PCTE Institute of Engineering & Technology

Course: BTech- Ist Year

Subject Name: Programming for Problem Solving (Theory)
Subject Code: BTPS 101-18
Semester: 1
Credit: 3
Course Instructor: Er. Neha Sharma

Email Address: [email protected]

Faculty of Computer Science Engineering Page 1

 PCTE Institute of Engineering & Technology

COURSE OUTCOMES

After studying this Course, the Students will be able:

To formulate simple algorithms for arithmetic and logical problems.

To translate the algorithms to programs (in C language).
Test and execute the programs and correct syntax and logical errors.
To implement conditional branching, iteration and recursion.
To decompose a problem into functions and synthesize a complete program using divide and conquer approach.
To use arrays, pointers and structures to formulate algorithms and programs.
To apply programming to solve matrix addition and multiplication problems and searching and sorting problems.
To apply programming to solve simple numerical method problems, namely root finding of function, differentiation of function and simple
integration.

Faculty of Computer Science Engineering Page 2

 PCTE Institute of Engineering & Technology

SYLLABUS
Unit 1 Introduction to Programming (4 lectures)
Introduction to components of a computer system (disks, memory, processor, where a program is stored and executed, operating system, compilers etc.) – (1
lecture).
Idea of Algorithm: steps to solve logical and numerical problems. Representation of Algorithm: Flowchart/Pseudocode with examples. (1 lecture)
From algorithms to programs; source code, variables (with data types) variables and memory locations, Syntax and Logical Errors in compilation, object and
executable code- (2 lectures)
Unit 2 Arithmetic expressions and precedence (2 lectures)
Conditional Branching and Loops (6 lectures)
Writing and evaluation of conditionals and consequent branching (3 lectures)
Iteration and loops (3 lectures)
Unit 3 Arrays (6 lectures) Arrays (1-D, 2-D), Character arrays and Strings

Unit 4 Basic Algorithms (6 lectures) Searching, Basic Sorting Algorithms (Bubble, Insertion and Selection), Finding roots of equations, notion of order of
complexity through example programs (no formal definition required)

Unit 5 Function (5 lectures) Functions (including using built in libraries), Parameter passing in functions, call by value, Passing arrays to functions: idea of
call by reference

Unit 6 Recursion (4 -5 lectures) Recursion, as a different way of solving problems. Example programs, such as Finding Factorial, Fibonacci series, Ackerman
function etc. Quick sort or Merge sort.

Unit 7 Structure (4 lectures) Structures, Defining structures and Array of Structures

Unit8 Pointers (2 lectures) Idea of pointers, defining pointers, Use of Pointers in self-referential structures, notion of linked list (no implementation)

Unit 9 File handling (only if time is available, otherwise should be done as part of the lab)

Faculty of Computer Science Engineering Page 3

 PCTE Institute of Engineering & Technology

Text Books:
(i) Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
(ii) E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill

Reference Books:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.

Faculty of Computer Science Engineering Page 4

 PCTE Institute of Engineering & Technology

EVALUATION CRITERIA

PARAMETER MARKS
Mid Semester Examination 24
Attendance 6
Class Tests/Class Tasks 5
Presentation 5
Total 40

Attendance Policy:
75% attendance in Final Exams is compulsory, failing which the student will not be allowed to sit in the respective examinations.
Appearing and Passing in presentation is mandatory to clear internals.
Disciplined and civilized behaviour is required to be maintained by all.

You must read the college Rule Book thoroughly to avoid any confusion.

Students can score marks in attendance as per the following rule:

Up to 75% - Nil 76% to 80%  -  2 marks

81% to 85%  -  3 marks 86% to 90% -  4 marks

91% to 95%  - 5 marks Above 95% - 6 Marks 

Faculty of Computer Science Engineering Page 5

 PCTE Institute of Engineering & Technology

Presentation Topics:

 Power of Media

 Innovations and Life

 Secular world

 Start-up To Start

 Empty pocket taught a life lesson

 Sales target & life goals

 Importance of Values

 Health vs money
 Poverty doesn’t matter

 Innovation of Science

 A World of E-commerce

 Iot Internet of Things

 An Impact of management failure

Faculty of Computer Science Engineering Page 6

 PCTE Institute of Engineering & Technology

 Social media is our new friend

 Marketing Life Only a Marketer Know

 One step towards success

 Data is the new Oil

 How to Win Friends Easily?
 Latest medical innovation

 Youth and Their Power

 Revelation of technology

 Problem facing teenager today

 True never dies

 World after covid-19

 Life in a Big City

 The Book that has Influenced Me the Most

 Digital world

 Crime in Digital Marketing

 Impact of Covid-19 on Worlds Economy

Faculty of Computer Science Engineering Page 7

 PCTE Institute of Engineering & Technology

 New World of Cryptocurrency

 Army the Backbone of Country

 Life depends upon smile

 Secret of Healthy Life

 Find Happiness for Society

 Millionaire are Alone?

 Technology changes the World

 Bluetooth 5.0

 Li-fi New Wifi Technology

 Entrepreneurship

 Internet breaks relation

 How to Avoid Being Late

 Smiling Therapy Positive Effects on Mental Health

 Virtual Reality and Its Phenomenon
 How volunteering benefits students
 How Music Helps in Learning New Languages
 Left brain versus right brain

Faculty of Computer Science Engineering Page 8

 PCTE Institute of Engineering & Technology

 A new world of weapons

Guidelines for Presentation:

Presentation will be held during the semester about which you will be informed well in advance. The rules for presentation are:

 Each student has to deliver individual presentation.

 The topic of each student will be decided by the Course Instructor.
 The Presentation Topic will be given in advance at least one week before the date of presentation.
 Students must be in strict formals on the day of presentation.
 Six attendances will be taken during two day presentation. First attendance will be taken at 9:00 am sharp, second after tea
break, third attendance after lunch break and fourth attendance at the end of the proceedings of the first day. Fifth attendance
will be taken at start of presentations on second day and sixth attendance will be taken at end of presentations on second day.
 It is COMPULSORY for all the students to deliver the Presentation in order to clear the Internals of that subject.

Note:-

 There will be NO REMAKE of Mid-Semester Examination. The students are advised to appear in all the evaluation parameters with
preparation to avoid any inconvenience.

 If any student is caught copying or using unfair means in any evaluation parameter, then that student will get Internal REAPPEAR in
that subject.

Faculty of Computer Science Engineering Page 9

 PCTE Institute of Engineering & Technology

 The date of conduct of all the Evaluation parameters will be plotted in the Class Calendar. You are supposed to follow the Class
Calendar to keep a track of the date of conduct of all the evaluation parameters.

COURSE PLAN

Subject: Programming for Problem Solving Code: BTPS 101-18

Class: B. Tech (Ist Year) Semester: 1

No. of Lect.: 44 Credits:3

Name of Instructor: Er. Neha Sharma

Lect
Content Activity
No.
1 Introduction to Subject  
2 Introduction to Programming, Importance of Programming  
3 Computer System- Block Diagram  
4 Pseudo code and algorithms  
5 Steps in development of a program, Data Types Algorithm Examples-Practice tasks 
6 Constants, Variables, Symbolic Constants Key Words  Areas of application
7 Operators & Expressions - Arithmetic, Assignment Meaning, Usage and Applications, Implementation 
8 Relational, Logical, Conditional & Unary  Meaning, Usage and Applications, Implementation 
9 Control Statements- if, if-else  Meaning, Usage and Applications, Implementation 
10 Branching - nested if, switch  Implementation using C Programs
11 for loop  Implementation using C Programs
12 while, do-while  Implementation using C Programs
13 break, continue  Implementation using C Programs

Faculty of Computer Science Engineering Page 10

 PCTE Institute of Engineering & Technology

14 Arrays: Defining an Array Meaning, Usage and Applications

15 processing arrays,  Implementation using C Programs
16 passing arrays to a function  Implementation using C Programs
17 multi–dimensional arrays  Sum, Difference, Product
18 Strings: String declaration, Header File  
19 string functions and string manipulation  
1. Steps of Algorithm
20 Linear Search 2. Advantages and Disadvantages of algorithm
3. Practice using numerical problems
21 Binary Search  Applications & Implementation
22 Insertion Sort, Selection Sort  Applications & Implementation
23 Bubble Sort  Applications & Implementation
24 Functions: declaring, accessing functions  
25 passing arguments  
26 Types of argument, function prototypes  
27 passing arrays to a function  
 Scenarios , Implementation & Advantages &
28 Call by Value & Reference Disadvantages
29 Storage Class: Automatic, external and static variables.  Types and Usage
30 Recursion - Uses of Recursion  Meaning, Applications & Implementation
31 Factorial, Fibonacci Series  Mathematical Concept & Implementation using C
32 Ackerman Series  Mathematical Concept & Implementation using C
33 Sort - Quick, Merge  
34 Structures - defining structures  
35 Array of Structures  
36 Accessing Structure Data Members  
37 Comparison between Structure & Union Similarities & Differences
38 Pointers - Declaration and Initialization of Pointer Variables  
39 Self-referencing Pointers  

Faculty of Computer Science Engineering Page 11

 PCTE Institute of Engineering & Technology

1. Introduction
2. Terminology of Linked lists - Head, Pointer, data, etc.
3. Types of Linked Lists- Single Linked lists, Doubly
40,41 Linked List Linked lists, Circular
Linked lists, Header Linked lists with FIGURES
4. Advantages and Disadvantages of various types of
LL.
42,43 File Handling: File Operations  
44 Processing a Data File Reading & Writing to a File

Faculty of Computer Science Engineering Page 12