Important Dates

Quizzes/Deadline dates here, along with syllabus

• Apr 19 (FRI), 11:59 PM - CS 218 Programming assignment 2
• Apr 20 (SAT), 11:59 PM - CS 208 Homework assignment 4

Endsem Exams

• Apr 22 (MON), 2-5 PM - CS 218
• Apr 26 (FRI), 2-5 PM - CS 219
• Apr 27 (SAT), 2-5 PM - CS 240
• Apr 29 (MON), 2-5 PM - CS 208
• Apr 30 (TUE), 9-12 NOON - CS 236 [MORNING EXAM]
• May 02 (THU), 2-5 PM - CS 217

Syllabus for Endsems

• CS 218 - Lecture 1-35 (the last one by Akash not included), with more emphasis on the post-midsem part

• CS 219 - Lecture Slides 1-19

• CS 240 - Labs 1-13 (at least 30% marks from the content before midsem)

• CS 208 -

• CS 236 -
  

    5 marks - testing the basics of writing a shell using fork/exec/wait system calls.
    5 marks - a simple question testing the basics of using pthreads, locks, condition variables. 
    7 marks - a more challenging problem on multithreading
    8 marks - a question based on the filesystems lab
  

• CS 217 - Week 1-12 or Lectures 1-24

Weekly Recap

Summary of what happened (topics covered) in classes this week could go here

Tuesday

• CS 208 - Equivalence of non-deterministic and deterministic TMs, Equivalence of TM with Sigle ended and Two-side infinitely long tape, Equivalence of TM and Two stacks or Counters
• CS 218 - Continuing Radomized algo for 2D Linear Programming, 2 cases of subproblem, Probability of cases and Expected Runtime
• CS 219 - Semaphores, Semaphore as a lock and conditional variables, Solving problems using them

Thursday

• CS 208 - Counter machines, 3-counter machine with 2 counters, A computer by a Turing machine
• CS 218 - Simplex Algorithm, Defining Corner or Basic feasible solution, Standard form of LP, Geometric interpretation of simplex

Friday

• CS 208 - Recursively enumerable languages, TM's and strings as Natural numbers, Proving existance of non-recursively enumerable languages
• CS 217 - Normal form game representation, String and Weak Dominant strategy, Pure and Mixed Nash equilibria

Monday

• CS 218 - Alzebra in CS, modular arithmetic Features of QR code, Error correction algorithm in QR codes
• CS 219 - I/O subsystem, I/O instructions and Memory mapped I/O, Interrupt handler, Direct Memory Access (DMA)
• CS 208 - Revision of Friday's class, Reccursive Languages, Notion of Undecidability

Timetable

Time	Monday	Tuesday	Wednesday	Thursday	Friday
8:30 am - 9:25 am	CS 218 (LA 001)	CS 208 (LA 201)		CS 219 (LA 001)
9:30 am - 10:25 am		CS 218 (LA 001)		CS 208 (LA 201)
10:35 am - 11:30 am	CS 219 (LA 001)			CS 218 (LA 001)
11:35 am - 12:30 pm	CS 208 (LA 201)	CS 219 (LA 001)
9:35 am - 11:00 am			Minor		Minor
11:05 am - 12:30 pm			CS 217 (LH 301)		CS 217 (LH 301)
2:00 pm - 4:55 pm	CS 240	DE 250 (S3)		CS 236	DE 250 (S7)

Course Policies

Weightage of everything for grades

CS 208

Logic, Automata and Theory of Computing

• Scribing - 3%
• Homework Assignment - 18%
• Quizzes - 14%
• Midsem - 25%
• Endsem - 40%

CS 217

Artificial Intelligence and Machine Learning

• Scribing - 5%
• 2 Quizzes - 15% each
• Midsem - 30%
• Endsem - 35%

CS 240

Artificial Intelligence and Machine Learning Lab

• Best 10 Weekly Labs - 3% each
• Midsem - 35%
• Endsem - 35%

CS 218

Design and Analysis of Algorithms

• 2 Homework Assignments - 5% each
• 2 Quizzes - 10% each
• Midsem - 25%
• Endsem - 40%

CS 219

Operating Systems

• 2 Quizzes - 15% each
• Midsem - 30%
• Endsem - 40%

CS 236

Operating Systems Lab

• 4 Lab Exams - 25% each (Weekly labs ungraded)