wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

DS(Part2)-After

Total questions: 11

Worksheet time: 6mins

Name
Class
Date
1.

__________ is a collection of elements used to store the same type of data.

a)

Array

b)

Switch

c)

Loop

d)

Case

2.

It use pointer to link nodes.

a)

Variable

b)

Linked-List

c)

Pointer

d)

Trees

3.
a)

Linked-List

b)

Circular Linked List

c)

Doubly Circular Linked List

d)

Doubly Linked List

4.

In ___________ type of linked lists we can traverse in both the directions.

a)

Singly Linked List

b)

Circular Linked List

c)

1-D Linked List

d)

Doubly Linked List

5.

_____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.

a)

Queue

b)

Stack

c)

Singly Linked List

d)

Circular Queue

6.

It is used to implement an associative array, a structure that can map keys to values.

a)

Linked List

b)

Hashing

c)

Trees

d)

Array

7.

It is a linear data structure that stores a collection of elements. Operates on first in first out (FIFO) algorithm.

a)

Stack

b)

Data Structure

c)

Queue

d)

Array

8.

True or false: Data structures are not a crucial part in data management.

a)

True

b)

False

9.

push() and pop() functions are found in.......

a)

Stacks

b)

Trees

c)

Queues

d)

Lists

10.

When linked lists are used as stacks, what kind of behaviour is implemented?

a)

First-In First-Out, or FIFO

b)

First-In Last-Out, or FILO

c)

Last-In Last-Out, or LILO

d)

Last-In First-Out, or LIFO

11.

Can we Implement Stack Using Queue Data structure?

a)

YES

b)

NO