Prog Paradigms and Data Structures

Question 1

Explain what is the asymptotic notation and why this is important.

Answer 1

In computer science, the asymptotic notation, represented by the Big O notation, is used to analyse the complexity of an algorithm according to the input size. It provides information about how long an algorithm will take to run in its worst-case scenario, considering a constantly growing input. This analysis can help the developer to predict how long an algorithm will take to run, helping to make better decisions concerning the algorithm design.

Question 2

How linked lists work and why using pointers is important when implementing a linked list in C language.

Question 3

Algorithm Design - Brute Force
Definition, Examples - Pros and Cons

Question 4

Bubble Sort - Definition

Question 5

Algorithm Design - Divide and Conquer
Definition, Examples and Diagram

Question 6

Quick Sort - Definition

Question 7

Merge Sort - Definition

Question 8

Algorithm Design - Decrease and Conquer
Definition, Examples and Diagram

Question 9

Binary Search - Definition

Question 10

Selection Sort - Definition

Question 11

Insertion Sort - Definition

Question 12

Selection Sort x Insertion Sort

Question 13

Algorithm Analyses - Give the 3 points and their definitions

Question 14

Which algorithms tend to be less efficient and which tend to be more efficient?

Question 15

Merge Sort - Memory Requirements and Stability

Question 16

Quick Sort - Memory Requirements and Stability

Question 17

Tim Sort - Definition and Steps

Question 18

Big O - Complexities - provide the list of how it grows with their name, definition and examples

Question 19

Bubble Sort - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 20

Quick Sort - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 21

Merge Sort - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 22

Selection Sort - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 23

Insertion Sort - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 24

Linear Search - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 25

Binary Search - Big O Notation - Worst Case Scenario and Best Case Scenario

Question 26

Efficiency Comparison - definition, key aspects, formula and how to calculate log on the calculator

Question 27

Structures - Definition and Code Example

Question 28

Pointers - Definition

Question 29

Referencing x Dereferencing

Question 30

& Ampersand x * Asterisk

Question 31

Pointer Application

Question 32

Dynamic Memory - Stack Memory x Heap

Question 33

Malloc () - Definition

Question 34

Calloc () - Definition

Question 35

Free () - Definition

Question 36

Realloc () - Definition

Question 37

Stacks - Definition, Diagram, Operators and Application

Question 38

Queues - Definition, Diagram, Operators and Application

Question 39

Linked Lists - Definition, Steps and the Structure

Question 40

Binary Tree - Definition, Diagram and Structure

Question 41

Imperative Languages x Declarative Languages

Question 42

What is a program paradigm - definition, types and examples.

Question 43

Procedural - Example, definition and Best Choice When:

Question 44

Object Oriented Programming - Example, definition and Best Choice When:

Question 45

OOP Principles

Question 46

OOP Architecture

Question 47

Logic - Example, definition and Best Choice When:

Question 48

Reactive - Example, definition and Best Choice When:

Question 49

Functional - Example, definition and Best Choice When:

Question 50

Explain the importance of choosing the right pivot.

Question 51

Merge and Quick sort which is recommend to the size of the array. Smaller or bigger.