The implementation of choice for an abstract data type such as a stack is the creation of a new method.
Anonymous Quiz
83%
T
17%
F
To peak -see the last item- in stack named 'items', you use .......
Anonymous Quiz
31%
return self.items(len(self.items)-1)
20%
return self.items(len[self.items]-1)
14%
return self.items[len[self.items]-1]
19%
return self.items[len(self.items)]
17%
None of these.
in Simple Balance Parentheses:
Closing symbols match opening symbols in the ................. order of their appearance.
Closing symbols match opening symbols in the ................. order of their appearance.
Anonymous Quiz
36%
Same
64%
Reverse
A stack is a collection of objects that are inserted and removed according to the (FIFO) principle
Anonymous Quiz
19%
T
81%
F
A user may insert objects into a stack at any time, but may only access or remove the most recently inserted object that remains (at the so-called “ top” of the stack).
Anonymous Quiz
90%
T
10%
F
Stacks are the simplest of all data structures, yet they are also among the most important
Anonymous Quiz
87%
T
13%
F
creates a new stack that is empty. It needs no parameters and returns an empty stack.
Anonymous Quiz
3%
peek()
3%
push(item
2%
pop()
55%
Stack()
36%
is_empty()
1%
size()
peek() : adds a new item to the top of the stack. It needs the item and returns nothing
Anonymous Quiz
15%
T
85%
F
pop() : removes the top item from the stack. It needs no parameters and returns the item
Anonymous Quiz
87%
T
13%
F
tests to see whether the stack is empty. It needs no
parameters and returns a boolean value.
parameters and returns a boolean value.
Anonymous Quiz
0%
push(item)
4%
peek()
1%
Stack()
3%
size()
91%
is_empty()
1%
pop()
peek() returns the bottom item from the stack but does not remove it. It needs no parameters
Anonymous Quiz
38%
T
62%
F
size(): returns the number of items on the stack. It needs no parametersand returns an integer
Anonymous Quiz
94%
T
6%
F
used in many applications, such as the Internet Web browsers history and the “undo” mechanism in Text editors
Anonymous Quiz
3%
queue
90%
stack
4%
Array
3%
Linked list
peek() : adds a new item to the top of the stack. It needs the item and returns nothing. this definition is not true.
Anonymous Quiz
23%
T
77%
F
The order of insertion is the reverse of the order of removalqueue
Anonymous Quiz
24%
queue
73%
stack
4%
Array