1. Which data structure allows deleting data elements from front and inserting at rear?
a. Stacks
b. Queues
c. Deques
d. Binary search tree
2. Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.
a. Input-restricted deque
b. Output-restricted deque
c. Priority queues
d.None of above
3. Which of the following data structure is non-linear type?
a. Strings
b. Lists
c. Stacks
d.None of above
4. Which of the following data structure is linear type?
a. Strings
b. Lists
c. Queues
d. All of above
5. To represent hierarchical relationship between elements, which data structure is not
suitable?
a. Deque
b. Priority
c. Tree
d. All of above
6. A binary tree whose every node has either zero or two children is called
a. Complete binary tree
b.Binary search tree
c.Extended binary tree
d.None of above
7. The depth of a complete binary tree is given by
a. Dn = n log2n
b. Dn = n log2n+1
c. Dn = log2n
d. Dn= log2n+1
8. When representing any algebraic expression E which uses only binary operations in a
2-tree,
a. the variable in E will appear as external nodes and operations in internal nodes
b.the operations in E will appear as external nodes and variables in internal nodes
c.the variables and operations in E will appear only in internal nodes
d.the variables and operations in E will appear only in external nodes
9. A binary tree can easily be converted into q 2-tree
a. by replacing each empty sub tree by a new internal node
b. by inserting an internal nodes for non-empty node
c. by inserting an external nodes for non-empty node
d. by replacing each empty sub tree by a new external node
10. When converting binary tree into extended binary tree, all the original nodes in binary tree
are
a. internal nodes on extended tree
b. external nodes on extended tree
c. vanishedon extended tree
d.None of above
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
a. ABFCDE
b.ADBFEC
c.ABDECF
d.ABDCEF
12. Which of the following sorting algorithm is of divide-and-conquer type?
a. Bubble sort
b. Insertion sort
c. Quick sort
d. All of above
13. An algorithm that calls itself directly or indirectly is known as
a. Sub algorithm
b. Recursion
c. Polish notation
d. Traversal algorithm
14. In a binary tree, certain null entries are replaced by special pointers which point to nodes
higher in the tree for efficiency. These special pointers are called
a. Leaf
b. branch
c. path
d. thread
15. The in order traversal of tree will yield a sorted listing of elements of tree in
a. Binary trees
b. Binary search trees
c. Heaps
d. None of above
16. In a Heap tree
a. Values in a node is greater than every value in left sub tree and smaller
than right sub tree
b. Values in a node is greater than every value in children of it
c. Both of above conditions applies
d. None of above conditions applies
17. In a graph if e=[u, v], Then u and v are called
a. endpoints of e
b. adjacent nodes
c. neighbors
d. all of above
18. A connected graph T without any cycles is called
a. a tree graph
b. free tree
c. a tree
d .All of above
19. In a graph if e=(u, v) means
a. u is adjacent to v but v is not adjacent to u
b. e begins at u and ends at v
c. u is processor and v is successor
d. both b and c
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
a. isolated
b. complete
c.finite
d.strongly connected
1. _____________ Memory is Volatile
main Random Access 
Both 1 and 2 Virtual2. An _________ data type is a keyword of a programming language that specifies the amount of memory needed to store data and the kind of data that will be stored in that memory location
abstract int vector None of these Short Int float long3. Which of the following abstract data types are NOT used by Integer Abstract Data type group?
Short Int float long 4. The hashString() member function is called by other member functions of the Hashtable class whenever a function needs to convert a ________________
a hash number key to a key key to a hash number key a key to an Index None of these . An application iterates the hashtable by calling the ______ and ______ member functions
hasNext() and hasDelete() hasNext() and getNextKey() Both 1 and 2 None of these 6. The java.util package contains two classes that are designed to work with hashtables. They are _______ and _________..
Hashtable , HashMap class Hashtable,List Vector,List Vector,Hashtable 7. Data members of the Hashtable class stored in the private access specifier
private access specifier Public access specifier common access specifier None of these 8. _____ is the common programming technique used for hashing in all hashing functions
Cloning Bit Shifting Hashmapping Listing 9. If the depth of a tree is 3 levels, then what is the Size of the Tree?
4 2 8 6 1v0. deleteNode() function requires the _____ of the data element of the node that is being removed
reference value declaration variable 11. Value of the first linked list index is _______
One Zero -1 None of these 12. A linked list index is ____ that represents the position of a node in a linked list.
An Integer a variable a character a boolean mpty?
because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class. because initialization of data members of the LinkedList class is performed by the destructor of the LinkedList class. because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList class. because initialization of data members of the QueueLinkedList class is performed by the destructor of the LinkedList class 14. _______ form of access is used to add and remove nodes from a queue
LIFO,Last In First Out FIFO , First In First Out Both 1 and 2 None of these 15. ______ form of access is used to add and remove nodes from a stack
LIFO FIFO Both 1 and 2 None of these 16. New nodes are added to the _____ of the queue.
front back middle Both 1 and 2
back middle Both 1 and 2 17. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
queue linked list stacks linked list both of them neither of them 18. In an array queue, data is stored in an _____ element.
Node linked list array constructor 19. The pop() member function determines if the stack is empty by calling the _____ member function
removeback() isEmpty() removedfront() hasNext() stack?
the new node is placed at the front of the linked list. the new node is placed at the back of the linked list. the new node is placed at the middle of the linked list. No Changes happensTop of Form
| |||||||||||||||||||||||||
By : ADEEL ABBAS
www.allvupastpapers.blogspot.com
AdeelAbbasbk@gmail.com
No comments:
Post a Comment
PLEASE COMMENT ABOUT YOUR VISIT AND MY SITE
Note: Only a member of this blog may post a comment.