Maharana Pratap Institute of
Technology
Gorakhnath, Gorakhpur
Department of Computer Science and Engineering
Academic Session: 2024-25 (ODD-SEMESTER)
LESSON PLAN DETAILS
Semester: I Course Code: Course: Programming for Problem Solving
BCS101/BCS- 201
Course Faculty: Tripti Tripathi Contact Hours /week: 4+1 # of credits:
CIE Marks: SEE Marks: Exam Hours: 3
Content delivery by using Chalk & Board, PPT, Video, Book
COURSE SYLLABUS:
Unit # Contents of Module Hrs Cos
Introduction to Components of a Computer System: Memory,
Processor, I/O Devices, Storage, Operating System, Concept of
Assembler, Compiler, Interpreter, Loader, and Linker.
Idea of Algorithm: Representation of Algorithm, Flowchart,
Pseudo Code with Examples, From Algorithms to Programs, Source
1 Code. 8 CO1
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.
Arithmetic Expressions and Precedence: Operators and
Expression Using Numeric and Relational Operators, Mixed
Operands, Type Conversion, Logical Operators, Bit Operations,
2 8 CO2
Assignment Operators, Operator precedence, and Associatively.
Conditional Branching: Applying if and Switch Statements,
Nesting if and Else and Switch.
Iteration and Loops: Use of While, do While, and for Loops,
Multiple Loop Variables, Use of Break, Goto, and Continue
Statements.
3 Arrays: Array Notation and Representation, Manipulating Array 8 CO3
Elements, using Multi-Dimensional Arrays. Character Arrays and
Strings, Structure, union, Enumerated Data types, Array of
Structures, Passing Arrays to Functions.
4 Functions: Introduction, Types of Functions, Functions with 8 CO4
Array, Passing Parameters to Functions, Call by Value, Call by
Reference, Recursive Functions.
Basic of searching and Sorting Algorithms: Searching & Sorting
Algorithms (Linear Search, Binary Search, Bubble Sort, Insertion
and Selection Sort)
Pointers: Introduction, Declaration, Applications, Introduction to
Dynamic Memory Allocation (Malloc, Calloc, Realloc, Free), String
and String Functions, Use of Pointers in Self-Referential Structures,
5 8 CO5
Notion of Linked List (No Implementation)
File Handling: File I/O Functions, Standard C Preprocessors,
Defining and Calling Macros and Command-Line Arguments.
COURSE OUTCOMES:
At the end of the Course, the Student will be able to:
CO- BCS To Develop Simple Algorithms for Arithmetic and Logical
1 101.1 Problems.
CO- BCS To Translate the Algorithms to Programs & Execution (in C
2 101.2 Language).
CO- BCS To Implement Conditional Branching, Iteration and
3 101.3 Recursion.
CO- BCS To Decompose a Problem into Functions and Synthesize a
4 101.4 Complete Program Using Divide and Conquer Approach.
CO- BCS Students will be able to write a server side java application
5 101.5 called Servlet & JSP to catch form data sent from client,
process it and store it on database
Topics to be Developing and contributing to real-world applications,
covered beyond Working on open-source projects
syllabus
Assessment Methodologies:
Sl. No. Description Type
Internal Assessment (Tutorials
1 Direct
/Assignments & Class Tests)
2 University exam Direct
3 Student feedback Indirect
LESSON PLAN
Faculty Signature
Conducted Date
Scheduled Date
C.O. Mapping
References
RBT Levels
Lecture #
Remarks
Topics
I Introduction to CO1
1
Computer Systems
Memory and
2
Processor
I/O Devices and
3
Storage
4 Operating System
5 Tutorial
Assembler, Compiler,
6
Interpreter
7 Loader and Linker
Introduction to
Algorithms,
8
Representation of
Algorithms
Flowchart, Pseudo
9
Code with Examples
10 Tutorial
From Algorithms to
11 Programs, Source code
and Execution
12 Structure of C Program
Writing and Executing
13
the First C Program
Syntax and Logical
Errors in Compilation,
14
Object and Executable
Code
15 Tutorial
Components of C
16 Language. Standard
I/O in C
Fundamental Data
17
types
18 Variables and Memory
Locations
19 Storage Classes
Tutorial
20
Arithmetic
Expressions:
21
Operators
Operators and
Expression Using
22 II Numeric and
CO2
Relational Operators
Mixed Operands, Type
23
Conversion
Logical Operators, Bit
24
Operations
Tutorial
25
26 Assignment Operator,
Operator precedence
27
and Associatively.
Applying if and Switch
28
Statements
Nesting if and Else and
29
Switch.
30 Tutorial
Iteration and Loops:
31 II
I Use of While
do While and for
32
Loops
Multiple Loop
33
Variables
Goto Statements
34
Tutorial
35
36 Continue Statements CO3
Arrays: Array Notation
37
and Representation,
Manipulating Array
38
Elements
39 Multi-Dimensional
Arrays
Tutorial
40
41 Character Arrays and
Strings
Structure, union
42
Enumerated Data
43
types
Array of Structures,
44 Passing Arrays to
Functions
45 Tutorial
Functions:
46
Introduction,
Types of Functions
47
Functions with Array,
48 IV
49 Passing Parameters to
Functions,
CO4
50 Tutorial
Call by Value
51
Call by Reference,
52
Recursive Functions.
53
Searching & Sorting
54 Algorithms (Linear
Search)
Tutorial CO5
55
Searching & Sorting
56 Algorithms (Binary
Search)
Searching & Sorting
57 Algorithms (Bubble
Sort)
Searching & Sorting
58 Algorithms (Insertion
and Selection Sort)
59 Tutorial
60 Pointers: Introduction,
Declaration and
61 Applications of
pointers
Introduction to
62 Dynamic Memory
Allocation
Malloc, Calloc
63
64 Tutorial
V
65 Realloc, Free
String and String
66
functions
Use of Pointers in Self-
67
Referential Structures
68 Notion of Linked List
69 Tutorial
File Handling: File I/O
70
Functions,
Standard C
71
Preprocessors,
Defining and Calling
72
Macros
Command-Line
73
Arguments.
74 Tutorial
75 Revision Class
76 Revision Class
Syllabus for Sessionals:
Sessional Planned Syllabus Actual Syllabus
CT-1 Lecture 1 to 29
CT-2 Lecture 29 to 69
Pre-AKTU Full Syllabus
Literature:
Text Books: (As prescribed by University)
T1. “The C programming” by Kernighan Brain W. and Ritchie Dennis M., Pearson Education
T2. "Programming in ANSI C" by E. Balagurusamy
T3. "Let Us C" by Yashavant P. Kanetkar
Web References:
WR1. https://www.geeksforgeeks.org/
WR2. https://www.tutorialspoint.com/
Sample Questions:
Question Questions
COs
#
UNIT-1
What is digital computer? Draw block diagram of digital computer and
1 CO1
explain each component of each. (AKTU 2016-17 or AKTU 2017-18)
Draw the memory hierarchical structural of a computer system. Explain each
2 CO1
memory unit in brief.
Describe compiler, interpreter, and assembler. Write the names of compiler
3 CO1
that are used in C programming.
What is an algorithm? Give the characteristics of an algorithm. Write an
4 algorithm for printing a table of a given positive integer and also draw the CO1
flow chat for the same.
5 Draw a flowchart to find the sum of digits and reverse of a given number. CO1
6 Difference between logical error and runtime error. CO1
Define datatypes in C. Discuss primitive data types in terms of memory size,
7 CO1
format specifier, and range.
8 What do you mean by scope of a variable. CO1
What is meant by storage class of a variable? define all types of storage
9 CO1
classes with example.
Illustrate and compare the static and extern storage classes with a relevant
10 CO1
example in C.
UNIT-2
Write short notes on operators in C language? What are the different types of
11 CO2
operators.
Write the difference between type conversion and type casting? What are the
12 CO2
escape sequence characters.
Write a program in C to find greatest number among three numbers using
13 CO2
conditional operators.
Write a program to check whether the given character is in upper case, lower
14 CO2
case or non-alphabetic character.
Any year is input through keyboard? Write a program to determine whether
15 CO2
the year is leap year or not.
16 Describe if-else-if ladder. CO2
17 Explain switch statement? With example. CO2
18 Write a program in C to display the prime numbers between 1 to 100. CO2
19 Explain Preprocessor. CO2
Write a C program using switch case to input marks of five subjects Physics,
Chemistry, Biology, Mathematics and Computer, calculate percentage and
grade according to given conditions:
If percentage >= 90% : Grade A
20 If percentage >= 80% : Grade B CO2
If percentage >= 70% : Grade C
If percentage >= 60% : Grade D
If percentage >= 40% : Grade E
If percentage < 40% : Grade F
UNIT-3
How Java TCP Socket works ? Define steps of Socket constructions .
19 CO3
What do you understand by J2EE ? Define N-TIER system .
20 CO3
21 What do you understand by URL Class ? Define URL Connection class . CO3
22 Define Inet address class . CO3
What do you understand by Script Tag .Define ways to implement Java Script
23 Explain Function in Java Script by making a script of addition of two number. CO3
UNIT-4
24 What do you understand by Java Beans ? Define its properties . CO4
What is EJB? Also explain EJB Architecture. And differentiate between Java Bean
25 CO4
and EJB.AKTU 2021
What is JDBC? Name and explain the Drivers used in JDBC. Write a JDBC Program
26 for insert and display the record of employees using prepared statement.AKTU CO4
2020
Explain JDBC application architecture. List the various types of JDBC drivers.
Discuss the steps to connect database with the web application using JDBC.Write
27 CO4
a program to demonstrate how to retrievethe data from a table using JDBC
API.AKTU 2019
What are java Beans? Why they are used? Write a JSP page and use an existing
28 java bean in JSP page by using the standard action. Write the program with CO4
describing the output?
UNIT-5
Explain Servlets with its life cycle. How its life cycle is different from the life cycle
29 CO5
of JSP? Explain with an example.
What do you mean by JSP ? Explain the Architecture of JSP . How JSP provides
30 CO5
better performance .
Course Faculty HOD
