DEPARTMENT OF CSE

SUBJECT: CP YEAR: I-I AY:2024-25

KLU VIT SRM

Only 30 percentage of CP is not part of their syllabus 1.C Pre-processor and header files
syllabus got matched 2. event and counter controlled loops
3. dangling memory
4. nested structures, arrays of structures,
structures and functions,
pointers to structures, self-referential
DEVIATED TOPICS structures

PERCENTAGE
10%
OF DEVIATION 70%
 KLU CP SYLLABUS

Problem solving through programming Credits: 3.0:2

Aim: The course is to make the students learn problem solving by writing algorithms, flowcharts and
coding them in C language. The course helps the students to write programs for solve Mathematical
and Engineering problems. The course also helps the students to prepare for placement tests and face
interviews for software jobs.

Program Outcome (Washington Accord) addressed:

1. Apply knowledge of mathematics, science, engineering fundamentals and an engineering specialization to the
conceptualization of engineering models.

2. Identify, formulate, research literature and solve complex engineering problems reaching substantiated conclusions
using first principles of mathematics and engineering sciences.

4. Conduct investigations of complex problems including design of experiments, analysis and interpretation of data, and
synthesis of information to provide valid conclusions.

5. Create, select and apply appropriate techniques, resources, and modern engineering tools, including prediction and

modeling, to complex engineering activities, with an understanding of the limitations

6. Function effectively as an individual, and as a member or leader in diverse teams and in multi- disciplinary settings.

12. Recognize the need for, and have the ability to engage in independent and life-long learning.

Competencies: At the end of the course the student should be able to

C1 Student must remember the syntax of different I/O functions ,format specifications , different data
types and their usage

C 2 Remember different types of operators precedence & associability. Apply them to write arithmetic
relational, logical, increment, decrement , assignment, & conditional expressions which are required in
writing programs.

C3 Student must remember the syntax of Control Structures (if-else, while, do – while, for, switch,
Continue , goto).Must understand their usage and write programs based on selection &
repetition of blocks of statements.

C4 Student must understand the allocation of memory for Arrays (I & II dimensional) and storing data.
Student must use these to write programs for sorting ,searching matrix operations and string
manipulations

C5 Student must learn the structure of C function and different forms . Student must be able to write multi
function program based on pass by value pass by reference concepts .Also learn how to pass arrays to
functions through arguments.

C6 Student must be able to define structure data types and use them in simple data processing applications Also
he must be able to use the concept of array of structures .
C7 Student must understand the concept of pointers , declarations , initialization operations on pointers and
their usage and advantage in handling I &II dimensional arrays and strings.
 C 8 Student must be able to apply malloc, calloc, realloc and free functions for Dynamic Memory
allocation. Also, he must be able to know the advantage of this over static memory allocation

C9 Student must be able to learn opening of data files and learn input/ output file data input /output. Also he
must learn to write programs for reading, writing and appending data to sequential data Files

Syllabus:
Character set, Integers, Floating point, Boolean, Pointer data types, Declaration, Introduction to
Formatted input and output.Assignment, Arithmetic operators, Implicit type conversions, Precedence
and associatively of operators, Relational, Logical, Compound assignment, Increment and
Decrement, Cast and conditional operators.

Flow charts for Algorithm Development, simple and compound statements, Null and Expression
statements, Selection statements, Repetition statements, Jump statements.

Function Definition, Function prototypes, calling functions, Standard C Header files and libraries,
Mathematical functions, Recursive functions, Global and local variables, Storage classes. Formatting
output for functions in the printf() family, Formatting input for functions in the scanf() family.

Character Code, Character input and output, character handling functions, Stings, string input and
output, The continuation character, string manipulation-length, copy, append, compare. Structures,
Enumerations, unions.

Declaration of Arrays, Processing Data in Arrays, Passing Arrays to Functions, Introduction to

Vectors and Matrices.Pointer variables, pointer Arithmetic, calling functions by Reference using
pointers, Relation between pointers and arrays, using pointers to pass One-Dimensional arrays to
functions, Dynamic Allocation of Memory, Functions Returning pointers, Array of pointers.

Opening and closing files, reading and writing sequential files.

Text Book:
1. C for Engineers and Scientists – An Intepretive Approach by Harry H.Cheng, Mc Graw. Hill International Edition
2010.
2. Programming in ANSI C – E.Balaguruswamy TMH

Reference Books:
1. Computer science, A structured programming approach using C, B.A. Forouzan and R.F.Gilberg, Third edition,
Thomson.
2. C Programming with problem solving-J.A.Jones and K.Harrow, Dreamtech Press.
3. The C Programming Language- B.W.Kernighan, Dennis M.Ritchie, PHI/Pearson Education.
4. Programming in C Kochan 3rd Edition Pearson Education.
SRM University AP, Andhra Pradesh
Neerukonda, Mangalagiri Mandal,
Guntur District, Mangalagiri, Andhra Pradesh – 522240.

Introduction to Computer Science and Programming Using C

L T P C
Course Code CSC 108 Course Category CC
3 0 0 3
Pre-Requisite Progressive
Co-Requisite Course(s) CSE 108L
Course(s) Course(s)
Course Offering Professional / Licensing
CSE
Department Standards

Course Objectives / Course Learning Rationales (CLRs)

1. Gain basic knowledge in C programminglanguage.

2. Acquire knowledge on Decision making and functions in C.
3. Learn arrays, strings and pointers concept in C.
4. Understand the basics concepts of Structures, Union and File handling techniques using C Programming.

Course Unitization Plan

Required CLOs
Unit No. Unit Name References Used
Contact Hours Addressed
UNIT I INTRODUCTION TO COMPUTER SCIENCE 9 1 1
Fundamentals of Computing, Historical perspective, Early
2 1 1,2
computers
Computing machine. Basic organization of a computer:
ALU, input-output units, memory, program counter - 2 1 1,2
variables and
addresses - instructions: store, arithmetic, input and output
Problem solving: Algorithm / Pseudo code, flowchart,
2 1 1,2
program development steps
Computer languages: Machine, symbolic and high-level
1 1 1,2
langua Level languages
Creating and Running Programs: Writing, editing (any
1 1 1,2
editor), compiling (gcc)
linking, and executing in Linux environment 1 1 1,2
UNIT II C PROGRAMMING BASICS 9
Structure of a C program, identifiers Basic data types and sizes.
1 1 1,2
Constants, Variables
Arithmetic, relational and logical operators, increment
1 1 1,2
and decrement operator’s
Conditional operator, assignment operator, expressions Type
1 1 1,2
Conversion
Conditional Expressions Precedence and order of evaluation, Sam
1 1 1,2
Programs.
SELECTION & DECISION MAKING: if-else, null else, nested i
2 1 1,2
y selection: switch, else-if, examples.
ITERATION: Loops - while, do-while and for, break, continue, 1 1 1,2
initialization and updating, event and counter controlled loops and
2 1,2 1,2
examples.
UNIT III FUNCTIONS AND ARRAYS 10
 User defined functions, standard library functions 1 2,3 1,2
Passing 1-D arrays, 2-D arrays to functions. 1 2,3 1,2
Recursive functions - Recursive solutions for Fibonacci series,
2 2,3 1,2
towers of Hanoi.
C Pre-processor and header files 1 2,3 1,2
Concepts, declaration, definition, storing and accessing elements 1 2,3 1,2
one dimensional, two dimensional and multidimensional arrays 2 2,3 1,2
array operations and examples, Character arrays and string
2 2,3 1,2
manipulations
UNIT IV POINTERS 10
Concepts, initialization of pointer variables 1 3,4 1,2
pointers as function arguments, passing by address, dangling
2 3,4 1,2
memory, address arithmetic
character pointers and functions, pointers to pointers 2 3,4 1,2
pointers and multi-dimensional arrays, dynamic memory
2 3,4 1,2
management functions
command line arguments 1 3,4 1,2
UNIT V ENUMERATED, STRUCTURE AND UNION TYPES 9
Structures - Declaration, definition, and initialization of
2 5 2, 3, 4
structures, accessing structures
nested structures, arrays of structures, structures and functions,
2 5 2, 3, 4
pointers to structures,
self-referential structures. Unions, typedef, bit-fields, program
2 5 2, 3, 4
applications
Bit-wise operators: logical, shift, rotation, masks.
1 5 2, 3, 4
FILE HANDLING: Concept of a file, text files and binary files,
2 5 2, 3, 4
formatted I/O, file I/O operations and example programs.
Total Hours 47
 L T P C
I Year –I Semester INTRODUCTION TO PROGRAMMING
3 0 0 3
(Common to All Branches of Engineering)
Introduction to Programming REGULATION : M23

Course Objectives:
 To introduce students to the fundamentals of computer programming.
 To provide hands-on experience with coding and debugging.
 To foster logical thinking and problem-solving skills using programming.
 To familiarize students with programming concepts such as data types, control
structures, functions, and arrays.
 To encourage collaborative learning and teamwork in coding projects.
Course Outcomes: A student after completion of the course will be able to
CO1: Understand basics of computers, the concept of algorithm and algorithmic thinking.
CO2: Analyse a problem and develop an algorithm to solve it.

CO3: Implement various algorithms using the C programming language.

CO4: Understand more advanced features of C language.

CO5: Develop problem-solving skills and the ability to debug and optimize the code.

UNIT I :Introduction to Programming and Problem Solving

History of Computers, Basic organization of a computer: ALU, input-output units,
memory, program counter, Introduction to Programming Languages, Basics of a Computer
Program- Algorithms, flowcharts (Using Dia Tool), pseudo code. Introduction to Compilation
and Execution, Primitive Data Types, Variables, and Constants, Basic Input and Output,
Operations, Type Conversion, and Casting.

Problem solving techniques: Algorithmic approach, characteristics of algorithm, Problem

solving strategies: Top-down approach, Bottom-up approach, Time and space complexities of
algorithms.

UNIT II :Control Structures

Simple sequential programs Conditional Statements (if, if-else, switch), Loops (for, while, do-
while) Break and Continue.

UNIT III :Arrays and Strings

Arrays indexing, memory model, programs with array of integers, two dimensional arrays,
Introduction to Strings.
UNIT – IV :Pointers & User Defined Data types
Pointers, dereferencing and address operators, pointer and address arithmetic, array
manipulation using pointers, User-defined data types-Structures and Unions.

UNIT - V :Functions & File Handling

Introduction to Functions, Function Declaration and Definition, Function call Return Types and
Arguments, modifying parameters inside functions using pointers, arrays as parameters. Scope
and Lifetime of Variables, Basics of File Handling

Note: The syllabus is designed with C Language as the fundamental language of

implementation.

Textbooks:
1. "The C Programming Language", Brian W. Kernighan and Dennis M. Ritchie,
Prentice- Hall, 1988
2. Schaum’s Outline of Programming with C, Byron S Gottfried, McGraw-Hill Education,
1996
Reference Books:
1. Computing fundamentals and C Programming, Balagurusamy, E., McGraw-HillEducation, 2008.
2. Programming in C, Rema Theraja, Oxford, 2016, 2nd edition
3. C Programming, A Problem Solving Approach, Forouzan, Gilberg, Prasad,CENGAGE,
3rd edition