20CS110 - 20CS210 - Introduction To Programming Syllabus For 2020-2021 Batch - 27012021
20CS110 - 20CS210 - Introduction To Programming Syllabus For 2020-2021 Batch - 27012021
Course Details:
Academic Year 2020-2021
Semester I / II
Teaching Department Computer Science and Engineering / Information Science and Engineering
Course Scheme:
Subject Code: 20CS110/20CS210 CIE: 50 Marks
Credits (L:T:P): 3:0:0 SEE: 50 Marks
Theory: 03 Hrs.
Hours / Week: Total Hours: 40 Hrs.
Tutorial: NIL
Pre-requisite: NIL
COURSE OBJECTIVES
Students are exposed to:
1. Learn the basic principles and concepts of problem solving.
2. Apply the constructs of C programming language for problems.
3. Acquire design factors and implement simple application programs.
COURSE OUTCOMES
After completing this course, students should be able to:
CO1: Define the basic concepts of problem solving and C programming constructs. Reproduce
algorithmic solutions to problems.
CO2: Illustrate the suitable constructs of C Programming language to solve problems.
CO3: Develop applications using Arrays, Strings, Functions, Pointers and Structures.
SYLLABUS:
Unit No. of
Course Content
No. Hours
1. Problem Solving Concepts: 08
Introduction to Algorithms and Flowcharts, Exchanging the values of Two
Variables, Counting, Summation of a Set of Numbers, Factorial Computation,
Sine Function Computation, Generation of the Fibonacci Sequence.
Overview of C:
Basic structure of a C program, executing a C Program, Character Set, C Tokens,
Keywords and Identifiers, Constants, Variables, data types, Declaration of
variables, Assigning values to variables, Defining Symbolic Constants,
Formatted Input and Formatted Output.
2. Operators: 06
Introduction, Arithmetic Operators, Relational Operators, Logical Operators,
Assignment Operators, Increment and Decrement Operators, Conditional
Operator, Bitwise Operators, Conditional Operator, Special Operators: Comma
and ‘sizeof’ operator.
Expressions:
Arithmetic Expressions, Evaluation of Expressions, Precedence of Arithmetic
Operators, Type Conversions in Expressions, Operator Precedence and
Associativity.
3. Control statements: 08
Introduction, Decision Making with IF Statement, Simple IF Statement, the
IF...ELSE Statement, Nesting of IF Statements, The ELSE…IF Ladder, The
Switch statement, Use of ‘goto’ statement.
Loops:
The WHILE Statement, The DO – While Statement, the FOR Statement, Nesting
of Loops, Jumps in Loops: break & continue statement. exit statement.
JSS MAHAVIDHYAPEETHA
JSS SCIENCE AND TECHNOLOGY UNIVERSITY
SRI JAYACHAMARAJENDRA COLLEGE OF ENGINEERING
Constituent College of JSS Science and Technology University
Approved by A.I.C.T.E
Governed by the Grant-in-Aid Rules of Government of Karnataka
Identified as lead Institution for World Bank Assistance under TEQIP Scheme
4. Arrays: 08
One-dimensional Arrays, Declaration of One-dimensional Arrays, Initialization
of One-dimensional Arrays, Example programs- Linear search, Binary search,
Bubble sort.
Two-dimensional Arrays, Declaration of Two-dimensional Arrays, Initialization
of Two-dimensional Arrays, Example programs – Matrix addition, Transpose of
a matrix.
Strings:
Declaring and Initializing String Variables, String-handling Functions - strlen(),
strcpy(), strcmp(), strcat(), strrev() with examples.
5. Pointers: 10
Introduction, Declaration and Initialization of Pointer variables, accessing a
variable through its Pointer.
Structures:
Structure definition and declaration, Operations on individual members.
User Defined Functions:
Elements of User-defined Functions - Function Declaration, Definition of
Functions, Function Calls. Return Values and their Types. Category of Functions.
Passing Arrays and Structures to Functions, Parameter passing - Pass by Value
and Pass by Reference. Recursive functions.
Text Books:
1. R. G Dromey: “How to solve it by Computer”, Pearson Education India 2015.
2. Brian W. Kernighan and Dennis M. Ritchie: “The C Programming Language”, 2 nd Edition, PHI,
2012.
3. E. Balaguruswamy: “Programming with ANSI C”, 8th Edition, 2019, Tata McGraw Hill
Publications.
Reference Books:
1. Jacqueline Jones & Keith Harrow: “Problem Solving with C”, 1st Edition, Pearson 2011.
2. Herbert Schildt: “C: The Complete Reference”, Paperback – 1, 4th Edition, July 2017.
Web Resources:
https://onlinecourses.nptel.ac.in/noc19_cs42/preview
https://onlinecourses.nptel.ac.in/noc19_cs43/preview
https://nptel.ac.in/courses/106/105/106105171/#
Also visit NPTEL website (http://nptel.ac.in) for additional information on the course.
JSS MAHAVIDHYAPEETHA
JSS SCIENCE AND TECHNOLOGY UNIVERSITY
SRI JAYACHAMARAJENDRA COLLEGE OF ENGINEERING
Constituent College of JSS Science and Technology University
Approved by A.I.C.T.E
Governed by the Grant-in-Aid Rules of Government of Karnataka
Identified as lead Institution for World Bank Assistance under TEQIP Scheme
Evaluation Scheme:
Continuous Internal Evaluation
Event Type Marks Hours
allotted
CIE -1 Written test -1 20 01 Hr.
CIE -2 Event -1 (Assignments / Seminars / Mini 20 One/Two
week
Project / MCQs / Viva)
duration/01 Hr.
CIE -3 Written test -2 20 01 Hr.
CIE -4 Event -2 (Assignments / Seminars / Mini 20 One/Two
week
Project / MCQs / Viva)
duration/01 Hr.
CIE -5 Written test -3 20 01 Hr.