Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 36-40 of 100

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

Question 36

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

In open addressing, resolving collisions by probing consecutive table slots (i+1, i+2, ...) is called -

Answers for question 36

Question 37

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

Space complexity of an adjacency matrix representation for a graph with V vertices is -

Answers for question 37

Question 38

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

Space complexity of an adjacency list representation for a graph with V vertices and E edges is -

Answers for question 38

Question 39

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

In a full binary tree (every internal node has exactly two children), if there are L leaves, how many internal nodes are there?

Answers for question 39

Question 40

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

Topological sorting can be performed only on which type of graph?

Answers for question 40
Scroll to Top