Programme Course Code(s) Title

B.Sc. ECS 18GE42 C Programming and Data

Structures
Preamble : This course has three credits dedicated to provide the students a
strong foundation on the basic knowledge on C Programming and
Data Structures .applications and host the businesses online.
Expected Level of Output : Conceptual Level
Department offered: : BCA
Prerequisites : Higher Secondary Level
Course Outcomes : On successful completion of the course, students will have the
ability to
Course Description Verb Skill CIA-Capstone
Outcomes
CO1 Able to understand the
Understand Conceptual skill Poster Presentation
Importance of C and Basic
CO2 Structure of programs
Able to apply the concepts of
Self Support
programmilanguages.
Decision Making ,Branching Apply Technical Skill
Assignment
and Looping
CO3 Able to analyze the Structures, Technical Skill Self Support
Analyze
Unions and Pointer Conceptual skill Assignment
CO4 Able to evaluate the Stack,
Technical Skill
Queues , Static List and Evaluate Class Presentation
Conceptual Skill
Linked List

CO5 Able to analyz Trees and Technical Skill

Analyze Group – Mini Project
Sorting Conceptual Skill
 Course Inputs:
Modular Assessment Code: D(Theory Application)
Modules Hours Text
Description Chapter CO
planned Book
Overview of C: History of C -
1 Importance of C - Basic Structure of A 1
programs
Constant, Variables, and Data Types:
Character Set, C Tokens, Keywords and
1 Identifier, Constants, Variables - Data A 2
Types – Declaration of Variables-
Assigning Values to Variables
Operators and Expressions:
Introduction - Arithmetic Operators -
Relational Operators - Logical Operators
I CO1
- Assignment Operators - Increment and
2 Decrement Operators - Conditional A 3
Operators - Bitwise Operators -
Arithmetic Expressions - Evaluation of
Expressions – Type Conversions in
Expressions

Managing Input and Output

Operations: Introduction – Reading a
1 A 4
Character – Writing a Character –
Formatted Input – Formatted Output

Decision Making and Branching:

Introduction - Decision Making with if
II 1 Statement – Simple if Statement – The if A 5
….. else Statement – Nesting of
if ….. else Statement – The Else if
 Ladder – Swith Statement – The Goto CO2
Statement
Decision Making and Looping:
2 Introduction – The While Statement – A 6
The do Statement – The for Statement
Arrays: Introduction - One-dimension
Arrays – Declaration of One-dimension
Arrays – Initialization of One-dimension
2 A 7
Arrays - Two-dimension Arrays -
Initializing Two-dimension Arrays -
Multi-dimension Arrays

User-Defined Functions : Introduction -

Need for User-defined Functions -
Elements of User-defined Functions -
2 Definition of Functions - Return Values A 9
and their types - Function Calls –
Function Declaration - Category of
Functions - Nesting of Functions –
Recursion

Structures and Unions : Introduction –

Defining a Structure – Declaring
Structure Variables – Accesing Structure
2 Members – Structure Initiliation - A 10
Copying and Comparing Structure
Variables - Arrays of Structures, Arrays
within Structures, Structures within
Structures, Structures and Functions
Pointers: Introduction - Understanding
III Pointers – Accessing the Address of a CO3
2 A 11
Variable - Declaring pointer Variables -
Initialization of pointer Variables
Accessing a variable through its pointer-
1 A 11
Pointer Expressions
A Look at Procedure oriented
1 B 1
programming – Object Oriented
Programming paradigm – Basic concepts
of Object Oriented Programming -
Benefits of OOP – Object oriented
language – Applications of OOP
 Introduction to Data Structures:
Introduction – Data and Information –
Overview of Data Structures – Types of
1 C 1
Data Structures – Premitive to Non
primitive Data Structures and
Operations.
Stack: Introduction – Stack – Related
Treams – Stack implementation –
Operations on Stack – Pointers and Stack
IV 2 – Representation of arithmetic C 4
Expressions- Infix, Prefix and Postfix
Notations – Evaluation of Postfix
Notiation – Conversion of expression
from Infix to Postfix
Queues : Introduction – Various CO4
Positions of Queue – Queue
2 Implementation – Operations of queues C 5
– Insertion and Deletion Queue – Types
of Queue
Static List and Linked List –
Introduction – Implementation of List –
2 C 6
Insertion – deletion –Sorting – Circular
Linked List - Doubly Linked List –
Cirular Doubly Linked List
Trees : Introduction – Basic Terms –
Binary Tree – Binary Tree C 8
2 Representation - - Traversal of a Binary
Tree
1 Binary Search Tree C 8
V CO5
Sorting: Introduction – Sorting –
Insertion Sort – Selection Sort – Bubble
2 C 10
Sort – Quick Sort – Heap Sort – Radix
Sort
3 Revision

Total
33
Hours
CIA: 15 Marks; Semester: 45 Marks
Text Book(s):
A. Balagurusamy. E; Programming in ANSI , Tata McGraw - Hill Publishing Company Limited,
New Delhi, , Third Edition, (2006).
B. Balagurusamy.E; Object Oriented Programming with C++, Tata McGraw – Hill Publishing
Company Limited, New Delhi, Fourth Edition, (2010).
C. Ashok N . Kamthane; Introduction to Data Structures using C, Pearson Education, (2007)
Reference Books:
1. Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language, Prentice Hall
2. Yashavant Kanetkar, Pointers in C, BPB Publications
3. S. Sahni and E. Horowitz, “Data Structures”, Galgotia Publications
4. Tanenbaum: “Data Structures using C”, Pearson/PHI.

Course Co-Ordinator:
1. K.Devika Rani Dhivya
2. R.Ramesh
 Programme Course Code(s) Title
B.Sc. ECS 18GE43 C Programming and Data
Structures Lab
Preamble : On successful completion of this course the students will acquire
knowledge in C Programming with Data Structure concepts.
Expected Level of Output : Conceptual Level
Department offered: : BCA
Prerequisites : Higher Secondary Level
Course Outcomes : On successful completion of the course, students will have
the ability to
Course Description Verb Skill CIA-Capstone
Outcomes
CO1 Able to understand the
Character Set, C Tokens,
Self Support
Keywords and Identifier, Understand Technical Skill
Assignment
Constants, Variables - Data
Types – Declaration of
CO2 Able to Understand Self Support
Variables- Assigning Understand Technical Skill
Arithmetic Operators Assignment
Values to Variables.
CO3 Able to analyse Decision
Self Support
Making, Branching and Analyze Technical Skill
Assignment
looping
CO4 Able to Create Stack and
Create Conceptual skill Poster Presentation
queue
CO5 Able to Understand the Conceptual
concepts of Trees Understand Poster Presentation
Skill
Course Inputs:
Modular Assessment Code: M (Practical - Application)

EX HOURS TITLE OF THE EXPERIMENT TEXT

PLANNED BOOK
1 1 Calculate Sum of Digits 1, A

2 2 Calculate Factorial of a given number 2

3 2 Find minimum and maximum of N numbers 3

4 2 Generate and Print Prime number up to an integer N 4

5 1 Find Largest of given Three numbers 5

6 2 Print Arithmetic Calculation Read Two Variables 6

I 1 Review A

Create a Stack and perform Pop, Push, Operation on

7 1 B
the Stack
B
8 2 Implement single linked list

Create a Binary Tree to perform Tree Traversal B

9 2
(Preorder, Posteorder, Inorder)

10 2 Implement Queue B

11 2 Implement Bubble Sort B

12 1 Implement Insertion Sort B

II 1 Revision A, B

Total
22
Hours
CIA: 15 Marks; Semester: 25 Marks

Software Essential : Turbo C

Text Book(s):
A. Balagurusamy. E; Programming in ANSI , Tata McGraw - Hill Publishing Company Limited,
New Delhi, , Third Edition, (2006).
B. Ashok N . Kamthane; Introduction to Data Structures using C, Pearson Education, (2007)
C. Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language, Prentice Hall
D. Yashavant Kanetkar, Pointers in C, BPB Publications
E. S. Sahni and E. Horowitz, “Data Structures”, Galgotia Publications
F. Tanenbaum: “Data Structures using C”, Pearson/PHI.
Websites:
1. https://www.sanfoundry.com/c-program-sum-all-digits-integer/
2. https://www.sanfoundry.com/c-program-factorial-using-recursion/
3. https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/
4. https://forgetcode.com/c/385-generating-n-prime-numbers
5. https://www.programiz.com/c-programming/examples/largest-number-three
6. https://www.programmingsimplified.com/c/program/addition-subtraction-
multiplication-and-division
Course Co-Ordinator:
1. K.Devika Rani Dhivya
2. R.Ramesh