BPSC Tre 4.0 DSA Practice Set
Que: (1). Which of the following is not the application of stack?
Que: (2). What is an AVL tree?
Que: (3). Which of the following data structures can be used for parentheses matching?
Que: (4). What are the disadvantages of arrays?
Que: (5). 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
}
Que: (6). The data structure required to check whether an expression contains a balanced parenthesis is?
Que: (7). Which of the following is not the type of queue?
Que: (8). Which of the following application makes use of a circular linked list?
Que: (9). Which of the following data structures stores elements in a non-linear relationship?
Que: (10). Which of the following tree data structures is not a balanced binary tree?
Que: (11). Which of the following is also known as Rope data structure?
Que: (12). What is the need for a circular queue?
Que: (13). Which of the following statement(s) about stack data structure is/are NOT correct?
Que: (14). The data structure required for Breadth First Traversal on a graph is?
Que: (15). Which of the following points is/are not true about Linked List data structure when it is compared with an array?
Que: (16). 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