Data_structure_quiz1

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

If the insertion and deletion happens from both the ends then the queue is called a______Queue

• a) Deque

• b) Header

• c) Queue

• d) Circular Queue

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC

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.

• Element

• Array

• Index

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

Almost all programming languages start arrays at ___

• index 0

• index 1

• index 2

• the null character

Arrays of characters, like letters, numbers, punctuation and other written symbols, are called ___

• structs

• vectors

• strings

• groups

int nums[ ] =

{2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

• nums[8]

• nums[3]

• nums(4)

• nums(3)

Which of these is not a data structure?

• Stack

• Array

• Integer

• List

Entries in a stack are “ordered”. What is the meaning of this statement?

• A collection of stacks is sortable

• Stack entries may be compared with the ‘<‘ operation

• The entries are stored in a linked list

• There is a Sequential entry that is one by one