Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Also checkout these categories
Theory of Machines MCQ Selenium automation MCQ Computer Architecture MCQ Windows 2000 Server MCQ Engineering Drawing MCQ Analogy MCQ Design of Steel Structures MCQ Microsoft Excel MCQ Transmission of Heat MCQ Nervous System MCQ Organic Chemistry MCQ Visual Basic .NET MCQ
- Two main measures for the efficiency of an algorithm are
- ……………. Is a pile in which items are added at one end and removed from…
- The situation when in a linked list START=NULL is
- When new data are to be inserted into a data structure, but there is no available space; this situation…
- The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
- The operation of processing each element in the list is known as
- Which of the following data structures are indexed structures?
- Which data structure is used in breadth first search of a graph to hold nodes?
- The number of possible ordered trees with three nodes A,B,C is?
- Which of the following is not the required condition for binary search algorithm?
- Which of the following statement is true ?
- Which of the following data structure is linear type?
- The difference between linear array and a record is
- The complexity of linear search algorithm is
- The complexity of Bubble sort algorithm is
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
- Arrays are best data structures
- Which of the following is two way list?
- Which data structure allows deleting data elements from and inserting at rear?
- Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
- A variable P is called pointer if
- Two dimensional arrays are also called
- If the values of a variable in one module is indirectly changed by another module, this situation is…
- The memory address of the first element of an array is called
- Which of the following data structure store the homogeneous data elements?
- Which if the following is/are the levels of implementation of data structure
- Which of the following algorithm design technique is used in the quick sort algorithm?
- Linked lists are best suited
- The elements of an array are stored successively in memory cells because
- Which of the following statement is false?