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

Questions 11-15 of 100

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

Question 11

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

Infix expression 'A + B * C' when converted to postfix form becomes -

Answers for question 11

Question 12

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

What condition occurs when trying to pop an element from an empty stack?

Answers for question 12

Question 13

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

Condition occurring when trying to insert an element into a completely full static stack is -

Answers for question 13

Question 14

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

A tree (connected, undirected, and acyclic) with N vertices always has exactly how many edges?

Answers for question 14

Question 15

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

Maximum number of nodes in a binary tree of height 'h' (where root is at height 1) is -

Answers for question 15
Scroll to Top