sponsored links
The logical or mathematical model of organization of data is called _____.
You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which sorting methods would be especially suitable for such a task?
Hashing is a technique for ___________ search
Exit loop is a _____ statement
The term structured programming refers to ___________.
If a node having two children is deleted from a binary tree, it is replaced by its
To find the location of the element with a given value is termed as _______.
The term algorithm refers to __________ number of step which gives_________ of operations
A data structure where elements can be added or removed at either end but not in the middle is called ____________.
A full binary tree with 2n+1 nodes contain _______ non leaf nodes
The postfix form of the expression (A+B)*(C*D−E)*F/G is
Which data structure allows deleting data elements from front and inserting at rear?
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as ?
A mathematical-model with a collection of operations defined on that model is called ?
The complexity of Bubble sort algorithm is ___________.
If a node in a BST has two children, then its inorder predecessor has
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as ?
An array is collection of _______.
A variable P is called pointer if _____________.
sponsored links
Thank you so much . Please provide more sets on Data Structures.
ReplyDeletepls provide professional knowledge [ IT ] question paper of 2013 exam ..
ReplyDeletewhich type of Q .. asked in PK (IT) section of 2013 exam..pls share some Q..
ReplyDeleteCan any say the cut off marks of english section in CWE SO(IT) because each question carries 1/2 mark?
ReplyDelete