MEDIUM
HSSC Clerk
IMPORTANT
Earn 100

Which of the following algorithm can be used to sort n integers in the range (1,...........n2) in O(n) time?

50% studentsanswered this correctly

Important Questions on Practice Sets

EASY
HSSC Clerk
IMPORTANT
Booth algorithm for integer multiplication gives the worst performance when the multiplier pattern is _____.
EASY
HSSC Clerk
IMPORTANT
What can be said about the array representation of a circular queue when it contains only one element?
MEDIUM
HSSC Clerk
IMPORTANT
Which of the following is a software tool for compiler constructions and available under UNIX operating system?
EASY
HSSC Clerk
IMPORTANT
Aggregation is a special form of _____ between a whole and its parts in which is composed of the parts.
MEDIUM
HSSC Clerk
IMPORTANT
In which type of technology flat panel displays is used?
MEDIUM
HSSC Clerk
IMPORTANT
Which of the following statements are true about doubly linked list?
(i) It may be either linear or circular.
(ii) It must contain a header node.
(iii) It will occupy same memory space as that of linear linked list, both having same number of nodes.
MEDIUM
HSSC Clerk
IMPORTANT
n stage ripple counter can count up to _____.
MEDIUM
HSSC Clerk
IMPORTANT
The relational model includes two general integrity rules. Integrity rule 1 is concerned with _____ and integrity rule 2 is concerned with _____.