True or False Questions: Operation of queue follows the Last-In-First-Out (LIFO)
ID: 3692467 • Letter: T
Question
True or False Questions: Operation of queue follows the Last-In-First-Out (LIFO) model. Operation of stack follows the First-ln-First-Out (FIFO) model. A character array variable can call any member functions belongs to string type cout is a global object of type ostrcam. The declaration char *p, q; declares both p and q to be pointers. The statement int *p; p=new int(lOO); allocates memory for 100 integers. The statement int *p; p=ncw int[200]; allocates memory for 200 integers. The cin.clearO function is used to throw character away from buffer. The setprecision(4) function in a cout statement limits output to 4 characters We can make more than one pointer in a node for link list Multiple Choice: The size() member function in the string starts remote runs in C++ returns the address of a string returns the address of a long variable returns the length of the contents in the string which of the following data has been sorted already an array with random number a link list with random number a binary tree a binary search tree The substr () function in string class is used for: return one part of current string replace the content of current string insert new content into current string search content from current string none of the aboveExplanation / Answer
1.
False
Queue id FIFO
2. False
Stack is LIFO
3. false
only string type variable(string object) can call member function
4. True
5. False
char *p, q; => p is pointer and q is character
6. false
7. true
8. false
Sets a new value for the stream's internal error state flags.
The current value of the flags is overwritten: All bits are replaced by those in state; If state
is goodbit (which is zero) all error flags are cleared.
cin.ignore() is used to throw away all character from buffer
9. false
Sets the decimal precision to be used to format floating-point values on output operations.
10. true
11. d. returns the length of string
12. d. binary search tree.
in-order traversal of binary search tree gives
sorted order.
13. a. return one part of current string.
it gives sub string from specified index.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.