HARD
HSSC Clerk
IMPORTANT
Earn 100
C programming language by itself provides _____.
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
If each node in a tree has value greater then every value in its left subtree and has value less than every value in its right subtree, the tree is known as _____.
HARD
HSSC Clerk
IMPORTANT
Search tables used by compilers for efficient searching generally use _____.
HARD
HSSC Clerk
IMPORTANT
Which of the following sorting method is stable?
HARD
HSSC Clerk
IMPORTANT
In which of the following sorting algorithms, the number of comparisons needed is minimum if the items are initially in reverse order and maximum if the items are in order?
HARD
HSSC Clerk
IMPORTANT
Which of the following sorting procedure is the slowest?
MEDIUM
HSSC Clerk
IMPORTANT
Which of the following best describes sorting?
HARD
HSSC Clerk
IMPORTANT
A search procedure which associates an address with a key-value and provide a mechanism for dealing with two or more values assigned to the same address is called _____.
HARD
HSSC Clerk
IMPORTANT
In what order the elements of a pushdown stack are accessed:
