Intro to Data Structures

Question 1

Arrays

Answer 1

A basic data structure with homogeneous data types referenced by index, contiguous locations

Question 2

Arrays; Ordering:

Answer 2

sequential

Question 3

Array: Big O notation

Answer 3

O(1) for accessing
O(n) for searching
O(n) for insertion and deletion
O(log n) for binary searching

Question 4

Linked-List: Single-Linked List

Answer 4

each node points to the next node. Tail points to null

Question 5

Linked-List: Double-Linked List

Answer 5

Each node points to the next and previous node. Head points to null and next, Tail points to previous and null.

Question 6

Linked-List: Circle-Linked List

Answer 6

The tail points to the head, closes the loop

Question 7

Linked-List Big O notation

Answer 7

O(n) for accessing
O(n) for searching
O(1) for insertion
O(1) for deletion

Question 8

Stack:

Answer 8

Containers of “objects” that are inserted and removed according to LIFO

Question 9

Stack Operations

Answer 9

Pull= inserting object to the top of the stack

Pop= remove from the stack and return the top object to the stack

empty()= returns true if empty

peek()= returns element on top of stack without removing it

search()= searches for elements in the stack

Question 10

Stack Big O notation

Answer 10

O(n) for accessing
O(n) for search
O(1) for insertion
O(1) for deletion

Question 11

Queues

Answer 11

Cousins of Stacks

Containers of “objects” that are inserted and deleted according to FIFO

Question 12

Queues: Operations

Answer 12

poll()
remove()
peek()
element()
offer()

Question 13

Queues: Big O notation

Answer 13

O(n) for accessing
O(n) for searching
O(1) for insertion
O(1) for deletion

Question 14

Tree

Answer 14

A non-linear data structure where the objects are organised in terms of hierarchical relationships