COURSE OVERVIEW:
The course is a
Basic Engineering course for all computation aspiring students. It is designed
to provide a comprehensive study of the C programming language that covers the
fundamental principles of computer programming, with an emphasis on problem
solving strategies using structured programming techniques. The syntax and
constructs of data types, control statements, arrays, functions and pointers
are elaborated. The derived data types like structures are discussed. It
stresses the strengths of C, which provide students with the means of writing efficient,
maintainable and reusable code to solve mathematical, engineering and simple
data processing problems.
II. COURSE
PRE-REQUISITES:
|
Level
|
Prerequisites
|
|
UG
|
Nil
|
III. DELIVERY /
INSTRUCTIONAL METHODOLOGIES:
|
Ö
|
CHALK
& TALK
|
Ö
|
QUIZ
|
Ö
|
ASSIGNMENTS
|
X
|
MOOCs
|
|
|
Ö
|
PPT
|
Ö
|
SEMINARS
|
X
|
MINI
PROJECT
|
X
|
VIDEOS
|
|
|
X
|
OPEN
ENDED EXPERIMENTS
|
Ö
|
ACTIVE
LEARNING STRATEGIES
|
|||||
IV. ASSESSMENT
METHODOLOGIES – DIRECT:
|
Ö
|
MID
EXAMS
|
Ö
|
END
SEMESTER EXAMS
|
Ö
|
ASSIGNEMNTS
|
X
|
SEMINARS
|
|
X
|
LABORATORY
PRACTICES
|
Ö
|
INVOLVEMENT
IN CLASSROOM ACTIVITY
|
X
|
OBJECTIVE
TEST
|
X
|
CERTIFICATION
(MOOCs/NPTEL)
|
|
X
|
COURSE
PROJECT (SINGLE/TEAM)
|
||||||
V. ASSESSMENT
METHODOLOGIES – INDIRECT:
|
Ö
|
COURSE
END SURVEY
|
X
|
EXAMINER
SURVEY
|
|
Ö
|
COURSE
INSTRUCTOR SURVEY
|
X
|
EXIT
INTERVIEW
|
VI. COURSE
OUTCOMES:
CO1. Select
right identifiers, data types and operators for effective computation.
CO2.Write programs using control
statements.
CO3. Write
programs demonstrating use of arrays, strings and their applications.
CO4. Demonstrate
the applications of function and recursion.
CO5.Write programs for
simple real life problems using pointers and
structures.
.
VII. Mapping Course Outcomes with Blooms Level of
Taxonomy
|
COs
|
Blooms Level (BL)
|
|||||
|
Remembering
(L1)
|
Understanding
(L2)
|
Applying
(L3)
|
Analyzing
(L4)
|
Evaluating
(L5)
|
Creating
(L6)
|
|
|
CO1
|
✔
|
✔
|
✔
|
|
|
|
|
CO2
|
✔
|
✔
|
✔
|
|
|
|
|
CO3
|
✔
|
✔
|
✔
|
|
|
|
|
CO4
|
✔
|
✔
|
✔
|
|
|
|
|
CO5
|
✔
|
✔
|
✔
|
|
|
|
VIII. Course Articulation Matrix: Mapping of
Course outcomes (COs) with Program outcomes (POs)
|
|
PO
1
|
PO
2
|
PO
3
|
PO
4
|
PO
5
|
PO
6
|
PO
7
|
PO
8
|
PO
9
|
PO
10
|
PO
11
|
PO
12
|
PSO
1
|
PSO
2
|
|
CO1
|
3
|
2
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CO2
|
|
3
|
|
|
|
|
|
|
|
|
|
|
|
|
|
CO3
|
|
|
3
|
|
2
|
|
|
|
|
|
|
|
|
|
|
CO4
|
|
|
3
|
|
2
|
|
|
|
|
|
|
|
|
|
|
CO5
|
|
|
3
|
|
2
|
|
|
|
|
|
|
|
|
|
Note:
Enter correlation levels 1, 2 or 3 as defined below:
1: Slight (Low) 2:
Moderate (Medium) 3:Substantial
(High)
IX. COURSE CONTENT
Course
Content:
|
|||
|
Unit - I
|
INTRODUCTION TO PROGRAMMING
|
Lecture Hours:
|
8Hrs
|
|
Introduction to components of
Computer Systems. Steps to solve logical and numerical problems.
Representation of Algorithm, Flowchart and Pseudo code with examples program
structure, identifiers, data types, Formatting input/output, Syntax and
Logical Errors in compilation, object and executable code.
|
|||
|
Unit – II
|
OPERATORS, EXPRESSIONS and DECISION MAKING AND
LOOPING
|
Lecture Hours:
|
10Hrs
|
|
Arithmetic,
Logical, Relational, Conditional, Assignment, Increment and Decrement
operators. Arithmetic Expressions,
Operator precedence and Associativity.
Writing and
evaluation of decision making, branching and looping.
|
|||
|
Unit – III
|
ARRAYS
|
Lecture Hours:
|
10Hrs
|
|
Definition, Types of Arrays, declaration and Initialization of
n-Dimensional Arrays and Character array, String manipulation. Linear
search, Bubble sort and Selection sort.
|
|||
|
Unit – IV
|
Functions
|
Lecture Hours:
|
9Hrs
|
|
Functions,
Parameter passing in functions through call by value, passing arrays to
functions, storage classes. Recursion
as a different way of solving problems. Example programs, such as finding
factorial, Fibonacci series.
|
|||
|
Unit - V
|
Pointers and Structures
|
Lecture Hours:
|
8Hrs
|
|
Definition,
Declaration, Pointer arithmetic, Pointer to Pointer, Pointer to an array
(base pointer), Dynamic memory allocation, Command Line arguments, idea of
call by reference in functions.
Defining, Declaring and initialization of structures, nested
structures, Array of Structures.
|
|||
|
Text Books:
|
|
|
1
|
B. A. Fouruzan and
R. F. Gilberg, C Programming & Data Structures, 3rd Edition, CENGAGE,
Learning, India, 2014.
|
|
Reference Books:
|
|
|
1
|
Brian W.
Kernighan and Dennis M. Ritchie, The C
Programming Language, 2nd Edition, Prentice Hall of India, 2015.
|
|
2
|
E.
Balagurusamy, Programming in ANSI C,
7th Edition Tata McGraw-Hill,
2017.
|
No comments:
Post a Comment