wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Data Structure

Total questions: 20

Worksheet time: 15mins

Name
Class
Date
1.

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

a)

Beta

b)

Data

c)

Database

d)

None of above

2.

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

a)

data type

b)

data

c)

datum

d)

all of above

3.

void is __________ data type.

a)

primary

b)

derived

c)

user defined

d)

none of above

4.

int is __________ data type.

a)

user defined

b)

derived

c)

primary

d)

all of above

5.

Array is ___________ data type.

a)

user defined

b)

primary

c)

derived

d)

all of above

6.

Pointer is __________ data type

a)

derived

b)

primary

c)

user defined

d)

none of above

7.

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

a)

linear

b)

non linear

c)

both a and b

d)

all of above

8.

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

a)

linear

b)

non linear

c)

homogeneous

d)

non- homogeneous

9.

In ___________ data structure data items are not in sequence.

a)

non linear

b)

linear

c)

non-homogeneous

d)

all of above

10.

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

a)

linear

b)

homogeneous

c)

static

d)

dynamic

11.

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

12.

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

13.

Every stack has a variable _________ associated with it.

a)

TOP

b)

BOT

c)

POT

d)

none of the above

14.

_________ operation adds an element to the top of the stack.

a)

pop

b)

push

c)

peep

d)

all of the above

15.

_________ operation removes the element from the top of the stack.

a)

push

b)

pop

c)

update

d)

none of the above

16.

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

a)

push

b)

pop

c)

peep

d)

update

17.

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

a)

push

b)

pop

c)

peep

d)

update

18.

A function calls itself is called ___________.

a)

queue

b)

recursion

c)

function

d)

none of above

19.

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

20.

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

a)

front

b)

rear

c)

near

d)

none of above