True or False Questions: Operation of queue follows the Last-In-First-Out (LIFO)

Question

True or False Questions: Operation of queue follows the Last-In-First-Out (LIFO) model. Operation of stack follows the First-In-First-Out (FIFO) model. A character array variable can call any member functions belongs to string type cout is a global object of type ostream. 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 = new 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

Explanation / Answer

1. False

Operation of Queue Follows First In First Out(FIFO) Modal

Queue Operations are initializing or defining queue , utilizing it and then erasing it from memory

basic operation

enqueue() = add an item to the queue

dequeue() = remove an item from queue

2.False

Operation of Stack Follows Last In First Out (LIFO) Modal

4.True

cout is global object of type ostream

Using insertors(>>) and extractors(<<) invokes the method of the cout object

5.False

char *p,q;

Because variable without asterik Sign is a simple variable

but Any Variable with Asterik Sign(*) known as pointer variable so only *p is pointer variable

6.True

int *p;

p=new int(100); Not Allocate memory 100 integers ...100 be the value of *p.

Here is One Integer with 100 Value

7.True

int *p;

p=new int[200]; allocates memory for 200 integers

One int pointer to 200 integers

.8.True

9.True

10.True

Yes You can declare more than one pointer in a node for link list

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.