HARD
HSSC Clerk
IMPORTANT
Earn 100

Which of the following algorithm design techniques is used in the quick sort algorithm?

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 26
The term "push" and "pop" is related to the _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 27
A data structure where elements can be added or removed at either end but not in the middle is known as:
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 28
When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return:
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 29
What are the two main measures of the efficiency of an algorithm?
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 30
The time factor when determining the efficiency of algorithms is measured by _____.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 31
Linked lists are not suitable for which of the following problems?
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 32
The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is.
HARD
HSSC Clerk
IMPORTANT
Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Chapter 7 - Data Structures>Exercise>Q 33
A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves: