HARD
HSSC Clerk
IMPORTANT
Earn 100
What is the time complexity of linear search algorithm over an array of elements?
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
The results returned by functions under value result and reference parameter passing conventions _____.
HARD
HSSC Clerk
IMPORTANT
The following C declarations
struct node {
int i ;
float j;
};
struct node *s ;
define s to be:
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?
