Sl No.

Question

What kind of list will give the item at position n easily

List implemented with Doubly-linked

an array
list

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

An advantage of linked list is

Low access speed

Optimal Search
Speed

A Disadvantages of linked list is

High access time

Zero
expandability

The smallest element of an arrays index is called its

Lower Bound

Upper Bound

In Circular linked list

Linear Order linked list is provided through_______________
In a singly linked list __________ node contains no links.
A linked list is which type of data structure?

Components are all

linked together in
some sequential
manner
Variable
First
Linear

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

Searching a linked list requires linked list be created

According to storage strategies linked list is a

22

To implement hetrogeneous linked list in C language which of the following pointer type is used

23

Type of storage is used to represent lists

24

The node in a singly linked list can be deleted .

25

Which of the following operation is not efficiently supported by a singly linked list

28

int*
Random

Null
Sequnetial

Without traversing the by traversing the

list
list from the head

What is an Ordered List

According to access strategies linked list is a

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

In sorted orderd only In any order

Nonlinear
Linear

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

A linked list does not allow_______.

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.

Doubly linked list

Two way linked

list

The poniter in case of a circular linked list,pointing to the whole list is usually called the_________

Double pointer

List Pointer

Doubly linked list

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

The header node of a 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

File is a resource for storing information (True/False)

41

Sharing of file by different applications is easier with______

List implemented with Doubly linked

an array
list

Unstructured files

Structured files

42

UNIX and MS-DOS uses unstructured file model (true/False)

43

kruskal and prims algorithm are used to find minimum spanning tree(True/False)

44
45

Select any one false statement about binary trees :

Finding the location of the element with a given value is :

46

Tree is a graph with cycle (True/False)

47

A node in a linkoed list carries folloeing information

48
49

50

Every non-empty
tree has exactly
Every binary tree has
one root node
at least one node

Traversal

Search

Data

Data and link

The sum of first five prime numbers is

Doubly linked list perform traversal ina

The memory address of first element of array is called

11
Any Direction

Base address

18
Circular
Direction
Element address

Ans
A

Singly linked list

Doubly linked or singly

linked list are equally best

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

Fowerwaed and backward

traversal within the list is
permitted
Strings
Middle
None

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

All of the above

Insertion before
the current
position

Moving to the position

immediately following 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

Singly linked list

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

Singly linked list

Doubly linked or singly

linked list are equally best

A
1

Both

None

Every node has at

Evry non-root node has
most two children
exactly one parent

Sort

A
B

None of the above

Link
26

28

Forward and
backward direction One Direction
Foundation
Address

None of the above

None

D
C