Data Structures- Introduction

Front

Process of inserting an element in stack is called ____________

Back

Push

Front

If the insertion and deletion happens from both the ends then the queue is called a ______ Queue.

Back

Deque

Front

Order of removal for elements “A”, “B”, “C”, and “D” in a queue?

Back

ABCD

Front

What is neither an algorithm nor a program?

Back

Pseudo code

Front

Data Structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.

Back

True

Front

In this type of data structures, data values of different types are grouped, as in structures and classes.

Back

Non-homogenous

Front

A container which can hold a fix number of items and these items should be of the same type. Most of the data structures make use of arrays to implement their algorithms.

Back

Array

Front

Example of linear data structure except: array, queue, stack

Back

tree

Front

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

Back

Array

Front

Which of these data structures is LIFO? Stack, Queue, Binary Tree, Double linked list

Back

Stack