PROGRAMMING FOR PROBLEM SOLVING - BCS 101 / 201

Programme: CSE Degree: B. Tech. Year: I

Course: Programming for Problem Solving Semester: II Credits:
Course Code: BCS201 Course Type: Core
Course Area / Domain: Software Concepts Contact Hours: 5 Hours / Week
Corresponding Lab Course Code: BCS 151 Course Name: PPS Lab

Syllabus
CO‐wise Syllabus
Statement Translate the algorithms to programs & perform its execution in C language.
Introduction to Components of a Computer System: Memory, Processor, I/O
Devices, Storage, Operating System, Concept of Assembler, Compiler,
CO‐1 Interpreter, Loader and Linker.
1 Syllabus
Idea of Algorithm: Representation of Algorithm, Flowchart, Pseudo Code
with Examples, From Algorithms to Programs, Source Code.

Programming Basics: Structure of C Program, Writing and Executing the

First C Program, Syntax and Logical Errors in Compilation, Object and
Executable Code. Components of C Language. Standard I/O in C,
Fundamental Data types, Variables and Memory Locations, Storage Classes.
Statement Implement conditional branching, instructions along with operators.
Arithmetic Expressions and Precedence: Operators and Expression Using
Numeric and Relational Operators, Mixed Operands, Type Conversion,
2 CO‐2 Syllabus Logical Operators, Bit Operations, Assignment Operator, Operator precedence
and associatively.

Conditional Branching: Applying if and Switch Statements, Nesting if and

Else and Switch.
Statement Use looping control instructions, arrays and structures to develop programs.
Iteration and Loops: Use of While, do While and for Loops, Multiple Loop
Variables, Use of Break, Goto and Continue Statements.
3 CO‐3 Syllabus
Arrays: Array Notation and Representation, Manipulating Array Elements,
using Multi-Dimensional Arrays. Character Arrays and Strings, Structure,
union, Enumerated Data types, Array of Structures, Passing Arrays to
Functions.
Statement Decompose a problem into functions and synthesize a complete program.
Functions: Introduction, Types of Functions, Functions with Array,
Passing Parameters to Functions, Call by Value, Call by Reference,
4 CO‐4 Syllabus Recursive Functions.

Basic of searching and Sorting Algorithms: Searching & Sorting

Algorithms (Linear Search, Binary search, Bubble Sort, Insertion and
Selection Sort)
Statement Utilize pointer, file handling, dynamic memory allocation to solve problems.
Pointers: Introduction, Declaration, Applications, Introduction to Dynamic
Memory Allocation (Malloc, Calloc, Realloc, Free), String and String
5 CO‐5 Syllabus functions, Use of Pointers in Self‐Referential Structures, Notion of Linked
List
(No Implementation)

File Handling: File I/O Functions, Standard C Preprocessors, Defining and

Calling Macros and Command‐Line Arguments.

Er. Navnish Goel

Assistant Professor, Department of Computer Science Engineering
IIMT ENGINEERING COLLEGE, MEERUT
[email protected] Page 1
 Er. Navnish Goel
Assistant Professor, Department of Computer Science Engineering
IIMT ENGINEERING COLLEGE, MEERUT
[email protected] Page 2
 PROGRAMMING FOR PROBLEM SOLVING - BCS 201
Program Outcomes (POs)
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering
sciences.
PO3 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.
PO4 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.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and
IT tools including prediction and modelling to complex engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
PO7 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.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams,
and in multidisciplinary settings.
PO10 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.
PO11 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.
PO12 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 Educational Objectives (PEOs)

To provide our graduates a concrete understanding of fundamental concept of computer science and
PEO1
engineering by providing sustainable quality education to meet industry requirement.
To provide our graduates with an education ensuring an adequate foundation in science and mathematics
PEO2
relevant to computing and also to pursue higher studies.
To provide technical knowledge to enhance the analysis and design skill for implementation, formulating
PEO3
and solving multidisciplinary computing problems.
To produce gradates with adequate cognitive and communication skills, which can function effectively as
PEO4
computer science professionals to fulfil the requirements needed for skilled resources.
To prepare graduates with awareness of lifelong learning with an understanding of their ethical and social
PEO5
responsibility to become responsible citizen.

Program Specific Outcomes (PSOs)

PSO1 Ability to understand, apply and analyse computational multimedia, web designing, Data Science, and
networking on the systems having different degree of complexity.
PSO2 Ability to apply standard practices and methodologies in software development and project management
using learned concepts and skills to deliver a quality product.
PSO3 Ability to employ contemporary computer languages, environment and platforms towards enriched career
opportunities and zeal for higher studies.

Er. Navnish Goel

Assistant Professor, Department of Computer Science Engineering
IIMT ENGINEERING COLLEGE, MEERUT
[email protected] Page 3
 Course Outcome:
Course Course Outcome Statement Blooms
Outcome Taxonomy
CO1 To Develop Simple Algorithms for Arithmetic and Logical Problems. K2, K3
CO2 To Translate the Algorithms to Programs & Execution (in C Language). K3
CO3 To Implement Conditional Branching, Iteration and Recursion. K3
To Decompose a Problem into Functions and Synthesize a Complete Program
CO4 K4
using Divide and Conquer Approach.
CO5 To Use Arrays, Pointers and Structures to Develop Algorithms and Programs. K2, K3
KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-POs and CO-PSOs Mapping Matrices

Course Program Outcome (PO) Program Specific

Outcome (PSO)
Outcome

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 2 3 2 - - - - - - 1 2 3 2 2

CO2 3 2 3 2 - - - - - - 1 2 3 2 2

CO3 3 2 3 2 - - - - - - 1 2 3 2 2

CO4 3 2 3 2 - - - - - - - 1 2 2 1

CO5 3 2 3 2 - - - - - - - 3 1 2 1

PO Target 3 2 3 2 - - - - - - 0.6 2 2.4 2 1.6

WEB SOURCE REFERENCES:

1. https://onlinecourses.nptel.ac.in/noc22_cs45/preview
2. https://www.youtube.com/watch?v=KlX8RSVvVe4

Er. Navnish Goel

Assistant Professor, Department of Computer Science Engineering
IIMT ENGINEERING COLLEGE, MEERUT
[email protected] Page 4
 Lecture Notes Index
L. Content of Syllabus Page Unit
Number Number Number
CO-1: To develop simple algorithms for arithmetic and logical problems.
1. Introduction of subject, Syllabus, COs, Teaching-learning strategy.
Components of a computer system: Memory, processor, I/O Devices,
2.
storage. UNIT 1
3. Operating System and its functions.
4. Idea of Algorithm: Representation of Algorithm, Pseudo code, Flowchart.
CO-2: To translate the algorithms to programs & execution (in C language).
Programming Basics: Concept of assembler, compiler, interpreter, loader
5.
and linker Structure of C program, First C program
6. Compilation and Execution steps, Errors
Components of C language, Fundamental Data Types, Variables and UNIT 1
7.
Memory locations, Type Conversion
8. Standard I/O in C
9. Storage classes
10. Types of Operators
UNIT 2
11. Operator Precedence and Associativity & Solving Expressions
CO-3: To implement conditional branching, iteration and recursion.
12. Branching: Applying if, if-else and nested if statements with examples
UNIT 2
13. Branching-Applying switch statement, Use of Break & Default
14. Iteration- Loops (While, do while, for,multiple loop variable) UNIT 3
CO-4: To decompose a problem into functions and synthesize a program using D &C approach.
15. Functions Basics: Introduction ,Types of functions
16. Passing Parameters -Call by Value
UNIT 3
17. Passing Parameters - Call by Reference
18. Recursive Functions
CO-5: To use arrays, pointers and structures to develop algorithms and programs.
19. Single Dimensional Arrays: Notation, Manipulation
20. Multi-Dimensional Array: Notation, Manipulation
21. Array and Functions
22. Strings
23. Structure, Array of structures, Self-referential structures
24. Union, Enumerated data types UNIT 4
25. Basic Algorithms: Searching
26. Basic Sorting Algorithms: Bubble
27. Basic Sorting Algorithms: Insertion
28. Basic Sorting Algorithms: Selection
29. Finding roots of equations, Notion of order of complexity
CO-5: To use arrays, pointers and structures to develop algorithms and programs.
30. Pointers: Introduction, Declaration, Applications
Introduction to dynamic memory allocation (malloc, calloc, realloc,
31. free)
32. Notion of linked list (no implementation) UNIT 5
33. File Handling
Standard C preprocessors, Defining and calling macros,
34.
command-line arguments

Er. Navnish Goel

Assistant Professor, Department of Computer Science Engineering
IIMT ENGINEERING COLLEGE, MEERUT
[email protected] Page 5