Programming and Data Structure (CS11001, 3-0-0)

 

SPRING  2015-16

 

 

Class Schedule:: Wed 12:00-12:55, Thur 11:00-11:55, Fri 9:00-9:55

Venue: F116

 

 

 

Class Test 1 Solutions:  pdf

 

Mid Semester Examination Solutions: pdf

 

Class Test 2 Solutions:: pdf

 

End Semester Examination Solutions: pdf

 

Schedule for showing End Semester & Class Test 2 Scripts: (DO NOT BRING PENS WITH YOU)

 

Date

Venue

Time

Departments

May 4, 2016

V1 (Vikramshila)

4:00PM – 4:40PM

AE, AG, AR, BT

May 4, 2016

V1 (Vikramshila)

4:50PM – 5:30PM

CS, CY, EC

May 4, 2016

V1 (Vikramshila)

5:40 PM – 6:20 PM

IE, IM, MA, ME, MF

May 4, 2016

V2 (Vikramshila)

4:00PM – 4:40PM

CE, CH

May 4, 2016

V2 (Vikramshila)

4:50PM – 5:30PM

EE, EX, GG, HS

May 4, 2016

V2 (Vikramshila)

5:40 PM – 6:20 PM

MI, MT, NA, PH, QD

 

 

 

Course Outline:

 

Introduction to digital computer. Introduction to programming: Variables, Assignment; Expressions.

Input/Output, Conditionals and Branching, Iteration.

Functions, Recursion. Arrays, Introduction to Pointers, Structures.

Introduction to Data-Procedure Encapsulation, Dynamic allocation, Linked structures.

Introduction to Data Structure: Stacks and Queues, Search Trees, Time and space requirements.

(A programming language like C/C++ may be used as a basis language. The same language must be used for the laboratory).

 

References:

 

1.      Programming with C (Third Edition)

B.S. Gottfried, Schaum’s Outline Series, Tata McGraw-Hill, 2010.

2.      Programming in ANSI C (Second Edition)

E. Balagurusamy, Tata McGraw-Hill, New Delhi, 1992.

3.      Data structures

S. Lipschutz, Schaum’s Outline Series, Tata McGraw-Hill, 2006.

4.      Data structures using C and C++ (Second Edition)

Y. Langsam, M.J. Augenstein, A.M. Tanenbaum, Prentice-Hall of India.

 

Lecture Slides:

 

Lecture

Outline of Coverage

Slides

L1-Intro

Introduction, data types, variables and constants, operators, expression, assignment, basic I/O, flowcharts, programming examples

L1-1

L1-2

L1-3

L1-4

L2-Control

 

Control statements, programming examples and exercises

L2-1

L2-2

L2-3

L3-Function

 

Functions, recursion, programming examples and exercises

L3-1

L3-2

L3-3

L4-Array

Arrays, strings, using arrays with functions, programming examples and exercises

L4-1

L4-2

Strings

Misc Topics

L5-Structure

 

Structures, array of structures, examples

L5-1

L6-Pointer

Pointers, relationship with arrays, parameter passing, pointers to structures, dynamic memory allocation

L6-1

L6-2

L7-Number

Number systems

L7-1

IEEE-754

L8-File

Files, command-line parameters

L8-1

L9-Sorting

Linear search and binary search. Sorting algorithms: selection, bubble and quick, time and space complexity.

L9-1

L10-Linked List

Self-referential structures, linked list, abstract data types, implementation of stacks and queues

L10-1

L11-Applications

Some applications of stack: evaluation of Postfix expressions, parenthesis matching, infix to postfix conversion.

L11

L12-Analysis

 

Algorithm analysis, formal notations.

L12

 

 

Important Information:

 

·        The breakup of marks for the course will be as follows:

o    Mid-semester examination                  30 %

o    End-semester examination                  50 %

o    Class Tests and attendance                 20 %