IBPS SO (IT Officer) Professional Knowledge Data Structure Questions Set

Dear Readers,

Here we are presenting you the model practice questions set from Data Structure section for the upcoming IBPS Specialist Officers (IT Officers) Exam.We have also included some important questions that are repeatedly asked in previous IBPS IT Officers and SBI IT Officers exams.

• The structural representation of logical relationships between elements of data is called - Data Structure
• A list of a finite number of homogeneous data elements is called - Array
• In Queue, the end from where items inserted is called - Rear
• In Queue, the deleted at one end is called - Front
• A data structure where elements can be added or removed at either end but not in the middle is called - Dequeue
• Stack is also called - Last In First Out (LIFO)
• The term Push and Pop is related to the - Stacks
• Prefix to Postfix is possible in data structure - Stack
• A data structure is needed to convert infix notation to postfix notation is - Stack
• A data structure is mainly used during shift reduce parsing is - Stacks
• A heap allows a very efficient implementation of a - Priority Queue
• The drawbacks of the binary tree sort are remedied by the - Heap Sort
• Round robin scheduling is essentially the preemptive version of - FIFO
• Useful in implementing quick sort is - List
• For tree, the list traversing through the entire list is not necessary is in - Circular List
• In a circular linked list, insertion of a record involves modification of - Two Pointer
• In a storage we can easily insert, delete and rearrange substrings is - Linked List
• Each item in a linked list is called - Node
• A stable sorting method is - Straight insertion sort 
• A tree having a main node which has no predecessor is - Rooted Tree
• Depth first search is - Tree Search
• The list with no nodes on it is called - Empty List or Null List
• The maximum numbers of nodes in a binary tree of depth (height) h is - 2^n+1 - 1
• Each node in a linked list must contain at least - Two Fields
• Access time of the symbol table will be logarithmic, if it is implemented by - Search Tree