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

PROGRAMMING IN C Syllabus Sage University

The document provides details about a Programming in C Lab course offered at SAGE University, Indore. It includes information about the course code, credits, prerequisites, objectives, content, experiments, textbooks, outcomes and mapping to program outcomes. The course aims to teach basic C programming concepts and their implementation through lab experiments.

Uploaded by

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

PROGRAMMING IN C Syllabus Sage University

The document provides details about a Programming in C Lab course offered at SAGE University, Indore. It includes information about the course code, credits, prerequisites, objectives, content, experiments, textbooks, outcomes and mapping to program outcomes. The course aims to teach basic C programming concepts and their implementation through lab experiments.

Uploaded by

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

SAGE University, Indore

Institute Name: Institute of Computer Application


Recommended Programs : BCA Semester : I
Course Name Programming In C Lab Course Code CAPDSPIC001P
L T P N Total
Credit Score 2
0 0 4 0 Credits
Prerequisites Fundamental of Computer (083)

The purpose of offering this course are:

1. Even with the introduction of several high level languages and


frameworks, the development of procedural codes is important in several
commercial app developments.
2. The object oriented platforms and event driven systems use procedural
languages for coding integral command content. C is an important
procedural language and was developed initially to write the UNIX
Course operating system.
Objectives 3. UNIX operating system, C compiler and all UNIX application programs
are written in C. C is popular because, it is easy to learn, produces
efficient programs, can handle low-level activities, and can be compiled
on a variety of platforms.
4. This course focuses on all the basic concepts, syntax and constructs of
the C language. For students, who are new to programming, this unit can
be considered as the starting point before taking up any other
programming oriented units.
5. The students will be implementing the concepts explained here to create
simple to complex programs.
Course Content List of Experiments:

Introduction to Programming:
Problem Solving Using Computers: Language Classification, Problem Analysis,
Algorithm and Flowchart design. Algorithms: Steps in developing algorithms,
advantages and disadvantages. Flowcharts: Symbols used in developing
flowcharts, advantages and disadvantages. Coding, testing, debugging,
Documentation and maintenance. Program development and modular design.

Fundamentals of C programming and Control Structures:


Structure of a C program, C Conventions, Character Set, Identifiers, Keywords,
Simple Data types, Modifiers, Variables, Constants, Operators (Arithmetic
operator, relational operator, logical operator, ternary operator, unary operator,
shorthand operator, bit-wise operator and arithmetic operator) Operator
precedence. Input and Output operation: Single character input and output,
formatted input and output, Buffered input.
Control Structures: Introduction, Conditional statement, if statement, if-else
statement, nested if statement, else-if statement and switch statement. Goto
statement. Looping statement, while statement, do-while statement, for
statement, break and continue, nested for statement

Arrays and Functions:


Arrays: Introduction (One and multi-dimensional), Declaration of arrays,
Initialization of arrays, processing with arrays. String manipulation, declaration
of string arrays, string operations.
Functions: Introduction, advantages of subprograms, Function definition, function call,
Actual and formal arguments, local and global variables, function prototypes, types of
functions, recursive functions, arrays and functions.
Part A
1. Printing the reverse of an integer.
2. Printing the odd and even series of N numbers.
3. Get a string and convert the lowercase to uppercase and vice--versa using
getchar() and putchar().
4. Input a string and find the number of each of the vowels appear in the
string.
5. Accept N words and make it as a sentence by inserting blank spaces and
a full stop at the end.
6. Printing the reverse of a string.
Storage Classes, Structures, Unions and Pointers:
Storage Classes, Structures and Unions: Introduction, types of storage classes,
Introduction to structures, Advantages of structures, accessing elements of a
structure, nested structures, array of structures, functions and structures, Unions,
bit-fields, enumerated data types.

Pointers: Introduction, pointer variable, pointer operator, pointer arithmetic,


pointers and arrays, pointers and strings, array pointers, dynamic allocation

Part B
1. Searching an element in an array using pointers.
2. Checking whether the given matrix is an identity matrix or not.
3. Finding the first N terms of Fibonacci series.
4. Declare 3 pointer variables to store a character, a character string and an
integer respectively. Input values into these variables. Display the
address and the contents of each variable.
5. Define a structure with three members and display the same.
6. Declare a union with three members of type integer, char, string and
illustrate the use of union.
7. Recursive program to find the factorial of an integer.
8. Finding the maximum of 4 numbers by defining a macro for the
maximum of two numbers.
9. Arranging N numbers in ascending and in descending order using bubble
sort.
10. Addition and subtraction of two matrices.
11. Multiplication of two matrices.
12. Converting a hexadecimal number into its binary equivalent.
13. Check whether the given string is a palindrome or not.
14. Demonstration of bitwise operations.
15. Applying binary search to a set of N numbers by using a function.
Files, Preprocessor, standard library and header files:
Files: Introduction, File data type, opening and closing a file, file functions
(getc, putc, getw, putw, fscanf, fprintf, fread, fwrite, fgets, fputs, feof).
Preprocessor: #define, #include, #undef, Conditional compilation directives, C
standard library and header files: Header files, string functions, mathematical
functions, Date and Time functions
Create a sequential file with three fields: empno, empname, empbasic. Print all
the details in a neat format by adding 500 to their basic salary.
T1: Forouzon A Behrouz, Gilberg F Richard, A Structured Programming
Approach using C - 3rd Illustrated Edition, 2009.
Text Books T2: Kanetkar, Yashavant: “Let Us C”, 6th Edition. BPB Publications.
T3: Balagurusamy, E: “Programming in ANSI C” 3rd Edition. Tata McGraw-
Hill
R1:The C programming Language by Richie and Kernighan, 2004, BPB
Publication
References
R2:Gottfried, Byron S: “Programming with C”, 1996. Tata McGraw-Hill
R3:Deitel, H M and Deitel P J: “C How to Program”, 2nd Edition. Prentice-Hall
After reading this course students will learn
After completion of the course the student will be able:
CO1: To be able to use the basic concepts of Computer components. To be
able to design, implement, test, debug and document programs in C.
CO2: To be able to use functions, and functions with parameters passing
Course
option.
Outcomes
CO3: To be able to use pointers and arrays, perform pointer arithmetic.
CO4: To be able to understand the advance topics in C like file handling
functions and the concept of Standard C library.
CO5: To be able to learn the concept of C preprocessor and its application in
program development.

Mapping of Course outcome with Program Outcomes, PSO’s, and Knowledge Levels (As per Blooms
Taxonomy)
Knowledge Levels (K1, K2,
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4 …, K6)
CO1 3 2 1 1 1 2 2 1 2 K2
CO2 3 2 3 1 1 1 2 2 1 2 K3
CO3 3 2 3 3 1 1 1 2 2 1 1 2 K3
CO4 3 2 3 2 1 1 1 2 2 2 1 2 K5
CO5 3 2 3 3 3 1 1 1 2 2 2 1 2 K6

High-3 Medium-2 Low-1


K1 => Remember K2 => Understand K3 => Apply K4 => Analyze K5 => Evaluate K6 => Create

Designed By: Checked By: Approved By:


(Name with Sign.) (Name with Sign.) (Name with Sign.)

You might also like