IBPS SO IT Officer Questions Solved Problems with Detailed Solutions [Free PDF]

Concepts:

• Breadth-First Search (BFS) is an algorithm for traversing or searching tree or graph data structures.
• Breadth-First Search (BFS) algorithm traverses a graph in level order and uses a queue data structure to remember to get the next vertex to start a search when a dead end occurs in any iteration.
• It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors.

Important Point:

• A queue is a data structure that is First in First Out (FIFO) or Last in Last Out (LILO) which means the element which is inserted first comes out first from the queue or the elements inserted last comes out last from the queue
• Insertion ( push() )operation in a queue, a new node is added, new node points to rear pointer of the queue and rear pointer point to a new node. Deletion (pop()) operation removes element from front of queue. This operation takes a constant amount of time, Therefore, the complexity of insertion and deletion in the queue is O(1)

Memory of a computer is organized for running program into three segments: the text segment, stack segment, heap segment.

Stack and heap is where storage is allocated for data storage. Stack is where memory is allocated for automatic variables within functions.

A variable declared inside a function without any storage class specification, is by default an automatic variable. They are created when a function is called and are destroyed automatically when the function exits. Automatic variables can also be called local variables because they are local to a function.

Looking at the first octet of an IP address, you can identify the class of that address.

 Class A : 1 - 127

Class B : 128 - 191

Class C : 192 - 223

Class D : 224 - 239

Class E : 240 - 254

In IP address 135.0.10.27, first octet is 135 which lies in range 128 - 191 of class B.

Memory capacity =16K × 16 = 2¹⁴ × 2⁴

Memory Capacity is of the form = 2^m × 2ⁿ

Address lines required = m = 14

Data Lines required = 2ⁿ = 16

Option 3 is correct