BPSC Tre 4.0 DSA Practice Set

Que: (1). Which of the following is not the type of queue?

Que: (2). Which of the following application makes use of a circular linked list?

Que: (3). The data structure required for Breadth First Traversal on a graph is?

Que: (4). Which algorithm is used in the top tree data structure?

Que: (5). What is the need for a circular queue?

Que: (6). Which of the following points is/are not true about Linked List data structure when it is compared with an array?

Que: (7). What is an AVL tree?

Que: (8). What is a data structure?

Que: (9). 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: (10). The prefix form of A-B/ (C*D^E) is?

Que: (11). Which of the following is not the application of stack?

Que: (12). What data structure would you mostly likely see in non-recursive implementation of a recursive algorithm?

Que: (13). What is a bit array?

Que: (14). Which of the following data structures can be used for parentheses matching?

Que: (15). What are the disadvantages of arrays?

Que: (16). The data structure required to check whether an expression contains a balanced parenthesis is?

Que: (17). Which of the following is the most widely used external memory data structure?

Que: (18). Which of the following statement(s) about stack data structure is/are NOT correct?

Que: (19). Which of the following is also known as Rope data structure?

Que: (20). 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: (21). Which of the following tree data structures is not a balanced binary tree?

Que: (22). Which data structure is used for implementing recursion

Que: (23). Which data structure is based on the Last In First Out (LIFO) principle?

Que: (24). Which data structure is needed to convert infix notation to postfix notation?

Que: (25). The height of n elements 2-3 tree is ______

Que: (26). Which of the following data structures stores elements in a non-linear relationship?

Que: (27). Which data structure is used for efficient searching, insertion, and deletion of elements?

Que: (28). In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?

Que: (29). The result evaluating the postfix expression 10 5 + 60 6/ * 8-

Que: (30). In a balanced binary tree, the height of two sub-trees of every node can not differ by more than

Que: (31). Write the output of the following program: int a[ ] = {1,2,3,} *p;

Que: (32). A queue has configuration a, b, c, d. If you want to get the configuration d, c, b, a, you need a minimum of _______.

Que: (33). The order of the binary search algorithm is _______.

Que: (34). The preorder traversal of a binary search tree is 15, 10, 12, 11,20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?

Que: (35). How many distinct binary search trees can be created out of 4 distinct keys?

Que: (36). Merge Sort is an example of which algorithm design paradigm?