KEMBAR78
27 Computer Programming CS100 Syllabus | PDF | C (Programming Language) | Pointer (Computer Programming)
Scribd
Upload
234 views2 pages

27 Computer Programming CS100 Syllabus

CS100 is a 2-1-0 credit course introduced in 2016 on Computer Programming. The course objectives are to understand C programming concepts and use them to solve problems and introduce basic data structures. The syllabus covers C language constructs, operators, sorting, searching, pointers, memory allocation, stacks and queues. The course outcomes are to identify appropriate C language to solve problems, analyze and implement subtasks as functions, implement algorithms efficiently, apply file handling and sorting/searching techniques to solve applications. The course plan has 6 modules covering C language basics, arrays/strings, structures, pointers, functions, sorting/searching, and file handling across 15 contact hours.

Uploaded by

Farzin Farooq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
234 views2 pages

27 Computer Programming CS100 Syllabus

CS100 is a 2-1-0 credit course introduced in 2016 on Computer Programming. The course objectives are to understand C programming concepts and use them to solve problems and introduce basic data structures. The syllabus covers C language constructs, operators, sorting, searching, pointers, memory allocation, stacks and queues. The course outcomes are to identify appropriate C language to solve problems, analyze and implement subtasks as functions, implement algorithms efficiently, apply file handling and sorting/searching techniques to solve applications. The course plan has 6 modules covering C language basics, arrays/strings, structures, pointers, functions, sorting/searching, and file handling across 15 contact hours.

Uploaded by

Farzin Farooq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course No.

Course Name L-T-P- Year of Introduction


Credits
Computer Programming
CS100 2-1-0 2016

Course Objectives

To understand the fundamental concept of C programming and use it in problem solving.

To introduce basic data structures and their applications.


Syllabus
Introduction to C language; Operators and expressions; Sorting and searching; Pointers; Memory allocation;
Stacks and Queues.

Course Outcomes
1. Identify appropriate C language constructs to solve problems.
2. Analyze problems, identify subtasks and implement them as functions/procedures.
3. Implement algorithms using efficient C-programming techniques.
4. Explain the concept of file system for handling data storage and apply it for solving problems
5. Apply sorting & searching techniques to solve application programs.

References

1. Rajaraman V., Computer Basics and Programming in C, PHI.


2. Anita Goel and Ajay Mittal, Computer fundamentals and Programming in C., Pearson.
3. Gottfried B.S., Programming with C, Schaum Series, Tata McGraw Hill.
4. Horowitz and Sahni, Fundamentals of data structures - Computer Science Press.
5. Gary J. Bronson, ANSI C Programming, CENGAGE Learning India.
6. Stewart Venit and Elizabeth Drake, Prelude to Programming – Concepts & Design, Pearson.
7. Dromy R.G., How to Solve it by Computer, Pearson.
8. Kernighan and Ritche D.M., The C. Programming Language, PHI.
.

COURSE PLAN

Contact Sem.ExamM
Module Contents
Hours arks;%

Introduction to C Language: Preprocessor directives, header


files, data types and qualifiers. Operators and expressions.
Data input and output, control statements.
I 7 15%

68
Arrays and strings- example programs. Two dimensional
II arrays - matrix operations. 8
Structure, union and enumerated data type. 15%

Pointers: Array of pointers, structures and pointers.


III Example programs using pointers and structures.

7 15%
FIRST INTERNAL EXAM

Functions – function definition and function prototype.


Function call by value and call by reference. Pointer to a
IV function –. Recursive functions. 7 15%

SECOND INTERNAL EXAM

Sorting and Searching : Bubble sort, Selection sort, Linear


Search and Binary search.
Scope rules Storage classes. Bit-wise operations.
V 6 20%

Data files – formatted, unformatted and text files.


VI Command line arguments – examples. 7 20%

END SEMESTER EXAM

69

You might also like