School of Computing and Information TechnologyCourse

Hand-out

Problem Solving Using Computers| CS 1002 | 3 Credits | 3 0 0 3

Session: August 2023 – November 2023 | Faculty: Dr Jay Prakash Singh (Course-Coordinator) |Dr.
Satyabrata Roy | Dr. Gautam Kumar | Mr. Lav Upadhayay |Dr. Mayank Namdev | Mr Dhananjay Kumar Singh
| Ms. Babita| Dr. Preeti Narooka| Ms. Nandani| Dr. Lokesh | Dr. Krati Dubey | Dr. Shweta Sharma| Ms. Shally
Vats

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

[CS1002.1]. Understand algorithm development, elements of programming languages and designing flow charts.
[CS1002.2]. Apply the basic programming concepts such as tokens, data types, operators and control statements for
implementing programs.
[CS1002.3]. Describe and analyze the concepts of array data type (1D and 2D), functions, structure and union.
[CS1002.4]. Illustrate the concept of pointers and file handling.
[CS1002.5]. Creating algorithms or pseudo code to solve real life problems using programing constructs.

These course outcomes ensure that students gain a comprehensive understanding of computer
programming principles, data manipulation, and problem-solving techniques, while also mastering the
use of essential programming constructs and libraries.

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.
D. Assessment Plan:

Criteria Description Maximum Marks

MTE I (Closed Book)
Internal Assessment 30
(Summative)
Quizzes (Best 3 of 4: 15%) and 30
Assignments (Two : 5%)
End Term Exam End Term Exam (Closed Book) 40
(Summative)
Total 100
A minimum of 75% Attendance is required to be maintained by a
Attendance student to be qualified for taking up the End Semester examination.
(Formative) The allowance of 25% includes all types of leaves including medical.
leaves.

E. SYLLABUS
Module CONTENTS
Introduction to Computer Programming and Computer Architecture:
1 Algorithms and flowcharts, the von Neumann architecture, programs,
assembly language, high level programming languages
Fundamentals of Data Types and Variables in Programming: Data types,
2
variables, Enumerated datatypes, Storage Class

3 Understanding Operators, Expressions, and Control Statements:

Operators, expressions, Control Statements
4 Working with Arrays and Pointers in Programming: Arrays and pointers

5 Functions, Recursion, and Structures in Programming: Function,

recursion, Structures
File Handling, Standard Library Functions, and Elementary Data
6 Structures: File Handling, some standard library functions, and some
elementary data structures.

F. Text Books

T1. E. Balagurusamy, “Programming in ANSI C”, 7th Edition, McGraw Hill Publication, 2017.T2. Y. P.
Kanetkar, “Let us C”, 16th Edition, BPB Publication, 2017.
G. Reference Books

R1. B. W. Kernighan, D. M. Ritchie, “The C Programming 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:
Lecture Topics Session Mode of Corres Mode of
Number Outcome Delivery pondi Assessing CO
ng CO
1 von Neumann architecture, To acquaint basic Lecture 1002.1 Mid Term ,
programs, assembly language, high knowledge of computer Quiz & End
level programming languages system. Term

2 Algorithm and Flowchart To learn process to solve Lecture 1002.1 Mid Term ,
any complex problem Quiz & End
Term

3. Data types (table including range, Implementation of various Lecture 1002.2 Mid Term ,
memory and format specifier), data type Quiz & End
Operators: arithmetic, relational, logical, Term
assignment.
4. Storage Class, Enumerated datatype To gain knowledge of storage Lecture 1002.2 Mid Term ,
class and enumerated data Quiz & End
types Term

7. Bitwise, conditional, type-cast, size of, Implementation of various Lecture, 1002.2 Mid Term ,
comma, Operator precedence and arithmetic operations Activity Quiz & End
associativity, type conversion. (TSP) Term
8. Operator precedence and associativity, Implementation of Lecture 1002.2 Mid Term ,
type conversion precedence in programming Quiz & End
Term
9. Input and output statements (formatted Implementation of input and Lecture 1002.2 Mid Term ,
and unformatted): printf, scanf, gets, puts, output statements Quiz & End
getchar, putchar Term

10. Decision statements: if, if-else, nested Implementation of decision Lecture 1002.3 Mid Term ,
if-else, if-else ladder statements Quiz & End
Term
11. Switch, break statement Learning the Lecture 1002.3 Mid Term ,
implementation of switch Quiz & End
and break Term
12. Repetitive structures: for, while loops Learning the Lecture 1002.3 Mid Term ,
implementation of looping Quiz & End
Term

13. Repetitive structures: do-while loops, Learning the Lecture 1002.3 Mid Term ,
nested loops implementation of looping Quiz & End
Term
14. More examples on Nested loops of Learning the Activity 1002.3 Mid Term ,
various types implementation of looping (Think Quiz & End
Pair Term
Share)
15. Continue and break statements Describe the usage of Lecture 1002.3 Mid Term ,
continue and break Quiz & End
Term
16. 1-D array: definition, declaration, Describe and define array of Lecture 1002.4 Mid Term ,
initialization, input array, output array various data type Quiz & End
Term
17. 1-D array: Examples of array operations Describe and define array of Lecture 1002.4 Mid Term ,
various data type Quiz & End
Term

18. 1-D character array: character array, Describe and define array of Lecture 1002.4 Mid Term ,
string, standard functions for string various data type Quiz & End
manipulation Term

19. 1-D character array: user defined Describe and define array of Lecture 1002.4 Mid Term ,
functions of standard string manipulation various data type Quiz & End
functions Term

20. Application of 1-D array: Linear Describe use of linear array Activity 1002.4 Mid Term ,
Search and Bubble Sort Quiz & End
Term

21. Revision – 1 Revision of earlier concepts Lecture 1002.1 Mid Term ,

to Quiz & End
1002.4 Term

22. 2-D array: definition, declaration, Describe and define array of Lecture 1002.4 Mid Term ,
initialization, input array, output array, various data type Quiz & End
one simple program Term

23. 2-D array: More examples on 2-D Describe and define array of Lecture 1002.4 Mid Term ,
arrays various data type Quiz & End
Term

24. 2-D array: More examples on 2-D array Describe and define array of Lecture, 1002.4 Mid Term ,
various data type Activity Quiz & End
Term

25. Pointers: Introduction Describe functionality of Lecture 1002.4 Mid Term ,

pointers in programming Quiz & End
Term

26. 1-D Array and pointer Implementation of ID array Lecture 1002.4 Mid Term ,
with pointer Quiz & End
Term

27. More examples on pointer and To acquaint more Lecture 1002.4 Mid Term ,
operations using pointers knowledge about pointers Quiz & End
Term

28. Some more examples on pointer and To acquaint more Lecture 1002.4 Mid Term ,
operations using pointers knowledge about pointers Quiz & End
Term

29. Functions: introduction to functions, Describe importance of Lecture, 1002.4 Mid Term ,
function prototype, call, definition function and modular Activity Quiz & End
programming Term
30. Call by value and Call by reference Describe importance of Lecture 1002.4 Mid Term ,
function and modular Quiz & End
programming Term

31. More examples using functions Describe importance of Lecture 1002.4 Mid Term ,
function and modular Quiz & End
programming Term

32. Examples using functions continued Describe importance of Lecture 1002.4 Mid Term ,
function and modular Quiz & End
programming Term

33. Revision – 2 Revision of earlier concepts Lecture 1002.4 Mid Term ,

Quiz & End
Term
34. Storage classes Describe usage of storage Lecture 1002.4 Mid Term ,
classes Quiz & End
Term

35. Structures: definition, declaration, Describe usage of Lecture 1002.4 Mid Term ,
initialization structures Quiz &
End
Term
36. Structures: array of structures Describe usage of Lecture 1002.4 Mid Term ,
structures Quiz &
End
Term
37. Union, difference between union and Describe usage of union Lecture 1002.4 Mid Term ,
structures Quiz &
End
Term
38. File handling: introduction, operations on Describe usage of file Lecture 1002.5 Mid Term ,
files, opening modes handling with various Quiz &
operations and modes End
Term
39. File handing function Describe usage of file Lecture 1002.5 Mid Term ,
handling with various Quiz &
operations and modes End
Term
40. File handing function Describe usage of file Lecture 1002.5 Mid Term ,
handling with various Quiz &
operations and modes End
Term
41. Revision – 3 Summarize entire syllabus Lecture 1002.1 Mid Term ,
1002.2 Quiz & End
1002.3 Term

42. Revision – 4 Summarize entire syllabus Lecture 1002.4 Mid Term ,

1002.5 Quiz & End
Term
I. Course Articulation Matrix: (Mapping of COs with POs)

CORRELATION WITH PROGRAM OUTCOMES CORRELATION WITH

CO PROGRAM SPECIFIC
STATEMENT
OUTCOMES
PO PO PO PO PO PO PO PO PO PO PO PO PSO 1 PSO 2 PSO 3
1 2 3 4 5 6 7 8 9 10 11 12
CS Understand algorithm development, 2 1 1 2 1 1
1002.1 elements of programming languages and
designing flow charts.
CS Apply the basic programming concepts 2 1 2 1
1002.2 such as tokens, data types, operators and
control statements for implementing
programs.
CS Describe and analyze the concepts of array 3 1 2 1
1002.3 data type (1D and 2D), functions, structure
and union.
CS Illustrate the concept of pointers and file 2 2 1
1002.4 handling
CS Creating algorithms or pseudo code to 3 2 1 3 3 1 1
1002.5 solve real life problems using programing
constructs
1- Low Correlation; 2- Moderate Correlation; 3- Substantial Correlation