School of Computing and Information Technology

Course Hand-out
Problem Solving Using Computers| CS 1001 | 3 Credits | 3 0 0 3

Session: Oct 2021 – March 2021 | Faculty: Dr Prakash Ramani | Dr Manish Kalra | Mr Lokesh Singh | Mr Manoj
R | Dr. Renu Kumawat | Dr. Amit Chaurasia | Dr Vijay Shankar Sharma | Dr Shally Vats | Dr. Shweta Sharma
| Dr. Sumit Dhariwal | Dr. Avni Sharma

Class: B. Tech 1st Year

A. Introduction: Problem solving using computers course focuses on basic computer fundamentals,
number system and programming in C fundamentals. By means of C language students learn to
write set of instructions to create a program so that desire output can be generated by computer.

B. Course Outcomes: At the end of the course, students will be able to

[CS1001.1]. Translate numbers from one number system to another and explain components of
computer system and its functions.
[CS1001.2]. Demonstrate the basic programming concepts such as tokens (data types, operators, etc)
and control statements.
[CS1001.3]. Make use of flowcharts and algorithms in solving real life problems.
[CS1001.4]. Apply the concepts arrays, functions, structure, and union in solving problems.
[CS1001.5]. Illustrate the concept of pointers and file handling.

C. PROGRAM OUTCOMES
[PO.1]. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
and an engineering specialization to the solution of complex engineering problems
[PO.2]. Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences
[PO.3]. Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the public health
and safety, and the cultural, societal, and environmental considerations
[PO.4]. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions
[PO.5]. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with an understanding
of the limitations
[PO.6]. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal, and cultural issues and the consequent responsibilities relevant to the professional engineering
practice
[PO.7]. Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development
 [PO.8]. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practices
[PO.9]. Individual and teamwork: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings
[PO.10]. Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions
[PO.11]. Project management and finance: Demonstrate knowledge and understanding of the engineering
and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects
and in multidisciplinary environments
[PO.12]. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change

PROGRAM SPECIFIC OUTCOMES:

[PSO 1]. Will be able to design, develop and implement efficient software for a given real life problem.
[PSO 2]. Will be able to apply knowledge of AI, Machine Learning and Data Mining in analyzing big
data for extracting useful information from it and for performing predictive analysis.
[PSO 3]. Will be able to design, manage and secure wired/ wireless computer networks for transfer and
sharing of information.
D. Assessment Plan:

Criteria Description Maximum Marks

Sessional Exam I (Close Book) 20
Internal Assessment Sessional Exam II (Close Book) 20
(Summative)
Quizzes (03) and Assignment (03) 20
End Term Exam End Term Exam (Close Book) 40
(Summative)
Total 100
Attendance A minimum of 75% Attendance is required to be maintained by a student to
(Formative) be qualified for taking up the End Semester examination. The allowance
of 25% includes all types of leaves including medical leaves.

E. SYLLABUS
Introduction to Computing, Importance of Problem Solving using Computers, Algorithms and Flow
charts, Introduction to C language, Simple C programs, Syntax and Logical Errors in compilation,
Object and executable code, Variable names and declaration, Data types, Sizes and Constants,
Various operators, Type conversion and expressions, Precedence and order of evaluation,
Statements and blocks, Control, flow, Break and continue, 1-D and 2-D Arrays and Strings, Searching
and Sorting, Multidimensional Arrays and Matrices, Modular programming and Recursive functions,
Structure and Pointers, Defining Structures and Array of Structures, Pointer arithmetic, Pointer to
Structures, File Management.
F. Text Books
T1. E. Balagurusamy, “Programming in ANSI C”, 7th Edition, McGraw Hill Publication, 2016.
T2. Y. P. Kanetkar, “Let us C”, 12th Edition, BPB Publication, 2014.
 G. Reference Books

R1. B. W. Kernighan, D. M. Ritchie, “The C Programing Language”, 2nd Edition, Prentice Hall of India, 2014.
R1. B. Gottfired, “Schaum's Outline Series: Programming with C”, 3rd Edition, McGraw Hill Publication, 2012.

H. Lecture Plan:

lectur Topics Session Mode of Correspondin Mode of Assessing

e Outcome Deliver g CO CO
y
ONLINE
1 Number systems: decimal, binary, To acquaint Lecture CS1001.1 Mid Term I, Quiz &
octal, hexadecimal, base-r knowledge End Term
conversions about basics of
number system
2 Number systems: decimal, binary, To acquaint Activity CS1001.1 Mid Term I, Quiz &
octal, hexadecimal, base-r knowledge End Term
conversions about basics of
number system
3 Basic architecture of computers Describing Lecture CS1001.1 Mid Term I, Quiz &
and its building block basic End Term
architecture of
Computer
4 Computer languages: machine Differentiate Lecture CS1001.1 Mid Term I, Quiz &
language, assembly language, high between End Term
level language; translators: machine
assembler, compiler, language and
interpreter, algorithms and high-level
flowcharts Language
5 Short history, character set, Different Guided Self- CS1001.2 Mid Term I, Quiz &
tokens characters and Study End Term
tokens
6 Constants (integer, real, Describe and Lecture CS1001.2 Mid Term I, Quiz &
character, string); variables, implementation End Term
keywords of various
constant type
7 Data types (table including range, Implementation Lecture CS1001.2 Mid Term I, Quiz &
memory and format specifier) of various data End Term
type
8 Operators: arithmetic, relational, Implementation Lecture CS1001.2 Mid Term I, Quiz &
logical, assignment of various End Term
arithmetic
operations
9 Bitwise, conditional, type-cast, Implementation Lecture CS1001.2 Mid Term I, Quiz &
sizeof, comma of various End Term
operators
10 Operator precedence and Implementation Lecture CS1001.2 Mid Term I, Quiz &
associativity, type conversion of precedence End Term
in programming
11 Operator precedence and Implementation Lecture CS1001.2 Mid Term I, Quiz &
associativity, type conversion of precedence End Term
in programming
12 Input and output statements Implementation Lecture CS1001.2 Mid Term I, Quiz &
(formatted and unformatted) : of input and End Term
printf, scanf output
statements
13 Gets, puts, getchar, putchar Implementation Activity CS1001.2 Mid Term I, Quiz &
of input and End Term
output
statements
using system
functions
14 Decision statements: if, if-else, Implementation Lecture CS1001.3 Mid Term I, Quiz &
nested if-else, if-else ladder of decision End Term
statements
15 Decision statements: if, if-else, Implementation Lecture CS1001.3 Mid Term I, Quiz &
nested if-else, if-else ladder of decision End Term
statements
16 Switch, break statement Learning the Lecture CS1001.3 Mid Term I, Quiz &
implementation End Term
of switch and
break
17 Switch, break statement Learning the Lecture CS1001.3 Mid Term I, Quiz &
implementation End Term
of switch and
break
18 Repetitive structures: for, while, Learning the Lecture CS1001.3 Mid Term II, Quiz &
do-while implementation End Term
of looping
19 Repetitive structures: for, while, Learning the Lecture CS1001.3 Mid Term II, Quiz &
do-while implementation End Term
of looping
20 Nested loops Learning the Lecture CS1001.3 Mid Term II, Quiz &
implementation End Term
of looping
21 Nested loops Learning the Lecture CS1001.3 Mid Term II, Quiz &
implementation End Term
of looping
22 Continue and break statements Describe the Lecture CS1001.3 Mid Term II, Quiz &
usage of End Term
continue and
break
23 Continue and break statements Describe the Lecture CS1001.3 Mid Term II, Quiz &
usage of End Term
continue and
break
24 1-D array: definition, declaration, Describe and Lecture CS1001.4 Mid Term II, Quiz &
initialization, input array, output define array of End Term
array various data
type
25 1-D array: definition, declaration, Describe and Lecture CS1001.4 Mid Term II, Quiz &
initialization, input array, output define array of End Term
array various data
type
26 1-D character array: character Describe and Lecture CS1001.4 Mid Term II, Quiz &
array, string, string standard define array of End Term
function various data
type
27 1-D character array: character Describe and Lecture CS1001.4 Mid Term II, Quiz &
array, string, string standard define array of End Term
function various data
type
28 Use of 1D array: Linear Search Describe use of Lecture CS1001.4 Mid Term II, Quiz &
and Bubble Sort linear array End Term
29 2-D array: definition, declaration, Describe and Lecture CS1001.4 Mid Term II, Quiz &
initialization, input array, output define array of End Term
array, one simple program various data
type
30 2-D array: definition, declaration, Describe and Lecture CS1001.4 Mid Term II, Quiz &
initialization, input array, output define array of End Term
array, one simple program various data
type
31 2-D array: definition, declaration, Describe and Lecture CS1001.4 Mid Term II, Quiz &
initialization, input array, output define array of End Term
array, one simple program various data
type
32 Pointers: introduction Describe Lecture CS1001.4 Mid Term II, Quiz &
functionality of End Term
pointers in
programming
33 1-D Array and pointer Implementation Lecture CS1001.4 Mid Term II, Quiz &
of ID array End Term
with pointer
34 Functions: introduction to Describe Lecture CS1001.4 Mid Term II, Quiz &
functions importance of End Term
function and
modular
programming
35 Function prototype, call, definition Describe Lecture CS1001.4 Mid Term II, Quiz &
importance of End Term
function and
modular
programming
36 Storage classes Describe usage Lecture CS1001.4 Mid Term II, Quiz &
of storage End Term
classes
37 Structures: definition, declaration, Describe usage Lecture CS1001.4 Quiz & End Term
initialization, array of structures of structures
38 Structures: definition, declaration, Describe usage Lecture CS1001.4 Quiz & End Term
initialization, array of structures of structures
39 Union, difference between union Describe usage Lecture CS1001.4 Quiz & End Term
and structures of union
40 File handling: introduction, Describe usage Lecture CS1001.45 Quiz & End Term
operations on files, opening of file handling
modes with various
operations and
modes
41 File handing function Describe usage Lecture CS1001.45 Quiz & End Term
of file handling
with various
operations and
modes
42 File handing function Describe usage Lecture CS1001.45 Quiz & End Term
of file handling
with various
operations and
modes
 I. Course Articulation Matrix: (Mapping of COs with POs)

CORRELATION WITH PROGRAM OUTCOMES CORRELATION

CO STATEMENT WITH PROGRAM
SPECIFIC OUTCOMES
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO 3
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CS1001.1 Translate numbers from one number 3 1 3
system to another and explain
components of computer system and its
function
CS1001.2 Demonstrate the basic programming 2 1 2 2
concepts such as tokens (data types,
operators, etc) and control statements.

CS1001.3 Make use of flowcharts and algorithms in 3 1

solving real life problems.

CS1001.4 Apply the concepts arrays, functions, 2 1 2 2 1

structure, and union in solving problems.

CS1001.5 Illustrate the concept of pointers and 1 1 1 1

file handling.

1- Low Correlation; 2- Moderate Correlation; 3- Substantial Correlation