**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.

**The performance of an algorithm is measured on the basis of_______**

(A) Time Complexity

(B) Space Complexity

(C) Both (A) & (B)

(D) None of the above**A set of functions that grow slower than or at the same rate as expression is represented by_____**

(A) Big Omega notation

(B) Theta notation

(C) Big O notation

(D) None of the above**The average time complexity of Insertion sort algorithm is________**

(A) O (n^2)

(B) O (n log n)

(C) O (n)

(D) None of the above**Which of the following is not a stable sort?**

(A) Insertion Sort

(B) Heap Sort

(C) Merge Sort

(D) None of the above**The space required to store the values of all the constants and variables is called_______**

(A) Instruction space

(B) Data Space

(C) Environment Space

(D) None of the above**In Heap data structure, If the parent nodes are greater than their children nodes then it is called __________**

(A) Max-Heap

(B) Min-Heap

(C) Both (A) & (B)

(D) None of the above**The Quick sort algorithm divides the list into ______ main parts**

(A) Four

(B) Six

(C) Five

(D) Three**Circular linked list can also be used to create _____**

(A) Priority Queue

(B) Double ended Queue

(C) Circular queue

(D) None of the above**Which of the following is/are real-time application(s) of Queue?**

(A) Printer

(B) CPU task scheduling

(C) Interrupts handling in real-time systems

(D) All of the above**Linked Lists are used to implement______**

(A) Stacks

(B) Graphs

(C) Queues

(D) All of the above

AffairsCloud Recommends IBPSGuide Mock Test