Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Correct Answer :
A. Last in first out
Related Questions
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
push, pop
insert, delete
pop, push
delete, insert
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
Which of the following statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
The term push and pop is related to the
array
lists
stacks
all of above
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
Which of the following is not the required condition for binary search algorithm?
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above