Syllabus	.html                              .pdf
Students' List	s3c
Contact  Hours (Room# 312)	12/9 19/9 26/9 7/11 Monday 5 3 Tuesday 4 2 3 Wednesday 4 1 1 1 Thursday 3 2 2 1 Friday 2 2 2
Progress	Course Progress Page
Assignments	20/10/22 Class Assignment I: Model Questions and instructions Questions: (1) Write an algorithmic function sort_list(A,n,L) to copy the integer array A  of size n to a linked list in sorted order.  Do not sort A. L is pointing to a singly linked list which is initially empty. Illustrate sort_list() function above with an array (3, 4, 2, 1, 5) (2) Write the insertion sort algorithm as discussed in class. Illustrate the functioning of your algorithm with an array (3, 4, 2, 1, 5) Instructions: The CA is based on the discussion in class. Algorithms and illustrations should comply with the discussions in the class. Write answers to the above questions on your own in advance and carry it in one/two paper sheets to the test hall for reference. No need to attach it with the test answer sheets. Answers written by some one else may not help you much. Do not bring any other material to the test hall. Also bring blank sheets to write the test. Twine or stapler will be arranged. Neatly write the answers in the stipulated time. No discussion or exchange of material with others are permitted. Date(probably 25/10), time, and venue of CA1 will be announced later. Please don't abstain. Re-chance will not be an easy choice. 24/10/22 CAI is scheduled for 25/10/22 2PM. Venue will be informed in class. 25/10 Seating arrangement: 502: RNs 1 to 30 503: Rest of the class 10/11: CA1 pending for 64 66 68 CA1 Evaluation : In most of the cases I wish to hear an explanation of the answers, especially to the first question. The marks will be updated based on it. In some cases the evaluation is complete based on the written answers. Anyway, for all the cases you have a chance to put up your logical arguments to claim your marks if you have assessed that the awarded marks are less than what it should be. For that come prepared with clear logical arguments. Anyway, what is completed is here. CA1 & T1: We shall have a class room discussion on 17/11/22. After that, you can come and verify your marks and claim more marks if you assess that the awarded marks are less than what it should be. 11/11: Possibly we shall have an online session on 14/11/22, Monday to discuss CA1 and T1 QAs. Confirmation and other details will be posted on Sunday evening. 27/11/22 CA2 Model Questions (1) Using mid-square hash function(with word size 8 and 4 bits separated from middle)  and quadratic collision resolution technique as discussed in class illustrate how the following keys are hashed: 10 20 30 40 50. (1/12 - In case the squared value doesn't fit in the word use 12 bit word; or retain only the 8 LSBs) (2) Illustrate how BFS algorithm as discussed in class works on the following undirected graph. Clearly show the changes in the data structures as the algorithm execution progresses. Starting node is A. Edges of the graph: AB BC CD AE AF AG AH AI AJ DG GJ 5/12/22: CA2 will be conducted during 10AM and 12 on 6/12/22 CA2 marks
Tests	Topics for T1 Module 1: Basic Concepts of Data Structures Algorithms Time Complexity Complexity Calculation of Simple Algorithms Module 2: Arrays and Searching Stacks Queues Linear Search and Binary Search Infix to Postfix conversion Module 3: Linked List Self Referential Structures Singly Linked List Operations on Linked List Stacks and Queues using Linked List Module 5: Sorting Techniques Bubble Sort Selection Sort Heap Sort 12/11: T1 marks See remarks above against assignments. 8/12/22 Topics for T2 Module 1 System Life Cycle Performance Analysis of algorithms Space Complexity, Asymptotic Notation Module 2 Polynomial representation using Arrays Sparse matrix Priority Queues Double Ended Queues Evaluation of Expressions Module 3 Memory Management Dynamic Memory Allocation Doubly Linked List Circular Linked List Polynomial representation using Linked List Memory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes Module 4 Trees and Graphs Trees, Binary Trees-Tree Operations, Binary Tree Representation Tree Traversals Binary Search Trees & Operations Graphs, Representation of Graphs Depth First Search Applications of Graphs Module 5 Quick Sort Merge Sort Hashing - Techniques Collision Resolution Overflow handling Hashing functions – Division, Folding, Digit Analysis 15/12/22: T2 marks
Sessional	Marks:      T1           T2          CA1            CA2 4/1/23 Draft Sessional is ready.  (Later modified with booster distribution recycled!)(Updated on 5/3 with marks who missed their first chance) Booster formula is subject to change, but will  not adversely effect those below 40 Booster: Addition 14 and  Multiplication up to 14 Attendance component: att_percentage/10 +1 Entries per line: rn t1/12.5 t2/12.5 a1/10 a2/10 at% --> t1b t2b a1b a2b at ---> actual boosted Attendance shortage matter may be taken up with staff advisor and college authorities. Two  attendance shortage cases exist. Candidates may seek whatever recourse options available at their disposal. 13/1/23 Final sessional
Doubt clearing
Attendance	Students are expected to attend all the classes. Please be at the class at the time of commencement. Attendance shall be marked only if physically present in the class. As per KTU rules, absence for all activities and contingencies should be limited to 25%. Hence duty leave will not imply presence. Also, late comers will be marked, and two late marks will count as one absence. Attendance status  till September end Shortage(10hrs) 57 7   70 45 7   70 44 7   70 43 7   70 3 7   70 49 5   50 41 5   50 2 5   50 Shortage as on 18/10 (18 hrs) 45 13   72 41 12   67 49 11   61 2 11   61 -------------------------------- Attendance status at the end of October Shortage after October (27 hours) 49 20   74 2 20   74 -------------------------------- Attendance status at the end of November LET details subject to correction Shortage after  November (42 hours) 45 30   71 49 29   69 --------------------------------------- Attendance status at the end of December classes LET details subject to correction Shortage after  December (49 hours) 49 35   71 45 33   67 ------------------------------------------------------ 4/1/23 As per attendance rules, 8.2, attendance up to  10% can be considered for national level duty leave. As per attendance rules, 8.3, attendance up to  5% can be considered for college level duty leave. Requests received so far and considered. 13 - 4 hrs  - 8.2, 8.3 23 - 5 hrs  - 8.2, 8.3 40 - 1 hr  - 8.3 63 - 5 hrs - 8.2, 8.3
Advanced question /topic (Some may be Beyond syllabus)	3/11/22: Question posed today in class. There are 69 students in a class. Each one of them is saying "I am in close friendship with exactly 25 others in the class". Why is it impossible?
Course schedule	Required: M1 + M2 + M3 + M4 + M5 + T + A = 5 + 10 + 12 + 8 + 10 = 45 + 4  + 2 = 51 Possible: Sep + Oct + Nov + Dec 11 + 14 + 17 + 12 = 54 Actual: 10 + 17 + 15 + 7 = 49
LET special session	A special session to cover the topics missed by LET students shall be conducted on 2/11/22 from 9.30 onward. 9.30-12.30 Session: Data structures, Algorithms, Complexity, Arrays, Sequential search & complexity, Binary search - recursive, iterative, complexity, interchange sort, complexity, selection sort, bubble sort - both directions, insertion sort. Attended by all 6 from S3C and RN 65 from S3D. 1.30-3PM Session: Q using array, Q using linked list. Attended by all 6 from S3C

/Announcements/Information/Remarks

12/9/22	Classes commenced. On roll 63 students.
13/9	#55 left. Now total 62.
13/10	L1 - L4 attended class. Total = 62 + 4 = 66
18/10	L5 attended class. Total = 67
25/10	L6  reported, CA1 later. Total = 68
26/10	L7 reported. Total = 69
28/10	L8 reported. Knew that L1 and L5 left. So, total = 68 For our purpose only: L2 - Arathi, L3 - Arya, L4 - Malavika, L6 - Diljith, L7 - Arun, L8 - Adarsh
31/10	Roll nos. we will use for LET: 64 Adarsh, 65 Arathi, 66 Arun, 67 Arya, 68 Diljith, 69 Malavika
11/11	Possibly we shall have an online session on 14/11/22, Monday to discuss CA1 and T1 QAs. Confirmation and other details will be posted on Sunday evening.
13/11	Our session tomorrow to discuss CA1 & T1 will be at 7PM.
14/11	Day's online session at 7PM  https://meet.google.com/pzr-uuwg-eog Preferable to use college email id to login Once the session started please type in your roll number as CS21Cxx in the chat window. (Replace xx in CS21Cxx by the last two digits of your roll number)
16/12	Clarified that 69 has discontinued the course. Hence removed some of the related entries (Att: from 29/11)
3/1/23	Retest chance for T1, T2, CA1, and CA2 should be claimed today with sanctioned permission letters. If already permitted, please meet me in person today itself to verify and schedule it.