Dear Aspirants,

Welcome to the Professional Knowledge Section in Affairscloud.com. Here we are providing sample questions in Data Structures. It will be useful for the IBPS SO IT officer and SBI Assistant Manager(System). We have also included some important questions that are repeatedly asked in previous exams.

  1. In Queue, the elements added at…..end
    (A) front
    (B) rear
    (C) top
    (D) base
    (B) rear

  2. The terms “POP” and “PUSH” are related to…..
    (A) queue
    (B) stack
    (C) linked list
    (D) None of the above
    (B) stack

  3. Stack is also called a …….
    (A) Last In First Out
    (B) First In First Out
    (C) LIFO & FIFO
    (D) None of the above
    (A) Last In First Out

  4. The largest element of an Array Index is called……
    (A) Range
    (B) Upper bound
    (C) lower bound
    (D) None of the above
    (B) Upper bound

  5. The memory address of the first element of an array is called…
    (A) first address
    (B) floor address
    (C) base address
    (D) None of the above
    (C) base address

  6. The complexity of shell sort is
    (A) O(log)
    (B) O(n^2)
    (C) O(n (log n)^2)
    (D) None of the above
    (C) O(n (log n)^2)

  7. Which of the following is a linear data structure?
    (A) Array
    (B) Graph
    (C) Tree
    (D) None of the above
    (A) Array

  8. ….. is a technique to convert a range of key values into a range of Indices of an Array?
    (A) Thrashing
    (B) Hashing
    (C) Interpolation
    (D) None of the above
    (B) Hashing

  9. ……. is a queue with limited number of elements.
    (A) Bounded queue
    (B) Unbounded queue
    (C) Both (A) & (B)
    (D) None of the above
    (A) Bounded queue

  10. An odd-even sort is also called……
    (A) Bubble Sort
    (B) Heap Sort
    (C) Quick Sort
    (D) Brick Sort
    (D) Brick Sort

LEAVE A REPLY

Please enter your comment!
Please enter your name here