Toggle navigation
Home
Article Category
Question Papers
General Knowlege
Popular Pages
Multiple Choice Question in 049
Multiple Choice Question in
Multiple Choice Question in TRADES-INSTRUCTOR---GR-II---SMITHY---TECHNICAL-EDUCATION
Multiple Choice Question in -current-affairs-2016
Question Answer in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in english
Multiple Choice Question in abbreviations-abbreviations-m
Multiple Choice Question in SSC CHSL 7 March 2018 Morning Shift
Multiple Choice Question in 072/2016
Multiple Choice Question in 100/2016
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Multiple Choice Questions
1. What among following is true about stack
(A): stack cannot reuse its memory
(B): all elements are of different datatypes
(C): all operation done at one end
(D): none of above
Previous Question
Show Answer
Next Question
Add Tags
Report Error
Show Marks
Write Comment
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Tags
Show Similar Question And Answers
QA->Regarding special Disability leave which among the following is true?....
QA->The addressing mode used in the stack related instruction PUSH B is:....
QA->Consider a Program Graph (PG) with statements as nodes and control as edges. Which of the following is not true for any PG?....
QA->In Object Oriented Software Design, which of the following is not true?....
QA->Who is known as a sportsman among kings and king among Sportsmen?....
MCQ->Which of the following statements are correct about the Stack collection? It can be used for evaluation of expressions. All elements in the Stack collection can be accessed using an enumerator. It is used to maintain a FIFO list. All elements stored in a Stack collection must be of similar type. Top-most element of the Stack collection can be accessed using the Peek() method.....
MCQ->There is a vertical stack of books marked 1, 2 and 3 on Table-A, with 1 at the bottom and 3 on top. These are to be placed vertically on Table-B with 1 at the bottom and 2 on the top, by making a series of moves from one table to the other. During a move, the topmost book, or the topmost two books, or all the three, can be moved from one of the tables to the other. If there are any books on the other table, the stack being transferred should be placed, on top of the existing books, without changing the order of books in the stack that is being moved in that move. If there are no books on the other table, the stack is simply placed on the other table without disturbing the order of books in it. What is the minimum number of moves in which the above task can be accomplished?....
MCQ->Which of the following statements are correct about the C#.NET code snippet given below? int[] a = {11, 3, 5, 9, 4}; The array elements are created on the stack. Refernce a is created on the stack. The array elements are created on the heap. On declaring the array a new array class is created which is derived from System.Array Class. Whether the array elements are stored in the stack or heap depends upon the size of the array.....
MCQ->Which of the following statements are correct about the C#.NET code snippet given below? sample c; c = new sample(); It will create an object called sample. It will create a nameless object of the type sample. It will create an object of the type sample on the stack. It will create a reference c on the stack and an object of the type sample on the heap. It will create an object of the type sample either on the heap or on the stack depending on the size of the object.....
MCQ->Which of the following is the correct way to access all elements of the Stack collection created using the C#.NET code snippet given below? Stack st = new Stack(); st.Push(11); st.Push(22); st.Push(-53); st.Push(33); st.Push(66);....
×
×
Type The Issue
×
Your Marks
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions