Search your Topic HERE....

February 08, 2014

IBPS IT Officers Professional Knowledge Practice Bits : Data Structures - Set 3


sponsored links

A binary tree of depth “d” is an almost complete binary tree if
  1. Each leaf in the tree is either at level “d” or at level “d–1”
  2. For any node “n” in the tree with a right descendent at level “d” all the left
  3. descendents of “n” that are leaves, are also at level “d”
  4. Both (1) & (2)
  5. None of the above

A _________ is an entity, that possesses the value and its name reflects the meaning of the value.

which linked list doesn't have NULL links ?

Name a Data Structure which is linear type ?

The dummy header in linked list contain ________________.

A _____________ is table of keys and addresses in which a unique external storage address is assigned to each key

A linear collection of data elements where the linear node is given by means of pointer is called _________________

An adjacency matrix representation of a graph cannot contain information of ___________________________

One of the major drawback of B-Tree is the difficulty of ___________ the keys sequentially

The time complexity of heap sort is ____________.

Representation of data structure in memory is known as _____________________

Name the pointer associated with the stack?

Each node in singly linked list has _________fields

The total number of comparisons in a bubble sort is ________________.

The term "push" and "pop" is related to the _______.

Each array declaration need not give, implicitly or explicitly, the information about ______________.

The situation when in a linked list START=NULL is __________.

The best average behaviour is shown by which sorting algorithm?

When new data are to be inserted into a data structure, but there is no available space; this situation is usually called as ____________.

The complexity of Binary search algorithm is __________.

Read More Practice tests and Study material for IBPS IT Officers Professional Knowledge section from here

sponsored links


  1. Can you please update today's specialist officers exam review?? Thanks in advance.

  2. Today's exam review plzz..

  3. Can you please let us know today's review about exam

  4. we want today exam review...plz update it soon

  5. plz plz plz update today it officer exam review......i have exam tomorrow. how is profetional know..section

  6. Hi..
    Can you please conform total number of comparison in bubble sort..??
    I think it's O(n^2) instead of O(nlogn)

    1. You are correct friend. Sorry for the inconvenience caused. I will correct the answer.

  7. how to download application form for clerk interview.. mine on 10 feb

  8. quant me bs 24 attempt kr paya..ho skta 4-5 galat b ho....
    ibps so ka quant cutoff clear ho payega kya???

    paper was damn easy den also kch na kr paya...can't figure it out shame on whom...

  9. quant me bs 24 kr paya....4-5 galat b ho skteh...

    iski sectional ki umeed h kya kch???


Related Posts Plugin for WordPress, Blogger...