BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani

Pilani Campus
AUGS/ AGSR Division

SECOND SEMESTER 2022-23

COURSE HANDOUT
Date: 15.01.2023

In addition to part I (General Handout for all courses appended to the Time table) this portion gives further
specific details regarding the course.
Course No : CS F111
Course Title : Computer Programming
Instructor-in-Charge : Dr. Tejasvi Alladi
Instructor(s) : Dr. Tejasvi Alladi (tejasvi.alladi@pilani.bits-pilani.ac.in)
Dr. Jagat Sesh Challa (jagatsesh@pilani.bits-pilani.ac.in)
Dr. Asish Bera (asish.bera@pilani.bits-pilani.ac.in)
Mr. Pawan Kumar Mishra (pawan.mishra@pilani.bits-pilani.ac.in)
Practical Instructors : Mr. Nitish Yadav (p20210022@pilani.bits-pilani.ac.in)
Mr. Abhishek Vyas (p20180407@pilani.bits-pilani.ac.in)
Ms. Sakshi (p20180437@pilani.bits-pilani.ac.in)
Ms. Vijay Kumari (p20190065@pilani.bits-pilani.ac.in)
Mr. Aravind B S (aravind.bs@pilani.bits-pilani.ac.in)
Mr. Syed Sameen Ahmad Rizvi (p20190412@pilani.bits-pilani.ac.in)
Mr. Mohit (p20210472@pilani.bits-pilani.ac.in)

1. Course Description: The primary goals of the course are to introduce:

● Basic representation of data and how to process data using the representation inside a computer.
● Techniques for specifying data, operations on data, and problem-solving using C programming language.
● Systematic techniques and approaches for constructing programs.

2. Scope and Objective of the Course: The course covers the following topics: Basic Model of a Computer;
Problem Solving – Basic Computing Steps and Flow. Programming Constructs – Expressions,
Statements, Conditionals, Iterators/Loops, Functions/Procedures; Data Types – Primitive Types, Tuples,
Lists/Arrays, Pointers and Dynamically Allocated Data, Linked Lists and its variants, Input output and
Files.

3. Text Books:
T1: Hanly, J.R. and E.B. Koffman. Problem Solving and Program Design in C(7/e). Pearson
Education, 2013.

4. Reference Books:
R1: Patt, Yale. Introduction to Computing Systems: From bits & gates to C &beyond (2/e). McGraw
Hill Education, 2017.
The authors take a bottom-up approach to introduce computers and computing.

1
 BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani
Pilani Campus
AUGS/ AGSR Division

R2: Forouzan, B.A. and Richard F. Gilberg . Computer science A structured programming approach
using C (3/e). Cengage Learning, 2007.
The book gives a fairly comprehensive overview of C, with several example programs.

R3: Gottfried, B.S. and Jitender Chhabra. Programming with C (Schaum's Outlines Series, 3/e).
McGraw Hill Education, 2017.
Another beginner’s book on C programming, with lots of drill exercises and programs.

R4: Kernighan, B.W and Dennis Ritchie. The C Programming Language (2/e). Pearson Education
India, 2015.
Considered the ultimate treatise on C, it conveys the philosophy and practice of C very tersely, but is pitched
at an advanced beginner level.

R5: Das, S. Unix: Concepts and Applications (4/e). McGraw Hill Education, 2017.
Provides a great introduction to using Unix commands.

R6: Das, Sumitabha. Computer Fundamentals and C Programming. New Delhi,

India: McGraw Hill Education. (2018)

5. Course Plan:
Module Lecture Session Reference Learning outcomes
No.
L1 Students get the motivation
Introduction to Programming; the need for behind programming, and
01 programming; overview of computers and T1: 1.1-1.3 understand a broad overview
of computing, computer
computing
organization
L2
02 How to express a problem using flowcharts Class Notes Students can write simple C
and algorithms programs, compile and
L3 execute them in a Unix
T1: 2.4;
03 A programming example using standard environment
Class notes
input and output
L4-L6 Students will understand, how
04 Internal representation of data; IEEE R1: 2.7.2 data is represented and stored
floating-point representation in Computers
L7-L9 Students can evaluate
05 Data Types; variables; constants; operators T1: 2.1-2.2 arithmetic expressions and
and expressions specify the exact internal data
representation.
L10-12 T1: 4.1-4.3, Given an iterative or
Statements – if… else, if… else… if, switch 4.7-4.8, 5.1- conditional, students would
06 Loops – while; do…while; for; break and 5.2, 5.4-5.8 be able to use the loop
constructs / if-else construct
continue
appropriately.

2
 BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani
Pilani Campus
AUGS/ AGSR Division

L13-15 Given a complex problem

T1: 3.1, 3.4-
Functions and program structure; return statement, students will be
07 3.5, 6.1-6.4,
types; scope rules; function arguments; call able to logically break down
10.1-10.4
by value; stack vs heap memory into simpler modules and
L16-L20 solve them using functions.
T1: 6.1
08 Arrays, Multi-dimensional Arrays, Linear They will also be able to store
Class Notes
Search, Binary Search, Sorting. and process groups of related
L21-L22 data records together using
Structures, Type Definitions, Enumerators in T1: 10.1 – arrays in C. They will also be
09 C, Array of Structures 10.4 able to store data of multiple
Class Notes datatypes together using
structures and process them.
L23-L26 T1: 8.1-8.5
10 Pointers; call by reference; pointer T1: 7.8-7.9,
arithmetic; arrays of pointers; 13.7 Students will be able to create
L27-L30 user-defined data types
Dynamic memory management, pertaining to a given problem,
11 Multidimensional arrays; pointers vs. Class Notes and create and manipulate
Multidimensional Arrays; command-line data structures using dynamic
arguments memory management. They
L31-34 T1: 13.1- will also learn about linked
12 Linked lists, Operations on Linked Lists, 13.4 Class lists, operations on linked lists
Circular and Doubly Linked Lists Notes along with Strings and file
L35-L36 Class Notes handling in C.
13 String Operations, File Handling T1: 2.3, 9.1-
9.5
L37-38 Students will be able to
Recursion, C Pre-processor understand recursion and
T1:11.1
14 recursive style of
Class Notes
programming. They will also
study the Pre-processor in C.
L39-L40 Students will be able to build
15 Cases Studies Class Notes C Projects for solving real-
world problems.

3
 BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani
Pilani Campus
AUGS/ AGSR Division

6. Plan for laboratory sessions:

Lab Session No. Broad topics to be covered
Lab 1 Introduction to Operating System, Unix, Basic Unix Commands
Lab 2 Some more Unix Commands and Introduction to a text editor
Lab 3 Writing basic C programs, compiling and executing them
Writing more complex C programs with multiple data types, variables and type
Lab 4
conversions
Lab 5 Control Flow: branching, decision making, looping
Lab 6 Storage Classes, Functions
Lab 7 Arrays – Searching and Sorting and other problems, passing arrays to functions
Lab 8 Multi-file Compilation with makefile
Lab 9 Structures in C
Lab 10 Pointers, Pointer Arithmetic, Call by reference
Lab 12 Dynamic Memory Allocation – variables, arrays, arrays of structures
Lab 12 Linked Lists
Lab 13 String Operations, File Handling, and Command-Line Arguments

7. Evaluation Scheme:

Weightage Nature of component

Component Duration Date & Time
(%) (Close Book/ Open Book)
Mid-Semester Test 90 Min. 20 03/05 AN2 Closed-book
Comprehensive
2 hours 40 12/07 AN Partly Open Book
Examination
Quiz TBA 10 TBA Closed-book
Programming Test 2 hours 20 TBA Open-book
2 hours ---
Laboratory Sessions 10 ---
each

8. Chamber Consultation Hour:

TBA

9. Notices: All announcements will be done through the Nalanda LMS.

4
 BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani
Pilani Campus
AUGS/ AGSR Division

10. Make-up Policy: Make-ups are generally considered only for medical emergencies leading to
hospitalization (or a personal emergency of similar nature). The decision by the Instructor-in-Charge
regarding granting make-ups shall be final. Makeups are allowed for Mid Semester Test, Lab Tests and
Comprehensive Examination. No makeup for weekly laboratory sessions. Out of 13 scheduled lab
sessions, 9 will be evaluative. Best 7 of 9 will be considered for grading.

11. Note: Award of grades would be guided in general by the histogram of marks. If a student does not given
sufficient opportunity for being assessed, either by missing a component entirely or by not applying
oneself to the task seriously, he/she may be awarded an ‘NC’ report.

Instructor-in-charge
CS F111