Chandan Karfa

CS 101: Introduction to Computing

Instructors

• Dr. Chandan Karfa

• Dr. Deepanjan Kesh

• Prof. P. K. Das

• Prof. S. B. Nair

• Plans:

• There are four groups. Groups 1 and 3 were taught by Prof. Nair and Dr. Karfa. Groups 2 and 4 were taught by Prof. Das and Dr. Kesh.

• Pre-mid Sem part was taught by Prof. Das and and Prof. Nair.

• Post Mid Sem was yaught by Dr. C. Karfa and Dr. D. Kesh.

Syllabus:

• Introduction to Computers: the von Neumann architecture, low/high level language, compiler, interpreter, loader, linker, operating system, flowchart, programming environment.

• Concepts of programming (using C): Data types, variables, operators, expressions, statements, control structures, functions, parameter passing, recursion, arrays and pointers, records (structures), memory management, files.

• Program development lifecycle. Algorithms, efficiency, correctness, implementation, verification, assertions, pre/post conditions, invariants, testing.

• Fundamental data structures: arrays, stacks, queues, linked lists.

• Searching and sorting.

Text Book:

• B. Kernighan and D. Ritchie, The C Programming Language, 4th Ed., Prentice Hall of India, 1988.

• H. Cormen, C. F. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 3rd Edition, MIT Press, Prentice Hall of India, 2009.

• A. M. Tannenbaum, Y Langsam and M J Augenstein, Data Structures Using C, Prentice Hall India, 1996

Grade Calculation

• MidSem: 40%

• End Sem: 60%

Classes (Post Mid-Sem part by Dr. C. Karfa)