Spicer Adventist University: Department of Computer Science Syllabus BSCC 111 C Programming (3 Credits)
Spicer Adventist University: Department of Computer Science Syllabus BSCC 111 C Programming (3 Credits)
Course Description:
The course is designed for the students to develop professional skills and problem solving
abilities to pursue a career in Software Industry. A course in programming fundamentals
forms the preliminary skill set for solving computational problems.
Course Objectives:
Course Requirements
Attendance:
This class will comply with the “Class Absences” policy of Spicer Adventist University.
Evaluation:
To encourage you to achieve your goals, your progress and achievement will be graded in
the traditional manner. While grading is by no means an exact science, every effort will
be made to be consistent and fair. Evaluation methods include:
Internal assessment with 20% marks by way of continuous internal evaluation and will
include assignments, projects and class presentations.
Assignments- Evaluation of homework reinforcing lecture & laboratory experiences will
be based on content, quality & punctuality. Late papers will be penalized.
External Assessment with 80% marks by way of an 80 point comprehensive end of
semester examination will be given covering the entire semesters work.
Chapter No Topics # Lectures
Chapter 1 Problem Solving using
Computers
1.1 Problem-Solving
1.2 Writing Simple Algorithms 2
1.3 Algorithms
1.4 Flowcharts
Chapter 3 Introduction to C
3.1 History
3.2 Structure of a C program
3.3Functions as building blocks
3.4 Application Areas 3
3.5 C Program development life cycle
3.6 Sample programs
Chapter 4 C Tokens
4.1 Keywords
4.2Identifiers
4.3Variables
4.4Constants – character, integer,
float, string, escape sequences
4.5Data types – built-in and user
defined 4
4.6 Operators and Expressions
Operator types (arithmetic, relational,
logical,
assignment, bitwise, conditional ,
other operators) , precedence and
associativity
rules.
4.7 Simple programs using printf and
scanf
Chapter 7 Functions in C
7.1 What is a function
7.2 Advantages of Functions
7.3 Standard library functions
7.4 User defined functions 6
:Declaration, definition, function call,
parameter passing
(by value), return keyword,
7.5 Scope of variables, storage classes
7.6 Recursion
Chapter 8 Arrays
8.1 Array declaration, initialization
8.2 Types – one, two and 5
multidimensional “
8.3 Passing arrays to functions
Chapter 9 Pointers
9.1 Pointer declaration, initialization
9.2 Dereferencing pointers
9.3 Pointer arithmetic
9.4 Pointer to pointer
9.5 Arrays and pointers 5
9.6 Functions and pointers – passing
pointers to functions, function
returning
pointers
9.7 Dynamic memory allocation
Chapter 10 Strings
10.1 Declaration and initialization,
format specifiers 4
10.2 Standard library functions
10.3 Strings and pointers
10.4 Array of strings
10.5 Command Line Arguments
Chapter 13 C Preprocessor
13.1 Format of Preprocessor directive
13.2 File Inclusion directive 2
13.3 Macro substitution, nested
macro, augmented macro
Course Textbook:
Reference Books:
1. The C Programming Language, Brian W. Kernighan, Dennis M. Ritchie,
ISBN:9788120305960, PHI Learning
2. How to Solve it by Computer, R.G. Dromey, ISBN:9788131705629, Pearson
Education
3. A Structured Programming Approach Using C, Behrouz A. Forouzan, Richard
F. Gilberg ISBN:9788131500941, Cengage Learning India
4. Using The GNU Compiler Collection, Richard M. Stallman;The GCC
Developer Community Pothi.com
6. Problems Solving Using Computers and ‘C’ Programming Poonam Ponde 3rd
Edition
7. Let Us ‘C’ by Yashavant Kanetkar 13 th Edition