Given an array X = (22, 33, 55, 88, 96) and key = 88
How many iterations are required to find the key using binary search?
Show answerHide answer
Correct answer: (D) 2
BEL PE · Computer Science
Data Structures Previous Year Questions
12 Data Structures (Computer Science) questions asked in BEL PE previous year papers, each with the correct answer and explanation. Read them free on UTpaper, or attempt the full papers as timed online tests.
- 12 questions
- Official answer key
- Free
Other Computer Science topics
Match the language with its machine format.
Language: I. Unrestricted language; II. Context sensitive language; III. Context free language; IV. Regular expression
Machine: 1. Finite automata; 2. Push down automata; 3. Linear bounded automata; 4. Turing machine
Show answerHide answer
Correct answer: (D) I – 4; II – 3; III – 2; IV – 1
Which of the following array representation is CORRECT for the max heap of the following data elements?
20, 30, 70, 10, 5, 50, 80
Show answerHide answer
Correct answer: (A) 80, 20, 70, 10, 5, 30, 50
Which of the following is the single path shortest path algorithm?
Show answerHide answer
Correct answer: (D) Dijkstra's algorithm
Consider the following queue of character, implemented using array of 7 memory,
Front = 3 Rear = 4 Queue: –, –, A, B, __, __, __, where '–' denotes empty memory cell. What is the value of front and rear after the following operation?
Enqueue C, D
Dequeue
Enqueue E, F
Dequeue
Show answerHide answer
Correct answer: (A) Front = 5 Rear = 1
In the push down automata, transitional function δ is in the form ______.
Show answerHide answer
Correct answer: (D) Q × (Σ ∪ {λ}) × Γ → (Q, Γ*)
The following C function is an example of what type of recursion?
int f(int n)
{
if(n==1)
return 1;
else if(n==0)
return 0;
else
return(f(n-1)+f(n-2));
}
Show answerHide answer
Correct answer: (B) Binary
Consider 2 dimensional array A[10][15]. Assume that each element takes one memory location and base address of array A is 100. Consider the lower bound of row and column as 0. What is the address of A[i][j] if array A is stored in row major form?
Show answerHide answer
Correct answer: (C) 15i + j + 100
What is the cyclomatic complexity of the given flow graph?
The flow graph has 9 nodes: 1, (2,3), (4,5), 6, 7, 8, 9, 10, 11, and 11 edges: 1 → (2,3); (2,3) → 6; (2,3) → (4,5); 6 → 7; 6 → 8; 7 → 9; 8 → 9; 9 → 10; (4,5) → 10; 10 → 1; 1 → 11.
Show answerHide answer
Correct answer: (D) 4
Match the following algorithms with the data structure it uses.
Algorithm: I. Breadth first search; II. Heap sort; III. Depth first search
Data structure: 1. Stacks; 2. Queue; 3. Arrays
Show answerHide answer
Correct answer: (C) I – 2; II – 3; III – 1
Which of the following is NOT part of the mechanical diagram of the Turing machine?
Show answerHide answer
Correct answer: (A) Queue
What is the minimum cost of the spanning tree of the given graph?
Vertices A to H with weighted edges: A–B 3, A–F 2, B–C 2, B–D 1, C–E 5, C–H 3, D–E 4, E–H 6, E–G 3, F–G 2, G–H 1.
Show answerHide answer
Correct answer: (B) 14
How to use these BEL PE Computer Science questions
Every question here was asked in a real BEL PE paper; the paper and shift are shown on the card, and the number opens the question on its own page. Try each one before tapping Show answer, then attempt the full BEL PE papers as timed tests to check your speed under exam conditions.