Lesson 3

Question 1

_______ is a sequence of data structures, which are connected together via links. It is a sequence of links which contains items. Each link contains a connection to another link. This is the second most-used data structure after array.

Answer 1

Linked List

Question 2

Each link of a linked list can store a data called an _______.

Answer 2

Link

Question 3

Each link of a linked list contains a link to the next link called _______.

Answer 3

Next

Question 4

A _________ contains the connection link to the first link called First.

Answer 4

Linked List

Question 5

True or false:
Linked List contains a link element called first.

Answer 5

True

Question 6

True or False:
Each link carries a data field(s) and a link field called next.

Answer 6

True

Question 7

True or False:

Each link is linked with its next link using its next link.

Answer 7

True

Question 8

True or False:

Last link carries a link as null to mark the end of the list.

Answer 8

True

Question 9

______ can be visualized as a chain of nodes, where every node points to the next node

Answer 9

Linked list

Question 10

Item navigation is forward only.

Answer 10

Simple Linked List

Question 11

Items can be navigated forward and backward.

Answer 11

Doubly Linked List

Question 12

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

Answer 12

Circular Linked List

Question 13

Basic Operations supported by a list:

Adds an element at the beginning of the list.

Answer 13

Insertion

Question 14

Basic Operations supported by a list:

Deletes an element at the beginning of the list.

Answer 14

Deletion

Question 15

Basic Operations supported by a list:

Displays the complete list.

Answer 15

Display

Question 16

Basic Operations supported by a list:

Searches an element using the given key.

Answer 16

Search

Question 17

Basic Operations supported by a list:

Deletes an element using the given key.

Answer 17

Delete

Question 18

_________ is a variation of Linked list in which navigation is possible in both ways, either forward and backward easily as compared to Single Linked List. Following are the important terms to understand the concept of doubly linked list.

Answer 18

Doubly Linked List

Question 19

Each link of a linked list contains a link to the previous link called _____.

Answer 19

Prev

Question 20

A ______ contains the connection link to the first link called First and to the last link called Last.

Answer 20

LinkedList

Question 21

The way to write arithmetic expression is known as a ______. An arithmetic expression can be written in three different but equivalent notations, i.e., without changing the essence or output of an expression.

Answer 21

notation

Question 22

The 3 notations are:

Answer 22

Infix Notation
Prefix (Polish) Notation
Postfix (Reverse-Polish) Notation

Question 23

We write expression in _________, e.g. a - b + c, where operators are used in-between operands.

Answer 23

infix notation

Question 24

In this notation, operator is prefixed to operands, i.e. operator is written ahead of operands. For example, +ab. This is equivalent to its infix notation a
+ b. Prefix notation is also known as ________.

Answer 24

Prefix/Polish Notation

Question 25

This notation style is known as _________. In this notation style, the operator is postfixed to the operands i.e., the operator is written after the operands. For example, ab+. This is equivalent to its infix notation a + b.

Answer 25

Reversed Polish Notation/Post Notation

Question 26

When an operand is in between two different operators, which operator will take the operand first, is decided by the ________ of an operator over others.

Answer 26

precedence

Question 27

___________ describes the rule where operators with the same precedence appear in an expression. For example, in expression a + b − c, both + and – have the same precedence, then which part of the expression will be evaluated first, is determined by associativity of those operators. Here, both + and − are left associative, so the expression will be evaluated as (a + b) − c.

Answer 27

Associativity

Question 28

___________ is an abstract data structure, somewhat similar to Stacks. Unlike stacks, this is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). It follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first.

Answer 28

Queue

Question 29

Basic operations of Queue:

Answer 29

Enqueue() Dequeue()

Question 30

Add (store) an item to the queue

Answer 30

enqueue()

Question 31

Remove (access) an item from the queue.

Answer 31

dequeue()

Question 32

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

Answer 32

peek()

Question 33

Checks if the queue is full.

Answer 33

isfull()

Question 34

Checks if the queue is empty.

Answer 34

isempty()

Question 35

True or False: In queue, we always dequeue (or access) data, pointed by front pointer and while enqueing (or storing) data in the queue we take help of rear pointer

Answer 35

True