10/27/22, 3:36 PM Quiz 3 - CIT005-Lec Midterm 2022-23

Quiz 3 - CIT005-Lec Midterm 2022-23

Total points 14/15

The respondent's email (19101081@spcba.edu.ph) was recorded on submission of this

form.

0 of 0 points

Full name:

CHARLES RONIEL C. MERCADO

Section/Time/Days

BIT301/3:00-4:00/T-TH

Activity Proper 14 of 15 points

A queue is a First In First Out (FIFO) data structure where the first item 0/1
inserted is the first to be removed.

True

False

Correct answer

True

https://docs.google.com/forms/d/e/1FAIpQLSdlengSTNCY0CEzUPeU8uluECC8KsdnLz6cQhTdwM9cu0UDWA/viewscore?hr_submission=ChkI8Y_L3… 1/5
10/27/22, 3:36 PM Quiz 3 - CIT005-Lec Midterm 2022-23

In a queue items are inserted at the rear and removed from the front of the 1/1
queue.

True

False

Queue is also an abstract data type or a non-linear data structure, just like 1/1
stack data structure, in which the first element is inserted from one end
called the REAR(also called tail), and the removal of existing element takes
place from the other end called as FRONT(also called head).

True

False

Not Like the stack, queue is also an ordered list of elements of similar data 1/1
types.

True

False

Queue can be implemented using an Array, Stack or Linked List.

1/1

True

False

https://docs.google.com/forms/d/e/1FAIpQLSdlengSTNCY0CEzUPeU8uluECC8KsdnLz6cQhTdwM9cu0UDWA/viewscore?hr_submission=ChkI8Y_L3… 2/5
10/27/22, 3:36 PM Quiz 3 - CIT005-Lec Midterm 2022-23

As we add elements to the queue, the tail keeps on moving ahead, always 1/1
pointing to the position where the next element will be inserted, while the
head remains at the first index.

True

False

Stack is a linear data structure similar to arrays and linked lists, which 1/1
can randomly access elements.

True

False

The stack data structure follows Last In First Out or First In Last Out 1/1
principles to execute its operations.

True

False

In a simple queue, insertion takes place at the rear and removal occurs at 1/1
the front. It strictly follows FIFO rule.

True

False

https://docs.google.com/forms/d/e/1FAIpQLSdlengSTNCY0CEzUPeU8uluECC8KsdnLz6cQhTdwM9cu0UDWA/viewscore?hr_submission=ChkI8Y_L3… 3/5
10/27/22, 3:36 PM Quiz 3 - CIT005-Lec Midterm 2022-23

In a queue , after REAR reaches the last index, if we can store extra 1/1
elements in the empty spaces (0 and 1), we can make use of the empty
spaces. This is implemented by a modified queue called the circular queue.

True

False

The components are added at the top of the stack during this process. 1/1
You must give an element to the Push() method that you wish to place into
a stack.

True

False

Circular Queue is also a linear data structure, which follows the principle of 1/1
FIFO(First In First Out), but instead of ending the queue at the last position,
it again starts from the first position after the last, hence making the queue
behave like a circular data structure.

True

False

https://docs.google.com/forms/d/e/1FAIpQLSdlengSTNCY0CEzUPeU8uluECC8KsdnLz6cQhTdwM9cu0UDWA/viewscore?hr_submission=ChkI8Y_L3… 4/5
10/27/22, 3:36 PM Quiz 3 - CIT005-Lec Midterm 2022-23

Peek() - It involves retrieving the topmost data element from the stack 1/1
removing it from the stack's data elements.

True

False

isfull() Method :
1/1
This operation is used to remove elements whether or not the stack is
complete.

True

False

isempty() Method:
1/1
The isEmpty method is used to add elements whether the stack is empty
or not.

True

False

This form was created inside of San Pedro College of Business Administration.

 Forms

https://docs.google.com/forms/d/e/1FAIpQLSdlengSTNCY0CEzUPeU8uluECC8KsdnLz6cQhTdwM9cu0UDWA/viewscore?hr_submission=ChkI8Y_L3… 5/5