HARD
HSSC Clerk
IMPORTANT
Earn 100

A data structure where elements can be added or removed at either end but not in the middle is called_____.
(a)Requeue
(b)Queues
(c)Dequeue
(d)Linked List
(e)Stacks

50% studentsanswered this correctly

Important Questions on Data Structures
MEDIUM
HSSC Clerk
IMPORTANT
Representation of data structure in memory is known as _____.

MEDIUM
HSSC Clerk
IMPORTANT
If the address of and are and respectively and each element occupies bytes then the array has been stored in _____ order.

MEDIUM
HSSC Clerk
IMPORTANT
An adjacency matrix representation of a graph cannot contain information of ______.

HARD
HSSC Clerk
IMPORTANT
An ADT is defined to be a mathematical model of a user defined type along with the collection of all operations on that model.

HARD
HSSC Clerk
IMPORTANT
An algorithm is made up of two independent time complexities and . Then the complexities of the algorithm is in the order of _____.

HARD
HSSC Clerk
IMPORTANT
The goal of hashing is to produce a search that takes _____.

HARD
HSSC Clerk
IMPORTANT
The best average behavior is shown by _____.

HARD
HSSC Clerk
IMPORTANT
What is the postfix form of the following prefix *+ab-cd _____.
