HARD
HSSC Clerk
IMPORTANT
Earn 100
The following C declarations
struct node {
int i ;
float j;
};
struct node *s ;
define s to be:
int i ;
float j;
};
struct node *s ;
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
A sort which compares adjacent elements in a list and switches where necessary is a _____.
HARD
HSSC Clerk
IMPORTANT
Recursive procedures are implemented by _____.
HARD
HSSC Clerk
IMPORTANT
The high level programming language called APL was developed for expressing complex mathematical expressions in compact formats. Can you name the person who developed it?
HARD
HSSC Clerk
IMPORTANT
A linear list in which elements can be added or removed at either end but not in the middle is known as _____.
HARD
HSSC Clerk
IMPORTANT
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as _____.
HARD
HSSC Clerk
IMPORTANT
Which of the following statement is not FALSE?
HARD
HSSC Clerk
IMPORTANT
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?
MEDIUM
HSSC Clerk
IMPORTANT
Match the following:
| A. Strassen's matrix multiplication algorithm. | (p) Greedy method multiplication algorithm. |
| B. Kruskal's minimum weight spanning tree algorithm. | (q) Dynamic programming. |
| C. Bi-connected components algorithm. | (r) Divide and Conquer. |
| D. Floyd's shortest path algorithm. | (s) Depth first search path algorithm. |
Codes:
