Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
75 views

C Programming Theory Syllabus - 2021-22

This document outlines a course on C programming for problem solving. The course is worth 3 credits and includes 3 hours of lectures and 0 hours of tutorials per week. It aims to teach students how to write algorithms, use repetitive methods, and create modular programs to solve problems. The course outcomes include illustrating problem-solving techniques, implementing sorting and searching arrays, and utilizing pointers and functions. The course content is divided into 5 modules covering topics like operators, branching, arrays, functions, structures, and pointers. Students will also complete self-study components on constants, header files, strings, and structures. The course uses 4 textbooks and reference books for further learning.

Uploaded by

60 - R - OP Choudhary
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

C Programming Theory Syllabus - 2021-22

This document outlines a course on C programming for problem solving. The course is worth 3 credits and includes 3 hours of lectures and 0 hours of tutorials per week. It aims to teach students how to write algorithms, use repetitive methods, and create modular programs to solve problems. The course outcomes include illustrating problem-solving techniques, implementing sorting and searching arrays, and utilizing pointers and functions. The course content is divided into 5 modules covering topics like operators, branching, arrays, functions, structures, and pointers. Students will also complete self-study components on constants, header files, strings, and structures. The course uses 4 textbooks and reference books for further learning.

Uploaded by

60 - R - OP Choudhary
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

C PROGRAMMING FOR PROBLEM SOLVING (Theory)

Course Code: 21CS103/21CS203 Credits: 03


L: P: T: S: 3: 0:0:0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50

Course Objectives:
1. Understand how to write an algorithm to solve a givenproblems.
2. Understand to how to use repetitive methods to solve the givenproblems.
3. Understand how to create modular programmingapproach.
4. Understand the data representation in memory and its data accessmethods.

Course Outcomes: After completion of the course, the graduates will be able to

CO1 Illustrate the problem-solving techniques using algorithm and flowcharts.

CO2 Demonstrate the solving of scientific problems using operators.

CO3 Analyze and implement programs to solve problems using decision making techniques.

CO4 Implement sorting and searching techniques using arrays and functions.
Construct new derived data types and create modular programs to solve complex and
CO5
repetitive tasks.
CO6 Effective Utilization of pointers & preprocessor directives

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 - - - - - - - - - - 1
CO2 3 - - - 1 - - - - - - 1
CO3 3 2 - - - - - - - - - 1
CO4 3 2 - - 1 - - - - - - -
CO5 3 3 2 - 1 - - - - - - 1
CO6 3 2 - - - - - - - - - -
Module Course Content Hours COs

Introduction to Computer Hardware and Software: Computer types,


CPU, Primary and Secondary Memory, Input & Output Devices, Software
1 types. 08 CO
1
Introduction to C Language&Problem-Solving Methodology: CO
Introduction to C language, Algorithm & Flowchart, Structure of C 2
program, C Tokens and Data types. Formatted & Unformatted Input &
Outputstatements.

Operators and Expression: Types of Operators, Type Casting, Precedence


2 and Associativity, Evaluation ofExpression. 08
CO3

Branching and Looping: Two-way selection: if, if-else, nested if-else,


Switch statement, goto statement, Loops: for, while-do, do-while, break
andcontinue.

Arrays: Introduction, Declaration & Initialization of 1D array, Bubble sort,


Linear & Binary search, reading and printing of 2 D array, Programs on
3 Matrix operations: addition, subtraction, multiplication, transpose, Norm. 08
CO4
Strings: Declaration & Initialization of String, Various Handling functions,
programs with and without using string handling functions.

Functions: Introduction to functions, function prototype, Types of


4 Functions, Function Definition, Function Call, Function Declaration,
Categories of Functions, Actual & Formal parameters, call by value & call 08 CO4
by reference. CO5

Recursion: Definition, general functioning of recursive functions, programs


using recursive functions: Fibonacci series, factorial of given number.

Structures: Introduction to Structures, declaration and Initialization of CO5


5 structures, accessing members of structure, Array of structure 08 CO6

Pointers: Introduction to Pointers, Declaration of pointers, Initialization of


pointer, pointer arithmetic, Pointer to an array.
Self-study component
Note: Questions for CIE and SEE not to be set from self-study component.
UNIT 1: Study of Escape sequences, Types of Constants and theirworking.
UNIT 2: Explore the header files: math.h, stdio.h, conio.h,stdlib.h.
UNIT 3: Search a sub string from a given string.
UNIT 4: Passing multidimensional array to a function
UNIT 5: Explore structures handling using pointers.

TEXT BOOKS
1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”,
2nd Edition, PHI,2017.
2. E .Bal Guruswamy, “Programming in ANSI C”. 7th Edition, Tata McGrawHill

REFERENCE BOOKS
1. Vikas Gupta, “Computer Concepts and C Programming”, Dream tech Press2014.
2. R. S.Bichkar, “Programming with C”, University Press,2017.
3. V. Rajaraman, “Computer Programming in C”, PHI,2019.
4. Jacqueline Jones & Keith Harrow, “Problem Solving with C”, 1st Edition, Pearson
2011.

You might also like