An abstract data type is a set of objects and a set of operations on those value
ID: 3703371 • Letter: A
Question
An abstract data type is a set of objects and a set of operations on those values.
Flag this Question
Question 210 pts
The link list consists of a series of nodes, which are necessarily adjacent in memory.
Flag this Question
Question 310 pts
The main difference between array and vector type in C++ ...........
Flag this Question
Question 410 pts
What is the average running time of searching an element in a linked list?
O(n2)
O(n3)
Flag this Question
Question 510 pts
In C++, the name of the library for implementation of common data structures is called.....
Flag this Question
Question 610 pts
Which of the following is not a major applications of stacks in programming?
Flag this Question
Question 710 pts
For infix to post-fix conversion procedure described in your textbook, what are the content of the stack and output for the following infix notation:
(x-y)*z
Look at the figures given below starting from left to right and top to bottom.
(Hint: please see the exercise in page 109-110 from your textbook)
Stack after ( scanned
Top
Bottom
Output:null
Stack after x scanned
Top
Bottom
Output:x
Stack after - scanned
Top
Bottom
Output:x
Top
Bottom
Output:xy
Top
Bottom
Output:xy-
Top
Bottom
Output:xy-
Top
Bottom
Output:xy-z
Top
Bottom
Output:xy-z*
Stack after ( scanned
Top
Bottom
Output:null
Stack after x scanned
Top
Bottom
Output:null
Stack after - scanned
Top
Bottom
Output:-
Top
Bottom
Output:-
Top
Bottom
Output:-yx
Top
Bottom
Output:-yx*
Top
Bottom
Output:-yx*
Top
Bottom
Output:-yx*z
Stack after ( scanned
Top
Bottom
Output:null
Stack after x scanned
Top
Bottom
Output:x
Stack after - scanned
Top
Bottom
Output:x
Top
Bottom
Output:yx
Top
Bottom
Output:yx-
Top
Bottom
Output:yx-
Top
Bottom
Output:yx-z
Top
Bottom
Output:yx-z*
Flag this Question
Question 810 pts
When an element is pushed to a stack, the element is inserted to .........
Flag this Question
Question 910 pts
Which of the following is not a procedure for standard stacks?
Flag this Question
Question 1010 pts
What is the average running time of infix to post-fix conversion using stack?
O(n2)
Flag this Question
Question 1110 pts
For the following postfix expression computation as described in your textbook: what should be the content of the stack once the first / operator is scanned:
4 2 - 6 2 / + 1 2 * +
Look at the figures given below starting from left to right.
(Hint: please see the exercise in page 106-107 from your textbook)
After - scanned
Top
Bottom
After 6 scanned
Top
Bottom
After 2 scanned
Top
Bottom
After / scanned
Top
Bottom
After - scanned
Top
Bottom
After 6 scanned
Top
Bottom
After 2 scanned
Top
Bottom
After / scanned
Top
Bottom
After - scanned
Top
Bottom
After 6 scanned
Top
Bottom
After 2 scanned
Top
Bottom
After / scanned
Top
Bottom
TrueExplanation / Answer
An abstract data type is a set of objects and a set of operations on those values.
Ans: True.
Usually abstract data type can be defined as a class of objects whose their logical behavior can be defined by a set of values and a set of operations.
The link list consists of a series of nodes, which are necessarily adjacent in memory.
Ans: False.
Ofcourse link list consists of a series of nodes but they are not necessarily adjacent in memory.
The main difference between array and vector type in C++ ...........
Ans: while array elements can be accessed with an index, the vector elements cannot.
What is the average running time of searching an element in a linked list?
Ans: O(n)
In C++, the name of the library for implementation of common data structures is called
Ans: Standard ADT Library
Which of the following is not a major applications of stacks in programming?
Ans:Syntax check for compilers
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.