2021-22  S3D
CST 201 Data Structures

Course Progress Page


Course So Far
Month
 Date
 Hr.
 Progress
 Class
#
 QA
Range
 Absentees
 No. of
Absentees
 Late
 Remarks
 Online class video
2021
Nov
 18
 2
 Intro ax+b
 1
 25-29
 26 30 41 42 51 55
 6
40->41, 44->42 (16/2/22)

29
 5
 ax+b; correctness; COs; concept of complexity
 2
 30-34
 32 38 13 26 62
 5
14->13

30
 5
 complexity; linear search, its complexity
 3
 35-59
 35 38 41 45 53 56 58 62 13 16 22 27 29
 13
gh, 14->13, 40->41
Dec
 1
 1
 Binary search, iterative, complexity
 4
 60-2
 61 62 26 56 58
 5



2
 3
 Binary search, recursive, fib_rec(n), fib_dp(n), swap
 5
 3-4
 3 14 58 62
 4
ghi

2
 5
 interchange sort, selection sort, conditional swap to improve
 6
 5-12
 14 52 58 62 3
 5



3
 1
 insertion sort, analysis. Bubble sort.
 7
 13-17
 11 49 52 56 58
 5



6
 5
 Bubble sort - either direction. Analysis
 8
1 9 10 11 13 20 36 37 49 51 52 58 59 62 64
 15
14->13

7
 2
 Complexity concept. O, Ω, \Omega  Θ\Theta  Notations. Definition and discussion of O. Illustration graphs.
System life cycle.
 9
52 + 66 1 +1 
gh
28/2: + 66

7
 4
 Polynomial using 1d array; pol_value, add_poly
 10
 18-34
 23 35 45 52 62 2 + 66
 6 +1

 28/2: + 66

8
 1
 add_poly completed
 11
 35-59
 52 62 13 14 24
 5
LET Akhil joined

9
 4
 Polynomial using 2d array; pol_value, add_poly 12
 60-16
 61 62 23 24 52
 5



10
 1
 ... add_poly 2d
 13
 17-31
 18 20 22 35 39 45 49 51 52 53 58 59 60 61 66 1 2 11
 18
gh;
So many absentees may be due to this being Minor hour.
28/2 65->66

14
 4
 add_poly 2d, sparse matrix
 14
2 3 21 35 47 50 57
 7



15
 1
 add sparse matrices
 15
 32-5
 32 58 3 22 + 65
 4 +1
 62 12
 2/3: + 65

16
 4
 Stack - background general talk, assignment, linux discussion
 16
 6
 7 19 22 25 33 34 41 55 60 62
+ 65 		10 +1
2/3: + 65

21
 1
 Stack using - array, structure with array
 17
3 22 55 62 4



22
 2
 Queue using structure with array
 18
2 12 16 23 25 26 29 33 38 41 47 53 62
 13



23
 2
 Circular queue using structure with array 19
1 3 5 9 10 11 14 18 20 21 22 25 38 39 44 45 46 47 49 51 52 55 57 58 59 60 61 62 63 64
 30


2022
Jan
 3
 2
 Priority Q
 20
20 24 25 26 27 36 45 55 58 60
 10



4
 1
 Postfix evaluation
 21
 7-14 14 22 26 58 60 65
 6
 62 12 6


5
 2
 Linked List - insertion
 22
26 35 50 52 55 56 58 62
 8



6
 2
 LL  - search and deletion
 23
 16-22
 26 44 47 58 62 2
 6



15
 AN
 T1
 24-25
- .5
01 02 03 05 07 09 10 11 12 13 14 16 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
 60



17
 2
 T1 qp discussion, DLL - insertion
 26
02 27 36 48 51
 5
64 14
39 not present when queried.
In insert_first_dll, even though explained, forgot to write
temp.next <--- H
just after
temp.data <--- x
183M

18
 7
 SLL deletion, DLL deletion
 27
 23-40
 02 03 20 32 35 51 52 59
 8
 54 46 58
509M

19
 2
 CLL insertion, search, deletion
 28
25
 1
 02
400M

20
 3
 LL - Poly operations
29
 41-44
 05 19 22
 3
 42 36
 Class/Video corrections:
1. Initially at one point coefficient and exponent values are written and explained in swapped order.
2. In the addpoly function before starting the second while loop the first while loop is to be closed using a curly brace.
 309M

24
 4
 LL - stack, Q
 30
05 22 26 47 64
 5

245M

25
 1
  infix to postfix
 31
 54-56
 16 55
 2
 54 60 48 58 26
 54 no response
 229M

25
 5
 quick sort, merge sort
 32
 57-67,45
 02 16 35 53 62 + 66 20 49 48 67
 10
 61 63 64 66
 61 63 64 66 No response
 Forgot to record!

27
 3
 heap
 33
 46-54, 1-6
 13 58 60 64 + 36
 5
 46 47 48 52 53 5
99M

31
 4
 heap sort,  memory allocations
 34
39
 1
 35 08 16 48

February
 1
 1
 first-fit, best-fit
 35
02 26 48 55 60 66 + 27 47
 8
 37 35


1
 5
 worst-fit
Tree, inorder traversal
 36
51 65 66 + 25
 4
 48 35 34 47
145M mkv format

same quality

377M
mp4 format

2
 2
 preorder, postorder, bst, insert, search
 37
 35-43
10-16

35 38 + 02 27
137M mkv

310M mp4

3
 3
 bst - deletion
38
 17
 05 55
 2
 32 40
213M

8
 1
 bst - deletion
 39
 18-56
 19 22 37 48 49 50 54 55 58 60 8 11
 12
 12 62


9
 2
 Graph - representation, BFS
 40
1




11
 4
 DFS; Applications of graph; Hashing 41






14
 2
 Hashing; Mid-sqaure
 42
 57-67
 59 29 37 38
 4



15
 1
 Hashing; Mid-sqaure, division, folding.
 43
 1-2
 13 21 22 29 34 37 38 56
 8



16
 2
 digit analysis. Collision - separate chaining, closed hashing - linear, quadratic probing, double hashing; Rehashing, load factor
 44
1 9 10 11 16 18 19 20 21 24 25 27 29 30 31 33 34 35 36 37 38 39 40 43 42 45 47 48 49 50 51 54 56 57 58 61 63 65 66
 39



17
 AN
 T2
 45
38 56
 2



21
 2
 T2 discussion
 46
5 26 46 48 56 64 65
 7



24
 3-
 T1 retest






March
 3
 1,2
 A2(CA)
 48