BPSC Tre 4.0 DSA Practice Set
Que: (1). Which data structure is used for efficient searching, insertion, and deletion of elements?
Que: (2). What are the disadvantages of arrays?
Que: (3). Which algorithm is used in the top tree data structure?
Que: (4). In a balanced binary tree, the height of two sub-trees of every node can not differ by more than
Que: (5). Which of the following is not the type of queue?
Que: (6). In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?
Que: (7). Which of the following is the most widely used external memory data structure?
Que: (8). Which of the following statement(s) about stack data structure is/are NOT correct?
Que: (9). The data structure required to check whether an expression contains a balanced parenthesis is?
Que: (10). Which of the following data structure can provide efficient searching of the elements?
Which of the following data structure can provide efficient searching of the elements?
(d) treap
(b) 2-3 tree
(c) unordered lists
(a) binary search tree
Que: (11). What is a data structure?
Que: (12). Which data structure is used for implementing recursion
Que: (13). The order of the binary search algorithm is _______.
Que: (14). What will be the output of the following program?
#include <stdio.h>
#include <string.h>
int main()
{
char str[] = "san foundry";
int len = strlen(str);
int i;
for(i = 0; i < len; i++)
push(str[i]); // pushes each character into stack
for(i = 0; i < len; i++)
printf("%c", pop()); // pops and prints from stack
}