Free Printable DATA STRUCTURES

1.

Stack uses __________ data structure as the element that was inserted last is the first one to be taken out.

a)

LIPO

b)

FIFO

c)

LIFO

d)

FIPO

2.

Full

form of LIFO is ____________

a)

Last

Inside First Outside

b)

Last

Innner First Outer

c)

Last In

First Out

d)

Last

Impact First Out

3.

Every stack has a variable _________ associated with it.

a)

TOP

b)

BOT

c)

POT

d)

none of

above

4.

_________

operation adds an element to the top of the stack.

a)

pop

b)

push

c)

peep

d)

all of

the above

5.

_________

operation removes the element from the top of the stack.

a)

push

b)

pop

c)

update

d)

none of

the above

6.

_________

operation returns the value of the topmost element of the stack.

a)

push

b)

pop

c)

peep

d)

update

7.

_________

operation changes the value of element given by user of the stack.

a)

push

b)

pop

c)

peep

d)

update

8.

A

function calls itself is called ___________.

a)

function

b)

recursion

c)

position

d)

none of

above

9.

A queue is a _________ data structure in which each element that was inserted first is the first one to be taken out.

a)

FITO

b)

FIFO

c)

FISO

d)

FIVO

10.

The elements in a queue are added at one end called ________.

a)

front

b)

rear

c)

near

d)

none of

above

11.

In the postfix notation, as the name suggests the operator is placed ________ the operands.

a)

before

b)

after

c)

both a

and c

d)

none of

above

12.

In the prefix notation, as the name suggests the operator is placed ________ the operands.

a)

before

b)

after

c)

both a

and c

d)

none of

above

13.

The elements in a queue are removed at one end called ________.

a)

front

b)

rear

c)

near

d)

none of

above

14.

In the _______ queue, the first index comes

right after the last index.

a)

linear

queue

b)

circular

queue

c)

priority

queue

d)

none of

above

15.

________ is visualized as vertical collections.

a)

stack

b)

queue

c)

circular

queue

d)

none of

above

16.

Collection of dinner plates at a wedding reception is an example of __________.

a)

stack

b)

queue

c)

circular

queue

d)

none of

above

17.

In pop operation of stack if TOP=NULL then stack is __________.

a)

full

b)

empty

c)

half

d)

all of

above

18.

In push operation of stack if TOP=MAX-1 then stack is _________.

a)

full

b)

empty

c)

half

d)

all of

above

19.

In __________ notation, the operator is placed between the operands.

a)

infix

b)

prefix

c)

postfix

d)

none of

above

20.

(A+B) is example of which of the following notation.

a)

infix

b)

prefix

c)

postfix

d)

none of

above

21.

In Singly Linked List Left part of the node which contains _________ may include a simple data type, an array or a structure.

a)

data

b)

node

c)

address

d)

none of

above

22.

In Singly Linked List Right part of the node which contains _________.

a)

data

b)

address

of a next node

c)

node

d)

none of

above

23.

In Singly linked list last node address part contains _________.

a)

NULL

b)

FULL

c)

data

d)

none of

above

24.

every node contains a pointer to another node which is of the same type, it is called a ____________ data type.

a)

simple

b)

primitive

c)

self

referential

d)

none of

above

25.

A linked list contains a pointer variable called __________,which stores address of first node in the list.

a)

LAST

b)

START

c)

MIDDLE

d)

all of

above

26.

If START=__________ then it means that the singly linked list is empty and contains no nodes.

a)

FULL

b)

NULL

c)

START

d)

none of

above

27.

Linked lists are _________.

a)

static

b)

dynamic

c)

both

d)

none of

above

28.

In _____________ Linked list the node that contains the address of the first node is actually the last node of the linked list.

a)

singly

b)

doubly

c)

circular

d)

none of

above

29.

Generally _________ is used to store large amount of data.

a)

array

b)

linked

list

c)

both a

and b

d)

none of

above

30.

If START=NULL in linked list then we need to write __________ Message.

a)

Overflow

b)

Underflow

c)

both

d)

none of

above

31.

_________ of a node is the number of edges arriving at that node.

a)

in-degree

b)

out-degree

c)

inout-degree

d)

none of above

32.

_________ of a node is the number of edges leaving that node.

a)

in-degree

b)

out-degree

c)

inout-degree

d)

none of above

33.

If the tree is not empty, then the first node is called ________.

a)

leaf

b)

internal node

c)

root

d)

none of above

34.

_________ is any node with an out-degree of zero.

a)

root

b)

internal node

c)

parent

d)

leaf

35.

A node that is not a root or a leaf is known as __________ node because it is found in the middle portion of a tree.

a)

root

b)

leaf

c)

internal node

d)

tree

36.

A node is a __________ if it has successor nodes - that is, if it has an out-degree greater than zero.

a)

child

b)

parent

c)

siblings

d)

none of above

37.

A node with a predecessor is a ______ . It has an in-degree of one.

a)

child

b)

parent

c)

siblings

d)

none of above

38.

Two or more nodes with the same parent are _______.

a)

child

b)

parent

c)

siblings

d)

none of above

39.

An _________ is any node in the path from root to the node.

a)

Ancestor

b)

Descendent

c)

tree

d)

none of above

40.

A binary tree in which every node other than leaf nodes has two children is called ________.

a)

full binary tree

b)

complete binary tree

c)

half binary tree

d)

complete half binary tree

41.

People have used the word ________ to mean computer information that is transmitted or stored.

a)

Beta

b)

Data

c)

Database

d)

None of above

42.

_____________ specifies how we enter data into our programs and what type of data we enter.

a)

data type

b)

data

c)

datum

d)

datum

43.

void is __________ data type.

a)

primary

b)

derived

c)

user defined

d)

none of above

44.

int is __________ data type.

a)

user defined

b)

derived

c)

primary

d)

all of above

45.

Array is ___________ data type.

a)

user defined

b)

primary

c)

derived

d)

all of above

46.

Pointer is __________ data type

a)

derived

b)

primary

c)

user defined

d)

none of above

47.

In ____________ data structure, the data items are arranged in a linear sequence.

a)

linear

b)

non linear

c)

homogeneous

d)

all of above

48.

In ___________ data structures all elements may or may not be of same type.

a)

linear

b)

linear

c)

homogeneous

d)

non- homogeneous

49.

In ___________ data structure data items are not in sequence.

a)

non linear

b)

linear

c)

non-homogeneous

d)

all of above

50.

____________data structures are those whose sizes and structures associated memory locations are fixed at compile time.

a)

linear

b)

homogeneous

c)

static

d)

dynamic

51.

Any two nodes which are connected by an edge in a graph are called _________ nodes.

a)

Adjacent

b)

Proper

c)

Node

d)

None of above

52.

A graph in which every edge is directed is called a __________.

a)

directed graph

b)

indirected graph

c)

directindirect graph

d)

none of above

53.

A graph in which every edge is undirected is called __________.

a)

directed graph

b)

undirected graph

c)

both a and b

d)

none of above

54.

A graph in which some of the edges are directed and some are undirected is called ________.

a)

directed graph

b)

undirected graph

c)

mixed graph

d)

none of above

55.

. An edge of a graph which joins a node to itself is called ________.

a)

node

b)

loop

c)

tree

d)

none of above

56.

Distinct edges which connect the same end points are called _________ edges.

a)

parallel

b)

level

c)

both a and b

d)

none of above

57.

. A graph in which weights are assigned to every edge is called _________ graph.

a)

Weighted

b)

Null

c)

Multi

d)

none of above

58.

In a graph, a node which is not adjacent to any other node is called _______ node

a)

multi

b)

single

c)

isolated

d)

none of above

59.

The no. of edges appearing in the sequence of a path is called the _______of the path.

a)

length

b)

width

c)

height

d)

none of above

60.

The path is a __________ if it begins and ends at the same vertex.

a)

wheel

b)

circuit

c)

length

d)

none of above

DATA STRUCTURES

Total questions: 60

Worksheet time: 3600secs

Similar Resources on Wayground