Quiz 1. Data Structures (OSTIM 2022)

Type your student Id.

Type your name.

...................... is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

• Algorithm

• Data Structure

• Database

• Array

How to classify Data Structures? Which one is NOT a classification type?

• Linear data structure

• Static data structure

• Non-linear data structure

• Dynamic data structure

• Logarithmic Data Structure

Which one is NOT a linear data structure?

• Array

• Queue

• Tree

• Linked list

Select correct data structure type for non-linear data structure type.

• tree - graph

• array - tree

• graph - linked list

• tree - queue

Select TRUE option about arrays.

• Array is a dynamic data structure

• Arrays don't use an index-based data like trees.

• Store multiple values of the same data type

• The search process in an array can't be done very easilyThe search process in an array can't be done very easily

Select WRONG option about Linked List.

• A linked list uses extra memory to store links.

• The first node of the linked list is called the Head

• During initialization of linked list, you need to know the size of the elements.

• Each node of the linked list consists of a pointer/link which is the address of the next node.

Which one is WRONG about Stack?

• Stack is a linear data structure that follows a particular order in which the operations are performed.

• Stack is implemented through array or linked list.

• The insertion and deletion happens at two end, from the top of the stack and front.

• Stack is a Last In First Out operation.

Which one is WRONG about Queue?

• Queue is a non-linear data structure that follows a particular order in which the operations are performed. 

• Queue is a First In First Out(FIFO) structure.

• To remove the last element of Queue, all the elements inserted before the new element in the queue must be removed.

• Queues are used for job scheduling in operating system.