Bihar STET Computer Science – Data Structures & Algorithms Set 2

Questions 31-35 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 31

MCQ · Single Correct 1 mark

In a Hash Table, the ratio of the total number of occupied entries 'n' to total slots 'm' (n/m) is called the:

Answers for question 31

Question 32

MCQ · Single Correct 1 mark

Primary clustering in Hash Tables is a major drawback primarily associated with which technique?

Answers for question 32

Question 33

MCQ · Single Correct 1 mark

A graph representation method using a V x V binary matrix where A[i][j] = 1 indicates an edge between i and j is:

Answers for question 33

Question 34

MCQ · Single Correct 1 mark

What is the space complexity of an Adjacency List graph representation with 'V' vertices and 'E' edges?

Answers for question 34

Question 35

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.06.2024 (Shift-II) PYQ

Which sorting algorithm guarantees a time complexity of O(n log n) in all cases (best, average, and worst)?

Answers for question 35
Scroll to Top