question

Question 1

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

Answer 1

stack

Question 2

The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Answer 2

stack

Question 3

Stack terminology ( 2 )

Answer 3

push() pop()

Question 4

(storing) an element on the stack.

Answer 4

push

Question 5

Removing (accessing) an element from the stack.

Answer 5

pop()

Question 6

get the top data element of the stack, without removing it

Answer 6

peek()

Question 7

The way to write arithmetic expression is known as a _______

Answer 7

notation

Question 8

Notations ( 3 )

Answer 8

infix, prefix, postfix

Question 9

where operators are used in-between operands.

Answer 9

infix notation

Question 10

the operator is written after the operands.

Answer 10

postfix notation

Question 11

is an abstract data structure, somewhat similar to Stacks.

Answer 11

queue

Question 12

The process of putting a new data element onto stack is known as a

Answer 12

push operation

Question 13

operator is written ahead of operands.

Answer 13

prefix notation

Question 14

This notation style is known asReversed Polish Notation

Answer 14

postfix notation

Question 15

This search algorithm works on the principle of divide and conquer.

Answer 15

Binary Search

Question 16

True or false
Interpolation search is an improved variant of binary search

Answer 16

true

Question 17

True or false
In interpolation, the data collection should be in a sorted form and equally distributed

Answer 17

true

Question 18

True or false
In interpolation, The algorithm works on the probing position of the required value

Answer 18

true

Question 19

True or false
Binary search looks for a particular item by comparing the middle most item of the collection

Answer 19

true

Question 20

In this type of search, a sequential search is made over all items one by one

Answer 20

Linear Search

Question 21

this search is a fast search algorithm with run-time complexity of Ο(log n

Answer 21

Binary Search

Question 22

this search is an improved variant of binary search.

Answer 22

interpolation search

Question 23

For this algorithm to work properly, the data collection should be in the sorted form

Answer 23

binary search

Question 24

the data collection should be in a sorted form and equally distributed.

Answer 24

interpolation search

Question 25

Most common orders are in numerical or lexicographical order

Answer 25

sorting

Question 26

True or false Bubble sort is a simple sorting algorithm

Answer 26

true

Question 27

algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order.

Answer 27

bubble sort

Question 28

This is an in-place comparison-based sorting algorithm

Answer 28

insertion sort

Question 29

a sub-list is maintained which is always sorted.

Answer 29

insertion sort

Question 30

an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

Answer 30

selection sort

Question 31

The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array.

Answer 31

selection sort

Question 32

a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms.

Answer 32

merge sort

Question 33

a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays.

Answer 33

quick sort

Question 34

is a highly efficient sorting algorithm and is based on insertion sort algorithm.

Answer 34

shell sort

Question 35

This algorithm uses insertion sort on a widely spread elements, first to sort them and then sorts the less widely spaced elements. This spacing is termed as interval. 

Answer 35

shell sort

Question 36

refers to arranging data in a particular format.

Answer 36

sorting

Question 37

True or false linear search is an improved variant of binary search

Answer 37

false

Question 38

True or false The top pointer provides top value of the stack without actually removing it.

Answer 38

true

Question 39

True or false stack data structure which follows first in first out methodology.

Answer 39

false

Question 40

provides top value of the stack without actually removing it.

Answer 40

top pointer

Question 41

known as reversed polish notation

Answer 41

postfix notation

Question 42

known as polish notation

Answer 42

prefix notation

Question 43

add (store) an item to the queue.

Answer 43

enqueue

Question 44

remove (access) an item from the queue.

Answer 44

dequeue

Question 45

is open at both its ends

Answer 45

queue