Module 3: Linked List and Queue

Question 1

It is a sequence of data structures, which are connected together via links

Answer 1

Linked List

Question 2

True or false: Each link contains a connection to another link

Answer 2

True

Question 3

What is the second most-used data structure after array?

Answer 3

Linked List

Question 4

What stores data or elements in a linked list?

Answer 4

Link

Question 5

Each link of a linked list contains a link to the next link called?

Answer 5

Next

Question 6

A ____ contains the connection link to the first link called First

Answer 6

Linked List

Question 7

What is being described:
1. Contains a link element called First
2. Carries data fields and a link field called next
3. Link is linked with its next link using its next link
4. Last link carries a link as null to mark the end of the list

Answer 7

Linked list

Question 8

What are the different types of linked list?

Answer 8

Simple Linked List
Doubly Linked List
Circular Linked List

Question 9

Item navigation is forward only

Answer 9

Simple Linked List

Question 10

Items can be navigated forward and backward

Answer 10

Doubly Linked List

Question 11

Last item contains link of the first element as next and the first element has a link to the last element as previous

Answer 11

Circular Linked List

Question 12

What are the basic operations supported by a linked list?

Answer 12

Insertion, Deletion, Display, Search, Delete

Question 13

Adds an element at the beginning of the list

Answer 13

Insertion

Question 14

Deletes an element at the beginning of the list

Answer 14

Deletion

Question 15

Displays the complete list

Answer 15

Display

Question 16

Searches an element using the given key

Answer 16

Search

Question 17

Deletes an element using the given key

Answer 17

Delete

Question 18

Variation of a linked list where navigation is possible both ways

Answer 18

Doubly Linked List

Question 19

Terms in doubly linked list:

Answer 19

Link, Next, Prev, LinkedList

Question 20

True or False: Infix notations are first converted to postfix or prefix notations and then computed

Answer 20

True

Question 21

This is the way to write arithmetic expressions

Answer 21

Notation

Question 22

Notation where operators are used in-between operands

Answer 22

Infix Notation

Question 23

Notation where operators are written ahead of operands

Answer 23

Prefix/Polish Notation

Question 24

Notation where the operator is written after the operands

Answer 24

Postfix/Reversed Polish Notation

Question 25

What to consider in converting infix notation to prefix or postfix notation?

Answer 25

Precedence of operators (PEMDAS), Associativity (Left Associative)

Question 26

Abstract data structure similar to stacks, but it is open at both ends

Answer 26

Queue

Question 27

Add (store) an item to the queue

Answer 27

Enqueue

Question 28

Remove (access) an item from the queue

Answer 28

Dequeue

Question 29

True or False: Queue can be implemented using arrays, linked lists, pointers, and structures

Answer 29

True

Question 30

Operations in queue:

Answer 30

peek() isfull() isempty()

Question 31

Checks if the queue is full

Answer 31

isfull()

Question 31

Gets the element at the front of the queue without removing it

Answer 31

peek()

Question 32

Checks if the queue is empty

Answer 32

isempty()

Question 33

What pointer is used to dequeue or access data?

Answer 33

Front pointer

Question 34

What pointer is used to enqueue or store data

Answer 34

Rear pointer

Question 35

Steps in enqueuing:

Answer 35

1. Check if full 2. If full -> return 0; 3. If not full, increment rear pointer to the next empty space 4. Add data element 5. Return success

Question 36

Steps in dequeuing:

Answer 36

1. Check if empty 2. If empty, return 0; 3. If not empty, access data pointed by front pointer 4. Increment front pointer to the next available data element 5. Return success