1. Input:A is non-empty list of numbers L
Xß-infinity
For each item in the list L,do
If the item>x,then
Xßthe item
Return X
X represents:-
a)largest number
b)smallest number
c)smallest negative number
d) none
2. Let A and B be nodes of a heap,such that B is a child of A. the heap must then satisfy the following conditions
a)key(A)>=key(B)
b)key(A)
c)key(A)=key(B)
d)none
3. String ,List,Stack,queue are examples of___________
a)primitive data type
b)simple data type
c)Abstract data type
d)none
4. which of the following is not true for LinkedLists?
a)The simplest kind of linked list is a single linked list ,which has one link per node .this link points to the next node in the list,or to a null value or emptylist if it is the last node.
b)a more sophisticated kind of linked list is a double linkedlist or two way linkedlist .Each node has two links ,one to the previous node and one to the next node.
c) in a circleLinkedList ,the first and last nodes are linked together.this can be done only for double linked list.
d) to traverse a circular linkedlist ,u begin at any node and follow the list in either direction until u return to the original node.
5. sentinel node at the beginning and /or at the end of the linkedlist is not used to store the data
a) true
b) false
Logged
Xß-infinity
For each item in the list L,do
If the item>x,then
Xßthe item
Return X
X represents:-
a)largest number
b)smallest number
c)smallest negative number
d) none
2. Let A and B be nodes of a heap,such that B is a child of A. the heap must then satisfy the following conditions
a)key(A)>=key(B)
b)key(A)
c)key(A)=key(B)
d)none
3. String ,List,Stack,queue are examples of___________
a)primitive data type
b)simple data type
c)Abstract data type
d)none
4. which of the following is not true for LinkedLists?
a)The simplest kind of linked list is a single linked list ,which has one link per node .this link points to the next node in the list,or to a null value or emptylist if it is the last node.
b)a more sophisticated kind of linked list is a double linkedlist or two way linkedlist .Each node has two links ,one to the previous node and one to the next node.
c) in a circleLinkedList ,the first and last nodes are linked together.this can be done only for double linked list.
d) to traverse a circular linkedlist ,u begin at any node and follow the list in either direction until u return to the original node.
5. sentinel node at the beginning and /or at the end of the linkedlist is not used to store the data
a) true
b) false
Logged
No comments:
Post a Comment