0% found this document useful (0 votes)
5 views

22CS110_210 Scheme & Syllabus

The document outlines the scheme and syllabus for the 'Introduction to Programming' course offered by the Department of Computer Science and Engineering at JSS Science and Technology University starting from the academic year 2022-23. It details course objectives, outcomes, content structure, evaluation schemes, and recommended textbooks and resources. The course focuses on problem-solving using the C programming language, covering topics such as data types, operators, control structures, arrays, pointers, and user-defined functions.

Uploaded by

prashanthdev888
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

22CS110_210 Scheme & Syllabus

The document outlines the scheme and syllabus for the 'Introduction to Programming' course offered by the Department of Computer Science and Engineering at JSS Science and Technology University starting from the academic year 2022-23. It details course objectives, outcomes, content structure, evaluation schemes, and recommended textbooks and resources. The course focuses on problem-solving using the C programming language, covering topics such as data types, operators, control structures, arrays, pointers, and user-defined functions.

Uploaded by

prashanthdev888
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

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
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
SCHEME & SYLLABUS
First Semester
(From the Academic Year 2022-23)
Course
Introduction to Programming Course Type Lecture
Title

Course 22CS110/
Credits 03 Class Theory
Code 22CS210
Total Number
Contact
TLP Credits of Classes / Assessment in Weightage and Marks
Hours
Semester
Theory 03 39 Theory Practical CIE SEE
Course
Structure Practical - - 39 - Weightage 40% Weightage 60%

Tutorial - - Max. Marks 40 Marks Max. Marks 60 Marks

Total 03 39 Min. Marks 20 Marks Min. Marks 25 Marks

Course Overview:
This course is designed to offer fundamentals of problem-solving using „C‟ programming language
and to introduce standard programming practices. This course pay attention towards the algorithmic
solution to the problems.

Pre requisites: NIL

Course Objective:
Course should enable the students to:
1. Learn the basic principles and concepts of problem solving.
2. Apply the constructs of „C‟ programming language for problem solving.
3. Use „C‟ programming language to develop simple applications.
Course Outcome:
After completing this course, students should be able to:
Highest Level of
CO # Course Outcome
Cognitive Domain
CO1 Describe the concepts of problem solving with algorithmic
L2
approach and comprehend the basic constructs of „C‟ language.
CO2 Apply the knowledge of operators, expressions and I/O function
L3
for solving problems.
CO3 Use branching and looping statements in problem solving. L3
CO4 Solve problems using arrays and strings. L3
CO5 Apply the concepts of pointers, modular-programming approach
L3
and structures in developing programs.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 – Create

Course Articulation:
POs →

PO10

PO11

PO12
PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
COs ↓

CO1 3 3 - - - - - - - - - -

CO2 3 3 - - - - - - - - - -

CO3 3 3 3 - - - - - - - - -

CO4 3 3 3 - - - - - - - - -

CO5 3 3 3 - - - - - - - - -
High – 3, Medium – 2, Low – 1

Course Content / Syllabus:


UNIT No. Content Hours
UNIT 1 Introduction to Computing: Introduction, Components of a Computer, 08
Concepts of hardware and Software, Art of Programming through
Algorithms and Flowcharts.
Overview of C: History of C, Importance of C, Sample Programs, Basic
Structure of C Programs, Programming Style, Executing a C Program.
Constants, Variables and Data Types: Introduction, Character Sets, C
Tokens, Keywords and Identifiers, Constants, Variables, data Types,
Declaration of Variables, Declarations of Storage Class, Assigning values to
Variables, Defining Symbolic Constants.
UNIT 2 Operators and Expressions: Introduction, Arithmetic Operators, 07
Relational Operators, Logical Operators, Assignment Operators, Increment
and Decrement Operators, Conditional Operators, Bitwise Operators,
Special Operators, Arithmetic Expressions, Evaluation of Expressions,
Precedence of Arithmetic Operators, Some computation Problems, Type
Conversion in Expressions, Operators Precedence and Associativity.
Managing Input and Output Operations: Introduction, Reading a
Character, Writing a Character, Formatted Input, Formatted output.
UNIT 3 Decision Making and Branching: Introduction, Decision making with „if‟ 08
Statement, Simple „if‟ Statement, The „if…else‟ Statement, Nesting of
„if…else‟ Statements, The „else if‟ Ladder, The „switch‟ Statement, The ? :
Operator, the „goto‟ Statement.
Decision Making and Looping: Introduction, The „while‟ Statement, The
„do‟ Statement, The „for‟ Statement, Jumps in Loops.
UNIT 4 Arrays: Introduction, One-Dimensional Arrays, Declaration of One- 08
Dimensional Arrays, Initialization of One-Dimensional Arrays, Two-
Dimensional Arrays, Initialization of Two-Dimensional Arrays.
Character Arrays and Strings: Introduction, Declaring and Initializing
String Variable, Reading Strings from Terminal, Writing Strings to Screen,
Arithmetic Operations on Characters, Putting Strings Together, Comparison
of Two Strings, String-Handling Functions.
UNIT 5 Pointers: Introduction, Understanding Pointers, Accessing the Address of a 08
Variable, Declaring Pointer Variables, Accessing a Variable through its
Pointer.
User-Defined Functions: Introduction, Need for User-Defined Functions,
A Multi-Function Program, Elements of User-Defined Functions, Defining
Functions, Return Values and Their Types, Function Calls, Function
Declaration, Category of Functions, Nesting of Functions, Recursion,
Passing Arrays to Functions.
Structures: Introduction, Defining a Structure, Declaring Structure
variables, Accessing Structure Members, Structure Initialization, Copying
and comparing Structure Variables, Operations of Individual members,
Arrays of Structures, Arrays within Structures, Structure and Functions.

Text Books:
1. E. Balaguruswamy: “Programming with ANSI C”, 8th Edition, 2019, Tata McGraw Hill
Publications.

Reference 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”, 2nd Edition,
PHI, 2012.
3. Herbert Schildt: “C: The Complete Reference”, Paperback – 1, 4th Edition, July 2017.

Web/Digital resources:
1. https://nptel.ac.in/courses/106104128
2. https://nptel.ac.in/courses/106/105/106105171/
Evaluation Scheme:
Continuous Internal Evaluation – CIE
Event Event Type Marks Allotted Duration
CIE – 1 Written Test – 1 30 1 Hour
CIE – 2 Event 20 1 Hour
CIE – 3 Written Test – 2 30 1 Hour
Note:
1. The written test 1 & 2 (CIE – 1 & 3) both will be conducted for 30 marks each in 1hour
duration and the marks scored will be reduced proportionately to 15 marks each.
2. The Event (CIE – 2) will be conducted for 20 marks and the marks scored will be reduced
proportionately to 10 marks.
3. The Event (CIE – 2) will be skill-based assessment such as Seminars / Technical talks / Case
study / hands-on activity / Mini projects / Sci-tech activity / Data analysis.
4. A student must score on an average of 50% i.e., 20 marks out of 40 from all the events (CIE - 1,
2, 3) to gain the eligibility to appear for SEE.

Semester End Examination – SEE


Event Event Type Marks Allotted Duration
SEE Written Examination 100 3 Hours
Note:
1. The SEE will be conducted for 100 marks and the marks scored will be proportionately reduced
to 60 marks. A student must score a minimum of 25 marks out of 60 in the SEE to pass.
2. SEE Question paper will be set for 100 marks and will have two parts (Part-A & Part-B).
Questions under Part-A are compulsory and questions under Part-B will have internal choices.

You might also like