MEDIUM
HSSC Clerk
IMPORTANT
Earn 100

An adjacency matrix representation of a graph cannot contain information of ______.

50% studentsanswered this correctly

Important Questions on Data Structures

HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 4
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
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 5
An algorithm is made up of two independent time complexities f(n) and g(n). Then the complexities of the algorithm is in the order of _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 6
The goal of hashing is to produce a search that takes _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 7
The best average behavior is shown by _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 8
What is the postfix form of the following prefix *+ab-cd _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 9
A queue is a _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 10
Which data structure is needed to convert infix notation to postfix notation?
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 11
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?