DSA_placement

Which of the following is true about linked list implementation of stack?

• • In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• • In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• • Both of the above

• • None of the above

Which one of the following is an application of Stack Data Structure?

• • Managing function calls

• • The stock span problem

• • Arithmetic expression evaluation

• • All of the above

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A

• B

• C

• D

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

• • Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT

• • Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR

• • Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT

• • Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

• Random access is not allowed in a typical implementation of Linked Lists
  

• Access of elements in linked list takes less time than compared to arrays
  
  

• Arrays have better cache locality that can make them better in terms of performance

• It is easy to insert and delete elements in Linked List

Which algorithm is used in the top tree data structure?
y

• a) Backtracking
  

• b) Divide and Conquer
  

• c) Branch

• greedy

Which of the following is the most widely used external memory data structure?

• B-tree

• red-black tree

• AVL Tree

• both avl and red black tree

What is the use of the bin data structure?

• a) to have efficient traversal

• b) to have efficient region query
  

• c) to have efficient deletion
  

• d) to have efficient insertion

If a problem can be broken into subproblems which are reused several times, the problem possesses ____________ property.

• Overlapping subproblems
  

• Optimal substructure
  

• Memoization

• Greedy

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________

• Dynamic programming
  

• Greedy
  

• Divide and conquer
  

• Recursion