Syllabus

 

COM 102

COMPUTER PROGRAMMING AND DATA STRUCTURES

(1+2)

 

THEORY

 

UNIT I: INTRODUCTION TO COMPUTER BASICS

            Introduction to Computer: Input / Output, Process and Memory– Generations and Classification of Computers- Software concepts: System Software and Application Software - Programming language and its classification - Algorithms and Flow charts.

UNIT II: C LANGUAGE

            History of C language– Structure of a C program – Character set      –   C tokens – Keywords and identifiers –Constants – Variables – Data types – Declaration – Operators and expressions

UNIT III: CONTROL STATEMENTS AND STRINGS

            Branching statements: If - If... Else – Nesting if.. Else –  Else .. If ladder - Switch – Goto Looping statements: While – Do-While - For - Arrays: One-Dimensional - Two Dimensional arrays - String: Reading and writing strings- String handling functions.

UNIT IV: FUNCTIONS AND USER DEFINED DATA TYPES

Defining a functions – Function declarations – Calling a function  – Categories of Functions  –Recursion - Structures- Array of Structures – Union - Pointers – Definition and understanding – Accessing – Declaring – Initialization - Accessing a variable   through its pointers- Pointer Expressions- Pointer increments and scale factor.

UNIT V – DATA STRUCTURES – STACK, LINKED LIST AND QUEUES

Introduction to data structures and its types – Stack: Definition-primitive/basic operation –Implementing Pop operation – Implementing  Push operation- Queues: Definition- Sequential representation -Insertion operation - Linked lists: Definition –   Inserting and Removing nodes from List.

Practical:

Familiarizing with Turbo C IDE; Building an executable version of C program; Debugging a C program; Developing and executing simple programs; Creating programs using decision making statements such as if, go to and switch; Developing program using loop    statements while, do and for; Using nested control structures; Familiarizing with one and two dimensional arrays; Using string functions; Developing structures and union; Creating user defined functions; Using local, global and external variables; Using pointers; Implementing stacks; Implementing push/pop functions; Creating queues; Developing linked lists in C language; Insertion/deletion in data structures.

 

Theory Schedule

 

	Introduction to Computer: Input / Output, Process and Memory	TB1:18-20
	Generations and Classification of Computers	TB1:9-18
	Software concepts: System Software and Application Software – Programming language and its classification  - Algorithms and Flow charts	TB1:287-297 TB1:263-264 TB1:230-240
	Structure of C programme, Character set, C tokens – Keywords and identifiers –Constants – Variables	TB2:12-13 & TB2:22-30
	Data types, Declaration, Operators, Expressions	TB2:30-35 & TB2:51-60
	Decision Making/Control Statements - Branching If - If... Else – Nesting if… Else - Else .. If ladder - Switch - Goto	TB2:111-135
	Concept of Looping/ loop statements - Scope and Visibility of variables - While – Do-While – For	TB2:149-172
	Concept of Arrays: One-Dimensional - Two Dimensional arrays	TB2:189-211
	Mid semester Examination
	String: Reading and writing strings- String handling functions	TB2:234-254
	Concept of Functions – Defining a function – Function declarations – Calling a function	TB2:267-277
	Categories of Functions – Recursion	TB2:278-292
	Structures- Array of Structures – Concept of Union	TB2:320-331 & TB2:338-339
	Pointer - Definition and understanding  – Accessing  – Declaring Pointers -Initialization - Accessing a variable through its pointers - Pointer Expressions- Pointer increments and scale factor.	TB2:353-364
	Introduction to a Data Structures	TB3:1-19
	Concept of Stacks & its Operations - PUSH & POP Operations, Concept of Queues - Insertion operations.	TB3:77-94 & TB3:174-181
	Concept of a Linked Lists - Inserting and Removing nodes from List	TB3:186-191

 

 

 

PRACTICAL SCHEDULE

1.      Working with Windows Operating System

2.      Develop algorithms and Flowchart for  simple problems

3.      Familiarizing with  Turbo C Integrated Development Environment (IDE)

4.      Developing and executing ‘C’ programs – (By using Arithmetic & logical operations )

5.      Developing and executing ‘C’ programs – (By using Conditional operator)

6.      Developing and executing ‘C’ programs – (By using Decision Making/ Control statements: if, if-else)

7.      Developing and executing ‘C’ programs – (By using Decision Making/ Control statements: nested if-else)

8.      Developing and executing ‘C’ programs – (By using Decision Making/ Control statements: switch & goto )

9.      Developing and executing ‘C’ programs – (By using Loop Statements/ Iteration statements: while & do-while)

10.    Developing and executing ‘C’ programs – (By using Loop Statements/ Iteration    

statements: for)

11.    Developing and executing ‘C’ programs – (By using Nested control structures)

12.    Developing and executing ‘C’ programs – (By using one dimensional array)

13.    Developing and executing ‘C’ programs to search an element in an array using Linear  search

14.    Developing and executing ‘C’ programs to perform bubble sort

15.    Developing and executing ‘C’ programs - (By using two dimensional array)

16.    Developing and executing ‘C’ programs to perform the following operation in Matrix

 a) Addition                   b) Subtraction

17.    Developing and executing ‘C’ programs to perform Matrix Multiplication.

18.    Developing and executing ‘C’ programs –(By using string library functions)

19.    Developing and executing ‘C’ programs –(By using string library functions)

20.    Developing and executing ‘C’ programs – (By using User Defined Functions)

21.    Developing and executing ‘C’ programs – (By using User Defined Functions)

22.    Developing and executing ‘C’ programs – (By using Parameter Passing Mechanisms:    

       Call-by-Value, Call-by-Reference)

23.    Developing and executing ‘C’ programs – (By using local and global variables)

24.    Developing and executing ‘C’ programs – (By using Recursion)

25.    Developing and executing ‘C’ programs – (By using Pointers)

26.    Developing and executing ‘C’ programs – (By using Structures)

27.    Developing and executing ‘C’ programs – (By using Unions)

28.    Developing and executing ‘C’ programs  - (To implement stack operation)

29.    Developing and executing ‘C’ programs  - (To implement stack operation)

30.    Developing and executing ‘C’ programs  - (To implement Queue operation)

31.    Developing and executing ‘C’ programs  - (To implement Queue operation)

32.    Developing and executing ‘C’ programs –(To implement  Linked list)

33.    Developing and executing ‘C’ programs –(To implement  Linked list)

34.    Final Practical Examination.

TEXT BOOKS

Unit - I

1. Pearson ,” Introduction to Computer Science”,  ITL Education Solutions Limited.

Unit – II,III,IV

2. Balagurusamy, E.,2017,ʺProgramming in ANSI C, Seventh Edition, McGraw Hill Education (India) Private Limited, New Delhi.

Unit - V

3.      Yedidyah Langsam, Moshe J.Augenstein, Aaron M. Tenenbaum, “Data Structure using C and C++”, Prentice – Hall of India Private Limited, New Delhi.

 

REFERENCE BOOKS

Unit - I

1. Rajaraman V. and  Veeharika Adabala ,”Fundamentals of Computers”, 2015, Sixth Edition, PHI Learning Private Limited, Delhi.

Unit – II,III,IV

2. The C Programming Language (Ansi C Version) by Brian W.rnighan  (Author), Dennis M. Ritchie

3.     Programming with ANSI and Turbo C by Ashok Kamthane, Published by Pearson Education

4. Yashavant P. Kanetkar, 2016, “Let Us C”,15^th Edition, BPB Publications

5.      Byron S Gottfried, 2018,“Programming with C”, Fourth Edition, Schaum’s Outlines, Tata McGraw-Hill Private Limited.

Unit - V

6.      Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, “Fundamentals of Data Structures in C”. Second Edition, Universities Publication.

7.   Data Structure Through C - by Yashavant P. Kanetkar 

8.      Seymour Lipschutz, “Data Structures with C”, Schaum’s Outlines, Tata McGraw-Hill Private Limited.