|
| Home | Tech FAQ | Interview Questions | Placement Papers | Tech Articles | Learn | Freelance Projects | Online Testing | Geeks Talk | Job Postings | Knowledge Base | Site Search | Add/Ask Question |
 Related Questions _________ is the way you groups things together by placing one thing on top of another and then removing things one at a time from the top. Skill/Topic: Stacks using an ArrayA) ArrayB) StackC) PointerD) All of the above Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: Push is the direction that data is being added to the stack. Latest Answer : Push method ... Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: Popping is the reverse process of pushing: it removes an item from the stack. It is important to understand that popping an item off the stack Latest Answer : yes. pop removes top element frm stack ... Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: The pop() member method removes the value from the top of Latest Answer : pop() method is used when we want to remove item frm stack. ... Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: The isFull() member method determines if there is room for one more value on the stack. Latest Answer : (B) False -- IsEmpty() checks if the stack has at least one element. This method is called by Pop() before retrieving and returning the top element. ... Skill/Topic: Stacks using an ArrayA) The isEmpty() member method determines if a value is at the top of the stack and is called before an attempt is made to remove the value Latest Answer : to check whether the stack is empty or not...if yes returns 1 else returns 0. ... Astack is a data structure that organizes data similar to how you organize dishes in a stack on your Astack is a data structure that organizes data similar to how you organize dishes in a stack on your kitchen counter. Skill/Topic: Stacks using Linked ListA) TrueB) False Skill/Topic: Stacks using Linked ListA) Linked ListB) QueueC) Doubly linked list Latest Answer : Ans to this question is: Linked-list because, queue can be only implemented by FIFO! and doublly link list is used for both ends! hence linked list is correct option! ... Skill/Topic: Stacks using Linked ListA) A stack-linked list accesses data last in, first out; a linked list accesses data first in, first out Skill/Topic: Stacks using Linked ListA) Back of the linked listB) Front of the linked listC) Middle of the Linked listD) None of the above Latest Answer : Back Of The Linked list ...
Sponsored Links
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
