Details of CS3101 (Autumn 2020)
| Level: 3 | Type: Laboratory | Credits: 4.0 |
| Course Code | Course Name | Instructor(s) |
|---|---|---|
| CS3101 | Programming and Data Structures I | Kripabandhu Ghosh |
| Syllabus |
|---|
| Topics:
Introduction to C programming: Datatypes, variables and constants, operators, assignments, expressions, input/output, conditionals and branching, iteration, functions, recursion, divide and conquer, pointers, structures, memory allocation. [19 hours] Problem solving using flowcharts and algorithms. [2 hours] Performance analysis of algorithms (Time and Space complexity). [2 hours] Linear data structures: Arrays: Types; Memory representation; Address translation and functions of single and multidimensional arrays with examples. [3 hours] Stacks and Queues: Definition; Representation; Usesandapplications; Infix,Prefix,Postfix notations: conversion and evaluation; Circular Queue; Priority Queues. [6 hours] Searching: Linear search; Binary search. [2 hours] Sorting: Terminology: Stability, inversion; Different sorting algorithms (Bubble, Insertion, Selection, Quick, Merge, Count, Radix). [2 hours] |
| References |
|---|
| Books and references:
1. Ellis Horowitz, Satraj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, W. H. Freeman and Company. 2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India. 3. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill. 4. Seymour Lipschutz, Data Structures, Schaums Outlines Series, Tata McGraw-Hill. |
Course Credit Options
| Sl. No. | Programme | Semester No | Course Choice |
|---|---|---|---|
| 1 | IP | 1 | Elective |
| 2 | IP | 3 | Not Allowed |
| 3 | IP | 5 | Not Allowed |
| 4 | MR | 1 | Not Allowed |
| 5 | MR | 3 | Not Allowed |
| 6 | MS | 3 | Not Allowed |
| 7 | MS | 5 | Elective |
| 8 | MS | 7 | Elective |
| 9 | MS | 9 | Elective |
| 10 | RS | 1 | Elective |
| 11 | RS | 2 | Elective |