HARD
HSSC Clerk
IMPORTANT
Earn 100
Match the correct pairs from the following:
List I
List II
A. All pairs shortest paths
i. Greedy
B. Quick Sort
ii. Depth-First search
C. Minimum weight spanning tree
iii. Dynamic Programming
D. Connected Components
iv. Divide and Conquer
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
The only language which is machine specific and which a computer understands directly is called _____.
HARD
HSSC Clerk
IMPORTANT
Linked lists are not suitable data structures of which one of the following problems?
HARD
HSSC Clerk
IMPORTANT
In which one of the following cases is it possible to obtain different results for call-by reference and call-by-name parameter passing methods?
HARD
HSSC Clerk
IMPORTANT
Heap allocation is required for languages _____.
HARD
HSSC Clerk
IMPORTANT
What is the name of the language which consists of strings 's and 's and is the only one which the computer can understand directly?
MEDIUM
HSSC Clerk
IMPORTANT
An instruction that can be recognized and used without translation must be written in _____.
HARD
HSSC Clerk
IMPORTANT
What was the name given to the first generation computer language?
HARD
HSSC Clerk
IMPORTANT
Which of the following relates to machine language?
