Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
Second Semester 2025-26
Course Handout Part II
Date: 02-Feb-2026
In addition to Part I (General Handout for all courses appended to the Time Table) this portion further specific
details regarding the course.
Course No. : CS F111 (3 1 4)
Course Title : Computer Programming
Instructor-in-charge : Prof. Amanjot Kaur (amanjot@[Link], Chamber: 224)
Course Instructors : Prof. Tojo Mathew (tojomathew@[Link], Chamber: 234)
Prof. Satya Jaswanth Badri (satya@[Link], Chamber: 225)
Prof. Shalaka S Mahadik ([Link]@[Link], Chamber
237)
Prof. Neena Susan ([Link]@[Link], Chamber: 237)
1. Course description: Course contents include: Basic Model of a Computer; Problem Solving-Basic
Computing Steps and Flow Charting (Assignment, Sequencing, Conditionals, Iteration). Programming
Constructs – Expressions, Statements, Conditionals, Iterators/Loops, Functions/Procedures; Data Types
– Primitive Types, Tuples, Choices (Unions or Enumerations), Lists/Arrays, Pointers and Dynamically
Allocated Data. Input output and Files.
Laboratory Component: Programming Exercises involving development and testing of iterative and
procedural programs using bounded and unbounded iterations, function composition, random access
lists, sequential access lists, dynamically allocated lists, and file access.
2. Scope and Objective:
The scope this course includes: Basic Model of a Computer; Problem Solving-Basic Computing Steps and
Flow Charting (Assignment, Sequencing, Conditionals, Iteration). Programming Constructs –
Expressions, Statements, Conditionals, Iterators/Loops, Functions/Procedures; Data Types – Primitive
Types, Tuples, Choices (Unions or Enumerations), Lists/Arrays, Pointers and Dynamically Allocated Data.
Input output and Files.
Laboratory Component: Programming Exercises involving development and testing of iterative and
procedural programs using bounded and unbounded iterations, function composition, random access
lists, sequential access lists, dynamically allocated lists, and file access.
The primary objectives 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 a programming
language.
● Systematic techniques and approaches for constructing programs.
3. Course learning outcomes:
Upon successful completion of this course, students should be able to:
CLO1. Understand different number systems and basic binary operations in computers
Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
CLO2. Use basic data types, operators and control structures (branching, looping etc.) appropriately
CLO3. Apply data storage mechanisms like arrays, structure for solving data-oriented problems
CLO4. Demonstrate creation of modularized programs using user-defined functions
CLO5. Solve problems using advanced programming concepts such as recursion, pointers, and dynamic
memory allocation.
4. Text books and references:
TB1. J.R. Hanly and E.B. Koffman, Problem Solving and Program Design in C. Seventh Edition, Pearson
Education, 2013.
RB1: 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.
RB2: 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 examples.
RB3: 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.
RB4: 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.
RB5: Das, S. Unix: Concepts and Applications (4/e). McGraw Hill Education, 2017. Provides a great
introduction to using Unix commands.
RB6: Das, Sumitabha. Computer Fundamentals and C Programming. New Delhi, India: McGraw Hill Education.
(2018)
5. Method of conduct of the course: Lecture-Tutorial-Practical
Course Pre/Co-requisite (if any) & Catalogue / Bulletin Description:
Given in the Bulletin 2025 – 2026
6. Course Plan
*
Sl. No./ Topics Lectorial Practical Ref./ Chap. Learning Outcome
Wk. No (3+1 Hrs/ (2Hrs/week) /Sec.
Week) #(Book)
Programming; need for Orientation, T1: 1.1-1.3 Understand the need of
programming; overview Introduction to computers and
1 of computers and 01-04 working with Unix programming in the
computing; (Linux) current world.
Data; IEEE floating point Introduction to R1 Learn the number
representation of working with Unix representation and basic
2
numbers 05-08 (Linux) cont. arithmetic operation in
computers.
Overview C Language, Input and output T1: 2.4; Student learn to
Program structure, Basic statement in C Class notes represent the solution of
3 programming examples 09-12 computational problem
using flow diagrams
Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
Data Types; variable Using different Gives the understanding
4 names; sizes, constants 13-16 data types and about philosophy and
Class Notes
and declarations operators in C relevance of C language.
Statements – if… else, if… Different Students can evaluate a
else… if, switch programming complex arithmetic
5 17-20 structures expression; also specify
Loops – while; do…
T1: 2.1- the exact internal data
while; for; break and (selective,
2.2 representation.
continue iterative)
Using arrays in C Given a problem that’s
Arrays 1D arrays, 2D
(Single T1: 4.1-4.3, iterative in nature,
arrays
6 21-24 dimensional with students would be able to
4.7-4.8, use the if-else construct
loops)
appropriately.
Algorithms and Using arrays in C Given a problem that’s
Flowcharts for (Multidimensional 5.1- iterative in nature,
7 representing solutions of 25-28 with nested loops) 5.2, 5.4-5.8 students would be able to
computing problems use the loop constructs
construct appropriately.
Functions and String processing T1: 3.1, 3.4- Learns to organize the
program Structure; in C code in to reusable
3.5, 6.1-6.4,
8 return types; scope 29-32 modules that are easy to
rules; header files, 10.1-10. manage.
Recursion
Pointers and function Structures and T1: 6.1, 8.1- Gives understanding of
arguments; call by value; Unions 8.5, 9.1-9.5 alternate ways to manage
call by reference; pointer memory and pass
9 arithmetic; arrays of 33-36 arguments to functions.
pointers; string
manipulation
Pointers vs. Functions T1: 8.7-8.8, Teaches different ways of
multidimensional Arrays; organizing large amount
10 37-40 13.7
Command Line of data in memory using
Arguments arrays.
Structures unions, Pointers T1: 14.3- Learns creation of
11 enumerated types and 41-44 14.4 customized application
data type definitions specific data types.
Standard input and File handling T1: 2.3 Students will be able to
output functions; create user-defined data
formatted input and types pertaining to a given
12 output; File 45-48 problem, create and
handling manipulate data
structures using dynamic
memory management,
and handle text files.
Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
Dynamic memory Dynamic T1: 12.1- Understand the finer
management; linked lists memory 12.2 aspects memory
13 49-52
allocation and Notes management during
linked list runtime.
Divide and Conquer – Practice session T1:10.3– Learns the concept divide-
Design using Recursion; before Lab 10.4 and-conquer using
14 Recursive procedures; 53-56 recursive functions calls.
Compre
Recursion vs. Iteration
*Practical: CP Lab Room No. 333/336
7. Course Evaluation
7.1 Scheme: [Legends: OB - Open Book, CB - Closed Book, TBA – To Be Announced]
EC Evaluation Component OB/ Duration Weighta Date & Time
No. (EC) CB ge
EC1 Quiz CB 20 Minutes 10% 05 Mar 2026, Th5
EC2 Continuous Lab
Evaluation & demo 1 OB* During Lab hours 5% Continuous
(before mid sem)
EC3 Mid-semester Test CB 90 Minutes 25% 06 Apr 2026, FN
EC4 Continuous Lab
Evaluation & demo 2 OB* During Lab hours 5% Continuous
(After mid sem)
EC5 End semester Lab exam OB* 90 Minutes 15% TBA, Tentative:
May 11 - 15, 2025)
EC6 Comprehensive Exam CB 3 hours 40% 06 Jun 2026, FN
*Only prescribed text book(s) and hand-written notes are permitted in open book evaluation components.
7.2 Grading
Mid-semester grading will be displayed after evaluation components: Midsem (25%), Quiz (10%) and Lab
evaluation & demo (5%) are completed. Final grade will include all the evaluation components listed.
A student may be awarded “NC”, if the student:
⮚ Doesn’t appear / appear for the sake of appearing for the evaluation components / scoring zero in
pre-compre total.
⮚ Scoring zero in the lab component / Abstaining from lab classes throughout.
⮚ A student should obtain 40% of the median marks of the class to clear the course. If any student gets
the marks lower than the prescribed standard mentioned above, the student may be awarded NC.
Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
8. Attendance policy
Every student is expected to be responsible for regularity of his/her attendance in class rooms and
laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in
this course. A student must maintain a minimum of 60% attendance in both the laboratory and lecture
components of the course to be eligible to appear for the Comprehensive Examination in each. Attendance
in the course will be a deciding factor in judging the seriousness of a student which may be directly / indirectly
related to grading.
For the students under the purview of Academic Counseling Board (ACB), the Board shall prescribe the
minimum attendance requirement on a case-to-case basis.
9. Chamber consultation hour (CCH):
Students can consult their course instructors during the below specified day & hour of the week. A prior
intimation about the visit through e-mail is recommended. (E.g. F4: Friday, 4th Hour)
Course Chamber
Instructor Consultation
Name Hour (CCH)
Prof. Amanjot Kaur F3
Prof. Tojo Mathew M5
Prof. Satya Jaswanth F3
Badri
Prof. Shalaka S Mahadik M5
Prof. Neena Susan Th7
10. Make up policy
Make-ups are not given as a routine for any of the evaluation components. It is solely dependent upon the
genuineness of the circumstances under which a student fails to appear in a scheduled evaluation
component. In such circumstances, obtaining prior permission from the Instructor-in-Charge (I/C) is a must.
Valid proof of reason for absence must be produced to be considered for makeup.
● Makeup will be considered ONLY in the following cases:
1. A medical emergency due to which the student is admitted in the hospital on the day of the
evaluation.
2. An emergency in the immediate family of the student for which the student’s presence there is
unavoidable on the day of evaluation.
3. The student is representing the institute (BPDC) in an external event on the day of the evaluation
with the approval of the concerned department/faculty-in-charge.
● In all of these cases, the course-in-charge must be intimated before the original schedule of the
evaluation, by e-mail.
Birla Institute of Technology & Science, Pilani
Dubai Campus
ACADEMIC— UNDER GRADUATE STUDIES DIVISION
● Sufficient document proof for the cause must be produced for all cases, while applying for makeup
(Mere drug prescription is not acceptable as a document proof for medical emergency)
In case eligible, the student must be prepared to take make up any time after missed evaluation component
on a short notice.
The request for make-up should reach the instructor-in-charge at the earliest, normally within two working
days after the scheduled date of the examination. Student will be eligible to avail makeup only once and for
any one of the evaluation components in a course. The make-up will be arranged normally in about a week
from the actual date of the missed evaluation component.
11. Miscellaneous
11.1 Notices & Communications: All class/section level notices concerning the course will be posted in the
LMS. Optionally, if there is a need, email to your BITS mail ID will be used for short notices and therefore you
should activate your BITS mail and check it regularly. All official emails will be sent to your BITS email ID only.
Prof. Amanjot Kaur
Instructor In-Charge
CS F111 (Computer Programming)