Get detailed information on data structures and algorithms in C++.

cpp.tar.gz

runBSTArray

runBST

Fundamentals of Web Programming

Data structures are amongst the very fundamentals of Computer Science and are often a core decision in developing efficient programs. This module contains a detailed review of all the common data structures and provides implementation level details in C++ to allow readers to become well equipped with all the different data structures they can leverage to write better code.

Data Structures and Algorithms in C++

Is the following statement true or false?

"Size of the linked list should be known to us in advance for creating a linked list".

Is the following statement true or false?
“Size of the linked list should be known to us in advance for creating a linked list”.

```
class Node {
	int data;
	Node * nextElement;
}
```

```
class Node {	
	int data;
	Node * head;
}
```

```
class Node {
	Node * head;
	Node * nextElement;
}
```

What is the basic information stored in `class Node` of a linked list?

What is the basic information stored in <code>class Node</code> of a linked list?

An array can be sorted but a linked list can't

An array has a fixed size, but a linked list has a dynamic size.

linked lists are not better than arrays in terms of space complexity.

Choose the correct difference between arrays and linked lists.

Choose the correct difference between arrays and linked lists.

Stores the first element or node of the list in a variable `currentNode`

Stores second element or node of the list in `currentNode` variable

What does the following line of code do?
```
Node * currentNode = list->head->nextElement;
```

What does the following line of code do?
<pre><code>Node * currentNode = list-&gt;head-&gt;nextElement;
</code></pre>

What does the following fragment of code do?
```
Node * currentNode = head;
while(currentNode != nullptr){
	currentNode = currentNode->nextElement;
}
```

What does the following fragment of code do?
<pre><code>Node * currentNode = head;
while(currentNode != nullptr){
	currentNode = currentNode-&gt;nextElement;
}
</code></pre>

DLL traverses a list twice as fast as the SLL.

DLL has two links (forward and backward) for traversing the list and SLL only has one

Choose the correct difference between DLL (Doubly Linked List) and SLL (Singly Linked List):

Choose the correct difference between DLL (Doubly Linked List) and SLL (Singly Linked List):

What does the following fragment of code do?

```C++
Node * current = head;   
    int count = 0;		
    while (current != nullptr) {			
        count++;					
        current = current->nextElement;  
    }
    return count;
```


What does the following fragment of code do?
<pre><code class="language-C++">Node * current = head; 
 int count = 0;		
 while (current != nullptr) {			
 count++;					
 current = current-&gt;nextElement; 
 }
 return count;
</code></pre>

What is the time complexity to count the number of elements in the linked list when `n` = no. of nodes in the list

What is the time complexity to count the number of elements in the linked list when <code>n</code> = no. of nodes in the list

```C++
		Node * temp=head;
    if(isEmpty()){
      while(temp->nextElement != nullptr) {
        temp=temp->nextElement;
      }
      temp->nextElement = head; 
    }  
```

```C++
		Node * temp=head;
    while(temp->nextElement != nullptr) {
      temp=temp->nextElement;
    }
    temp->nextElement = head; 
```

```C++
			Node * temp=head;
    	while(temp->nextElement != nullptr) {
        temp=temp->nextElement;
    	}
```

Which of the following code inserts a loop in the linked list?

Which of the following code inserts a loop in the linked list?

Is the following statement true or false?

"Elements of a linked list may or may not be stored consecutively in memory".

Is the following statement true or false?
“Elements of a linked list may or may not be stored consecutively in memory”.

The top ten most commonly asked interview questions about the linked list will be covered in this lesson in the form of a quiz.

Before We Begin

Introduction to Complexity Measures

Arrays in C++

Linked Lists in C++

Stacks/Queues in C++

Graphs in C++

Trees in C++

Heap in C++

Hashing in C++

Conclusion

Linked Lists Quiz: Test your understanding of Linked Lists