Course Syllabus

Tot. Tot.
Hrs /
Course NCrF Level Course Foundation L T P C Hrs / SL* Hrs /
Course Code Problem Solving using C (FC) Week
Name Category Course Sem Sem
5 3 0 0 3 3 45 45 90

Pre-requisite
Department Offering the Department of Computer Science and Special Requirements such as
Courses, if Nil Nil
Course (Owner) Engineering Data Book/Charts etc., If any
any

Learners are exposed to

• Impart foundational knowledge in programming and problem-solving strategies.
Course
• Enable students to write efficient, error-free programs using structured programming in C.
Learning
• Develop proficiency in handling arrays, strings, functions, pointers, and file operations.
Objectives:
• Strengthen students' ability to apply logical and analytical thinking to develop solutions.
• Prepare students to implement real-world problem solutions using C programming language.

Course Program Specific Outcomes

Program Outcomes (POs)
Outcomes At the end of this course, students will be able to: (PSOs)
(CO) 1 2 3 4 5 6 7 8 9 10 11 PSO-1 PSO-2 PSO-3
Demonstrate the fundamental concepts of computer system and programming logic
CO-1 3 2
for problem solving.
Analyze and develop logical solutions for well-defined problems using appropriate
CO-2 3
programming constructs.
CO-3 Design modular and reusable code for solving engineering problems. 3 2

Apply C programming to systematically investigate and analyze problems through

CO-4 3
logical experimentation and data handling.
Develop programming projects effectively with collaborative and communication
CO-5 2 2 2
skills.
Course Content
UNIT - 1 - INTRODUCTION TO COMPUTERS No. of Hours 9
Introduction of computer, Overview of operating systems, compilers, interpreters and programming languages, Number system, Memory, Variables, Values, Instructions, Programs, Problem Solving
Techniques- Programming Logic - Sequence, Selection and Repetition -Flow chart-Algorithm – Pseudocode – Debugging concepts. Use
Case: ATM Transaction Workflow Design
• Scenario: Designing the logic for ATM transactions such as withdrawal, balance inquiry, or PIN change.
• Application: Use of algorithms, flowcharts, pseudocode, and control logic (sequence, selection, repetition) to define step-by-step instructions that machine should follow.
UNIT - 2 - INTRODUCTION TO C No. of Hours 9
Basics of C: Character Set, Tokens- Identifiers, Keywords, Variables, Constants, Data types, Operators. Expressions, expression evaluation, Type conversion, operator precedence and associativity, C
program structure. Console I/O Operations: Formatted I/O - Unformatted I/O functions. Control Flow Statements: Branching Statements - if, if – else, switch. Looping statements- while, do –
while, for, nested loops. Unconditional Statements - break, continue, goto, exit.
Use Case: Student Grading System
• Scenario: Develop a student grading system where the program calculates final grades based on marks, assigns grades (A, B, C, D, F), and allows for multiple students to be graded.
• Application: Demonstrates use of variables, data types, expressions, console I/O, and control flow statements (if, switch, loops).

UNIT - 3 - ARRAYS STRINGS AND FUNCTIONS No. of Hours 9

Arrays: Array declaration, initialization and Accessing, Types of Arrays : 1-D, 2-D Arrays and dynamic array allocation Strings: String I/O, String Handling Functions. Functions: Introduction to
Functions, Types of Function, Function prototypes, parameter passing techniques-Call by Value, Call by reference, Scope of variables, Storage classes, Recursion, Arrays as Function Arguments. Use
Case: Building a Simple Student Management System
Scenario: Create a simple system to manage student information (such as student names, grades, and performance). The system allows users to:
• Add a student to the system.
• Display all student records.
• Calculate the average grade of the class.
• Search for a student by name.
• Use recursion to search the student database.
Application: Uses 1D/2D arrays for data storage, string functions for student names, and functions for modular code (e.g., calculate average, assign grade).

UNIT - 4 - STRUCTURES AND POINTERS No. of Hours 9

Structures: Type Definition (typedef), Structure: Definition and Initialization of Structures, Accessing Structures, Nested Structures, Arrays of Structures, Structures and Functions, Union.
Pointers: Pointer Declaration, Initialization and Accessing, Pointer Arithmetic, Accessing arrays through pointers, Pointers and strings, Pointers to Functions, Pointers to Structures, , Dynamic
memory allocation.
Use Case: Library Book Management System
Scenario: Maintaining details of books such as title, author, and availability using structures and accessing/modifying them using pointers.
Application: Structures to represent book records, arrays of structures for multiple books, and pointers for efficient data manipulation and dynamic memory use.

UNIT - 5 - FILE HANDLING AND GRAPHICS No. of Hours 9

File Management in C – Modes of File operations- Input / Output Operations on Files - Sequential and Random Access (Text and Binary files) - The ‘C’ Pre-processor- Macro Substitution - Command
Line Arguments, Introduction to C Graphics.
Use Case: Sales Record System with Report Generation
Scenario: Storing daily sales data in a file and retrieving it for generating reports or summaries.
Application: Use of file I/O (text/binary), command-line arguments for input files, and simple graphics to display sales charts or summaries visually.

Percentage of Syllabus Content covering GATE / Other Examinaations 75%

Percentage of Syllabus Content covering Industry Trends and skill Enhancemment 65%

1. E. Balagurusamy, - Computing Fundamentals and C Programming, 8th 6. Dr.E.Kannan, Prof.E.Kamalanaban, Dr.P.Visu, Dr.S.Koteeswaran- Computing
Edition Tata McGraw- Hill, 2019. Fundamentals & Programming in C‖, First Edition, CENGAGE Learning, 2015.
2. R.G.Dromey, How to Solve by Computer, Pearson Education, Inc, Reprint Online Resources:
2009. 1. https://www.learn-c.org/
Learning Resources
3. ReemaThareja, - Programming in C, Second Edition, Oxford University
(Reference and Text Books, 2. https://www.cprogramming.com/tutorial/c-tutorial.html
Press, 2016.
Online Courses etc.,)
 Learning Resources
(Reference and Text Books,
Online Courses etc.,)
4. YashavantKanetkar- Let Us C Solutions-12th Edition|| BPB 3. https://www.tutorialspoint.com/cprogramming/index.htm
Publication,2014 4. https://computer.howstuffworks.com/c1.htm
5. http://www.tutorialspoint.com/computer_fundamentals/
5. Byron Gottfried - Programming with C|| Schaum's Outline,2000
6. https://www.programiz.com/c-programming

Course Learning Assessment

Continuous Internal Assessment (CIA) (40)

Semester End Examinations (SEE) (50)
CIA 1 (20) CIA 2 (20)
BT Level
Theory Practical Theory Practical Theory Practical
K1 √ − √ − √ √ √ − − −
K2 √ − √ − − √ √ √ − − −
K3 √ − √ − − √ √ √ − − −
K4 − − − − − − − − − − −
K5 − − − − − − − − − − −
K6 − − − − − − − − − − −

*Details of Self Learning Components Opted for this course

S. No. Component Name # of Hrs. S. No. Component Name # of Hrs.

SLC-1 Bitwise Operators and Bit Manipulation 5 SLC-5 Function Pointers 6

SLC-2 Enumerated Types (enum) and application 4 SLC-6 Static vs Dynamic Memory Allocation (Comparison & Use Cases) 6

SLC-3 Working with Time and Date in C 6 SLC-7 Structures with Bit Fields 6

Create a tool to convert temperature, distance, or weight using switch-

SLC-4 6 SLC-8 Macros with Parameters and Conditional Compilation 6
case logic.

Course Syllabus Design Details

Internal Faculty Members Details Expert Faculty From Higher Educational Instutions Experts from Industries

1. Dr. Debasis Samanta

1. Dr. Arish
1 Dr. M. Kavitha Associate Professor
Senior Associate in Innovation Hub, PWC, Bangalore
Department of Computer Science and Engineering, IIT Kharagpur,
2. Dr.Sarma Venkataraman
(Retired as Group Director from ISRO/DoS inJune2020)
2. Dr. R. Suguna 2
Director, CRRao AIMSCS. University of Hyderabad Campus,
Gachibowli, T elangana.
3 Dr. Azath 3 3

Date of Creation Date of Revision Date of Approval of BoS 41st BoS - 26.04.2025

Signature

Faculty/BoS Coordinator Head of the Department Dean of the School

 Course Syllabus

Course NCrF Level Course

Course Code Data Structures
Name Category

Pre-requisite
Department Offering the
Courses, if Course Code & Name Department N
Course (Owner)
any

Course
Learning
Objectives:

Course
Outcomes At the end of this course, students will be able to:
(CO) 1
CO-1

CO-2

CO-3

CO-4

CO-5

Course Content
UNIT - 1 - Title

UNIT - 2 - Title

UNIT - 3 - Title
UNIT - 4 - Title

UNIT - 5 - Title

Percentage of S

Percentage of Syllabus Conte

Whe

Lab Experiments (30 Hrs.)

Lab 1: Implementation of Structures
Lab 2: Implementation of Structures using Pointers
Lab 3: Implementation of Matrix Multiplication – Dynamic Memory allocation
Lab 4: Array Implementation of List
Lab 5: Implementation of Linked List
Lab 6: Implementation of Doubly linked List
Lab 7: Implementation of Stack using array and Linked List
Lab 8: Implementation of Queue using array and Linked list

2
Learning Resources
(Reference and Text
3
Books, Online Courses
etc.,)
4
 (Reference and Text
Books, Online Courses
etc.,)

Course Learning Assessment

Continuous Internal Assessment (CIA) (40)

CIA 1 (20) CIA 2 (20)

BT Level
Theory Practical Theory Practical
K1
K2 50% Nil 50% Nil
K3
K4
K5
K6

*Details of Slef Learning Components Opted for this course

S. No. Component Name # of Hrs. S. No.

SLC-1 SLC-5

SLC-2 SLC-6

SLC-3 SLC-7

SLC-4 SLC-8

Course Syllabus Design Details

Internal Faculty Members Details Expert Faculty From Higher Educational Instut
1 1
2 2
3 3

Date of Creation Date of Revision

Signature

Faculty/BoS Coordinator Head of the Department

se Syllabus
Tot. Tot.
Mandatory Hrs /
Course L T P C Hrs / SL* Hrs /
MC Course (Non- Week
Category Sem Sem
Credit)
3 0 1 4 5 45+30 45 120

Special Requirements such as

Department Name
Data Book/Charts etc., If any

Program Specific Outcomes

Program Outcomes (POs)
(PSOs)
2 3 4 5 6 7 8 9 10 11 PSO-1 PSO-2 PSO-3

No. of Hours 9

No. of Hours 9

No. of Hours 9
 No. of Hours 9

No. of Hours 9

Percentage of Syllabus Content covering GATE / Other Examinaations

entage of Syllabus Content covering Industry Trends and skill Enhancemment

Whether the course Contains "Open Ended Experiments"?

Lab 9: Applications of Stack, Queue

Lab 10: Implementation of Tree using array
Lab 11: Implementation of BST using linked list
Lab 12: Implementation of B-Trees
Lab 13: Implementation of Graph using Array
Lab 14: Implementation of Shortest path Algorithm
Lab 15: Implementation of Minimal Spanning Tree

9
 10

arning Assessment

Semester End Examinations (SEE) (50)

0)

Practical Theory Practical

Nil 100% Nil

S. No. Component Name # of Hrs.

SLC-5

SLC-6

SLC-7

SLC-8

gher Educational Instutions Experts from Industries

1
2
3

Date of Approval of BoS

ead of the Department Dean of the School

 Course Syllabus

Course NCrF Level Course

Course Code Indian Constitution
Name Category

Pre-requisite
Department Offering the
Courses, if Course Code & Name Department N
Course (Owner)
any

Course
Learning
Objectives:

Course
Outcomes At the end of this course, students will be able to:
(CO) 1
CO-1

CO-2

CO-3

CO-4

CO-5

Course Content
UNIT - 1 - Title

UNIT - 2 - Title

UNIT - 3 - Title
UNIT - 4 - Title

UNIT - 5 - Title

Percentage of S

Percentage of Syllabus Conte

2
Learning Resources
(Reference and Text Books, 3
Online Courses etc.,)
4

Course Learning Assessment

Continuous Internal Assessment (CIA) (40)

CIA 1 (20) CIA 2 (20)

BT Level Theory Practical Theory Practical

*Details of Slef Learning Components Opted for this course

S. No. Component Name # of Hrs. S. No.

SLC-1 SLC-5

SLC-2 SLC-6

SLC-3 SLC-7

SLC-4 SLC-8

Course Syllabus Design Details

Internal Faculty Members Details Expert Faculty From Higher Educational Instut
1 1
2 2
3 3

Date of Creation Date of Revision

Signature

Faculty/BoS Coordinator Head of the Department

se Syllabus
Tot. Tot.
Mandatory Hrs /
Course L T P C Hrs / SL* Hrs /
MC Course - Non Week
Category Sem Sem
Credit
0 0 0 0 1 15 NA 15

Special Requirements such as

Department Name
Data Book/Charts etc., If any

Program Specific Outcomes

Program Outcomes (POs)
(PSOs)
2 3 4 5 6 7 8 9 10 11 PSO-1 PSO-2 PSO-3

No. of Hours

No. of Hours

No. of Hours
 No. of Hours

No. of Hours

Percentage of Syllabus Content covering GATE / Other Examinaations

entage of Syllabus Content covering Industry Trends and skill Enhancemment

10

arning Assessment

Semester End Examinations (SEE) (50)

0)

Practical Theory Practical

 S. No. Component Name # of Hrs.

SLC-5

SLC-6

SLC-7

SLC-8

gher Educational Instutions Experts from Industries

1
2
3

Date of Approval of BoS

ead of the Department Dean of the School

 Course Syllabus

Course NCrF Level Course

Course Code Data Structures
Name Category

Pre-
requisite Department Offering the
Course Code & Name Department N
Courses, if Course (Owner)
any

Course
Learning
Objectives:

Course
Outcomes At the end of this course, students will be able to:
(CO) 1
CO-1

CO-2

CO-3

CO-4

CO-5

Course Content
Lab Experiments (30 Hrs.)
Lab 1: Implementation of Structures
Lab 2: Implementation of Structures using Pointers
Lab 3: Implementation of Matrix Multiplication – Dynamic Memory allocation
Lab 4: Array Implementation of List
Lab 5: Implementation of Linked List
Lab 6: Implementation of Doubly linked List
Lab 7: Implementation of Stack using array and Linked List
Lab 8: Implementation of Queue using array and Linked list
Percentage of S

Percentage of Syllabus Conte

Whe
 1

2
Learning Resources
(Reference and Text
3
Books, Online Courses
etc.,)
4

Course Learning Assessment

Continuous Internal Assessment (CIA) (40)

CIA 1 (20) CIA 2 (20)

BT Level
Theory Practical Theory Practical
K1
K2 NA NA
K3
K4
K5
K6

*Details of Slef Learning Components Opted for this course

S. No. Component Name # of Hrs. S. No.

Design flowcharts and write pseudocode for tasks like Online Food
SLC-1 SLC-5
Ordering or Bus Ticket Booking.

Design an algorithm to check whether a given number (e.g., 121, 1331)

SLC-2 SLC-6
is a palindrome.

Write a C program to simulate traffic light behavior using loops and

SLC-3 SLC-7
conditions.
Create a tool to convert temperature, distance, or weight using switch-
SLC-4 SLC-8
case logic.

Course Syllabus Design Details

Internal Faculty Members Details Expert Faculty From Higher Educational Instut
1 1
2 2
3 3

Date of Creation Date of Revision

Signature

Faculty/BoS Coordinator Head of the Department

se Syllabus
Tot. Tot.
Mandatory Hrs /
Course L T P C Hrs / SL* Hrs /
MC Course (Non- Week
Category Sem Sem
Credit)
0 0 2 2 4 60 NA 60

Special Requirements such

Department Name as Data Book/Charts etc., If
any

Program Specific Outcomes

Program Outcomes (POs)
(PSOs)
2 3 4 5 6 7 8 9 10 11 PSO-1 PSO-2 PSO-3

Lab 9: Applications of Stack, Queue

Lab 10: Implementation of Tree using array
Lab 11: Implementation of BST using linked list
Lab 12: Implementation of B-Trees
Lab 13: Implementation of Graph using Array
Lab 14: Implementation of Shortest path Algorithm
Lab 15: Implementation of Minimal Spanning Tree

Percentage of Syllabus Content covering GATE / Other Examinaations

entage of Syllabus Content covering Industry Trends and skill Enhancemment

Whether the course Contains "Open Ended Experiments"?

 6

10

arning Assessment

Semester End Examinations (SEE) (50)

0)

Practical Theory Practical

100% Nil

S. No. Component Name # of Hrs.

Write a C program to count the frequency of each unique
SLC-5 element in a given array. Example: Input: {1, 2, 2, 3, 1, 4} →
Output: 1:2, 2:2, 3:1, 4:1
Write a C Program to check whether two strings are anagrams of
SLC-6 each other.
Example: "listen" and "silent" → Anagrams

Create a program that logs and retrieves personal expenses using

SLC-7
file operations.
Create simple animations (e.g., moving car or bouncing ball)
SLC-8
using loops and graphics.

gher Educational Instutions Experts from Industries

1
2
 3

Date of Approval of BoS

ead of the Department Dean of the School

 Course Syllabus

Course NCrF Level Course

Course Code Data Structures
Name Category

Pre-
requisite Department Offering the
Course Code & Name Department N
Courses, if Course (Owner)
any

Course
Learning
Objectives:

Course
Outcomes At the end of this course, students will be able to:
(CO) 1
CO-1

CO-2

CO-3

CO-4

CO-5

Course Content
UNIT - 1 - Title

UNIT - 2 - Title

UNIT - 3 - Title
UNIT - 4 - Title

UNIT - 5 - Title

Lab Experiments (30 Hrs.)

Lab 1: Implementation of Structures
Lab 2: Implementation of Structures using Pointers
Lab 3: Implementation of Matrix Multiplication – Dynamic Memory allocation
Lab 4: Array Implementation of List
Lab 5: Implementation of Linked List
Lab 6: Implementation of Doubly linked List
Lab 7: Implementation of Stack using array and Linked List
Lab 8: Implementation of Queue using array and Linked list
Percentage of S

Percentage of Syllabus Conte

Wh

2
Learning Resources
(Reference and Text
3
Books, Online Courses
etc.,)
4

5
 Course Learning Assessment

Continuous Internal Assessment (CIA) (40)

CIA 1 (20) CIA 2 (20)

BT Level
Theory Practical Theory Practical
K1
K2 NA NA
K3
K4
K5
K6

*Details of Slef Learning Components Opted for this course

S. No. Component Name # of Hrs. S. No.

SLC-1 SLC-5

SLC-2 SLC-6

SLC-3 SLC-7

SLC-4 SLC-8

Course Syllabus Design Details

Internal Faculty Members Details Expert Faculty From Higher Educational Instut
1 1
2 2
3 3

Date of Creation Date of Revision

Signature

Faculty/BoS Coordinator Head of the Department

se Syllabus
Tot. Tot.
Mandatory Hrs /
Course L T P C Hrs / SL* Hrs /
MC Course (Non- Week
Category Sem Sem
Credit)
1 0 2 3 5 15+60 15 90

Special Requirements such

Department Name as Data Book/Charts etc., If
any

Program Specific Outcomes

Program Outcomes (POs)
(PSOs)
2 3 4 5 6 7 8 9 10 11 PSO-1 PSO-2 PSO-3

No. of Hours 9

No. of Hours 9

No. of Hours 9
 No. of Hours 9

No. of Hours 9

Lab 9: Applications of Stack, Queue

Lab 10: Implementation of Tree using array
Lab 11: Implementation of BST using linked list
Lab 12: Implementation of B-Trees
Lab 13: Implementation of Graph using Array
Lab 14: Implementation of Shortest path Algorithm
Lab 15: Implementation of Minimal Spanning Tree

Percentage of Syllabus Content covering GATE / Other Examinaations

entage of Syllabus Content covering Industry Trends and skill Enhancemment

Whether the course contain "Open Ended Experiments"?

10
arning Assessment

Semester End Examinations (SEE) (50)

0)

Practical Theory Practical

100% Nil

S. No. Component Name # of Hrs.

SLC-5

SLC-6

SLC-7

SLC-8

gher Educational Instutions Experts from Industries

1
2
3

Date of Approval of BoS

ead of the Department Dean of the School