Beruflich Dokumente
Kultur Dokumente
Question
Suppose Pointer ptr points to a node in a linked list.Which of the following statements changes ptr so
that it points to the next node
ptr++
If pointer ptr points to a node in a linked list then which of the following expression will be true when
ptr ponits to the tail node of the list
pt==NULL
ptr>link==NULL
Which of the following can be used as a criterion for classification of data structures used in languages Nature of a data
processing
stucture
a reference variable stores Address
A linked list is of a length specified in its declaration(True/False)
Purpose of a data
stucture
Information
5
6
7
ptr=link
Optimal Search
Speed
Zero
expandability
Lower Bound
Upper Bound
There is no
beginning and no
end
Arrays
Last
Non linear
10
11
12
13
14
15
In singly linked list a node contain minimum how many fields(assumming one for data)
A linked list node type is a simple type(True/False)
16
Which of the following data structure are used to implement queue (1)Tree (2)Linked list (3)
17
18
19
1&2
1&3
Singly linked list performs which of the following methods (1)Insertion (2)Modifications (3) Searching 1 & 2
In C language to implement the heterogeneous linked list_____pointer is used
TheList with no node is called as (1)Empty list (2) Null list (3)Zero list
1 &2
2&3
VoNull
2&3
20
21
22
To implement hetrogeneous linked list in C language which of the following pointer type is used
23
24
25
Which of the following operation is not efficiently supported by a singly linked list
28
int*
Random
Null
Sequnetial
Insertion after
Accesing the element the current
in the current position position
where the
smaller items
Where the address is precede the
ordered
larger ones
Nonlinear
Linear
How many Nodes are accessed,on the average,in inserting a new element into an ordered list with n
nodes
(n+1)/2
26
27
n/2
List
An array if extra
space is left
empty
Header Node
List node
29
An items can be inserted into_________,Without moving any other items
30
An extra node at the front of the list,which doesn'trepresent an item in the list is called
31
A ______ is a self-referential data type because it contains a pointer or link to another data of the same
data type
Stack
Linked list
32
Insertion
33
____________Permits insertion and removal of nodes at any point in the list in in constant time ,but do
not allow random access
Stack
Linked list
To traverse a ________,you begin at any node and follow the list in either direction until you return to
the original node.
The poniter in case of a circular linked list,pointing to the whole list is usually called the_________
Double pointer
List Pointer
Singly circularly
linked list
In a _____,insertion and removals can be done at any point with access to any nearby node
Doubly
Circularlinked list
Doubly linked
list
Simplifies Deletion
Simplifies
insertion
34
Random access
35
36
In a ______________,each node has one link,similarly to an ordinary singly linked list,except that the
next link of the last node points back to the first node.
37
38
39
What kind of list is best to answer questions such as "what is the item at position n ? "
40
41
Unstructured files
Structured files
42
43
kruskal and prims algorithm are used to find minimum spanning tree(True/False)
44
45
46
47
48
49
50
Every non-empty
tree has exactly
Every binary tree has
one root node
at least one node
Traversal
Search
Data
11
Any Direction
Base address
18
Circular
Direction
Element address
Ans
A
ptr=ptr+link
ptr=ptr->link
D
B
ptr->data==NULL Ptr->Data==-1
Life time of data
structure
Data
D
All of the above.
None
A
0
D
Zero overhead
Expandability
Time consuming
insertion and
deletion processes All of the above.
Range
All
Components are
arranged
hierarchically
Poniter
Last but one
Hierarchical
C
B
A
1 None
A
0
B
2 &3
ALL
1& 3
int
1&3
ALL
Structure
All
D
A
A
B
Without under
flow condition
Sequential
None
Dynamic
void*
Dynamic
Float*
Logical
A
C
C
B
by traversing the
list from the tail
Insertion before
the current
position
B
Both a and b
Sequential
None
Dynamic
1/(n+1)
None
B
B
B
Both a & b
None
List header
Both a and c
Queue
Priority queue
Deletion
Insertion at end
D
B
A
B
Queue
Priority queue
Circular linked
llist
Circular Pointer
End Pointer
Doubly
Circularlinked list Two way linked list
Singly circularly
linked list
D
Two way linked list
Pointera to null
Both a and b
A
1
Both
None
Sort
A
B
Link
26
28
Forward and
backward direction One Direction
Foundation
Address
None
D
C