8/16/22, 7:10 AM

K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2022-2023, Odd Sem
Course Title :COMPUTATIONAL THINKING FOR STRUCTURED DESIGN
Course Code :22SC1101
L-T-P-S Structure : 3-0-2-6
Pre-requisite :
Credits : 5.5
Course Coordinator :SREERAM NIMMAGADDA
Team of Instructors :
Teaching Associates :
Syllabus :Structured Programming Paradigm: Problem Solving Approach, Algorithms and Algorithm
Analysis, Program Development Steps, Structure of C Program, Pre-Processor Directives,
Design of Building
Blocks for solving real world problems: Modularization: Functions, Scope of Variables and Storage classes,
Data Types: Primitive, Extended and Derived Including Pointers,
Operators: Types of operators, Precedence,
Associativity,
User I/O: Formatted I/O, Command line arguments, Redirecting I/O: Files and File Operations.
Logic Design for Computational Thinking:
Control Flow Statements:
Decision Making using conditional
statements, Definite and indefinite Iterative statements.
Recursion, logic building using complex building
blocks.
CRUD operations on Basic Data Structures:
Basic Data Structure: Arrays, 2-D Arrays, Dynamic
Memory Allocation
Searching: Linear Search and Binary Search
Sorting: Bubble Sort
CRUD operations on
Linear Data Structures: Stacks, Queues and Single Linked List. Introduction to Trees.
Text Books :1. Brian W. Kernighan, Dennis M. Ritchie, “The C Programming Language: ANSI C Version”,
2/e, Prentice-Hall/Pearson Education-2005.
2. E. Balagurusamy, “Programming in ANSI C” 4thed.,Tata
McGraw-Hill Education, 2008.
3. R. F. Gilberg, B. A. Forouzan, “Data Structures”, 2nd Edition, Thomson
India Edition-2005.
Reference Books :1. Mark Allen weiss, Data Structures and Algorithm Analysis in C, 2008, Third Edition,
Pearson Education.
2. Horowitz, Sahni, Anderson Freed, “Fundamentals of Data structures in C”, 2nd Edition-
2007.
3. Robert Kruse, C. L. Tondo, Bruce Leung, Shashi Mogalla, “Data structures and Program Design in
C”, 4th Edition-2007.
4. C for Engineers and Scientists – An Interpretive Approach by Harry H. Cheng, Mc
Graw Hill International Edition-2010.
5. Jeri R. Hanly, Elliot B. Koffman, “Problem Solving and Program
Design in C”, 7/e, Pearson Education-2004.
6. Jean Paul Trembly Paul [Link], “An Introduction to Data
Structures with applications”, 2nd Edition.
Web Links :1. [Link]
2. [Link]
3. [Link]
4. [Link]
5.
[Link]
Course Rationale :The course takes an imperative view of problem solving through programming using C
programming language. This necessitates data abstraction, basics of data structures, and an introduction to the
GNU/Linux operating system and programming the medium level language C. Student is professionally
trained in algorithms, flowcharts, analysis of a problem and translating the same into a C program. The
students are made to write C programs on their own for sets of both mathematical and other engineering
problems after exposing them to the different constructs of C language namely Input/output, assignments,
iteration, and control structures. Finally, the student is acquainted with basic data structures like stacks,
queues, lists etc.
Course Objectives :The objective of the course is to equip the student with Design &problem-solving skills
using C Language and associated Data Structures to provide the student details about algorithms used in
typically familiar problems, and a few details about the essential ingredients of the programming language C
and fundamental Data Structures

COURSE OUTCOMES (COs):

1/41
8/16/22, 7:10 AM

CO Course Outcome (CO) PO/PSO Blooms

NO Taxonomy
Level
(BTL)
Develop and apply logical building blocks to solve real world
CO1 PO1,PO2 3
problems
CO2 Apply computational thinking for designing solutions PO2,PO1 3
CO3 Develop and apply the CRUD operations on arrays PO1,PO2 3
CO4 Apply CRUD operations on Linear Data Structures PO4 3
Apply the structured programming paradigm with logic building
CO5 skills on Basic and Linear Data Structures for solving real world PO1,PO2,PO4 3
problems
Skill the students in such a way that students will be able to
CO6 develop logic that help them to create programs as well as PO2,PO4,PO1 3
applications in C

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-1 COI-2 COI-3 COI-4
No. BTL
Btl-3
Btl-1
modularized

problem Btl-2 Design
Describe
Write
programs using code with Decision
solving techniques
CO1 3 Complex Building making constructs in
and translate
blocks with different solving
algorithm/ flowchart
modes of user Input computational
to a C program
problems.
Btl-2

among
Convert
definite and
Btl-1 Btl-3

indefinite iterative
iterative and
Syntactically Design
statements and able
CO2 3 differentiate definite recursive logic to
to write alternate
and indefinite solve real world
logic for a given
iterative statements problems
problem. convert
recursive functions to
iterative statements.
Btl-2 Btl-3
Btl-3
Write
syntactically Apply
CRUD
Apply
DMA to Solve
accurate code for 1-D operations on multi-
real world problems
CO3 3 and 2-D Arrays, dimensional arrays
and perform CRUD
demonstrates using asymptotic
operations on multi-
dynamic memory notations in solving
dimensional Arrays
allocation real world problems.
Btl-1
Write
syntactically Btl-3
Btl-3
accurate code for Apply
CRUD
Apply
CRUD
CO4 3 Implementing
stacks, operations on Linear
operations on stacks,
queues and SLL Data Structures using
queues, and SLL
(with structure asymptotic notations.
pointers
CO5 3 Btl-3
Apply
structured
programming
paradigm with
2/41
8/16/22, 7:10 AM

logical building skills

on basic and linear
data structures for
solving real world
problems
Btl-3
Skill
the students in
such a way that
students will be able
CO6 3
to develop logic that
help them to create
programs as well as
applications in C

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and
PO1
an engineering specialization to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences and
engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design
PO3 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
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
PO4
provide valid conclusions for complex problems that cannot be solved by straightforward application
of knowledge, theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modelling to complex engineering activities with an
understanding of the limitations.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
PO8
engineering practice
Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse
PO9
teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering
PO10 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
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 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.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and lifelong learning in the broadest context of technological change.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.

3/41
8/16/22, 7:10 AM

Lecture Course DELIVERY Plan:

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab End
COI- Structured Programming Semester Exam,Lab In
1 CO1 TB-1 Chalk,PPT,Talk
1 Paradigm Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM1,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab End
Semester Exam,Lab In
COI- Designing Algorithms for
2 CO1 TB-1 Chalk,PPT,Talk Semester Exam,Ratings
1 problem solving
on Global
Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
COI- Designing flowcharts for TB- Assignment,Lab In
3 CO1 Chalk,PPT,Talk
1 problem solving 1/Ch:2/9 Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
Data types: int, int
COI- Semester Exam,Lab In
4 CO1 pointer, float, float T1-PP.1-46 Chalk,PPT,Talk
2 Semester Exam,Ratings
pointer, char, char
pointer
on Global
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

4/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,End Semester
COI- Data types: int array, float TB-1/PP:1- Exam,Home
5 CO2 Chalk,LTC,PPT,Talk
1 array, char array 46 Assignment,SEM-
EXAM1

ALM,Home
Assignment,Lab End
Semester Exam,Lab In
Basic Operators:
COI- TB-1/PP:1- Semester Exam,Ratings
6 CO1 Arithmetic, Relational, Chalk,LTC,PPT,Talk
2 46 on Global
Logical
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
COI- TB-1/PP:1- Exam,Home
7 CO1 Modularization- functions Chalk,PPT,Talk
2 9 Assignment,Lab End
Semester Exam,Lab In
Semester Exam,SEM-
EXAM1

ALM,Home
Assignment,Lab End
Semester Exam,Lab In
COI- Semester Exam,Ratings
8 CO1 Storage classes TB-1/PP-60 Chalk,PPT,Talk
2 on Global
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

ALM,Home
Assignment,Lab In
COI-
9 CO1 User input from console TB-1/PP-5 Chalk,PPT,Talk Semester Exam,Ratings
3
on Global
Platforms,SEM-EXAM1

ALM,End Semester
Exam,Home
Assignment,Lab In
COI- TB-1/PP- Semester Exam,Ratings
10 CO1 User Input from files Chalk,PPT,Talk
3 27-38 on Global
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

5/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
Semester Exam,Lab In
COI- if-else, else if ladder, Semester Exam,Ratings
11 CO1 TB-1/PG:55 Chalk,LTC,PPT,Talk
3 conditional operator on Global
Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,Home
Assignment,Lab In
Semester Exam,Ratings
COI-
12 CO1 Nested if-else, switch TB-1/PG:57 Chalk,LTC,PPT,Talk on Global
3
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
Assignment,Lab End
COI- Increment, decrement
13 CO2 TB-1/PG:46 Chalk,PPT,Talk Semester Exam,Lab In
1 Operators
Semester Exam,SEM-
EXAM1,Skill In-Sem
Exam

ALM,Home
Assignment,Lab In
Semester Exam,Ratings
COI- Iterative statements
- for, TB- on Global
14 CO2 Chalk,PPT,Talk
1 while, do-while 1/PG:60-63 Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
COI- TB-
15 CO2 Loops Chalk,PPT,Talk Assignment,Lab In
1 [Link]-63
Semester Exam,SEM-
EXAM1

6/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
COI- TB- Assignment,Lab In
16 CO2 Nested Loops Chalk,LTC,PPT,Talk
1 1/PG:60-63 Semester Exam,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab In
COI- Semester Exam,Ratings
17 CO2 Bitwise Operators-I TB-1/PG:43 Chalk,LTC,PPT,Talk
2 on Global
Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

COI- ALM,End Semester

18 CO2 Bitwise Operators-II TB-1/PG:43 Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM1

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Expression
Evaluation
COI- Assignment,Lab In
19 CO2 Rules, Operator TB-1/PG:28 Chalk,LTC,PPT,Talk
2 Semester Exam,Ratings
Precedency
on Global
Platforms,SEM-
EXAM1,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
COI- Exercise,Home
20 CO2 Recursion PG:86 Chalk,LTC,PPT,Talk
3 Assignment,Lab In
Semester Exam,SEM-
EXAM1

ALM,Continuous
Evaluation - Lab
COI- Problem solving using Exercise,End Semester
21 CO2 TB-1/PG:86 Chalk,LTC,PPT,Talk
3 recursion Exam,LCE,SEM-
EXAM1,Skilling
Continuous Evaluation

7/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab End
COI- Data types: char
pointer,
22 CO3 PG:76 Chalk,LTC,PPT,Talk Semester Exam,Lab In
2 command line
arguments
Semester
Exam,LCE,Ratings on
Global Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
Assignment,Lab End
Semester Exam,Lab In
COI-
23 CO3 Strings and String library PG:76 Chalk,LTC,PPT,Talk Semester
2
Exam,LIT,Ratings on
Global Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
Assignment,Lab In
COI- 1D Arrays –
creation and Semester Exam,Ratings
24 CO3 pg-56 Chalk,LTC,PPT,Talk
2 insertion on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
COI- Assignment,Lab In
25 CO3 Bubble sort pg-65 Chalk,LTC,PPT,Talk
2 Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

8/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab In
COI- Semester Exam,Ratings
26 CO3 Linear Search pg:67 Chalk,LTC,PPT,Talk
2 on Global
Platforms,SEM-
EXAM2,Skill In-Sem
Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
COI- Assignment,Lab End
27 CO3 Binary search pg:78 Chalk,LTC,PPT,Talk
2 Semester Exam,Lab In
Semester Exam,Ratings
on Global
Platforms,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
COI- Dynamic Memory
28 CO3 pg:76 Chalk,LTC,PPT,Talk Assignment,Lab In
3 Allocation
Semester Exam,SEM-
EXAM2

ALM,End Semester
Exam,Home
COI- 2-D Arrays –
creation and
29 CO4 pg:79 Chalk,LTC,PPT,Talk Assignment,Lab In
3 insertion
Semester Exam,SEM-
EXAM2

ALM,End Semester
COI- 2-D Arrays, Matrix Exam,Home
30 CO3 pg:78 Chalk,LTC,PPT,Talk
3 creation and insertion Assignment,SEM-
EXAM2

ALM,End Semester
Exam,Home
COI-
31 CO3 Matrix Algebra pg Chalk,LTC,PPT,Talk Assignment,Lab In
4
Semester Exam,SEM-
EXAM2

9/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,End Semester
Exam,Home
Assignment,Lab In
COI- Semester Exam,Ratings
32 CO4 Structures pg-88 Chalk,LTC,PPT,Talk
2 on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

COI- ALM,End Semester

33 CO4 Array of Structures pg-88 Chalk,LTC,PPT,Talk
2 Exam,SEM-EXAM2

ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
COI- Semester Exam,Lab In
34 CO4 Structure Pointer pg-90 Chalk,LTC,PPT,Talk
2 Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,Home
COI- Linear Data
Structures TB-2 pg
35 CO4 Chalk,LTC,PPT,Talk Assignment,Ratings on
3 Stacks
using arrays 145
Global Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,Home
Assignment,Lab End
Semester Exam,Ratings
COI- Linear Data
Structures TB-2
36 CO4 Chalk,LTC,PPT,Talk on Global
3 Stacks
using arrays PG:148
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab End
COI- Linear Data
Structures TB-2/PG-
37 CO4 Chalk,LTC,PPT,Talk Semester Exam,Lab In
3 Queue
using arrays 156
Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

10/41
8/16/22, 7:10 AM

Book
Teaching-Learning
[Link]. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]

ALM,Home
Assignment,Lab In
Linear Data
Structures Semester Exam,SEM-
COI-
38 CO4 Single
Linked List - using tb-2pg:176 Chalk,LTC,PPT,Talk EXAM2,Skill In-Sem
3
structures Exam,Skill Sem-End
Exam,Skilling
Continuous Evaluation

ALM,End Semester
Exam,Home
Assignment,Lab End
Semester Exam,Lab In
COI- Delete operation on
39 CO4 TB-2 Chalk,LTC,PPT,Talk Semester Exam,Ratings
3 linked
list
on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
COI- Introduction to nonlinear Assignment,Lab In
40 CO4 TB-2 Chalk,PPT,Talk
4 data
structures Semester Exam,Ratings
on Global
Platforms,SEM-
EXAM2,Skilling
Continuous Evaluation

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Understand concept of structured programming

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
--- NOT
20 Explain structured Programming 2 Talk APPLICABLE
---
--- NOT
20 Need of structured Programming 2 Chalk APPLICABLE
---
--- NOT
5 conclusion 2 Talk APPLICABLE
---

SESSION NUMBER : 2
11/41
8/16/22, 7:10 AM

Session Outcome: 1 Design modularized solutions using algorithmic constructs to solve computational
problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Introduction to Problem Solving
through Algorithms and Flow charts • Introduction to
Algorithms • Understanding how to write Algorithms For
--- NOT
different categories of problems Sequence and selection. •
20 2 Chalk APPLICABLE
Design algorithms for the following [Link] an algorithm
---
to calculate area of a circle. [Link] an algorithm to print
first ‘n’ natural numbers. 3. Write an algorithm and draw a
flowchart to print greatest of two numbers
Practice session: 1. Write an algorithm to calculate simple
--- NOT
interest. 2. Write an algorithm to check if the year is leap
20 2 Talk APPLICABLE
year or not. 3. Write an algorithm to find if the number is
---
positive or negative
--- NOT
10 Conclusion on algorithms 2 Talk APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 Design flow charts to solve real life computational problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Introduction to Problem Solving
through Flow charts • Introduction to Flowcharts and
symbols • Understanding how to draw flow charts for
different categories of problems Sequence and selection. •
Drawing flow charts for algorithms [Link] an algorithm to
calculate area of a circle. [Link] an algorithm to print first
Leading
50 ‘n’ natural numbers. 3. Write an algorithm and draw a 1 Chalk
question
flowchart to print greatest of two numbers Practice session:
1. Write an algorithm and draw a flow chart to calculate
simple interest. 2. Write an algorithm and draw a flow
chart to check if the year is leap year or not. 3. Write an
algorithm and draw a flow chart to find if the number is
positive or negative.

SESSION NUMBER : 4

Session Outcome: 1 Understand Basic Data Types and to create variable of int, float and char data

Session Outcome: 2 Understand the concept and use of pointers of int and float and char data type

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Sub-task-1(Lecture): Introduction to Data Types in C. 2 Chalk Leading
Define Integer data type, and Pointers to int. Define Float question
Data Type, Pointers to float. Define char data type, pointer
to char 1. Write a C Program to create an integer variable
to store Employ ID and a float variable to store Employee
salary and print those values. (Taking input from user).
12/41
8/16/22, 7:10 AM

Sub-task-1(Lecture): Introduction to Data Types in C.

Define Integer data type, and Pointers to int. Define Float
Data Type, Pointers to float. Define char data type, pointer
to char 1. Write a C Program to create an integer variable
to store Employ ID and a float variable to store Employee
salary and print those values. (Taking input from user).
Practice session: . 1. Write a C Program to create two
integers’ variables with values 10 and 20 respectively and
print their sum using integer pointer. 2. Write a C Program
to create two integer variables with values 10 and 20
respectively and swap these integer values. 3. Write a C
program to create an array with 5 float elements in a float
array, find sum and average using float pointer

SESSION NUMBER : 5

Session Outcome: 1 Understand the concept and use of int, float and char arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance 1 Talk APPLICABLE
---
Quiz/Test
10 Quiz 2 LTC
Questions
Sub-task-1(Lecture): Introduction to arrays Define Integer
array Define Float array. Define char array Practice
--- NOT
session: . 1. Write a C Program to store CGPA of 10
35 2 Talk APPLICABLE
Students in a float array. Ask them to print these values 2.
---
Write a C program to create an array with 5 float elements
in a float array, find sum and average using float pointer

SESSION NUMBER : 6

Session Outcome: 1 Use arithmetic, relational, and logical operators

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explanation of arithmetic and relational operators with the
following problems 1. A computer programming contest
requires teams of 5 members each. Write a program that
asks for the number of players and then give the number of
teams and number of players leftover? 2. Ask the students
to write either algorithm or program to find given number
is positive or negative or zero number. Explanation of
--- NOT
logical operators with the following problems 1. Develop a
50 2 Talk APPLICABLE
routine in C that checks the given coordinates point(X,Y)
---
and determine to which quadrant the coordinate point lies
in. 2. An Immigration checking employee in airport
performs the following basic checks in permitting
passengers to waiting hall. (a) Valid passport Id (Ex. 1000
– 5000 ) and (b) Age >=5. The passenger is permitted only
if both the checks are satisfied. Implement a module in C
to perform the above checks.

SESSION NUMBER : 7
13/41
8/16/22, 7:10 AM

Session Outcome: 1 Know the benefits of function in computer programming

Session Outcome: 2 Apply structured programming concepts in solving problems

Session Outcome: 3 Solve computer applications with modular concepts

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub task-1(Lecture): What is a function, necessity of
function, function declaration, definition, function
prototype in C. We will ask students to practice the
Practice session-1 Write a function to calculate value of
(a+b)2 where a and b are two integers. Practice session-2:
Write a function that takes one character as input and --- NOT
50 prints out that character plus the next 5 characters , 3 Talk APPLICABLE
separated by tabs. The function takes one char argument, ---
and returns a char. For example, if the value of the
argument passed to the function was ‘m’, then the function
would print : m n o p q r and return ‘r’. show separately
the function declaration , the function definition and
function invocation.

SESSION NUMBER : 8

Session Outcome: 1 Think in logical way to solve real-time applications using storage classes

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Explanation for usage of storage
classes and types (auto and static with examples. Predict
the output. #include void func(void); int main() { func();
func(); return 0; } void func( ) { static int i = 5; int j=5;
i=i+1; j=j+1; printf("i is %d and j is %d\n", i, j); } Practice
session: 1. Program to perform addition of two numbers
using auto keyword. 2. Write a C program with function
--- NOT
name sample() with no argument and no return type.
50 3 Talk APPLICABLE
sample() function contains auto integer variable ‘a’ and
---
static integer variable ‘b’ with value assigned to 0. print
the value of ‘a’ and ‘b’ and then increment the value of ‘a’
and ‘b’ by 1 where the main() method calls the sample()
function thrice. 3. Predict the output. #include int
nextEven(); void main() { int x=nextEven(); printf(“x is
%d \n”, x); x=nextEven(); printf(“x is %d \n”, x); } int
nextEven() { static int a; a=a+2; return a; }

SESSION NUMBER : 9

Session Outcome: 1 Understand the concept of reading user inputs using Console- Formatted Input

Session Outcome: 2 Develop interactive solutions for real world problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Sub-task-1(Lecture): Explanation about User Input though 3 Talk Leading
• Console- Formatted Input-scanf(). Practice session: 1. question

14/41
8/16/22, 7:10 AM

Pradeep’s basic salary is input through keyboard. His

dearness allowance is 40% of his basic salary and House
Rental Allowance is 20% of his basic salary. Write a
program to calculate his Gross salary. 2. Write a C function
that accepts the following details of a Petrol Consumer
from console and print the same. Petrol details are the
quantity, the price per litre, the percentage discount.

SESSION NUMBER : 10

Session Outcome: 1 [Link] interactive solutions using files for real world problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Explanation about • File- Explanation
of use of files, different file operations(r,w,a+,w+),
fopen(),fclose(),fscanf(),fprintf()) Using File concepts,
perform a simple addition by storing the data into the file
and retrieving it. Practice session: 1. There are two numbers Leading
50 3 Talk
x and y in [Link]. Read these values from [Link] and question
store the values of x and y in [Link]. Write a C
routine to complete the task. 2. Develop a file application to
write ID number and Salary of an employee into the file
and display the employee data on the console.

SESSION NUMBER : 11

Session Outcome: 1 Understand the usage of conditional operator

Session Outcome: 2 Develop solutions using conditional statements

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Ask the student to write an algorithm to illustrate the
following. Indian Cricket Team went to toss with its
opposite team captain. If India wins the toss display “India
selected to bat” otherwise display “India selected to Field”
as the message. Use the above problem to explain the
syntax and execution flow of simple if and if-else --- NOT
50 statements Explain else if ladder with the help of following 3 Talk APPLICABLE
problems 1. To check given input character is vowel or ---
consonant. 2. Write a program to find whether the number
can be divisible by both 5 and 3 or not. Explain
Conditional operator with the following problem: Write a
C program to find biggest of two numbers using
conditional operator.

SESSION NUMBER : 12

Session Outcome: 1 Write solutions using multi conditional statements

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Explanation of nested if else with above problem Write a 3 Chalk --- NOT
program to find biggest of three numbers Explanation of APPLICABLE
15/41
8/16/22, 7:10 AM

switch statement Raja went to Trendset mall on x vehicle ---

to buy dresses for his family. He parked the vehicle in
malls paid parking area and completed shopping. After he
returns he has to pay for the parking. Now you have to
calculate the parking charges for the vehicle. Enter the
type of the vehicle as a character(c for car, b for bike, a for
auto).you have to read the hours and minutes when the
vehicle enters the parking slot and when it is leaving.
Write a C program to Calculate the total parking fees. The
Trendset mall has fixed the rates as shown below.(Using
nested if else) Vehicle name Rate till 3 hours Rate after 3
hours Truck/Auto 20 30 Car 10 20 Motorcycle/Scooter 5
10

SESSION NUMBER : 13

Session Outcome: 1 Apply increment and decrement operators to solve problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Introduction to Increment and
Decrement operators 1) What will be the result after
executing the program? main() { int a=10;
printf(“%d”,a++); printf(“%d”,++a); printf(“%d”,a);
printf(“%d”,a--); printf(“%d”,--a); printf(“%d”, Practice
--- NOT
Session : 1) What will be the result after executing the
50 2 Talk APPLICABLE
program? main() { int a=10,b=11,c=12,d=13,e; e=a++ + --
---
b - ++c + d--; printf(“%d”,e); } 2) Predict the output for
the following program. main() { int a=5; int b= ++a + ++a
+ ++a; printf(“%d %d”,b,a); } 3) What will be the result
after executing the program? main() { int a=5;
print(“%d%d%d”, ++a , a , a++); }

SESSION NUMBER : 14

Session Outcome: 1 Develop iterative solutions to solve real world problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Introduction of iterative statements (for, while, do-while)
Explanation of While and for loops syntax and flow chart
1. Write a program to print numbers from 1 to n using
while loop and for loop 2. Give a task to students to print
Leading
50 first n even numbers using while loop and for loop 1. Write 2 Talk
question
a C program to enter any number and calculate sum of its
digits 2. Write a program to print multiplication table up to
N multiples 3. Write a program to print Fibonacci sequence
up to N terms Compare while loop with for loop

SESSION NUMBER : 15

Session Outcome: 1 Differentiate while and do-while structures

Session Outcome: 2 Write solutions using do-while loop

Time(min) Topic BTL Teaching- Active

16/41
8/16/22, 7:10 AM

Learning Learning
Methods Methods
Sub-task1(Lecture): Explain the syntax of do-while loop.
Explain flowchart for do-while loop. Differentiate while
and do-while loops. 1. Write a program to print all
accepted integer numbers each in a new line, until user
enters zero using do-while construct 2. Write a program to
print all the even numbers in the given range using do-
while Practice session: 1. Write a C program to
demonstrate do-while for following scenario: The loop
needs to have a counter starting at zero that increment
every time the loop is executed. Inside the loop there need
to be a variable (say x), which is initially set at 1, that
doubles each time the loop is executed. The loop needs to
continue until the doubling variable exceeds given integer
(say n).Once the loop terminates, then return the counter.
Print x values. Sample input: Enter a number (for n):50
Sample output: 2 4 8 16 32 2. Create an equivalent of four
function calculators. The program should request the user Leading
50 2 Talk
to enter two numbers and an operator. It should carry out question
specified arithmetic operation on the two numbers(use
switch case).After displaying the result, the program
should ask the user if he/she wants to do another
calculation. If 'y', make it perform another operation.
Sample input: + 5 6 Do you want to continue(y/n):n
Sample output: Addition performed:11 3. Read a positive
integer value, and compute the following sequence: If the
number is even, halve it; if it's odd, multiply by 3 and add
1. Repeat this process until the value is 1, printing out each
value. Sample output: Initial value of n: 9 Next value is 28
Next value is 14 Next value is 7 Next value is 22 Next
value is 11 Next value is 34 Next value is 17 Next value is
52 Next value is 26 Next value is 13 Next value is 40 Next
value is 20 Next value is 10 Next value is 5 Next value is
16 Next value is 8 Next value is 4 Next value is 2 Final
value 1

SESSION NUMBER : 16

Session Outcome: 1 Write solutions using nested loops

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Quiz/Test
20 Quiz 2 LTC
Questions
Explanation of nested loops 1. Write a program to print
following pattern. 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 2. Write a --- NOT
30 program to print prime numbers up to n 3. Write a program 2 Talk APPLICABLE
to print following pattern A B C D E F G H I J Conclusion ---
on loops

SESSION NUMBER : 17

Session Outcome: 1 Use bitwise operators

Time(min) Topic BTL Teaching- Active

Learning Learning
17/41
8/16/22, 7:10 AM

Methods Methods
Explain Bitwise operators Bitwise AND(&) Bitwise OR(|)
Bitwise Not(~) Ask the students to practice the following
problems 1. Void main() { int a=12,b=25; --- NOT
50 printf(“a&b=%d”,a&b); printf(“a|b=%d”,a|b); 2 Talk APPLICABLE
printf(“~a=%d”,~a); printf(“~b=%d”,~b); } 2. Write a C ---
Program to simulate AND, OR and NOT logic gates by
allowing the user input binary values for A and B

SESSION NUMBER : 18

Session Outcome: 1 Use bitwise operators

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explain Bitwise operators Bitwise XOR (^) Bitwise Left
shift (<<) Bitwise Right shift (>>) 1. Swap two values by
using XOR operators. 2. Ask student to solve the following --- NOT
50 problem: Void main() { int a=212,b,c; b=a<<2; c=a>>3; 2 Talk APPLICABLE
printf(“b=%d,c=%d”,b,c); } 3. Ask the student how to ---
double and half the values by using bitwise left shift and
right shift operators conclusion

SESSION NUMBER : 19

Session Outcome: 1 understand the precedence and associativity of C operators

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Evaluate the following expression using BODMAS rule.
7+(8%3)-12*30/6. Explain operator precedence and
associativity 1. find o/p of following: void main() { Int
--- NOT
a,b=3; char c=’a’; a=b+c; printf(“%d\n”,a); } 2. Write a C
50 3 Talk APPLICABLE
Program to find out Reynold Number, Prandtl No., Heat
---
Transfer Coefficients, Catalyst Surface temperature. 3.
Write a C Program for "Newton Raphson" method (To find
out the root of the equation).

SESSION NUMBER : 20

Session Outcome: 1 Implement concept of recursion to solve real world problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explain what a recursion is & how recursive functions
work? 1. Write a C program to find nth term in Fibonacci Leading
50 3 Talk
Series using Recursion. 2. Write a program to print the sum question
of natural numbers using recursion conclusion

SESSION NUMBER : 21

Session Outcome: 1 Apply concepts of recursion and iterations to solve problems

Time(min) Topic BTL Teaching- Active

Learning Learning
18/41
8/16/22, 7:10 AM

Methods Methods
Sub-task-1(Lecture): Explain about difference between
iterative and recursive solution. Explain Iterative solutions
to recursive solutions. 1. Write a program to find the
factorial of a given number using recursion 2. Ask the
student to write the program to displays integers 100
through 1 using Recursion and Iteration Practice Session:
1. Ask the student to write the implementation of finding
--- NOT
factorial of number using recursion as well as iteration 2.
50 3 Talk APPLICABLE
Write a C program to count digits of a number using
---
Recursion and Iteration. 3. Write a C program to find sum
of all digits using Recursion and Iteration. 4. Ask the
student to Calculate power of a number program using
Recursion and Iteration 5. [Link]
programs/[Link] the student to
write C program to calculate length of the string using
Recursion and Iteration

SESSION NUMBER : 22

Session Outcome: 1 To Build problems on char data type, char array, char pointer

Session Outcome: 2 use command line arguments

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explanation of char data type, char array, char pointer
Develop a function that takes character as an argument and
displays the keyed-in character along with previous and
next characters as per ASCII values. Explain about
command line arguments Practice Session: 1. Develop a
program which initializes character array with set of n --- NOT
50 characters and display the sum of all characters as per their 2 Talk APPLICABLE
ASCII values. 2. Develop a program which initializes ---
character array with set of characters and create a character
pointer and display the second and third character of
character array using character pointer. 3. Write a C
program which read 3 numbers through command line
arguments and print the sum of three numbers.

SESSION NUMBER : 23

Session Outcome: 1 Apply string library function

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Sub-task-1(Lecture): Explanation of String and Library 3 Talk --- NOT
functions (strlen(), strrev(), strcat(), strcpy(), strcmp()etc..) APPLICABLE
with the help of following problem Develop a program to ---
read two strings which can perform following operations •
Finding the string length • Comparing two strings •
Appending second string to first string • Reverse the string
• Palindrome 25 Practice session: 1)Write a program to
read a string and find out a word is present in that string
and also print starting index of the word using strstr().
Input: Str1=” Was this the face that launch'd a thousand
19/41
8/16/22, 7:10 AM

ships”; Str2=”face”; Output: String 'face' was found at

position 14 in string 'Was this the face that launch'd a
thousand ships'. 2)Write a program to declare to three
strings and take input into two strings and concatenate two
strings into the third string in one line of code Input:
Str1:The face of the ship Str2:is too wide Str3:Empty(It
should contain the concatenated string) Output: Str3
should print “The face of the ship is too wide” 3)Wrtite a
program to compare two different strings upto nth
character(Hint: strncmp(str1, str2,BUFFERSIXE))

SESSION NUMBER : 24

Session Outcome: 1 Understand and implement 1D arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Read 100 numbers, compute their
average, and determine how many numbers are above the
average. Explain need of arrays, array definition and
declaration. Input/output statements and how to use it in
coding. Practice session: 1. A competition is conducted in
two different galleries of the venue. Just for the ease of
their management, the Event organizers have announced to
divide the children into two groups, to attend the
competition in the two chosen galleries. By that note, all
those children who have their registration code as an even
number will be put in one gallery and those with odd
number will be in another gallery. Help the organizers to
find count of number of even registration codes and odd
registration codes from the total N. Note: The registration
code need not be unique as each child will have a unique --- NOT
50 school code. Input Format: The first line of input consists 2 Talk APPLICABLE
of a single integer N denoting the number of registration ---
codes issued for the competition. The second line of input
consists of N space separated integers, denoting the
registration codes of each child. Output Format: Output a
single with the count of even numbers and odd numbers
from N, separated by a single space. Refer sample input
and output for formatting specifications. Sample Input 1: 3
1 4 10 Sample Output 1: 2 1 Sample Input 2: 5 2 6 23 12
11 Sample Output 2: 3 2 Reference: [Link] 2.
Given a non-empty array, return true if there is a place to
split the array so that the sum of the numbers on one side is
equal to the sum of the numbers on the other side.
canBalance([1, 1, 1, 2, 1]) → true canBalance([2, 1, 1, 2,
1]) → false canBalance([10, 10]) → true Reference:
[Link]

SESSION NUMBER : 25

Session Outcome: 1 Apply Bubble sort to sort array elements.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Sub-task-1(Lecture): In a sports class student are lined up in a 3 Talk --- NOT

20/41
8/16/22, 7:10 AM

random order. Now your given a task of lining up all the students APPLICABLE
in an ascending order of height. Explanation of Bubble Sort ---
passes Practice session: 1. Write a program to arrange the list of
marks in descending order and print highest student marks 2. int
bubblesort(int a[10],int n) { count=0; int swap=1,i;
while(swap!=0) { swap=0; count=count+1; for(i=1;i<=n-1;i++) {
if(a[i]>a[i+1]) { int temp=a[i]; a[i]=a[i+1]; a[i+1]=temp;
swap=1; } } return count; } For the given inputs n=5 and array
elements a[5]={1,3,2,5,4}, what the above function will return.
3. A new deadly virus has infected large population of a planet.
A brilliant scientist has discovered a new strain of virus which
can cure this disease. Vaccine produced from this virus has
various strength depending on midichlorians count. A person is
cured only if midichlorians count in vaccine batch is more than
midichlorians count of person. A doctor receives a new set of
report which contains midichlorians count of each infected
patient, Practo stores all vaccine doctor has and their
midichlorians count. You need to determine if doctor can save all
patients with the vaccines he has. The number of vaccines and
patients are equal. Input Format: First line contains the number
of vaccines - N. Second line contains N integers, which are
strength of vaccines. Third line contains N integers, which are
midichlorians count of patients. Output Format: Print a single
line containing ′Yes′ or ′No′. 5 123 146 454 542 456 100 328 248
689 200 Output: NO Ref:
[Link]
sort/practice-problems/algorithm/save-patients/

SESSION NUMBER : 26

Session Outcome: 1 Apply linear search operation on array

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task 1(Lecture): Suppose you use Uber application as a
ride and you request a ride to go from one place to another.
Your driver just arrived at the parking lot of your place.
The only thing you know about the ride is the license plate
number. How do you find your Uber ride? Explanation on
Searching an element in a array by using Linear Search and
its Time Complexity. 1. You have been given an array of
size N consisting of integers. In addition, you have been
given an element M you need to find and print the index of
the last occurrence of this element M in the array if it exists Leading
50 3 Talk
in it, otherwise print -1. 2. The couples and singles are question
participating in a TV show. Write a program to help the TV
show manger to identify the count of couples participated
in the show. Assume the couples are given with same
identity number. 3. Given A Series Of N Positive Integers
a1,a2,a3........an. , Find The Minimum And Maximum
Values That Can Be Calculated By Summing Exactly N-1
Of The N Integers. Then Print the respective Minimum and
Maximum Values As A Single Line Of Two Space-
Separated Long Integers.

SESSION NUMBER : 27

Session Outcome: 1 Apply binary search operation on array

21/41
8/16/22, 7:10 AM

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): we have a book which has
42949672960 pages. We also have a table of contents. Now
we want to read the content on page 104000. How do we do
that? Explain Divide and Conquer Concept. Introduction to
Binary Search, Binary Search algorithm with recursive and
with Iterative and its time complexity. Practice session: 1.
Write a C Program to read N integers in an array and search
key element. Print the position of searching element if
found, print “Element Not Found” otherwise. 2. Monk and
his friend Micro are on a quest to find the answer of Life,
Universe and Everything. In order to complete it they need
to answer Q queries on an array A having N integers. The
queries can be of following two types: 0 x: Find the number
of numbers in A which are not less than x. 1 x: Find the
number of numbers in A which are greater than x. Help them
complete the quest and be back in time for the next Code --- NOT
50 Monk Challenge. Input First line consists of a single integer 3 Talk APPLICABLE
denoting N. Second line consists of N space separated ---
integers denoting the array A. Third line consists of a single
integer denoting Q. Each of the following Q lines consists of
a query of one of the given two types. 4 1 2 3 4 3 0 5 1 3 0 3
Output 0 1 2 Ref:
[Link]
search-2-cff3fa01/ 3. Cool boy goes to buy soap from a
shop. The shop contains N soaps. The prices of soap are
given in the form of an array A. The price of ith soap is A[i].
Now cool boy has q queries, in each query he wants to know
the number of soaps that have price less than the given
amount M. Input: First line contains integer N total number
of soaps available in the shop. Second line contains N space
separated integers. Third line contains Q number of queries.
Each of the next Q lines contain integer M. 5 1 4 10 5 6 4 2
3 5 11 Output: 1 1 2 5

SESSION NUMBER : 28

Session Outcome: 1 Implementing and solving problems through DMA operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Quiz/Test
20 Quiz 2 LTC
Questions
30 Sub-task-1(Lecture): Identify error in the following 2 Talk --- NOT
statement? int a[5]; a[7]=15; Explanation of Dynamic APPLICABLE
Memory Allocation and its functions ---
malloc(),calloc(),realloc(),free() Practice session: 1. Given
an int array, return a new array with double the length
where its last element is the same as the original array, and
all the other elements are 0. makeLast([4, 5, 6]) → [0, 0, 0,
0, 0, 6] makeLast([1, 2]) → [0, 0, 0, 2] makeLast([3]) →
[0, 3] Ref: [Link] 2. Write a program that
reads 10 numbers and displays distinct numbers (i.e., if a
number appears multiple times, it is displayed only once).

22/41
8/16/22, 7:10 AM

(Hint: Read a number and store it to an array if it is new. If

the number is already in the array, discard it.

SESSION NUMBER : 29

Session Outcome: 1 Implement 2Dimensional Arrays and Multidimensional arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Read 4 subject marks of five students
and calculate highest mark in each subject. Explain 2D
array (Multidimensional array) with syntax, memory layout
and initialization in different ways with suitable examples.
Practice session: 1. The world contains 10 countries each
country is suffering with 3 different types of viruses
(corona,Ebola,swine flu) Write a program to print a) The
total no of persons infected in each country. b) The total no
Leading
50 of infected persons of each virus. (Medium) 2. In a small 3 Talk
question
college there are 5 faculty. Each faculty is supposed to
teach three different subjects like C, C++, JAVA. The
college management collected feedback from students. Of
all 5 faculty from 3 different subjects. Write a C program to
print a. The total count of faculty who got more than
average feedback inJAVA subject. b. Printthe 2 highest
feedbacks among all the subjects of all the faculty.
(Medium) Problem Discussion

SESSION NUMBER : 30

Session Outcome: 1 Write programs with 2D arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explanation of 2D Array and its syntax with following
example A and B are two m x n matrices. Find the third
matrix C= A+B. write algorithm for matrix addition.
--- NOT
Practice problem: The world contains 10 countries each
50 3 Talk APPLICABLE
country is suffering with 3 different types of viruses
---
(corona, Ebola, swine flu) Write a program to print a) The
total no of persons infected in each country. b) The total no
of infected persons of each virus.

SESSION NUMBER : 31

Session Outcome: 1 Implement addition, subtraction, and multiplication operations on 2D Matrices

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Practice Session: 1. Write a program that contains 0’s and 3 Talk Quiz/Test
1’s into a 4-by-4 square matrix, prints the matrix, and finds Questions
the rows, columns, and diagonals with all 0s or 1s. Here is a
sample run of the program: 0111 0000 0100 1111 All 0's on
row 1 All 1's on row 3 2. You are given a two-dimensional
3*3 array starting from A [0][0]. You should add the
alternate elements of the array and print its sum. It should
23/41
8/16/22, 7:10 AM

print two different numbers the first being sum of A 0 0, A 0

2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 [Link]
Format: First and only line contains the value of array
separated by single space. Output Format: First line should
print sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 Second line
should print sum of A 0 1, A 1 0, A 1 2, A 2 1 SAMPLE
INPUT: 1 2 3 4 5 6 7 8 9 SAMPLE OUTPUT: 25 20 Ref:
[Link]
structures/arrays/multi-dimensional/practice-
problems/algorithm/add-alternate-elements-of-2-
dimensional-array/ Enter a number between 0 and 511: 7 0 0
0 0 0 0 1 1 1 Ref:Textbook , “programming in c “ by Dinel
Lingue 3. An n * n matrix is called a positive Markov
matrix, if each element is positive and the sum of the
elements in each column is 1. Write a program to check
whether a matrix is a Markov matrix:

SESSION NUMBER : 32

Session Outcome: 1 Illustrate the usage of Structures

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Explanation of structures and discuss
the implementation of user defined data-type ‘struct’.
Study the information displayed on ID card and analyzes
their types of data values. Now discuss how to store the --- NOT
50 above information into a record format. Practice session: 3 Talk APPLICABLE
1. Identify the storage details of account holders of ---
specified Bank branch, Vijayawada. 2. Define a structure
for Book Specifications like title, author, subject and cost.
Read the details from console then display the details.

SESSION NUMBER : 33

Session Outcome: 1 Solve real world problems using structure arra

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Explanation of array of structures
(how to declare, how to initialize, how to access elements)
Define a structure Bank with members
Name,AccountNo,Branch,BranchCode, Balance and read 2
records and display them using structure array Practice
session: 1. Define a Structure Student with Name, Age,
Marks, ID using appropriate Data Type and Size as
Members. Implement function to store 2 student records and
Leading
50 read records and display those details. 2. Define a Structure 3 Talk
question
Employee with ename,eid,Salary using appropriate Data
Type and Size as Members and read 2 employee records and
display the record of an employee whose salary is 60000. 3.
Define a Structure Student with Name, Age, Marks, ID
using appropriate Data Type and Size as Members.
Implement function to store 2 student records and read
records and display the record of student whose age is
greater than 20.

24/41
8/16/22, 7:10 AM

SESSION NUMBER : 34

Session Outcome: 1 Solve real world problems using Structure pointers

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task-1(Lecture): Explanation of structures and
pointers to structure Practice session: 1. Define a structure
COMPLEX whose fields are real and imaginary parts of a
complex number. Write a program to find sum of two --- NOT
50 complex numbers using pointers to structures. 2. Define a 3 Talk APPLICABLE
structure ADDRESS with following fields: street, block, ---
area, country and pin code. Write a program to take input
and print address of two persons using pointers to
structures.

SESSION NUMBER : 35

Session Outcome: 1 Examine the rules to be imposed over collection to convert it into Stack data structure.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task 1(Lecture): Introduction to data structures. Types
of data structures. Introduction to stack data structure and
operations on stack data structure (Push, Pop, and Display
Operations) with the help of example below: Consider an
initially empty stack S stored in array S[0..5]. Assume the
TOP be the pointer that points to topmost element on stack.
TOP is initialized to -1. Show the value of TOP after each
statement has been executed. Indicate any errors that might
Leading
50 occur. Push( 4); Push(1); Push(20); Push(-50); Push(120); 2 Talk
question
Push( 230); int de1 = Pop(); int de2 = Pop(); int de3 =
Pop(); int de4 = Pop(); int de5 = Pop(); int de6 = Pop();
Practice session: 1. Ask the student to write functions for
push(), pop( ) and display( ). 2. Ask the students to write
program to design a stack that retrieves the minimum
element in constant time. [Link] the students to write a
program that uses stack data structure to print the prime
factors of given positive integer in descending order.

SESSION NUMBER : 36

Session Outcome: 1 Sketch and implement stack data structure and its operations

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
50 Practice session: 1. Given the following sequence of letters 3 Talk --- NOT
and asterisks: COR*O*NAV***IR***US*** Consider the APPLICABLE
stack data structure, supporting two operations push and ---
pop. Suppose that for the above sequence, each letter (such
as C) corresponds to a push of that letter onto the stack and
each asterisk (*) corresponds a pop operation on the stack.
Show the sequence of values returned by the pop
operations 1. Develop a C routine which accepts a string
and checks whether the string is palindrome or not using
25/41
8/16/22, 7:10 AM

stack data structure. Example-1: Please enter the string:

palace The string is not a palindrome. Example-2: Please
enter the string: racecar The string is a palindrome. 2.
Implement a program in C to input a two-digit number and
store all its divisors in a stack. The program should display
divisors. 3. Consider the following sequence of push and
pop operations on an initially empty stack S. S =
push(S,1); S = pop(S); S = push(S,2); S = push(S,3); S =
pop(S); S = push(S,4); S = pop(S); S = pop(S); Outline
each operation and write the correct order of the values
popped. 4. Implement a C routine compare () that
compares two stacks and returns 0 if they are equal?

SESSION NUMBER : 37

Session Outcome: 1 Apply operations on queue dtata structure

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Sub-task 1(Lecture): Explanation on Queue Linear Data
structure. Explain the method of inserting and deleting into
Queue with the help of example below: Suppose that Q is
an initially empty array-based queue of size 3. Show the
values of the data members front and back after each
statement has been executed. Indicate any errors that might
occur. Queue Q[3] ); front = _____ back = _____
[Link] ( 30120 ); front = _____ back = _____
[Link] ( 30541); front = _____ back = _____
[Link] ( 40850 ); front = _____ back = _____
[Link] ( 10020 ); front = _____ back = _____ int de1
--- NOT
= [Link]( ); front = _____ back = _____ [Link]
50 3 Talk APPLICABLE
(31252 ); front = _____ back = _____ int de2 =
---
[Link]( ); front = _____ back = _____ int de3 =
[Link]( ); front = _____ back = _____ int de4 =
[Link]( ); front = _____ back = _____ [Link]
(70024 ); front = _____ back = _____ Practical Session:
[Link] a struct named as Queue. Define the operation
such as Enqueue( ), Dequeue( ) and Display( ) to insert an
element, to delete an element and to display the element in
the Queue. Check the Queue is full or empty by defining
two functions as isEmpty( ) or isFull( ). [Link] a program
to print a sequence of fibnoacci number using Queue data
structure.

SESSION NUMBER : 38

Session Outcome: 1 2. Implement create, insert and display operations on single linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Single linked list-Insert Explain SINGLE LINKED LIST:
CREATE, INSERT, DISPLAY Operations Practice --- NOT
50 session: 1. 1. Write a C program to create a single linked 3 Talk APPLICABLE
list and display the elements in the list and also perform ---
insert operation

26/41
8/16/22, 7:10 AM

SESSION NUMBER : 39

Session Outcome: 1 Write syntactically correct delete operation of single linked list

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Quiz/Test
20 Quiz 2 LTC
Questions
--- NOT
10 Explain various kinds of delete operations 2 Talk APPLICABLE
---
Design a function to delete first node in SLL 2. Write a --- NOT
20 function to delete the last node in SLL 3. Write a function 2 LTC APPLICABLE
to delete node at given position in SLL ---

SESSION NUMBER : 40

Session Outcome: 1 Understand trees and tree terminology

Session Outcome: 2 Construct different kinds of binary trees

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Explain Tree, tree terminology, Tree nomenclature, Binary --- NOT
25 tree, Properties of binary tree, Different kinds of binary 2 Talk APPLICABLE
Tree ---
1. Construct a complete binary tree from given elements --- NOT
25 10,30,5,15,25,36. 2. Construct a full binary tree from the 2 Talk APPLICABLE
folllowing list of elements 1,2,3,4,5,6,7,8,9 ---

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

Tutorial
Session Topics CO-Mapping
no

1 Algorithms & Flowcharts CO5

2 Data Types CO5

3 Modularization and Storage classes CO5

4 conditional statements and input, output CO5

5 Loop statements- while CO5

6 Loop statements- for CO5

27/41
8/16/22, 7:10 AM

Tutorial
Session Topics CO-Mapping
no

7 Recursion CO5

8 Strings CO5

9 1-D arrays CO5

10 2-D Arrays CO5

11 structures and stack CO5

12 Queue CO5

13 Linked List CO5

Practical Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Design and draw flowcharts to solve computational problems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
1. Write an algorithm to find sum of natural numbers. 2.
50 2 LTC APPLICABLE
Write an algorithm to convert radians into tan degree
---
--- NOT
3. Write an algorithm and flowchart to generate
30 2 LTC APPLICABLE
supermarket bill
---
--- NOT
20 viva 1 Talk APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Understand Basic Data Types

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
1. Develop a program to generate electricity bill based on --- NOT
50 units consumed 2. Develop a program to read temperature 2 LTC APPLICABLE
as centigrade and display the suitable message ---
--- NOT
3. Write a program to read (x1,y1) & (x2,y2) from files
30 2 LTC APPLICABLE
and find the distance between two points
---
--- NOT
20 viva 2 LTC APPLICABLE
---

28/41
8/16/22, 7:10 AM

SESSION NUMBER : 3

Session Outcome: 1 Apply modularization to develop programs

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Anuj takes a loan of Rs.7,00,000 to pay his [Link] fees
from his friend at 12.5% rate of interest. He needs to clear
the dues to get the No Objection Certificate. Help him in
--- NOT
finding out the amount to be paid with interest to the bank.
35 3 LTC APPLICABLE
Interest is computed using Simple Interest for a period of 4
---
Years. Pass inputs as parameters to a function name
Simple_Interest which will return the interest to the main
function
Mr. Ravi has prepared a test-1 question paper for 1st year
B. Tech. The test consists of 3 questions with each
question having certain marks assigned to it. However, Mr.
--- NOT
Ravi has assigned distinct marks for each of 3
30 3 LTC APPLICABLE
questions. This means no two questions can have the same
---
marks. Find the minimum and maximum marks that he set
the paper for. Solve this problem using arrays by declaring
the array globally
Six friends go on a trip and are looking for
accommodation. After looking for hours, they find a hotel
which offers two types of rooms — double rooms and --- NOT
25 triple rooms. A double room costs Rs. X, while a triple 3 LTC APPLICABLE
room costs Rs. Y. The friends can either get three double ---
rooms or get two triple rooms. Find the minimum amount
they will have to pay to accommodate all six of them

SESSION NUMBER : 4

Session Outcome: 1 write programs using conditional statements, input and output statements

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Consider a closed circuit containing ten resistors
--- NOT
connected in series with resistances 10, 12, 13, 22, 34, 44,
30 3 LTC APPLICABLE
45, 5, 55, 7 respectively. Write the resistances to a file
---
named [Link] and find the average resistance of the circuit
Your local library needs your help! Given the expected and --- NOT
30 actual return dates for a library book, create a program that 3 LTC APPLICABLE
calculates the fine (if any). ---
Krishna is playing with his mobile and his mother tries to
teach him basic arithmetic calculations in mobile.
Whenever he clicks on + symbol it performs addition
likewise other operations are also explained. Now Krishna --- NOT
30 is assigned to take two numbers and perform the basic 3 LTC APPLICABLE
arithmetic operations. Now your task is to help Krishna in ---
choosing the symbol and its operation. (Hint: + addition, -
subtraction, * multiplication, / division operations using
Switch Statement)
--- NOT
10 Viva 2 Talk APPLICABLE
---
29/41
8/16/22, 7:10 AM

SESSION NUMBER : 5

Session Outcome: 1 write programs using loops

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Shivam is the youngest programmer in the world, he is just
12 years old. Shivam is learning programming and today --- NOT
30 he is writing his first program. The task is very simple: 2 LTC APPLICABLE
given two integers A and B, write a program to add these ---
two numbers and output it.
The Fibonacci numbers, commonly denoted F(n) form a
sequence, called the Fibonacci sequence, such that each --- NOT
30 number is the sum of the two preceding ones, starting from 3 LTC APPLICABLE
0 and 1. That is, F (0) = 0, F (1) = 1 F(n) = F (n - 1) + F (n ---
- 2), for n > 1. Given n, calculate F(n).
Ravi likes printing tables. So, whenever he finds a number, --- NOT
30 he will print a table for it. Given an integer, n, print its first 3 LTC APPLICABLE
10 multiples ---
--- NOT
10 Viva 2 LTC APPLICABLE
---

SESSION NUMBER : 6

Session Outcome: 1 write programs using loops

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
On the eve of Diwali, Hari is decorating his house with a
serial light bulb set. The serial light bulb set has N bulbs
placed sequentially on a string which is programmed to --- NOT
30 change patterns every second. If at least one bulb in the set 2 LTC APPLICABLE
is on at any given instant of time, how many different ---
patterns of light can the serial light bulb set produce?
Note: Lighting two bulbs *-* is different from **-
Hari wants to construct a staircases pattern using the ′#’ --- NOT
30 symbol. He is very busy at CRT training. Your task is to 3 LTC APPLICABLE
help Hari to print this staircase pattern ---
Sony is writing tables by inputting two numbers (e.g., 4
and 9) and display their math tables up to 10 and she is not --- NOT
30 interested to display the values when multiplier and 3 LTC APPLICABLE
multiplicand are the same. So, by skipping that condition ---
she must display the table

SESSION NUMBER : 7

Session Outcome: 1 write recursive solutions

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
30 Srujan asks his son Arun to calculate the sum of total 2 LTC --- NOT
natural numbers present on the board. Arun starts APPLICABLE
summing the natural numbers and after reaching up to 10 ---
30/41
8/16/22, 7:10 AM

he gets confused and again starts counting from first. Your

task is to help Arun to calculate the sum of total natural
numbers recursively.
Arun's programming tutor challenged him to discover the
--- NOT
power of a number by comparing the iterative and
30 3 LTC APPLICABLE
recursive processes. Assist Arun in discovering the power
---
of a number
The following example calculates the factorial of a given --- NOT
30 number using a recursive function – Finding Factorial 3 LTC APPLICABLE
recursively ---
--- NOT
10 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 8

Session Outcome: 1 write programs using string

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
30 Length of Last Word 3 LTC APPLICABLE
---
--- NOT
30 Valid Palindrome 3 LTC APPLICABLE
---
--- NOT
20 Equivalent-strings 3 LTC APPLICABLE
---
--- NOT
20 Search Insert Position 3 LTC APPLICABLE
---

SESSION NUMBER : 9

Session Outcome: 1 write programs using arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
30 Add to Array-Form of Integer 3 LTC APPLICABLE
---
--- NOT
30 Linear search 3 LTC APPLICABLE
---
--- NOT
30 Bubble sort 3 LTC APPLICABLE
---
--- NOT
10 Viva 2 Talk APPLICABLE
---

SESSION NUMBER : 10

31/41
8/16/22, 7:10 AM

Session Outcome: 1 use 2-D arrays

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
20 Search in a Sorted Matrix 2 LTC APPLICABLE
---
--- NOT
20 Convert 1D Array Into 2D Array Search a 2D Matrix 3 LTC APPLICABLE
---
--- NOT
60 Boxes through a Tunnel Sinking Ship 3 LTC APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 1 apply CRUD operations on stack

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
30 Structures in C(code chef) 2 LTC APPLICABLE
---
--- NOT
30 Simple stack 2 LTC APPLICABLE
---
--- NOT
30 stack operations 3 LTC APPLICABLE
---
--- NOT
10 Viva 1 Talk APPLICABLE
---

SESSION NUMBER : 12

Session Outcome: 1 Apply operations on Queue

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
50 simple Queue 3 LTC APPLICABLE
---
--- NOT
50 Maximum Element (Queue) 3 LTC APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 1 Apply various operations on SLL

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

32/41
8/16/22, 7:10 AM

50 create and insert node in SLL 2 LTC --- NOT

APPLICABLE
---
--- NOT
50 Delete and Display operation of SLL 3 LTC APPLICABLE
---

Skilling Course DELIVERY Plan:

Skilling
session Topics/Experiments CO-Mapping
no

1 Algorithms CO6

2 Flowcharts CO6

3 Data Types CO6

Skilling Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 write algorithms

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
50 Designing Algorithms 1 Talk APPLICABLE
---
--- NOT
Write an algorithm and flowchart to generate supermarket
50 2 Talk APPLICABLE
bill
---

SESSION NUMBER : 2

Session Outcome: 1 Draw flowcharts

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
50 Flowcharts 2 Talk APPLICABLE
---
--- NOT
50 Flowcharts 2 Chalk APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 use Data Types

Time(min) Topic BTL Teaching- Active

Learning Learning

33/41
8/16/22, 7:10 AM

Methods Methods
Raja wants to become fit for which he decided to walk to
the office and return home by walking. It is known that --- NOT
40 Raja office is X km away from his home. If his office is 2 LTC APPLICABLE
open on 5 days in a week, find the number of kilometers ---
Raja travels through office trips in a week
A Utopian tree sapling with a height of 1 inch is planted --- NOT
30 on day1. The tree grows 2 inches every day. Find the 2 LTC APPLICABLE
height of the tree in centimeters on nth day ---
There is a group of N friends who wish to enroll in a
course together. The course has a maximum capacity of M
students that can register for it. If there are K other
--- NOT
students who have already enrolled in the course,
30 2 LTC APPLICABLE
determine if it will still be possible for all the N friends to
---
do so or [Link] N, M and K - the size of the friend
group, the capacity of the course and the number of
students already registered for the course

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment Assignment
Week Topic Details co
Type No

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
V-
S12,V-
V-S2,V-S5,V-
V-S2,V-S5,V- S16,V- -
S6,V-S9,V-
Theory S6,V-S9,V- S17,V- V-S26 -- V-S14 -- -- -
S10,V-S11,V-
S10,V-S27 S25,V- -
S27
S26,V-
S31
-
Mon Tutorial -- -- -- -- -- -- -- -- -
-
V- V- V- -
V-S1,V-
Lab V-S13 V-S13 S1,V- V-S7 V-S7 S26,V- S26,V- -
S19
S19 S32 S32 -
V-S3,V-S8,V- V-S3,V-S8,V- V- V- V-S4,V- V-S4,V-
-
S21,V-S22,V- S21,V-S22,V- S18,V- S18,V- S15,V- S15,V-
Skilling -- -- -
S23,V-S24,V- S23,V-S24,V- S29,V- S29,V- S20,V- S20,V-
-
S28 S28 S30 S30 S33 S33
Tue V-S9,V-
S13,V- V-S4,V- -
V-S7,V-S12,V- V-S7,V-S12,V-
Theory S15,V- V-S13 S5,V- V-S18 -- -- -
S23,V-S29 S23
S21,V- S18 -
S26
-
Tutorial -- -- -- -- -- -- -- -- -
-

34/41
8/16/22, 7:10 AM

Lab V-S14 V-S14 V-S2,V- V- V-S8 V-S8 V- V- -

S20 S2,V- S25,V- S25,V- -
S20 S31 S31 -
V-S1,V-S10,V- V-S1,V-S10,V- V- V- V-S3,V- V-S3,V-
-
S11,V-S22,V- S11,V-S22,V- S17,V- S17,V- S6,V- S6,V-
Skilling -- -- -
S24,V-S25,V- S24,V-S25,V- S30,V- S30,V- S16,V- S16,V-
-
S27,V-S32 S27,V-S32 S33 S33 S19 S19
V-S8,V-
V- -
V-S14,V-S18,V- V-S14,V-S20,V- S19,V-
Theory S28,V- -- -- -- -- -
S20,V-S24 S24 S28,V-
S29 -
S29
-
Tutorial -- -- -- -- -- -- -- -- -
-
Wed V- V- V- V- -
Lab V-S11 V-S11 S15,V- S15,V- V-S3 V-S3 S22,V- S22,V- -
S33 S33 S28 S28 -
V-S1,V-S2,V- V-S1,V-S2,V- V- V-
V-
S4,V-S5,V-S6,V- S4,V-S5,V-S6,V- V-S7,V- S10,V- S10,V- -
S7,V-
Skilling S17,V-S22,V- S17,V-S22,V- S9,V- S12,V- S12,V- -- -- -
S9,V-
S23,V-S25,V- S23,V-S25,V- S32 S13,V- S13,V- -
S32
S26,V-S31 S26,V-S31 S16 S16
V-S1,V-
V-
S6,V-
V-S2,V-S3,V- S1,V- -
V-S3,V-S19,V- S10,V-
Theory S13,V-S19,V- S21,V- V-S33 V-S33 -- -- -
S30 S21,V-
S28,V-S30 S22,V- -
S22,V-
S32
S32
-
Tutorial -- -- -- -- -- -- -- -- -
Thu -
V- V- -
Lab V-S12 V-S12 V-S16 V-S16 V-S4 V-S4 S21,V- S21,V- -
S27 S27 -
V-S5,V-S15,V- V-S5,V-S15,V- V-S7,V- V-S7,V-
V- -
S17,V-S18,V- S17,V-S18,V- V-S8,V- S9,V- S9,V-
Skilling S8,V- -- -- -
S20,V-S26,V- S20,V-S26,V- S31 S11,V- S11,V-
S31 -
S27 S27 S14 S14
V-S1,V- -
V-S11,V-S15,V- V-S11,V-S15,V- V-S4,V-
Theory S3,V- -- V-S4 -- -- -
S25,V-S27 S25 S20
S32 -
-
Tutorial -- -- -- -- -- -- -- -- -
-
V- V- -
Fri Lab V-S5 V-S5 V-S9 V-S9 V-S17 V-S17 S23,V- S23,V- -
S29 S29 -
V-S7,V-S8,V- V-S7,V-S8,V-
S10,V-S12,V- S10,V-S12,V- V-
V-S2,V-
S14,V-S16,V- S14,V-S16,V- S2,V- -
S13,V- V-S6,V- V-S6,V-
Skilling S18,V-S21,V- S18,V-S21,V- S13,V- -- -- -
S28,V- S19 S19
S23,V-S24,V- S23,V-S24,V- S28,V- -
S29
S30,V-S31,V- S30,V-S31,V- S29
S33 S33
Sat Theory V-S7,V-S16,V- V-S16,V-S17 V- V-S31 V-S8 V-S8 -- -- -
35/41
8/16/22, 7:10 AM

S17,V-S22 S23,V- -
S24,V- -
S30,V-
S31,V-
S33
-
Tutorial -- -- -- -- -- -- -- -- -
-
V- V- -
Lab V-S6 V-S6 V-S10 V-S10 V-S18 V-S18 S24,V- S24,V- -
S30 S30 -
V- V-S1,V- V-S1,V-
V-S9,V-S11,V- V-S9,V-S11,V- V-S3,V-
S3,V- S2,V- S2,V-
S15,V-S21,V- S15,V-S21,V- S4,V- -
S4,V- S5,V- S5,V-
Skilling S25,V-S26,V- S25,V-S26,V- S13,V- -- -- -
S13,V- S12,V- S12,V-
S28,V-S29,V- S28,V-S29,V- S14,V- -
S14,V- S19,V- S19,V-
S32 S32 S27
S27 S20 S20
-
Theory -- -- -- -- -- -- -- --
-
-
Tutorial -- -- -- -- -- -- -- --
-
Sun
-
Lab -- -- -- -- -- -- -- --
-
-
Skilling -- -- -- -- -- -- -- --
-

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be
planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

[Link] Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and
schedule notified accordingly.
Advanced Topics, Additional Reading, Research
[Link] CO ALM References/MOOCS
papers and any

EVALUATION PLAN:

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4 CO5 CO6
Type Component Dates (Hours)
End Skill Sem-End Weightage 6 6
Semester Exam 100
Max Marks 50 50
Summative

Evaluation
End Semester Weightage 24 180 6 6 6 6

36/41
8/16/22, 7:10 AM

Total= 40 Exam Max Marks 100 25 25 25 25

% Lab End Weightage 10 10
Semester 100
Exam Max Marks 50 50
Ratings on Weightage 4 1 1 1 1
Global 40
Platforms Max Marks 40 10 10 10 10
Skilling Weightage 4 4
In Continuous 40
Evaluation Max Marks 50 50
Semester
Formative
Weightage 5 2 1 1 1
ALM 30
Evaluation
Max Marks 40 10 10 10 10
Total= 24
Home
% Weightage 5 2 1 1 1
Assignment 45
and Textbook Max Marks 40 10 10 10 10
Continuous Weightage 6 6
Evaluation - 50
Lab Exercise Max Marks 50 50
Semester in Weightage 12 6 6
120
Exam-I Max Marks 50 25 25
In Semester in Weightage 12 6 6
Semester Exam-II 120

Max Marks 50 25 25
Summative
Evaluation
Lab In Weightage 8 8
Total= 36
Semester 100
% Exam Max Marks 50 50
Skill In-Sem Weightage 4 4
100
Exam Max Marks 50 50

ATTENDANCE POLICY:

Every
student is expected to be responsible for regularity of his/her
attendance in class rooms and laboratories,
to appear in scheduled
tests and examinations and fulfill all other tasks assigned to
him/her in every course
In
every course, student has to maintain a minimum of 85% attendance to
be eligible for appearing in Semester

end examination of the course,

for cases of medical issues and other unavoidable circumstances the
students
will be condoned if their attendance is between 75% to 85%
in every course, subjected to submission of
medical certificates,
medical case file and other needful documental proof to the concerned
departments

DETENTION POLICY :

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such
student to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Name of Faculty Delivery Sections Chamber Chamber Chamber Signature
Component of Consultation Consultation Consultation of Course
of Faculty Faculty Day (s) Room No: faculty:

37/41
8/16/22, 7:10 AM

Timings for each

day
7-
SHAIK RAZIA L MA,3- - - - -
MA
7-
SHAIK RAZIA P MA,3- - - - -
MA
3-
SHAIK RAZIA S MA,7- - - - -
MA
HARITHA
L 1-MA - - - -
DONAVALLI
11-
SRIDEVI EMANDI L MA,19- - - - -
MA
11-
SRIDEVI EMANDI P MA,19- - - - -
MA
11-
SRIDEVI EMANDI S MA,19- - - - -
MA
Zeelan CMAK L 26-MA - - - -
Zeelan CMAK P 26-MA - - - -
Zeelan CMAK S 26-MA - - - -
5-
DAMA ANAND L MA,29- - - - -
MA
5-
DAMA ANAND P MA,29- - - - -
MA
5-
DAMA ANAND S MA,29- - - - -
MA
SIVA KUMAR
L 23-MA - - - -
PATHURI
SIVA KUMAR
P 23-MA - - - -
PATHURI
SIVA KUMAR
S 23-MA - - - -
PATHURI
SUDARSA DORA
L 16-MA - - - -
BABU
SUDARSA DORA
P 16-MA - - - -
BABU
SUDARSA DORA
S 16-MA - - - -
BABU
10-
VELAGAPALLI
L MA,20- - - - -
PREMALATHA
MA
20-
VELAGAPALLI
P MA,10- - - - -
PREMALATHA
MA
VELAGAPALLI S 20- - - - -
38/41
8/16/22, 7:10 AM

PREMALATHA MA,10-
MA
AZMIRA KRISHNA L 6-MA - - - -
AZMIRA KRISHNA P 6-MA - - - -
AZMIRA KRISHNA S 6-MA - - - -
SREERAM
L 2-MA - - - -
NIMMAGADDA
SREERAM
P 2-MA - - - -
NIMMAGADDA
SREERAM
S 2-MA - - - -
NIMMAGADDA
RAJESH KUMAR
L 24-MA - - - -
ESWARAN
RAJESH KUMAR
P 24-MA - - - -
ESWARAN
RAJESH KUMAR
S 24-MA - - - -
ESWARAN
14-
KARIMUNNISA
L MA,28- - - - -
SYED
MA
28-
KARIMUNNISA
P MA,14- - - - -
SYED
MA
28-
KARIMUNNISA
S MA,14- - - - -
SYED
MA
4-
GANESAN T L MA,12- - - - -
MA
4-
GANESAN T P MA,12- - - - -
MA
4-
GANESAN T S MA,12- - - - -
MA
U HARITA L 8-MA - - - -
U HARITA P 8-MA - - - -
U HARITA S 8-MA - - - -
13-
ASHOK BEKKANTI L MA,25- - - - -
MA
13-
ASHOK BEKKANTI P MA,25- - - - -
MA
13-
ASHOK BEKKANTI S MA,25- - - - -
MA
MADUPU KUMAR L 9-MA - - - -
MADUPU KUMAR P 9-MA - - - -
MADUPU KUMAR S 9-MA - - - -
PARASA GAYATRI L 21-MA - - - -
PARASA GAYATRI P 21- - - - -
39/41
8/16/22, 7:10 AM

MA,1-
MA
21-
PARASA GAYATRI S MA,1- - - - -
MA
Yamini Tondepu L 15-MA - - - -
Yamini Tondepu P 15-MA - - - -
Yamini Tondepu S 15-MA - - - -
CHIRANJEEVI
L 22-MA - - - -
KOTHAPALLI
CHIRANJEEVI
P 22-MA - - - -
KOTHAPALLI
CHIRANJEEVI
S 22-MA - - - -
KOTHAPALLI
YOGESH KAKDE L 17-MA - - - -
YOGESH KAKDE P 17-MA - - - -
YOGESH KAKDE S 17-MA - - - -
Lavanya Chunduri L 33-MA - - - -
Lavanya Chunduri P 33-MA - - - -
Lavanya Chunduri S 33-MA - - - -
Zubair Ashraf L 27-MA - - - -
Zubair Ashraf P 27-MA - - - -
Zubair Ashraf S 27-MA - - - -
ALANGUDI BALAJI
NAVANEETHA L 18-MA - - - -
RAMA KRISHNAN
ALANGUDI BALAJI
NAVANEETHA P 18-MA - - - -
RAMA KRISHNAN
ALANGUDI BALAJI
NAVANEETHA S 18-MA - - - -
RAMA KRISHNAN
RAMESH
L 32-MA - - - -
MYLAPALLI
RAMESH
P 32-MA - - - -
MYLAPALLI
RAMESH
S 32-MA - - - -
MYLAPALLI
FARHAN SUFYAN L 31-MA - - - -
FARHAN SUFYAN P 31-MA - - - -
FARHAN SUFYAN S 31-MA - - - -
Karri Bhaskar L 30-MA - - - -
Karri Bhaskar P 30-MA - - - -
Karri Bhaskar S 30-MA - - - -

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course
Faculty to the class.

40/41
8/16/22, 7:10 AM
NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(SREERAM NIMMAGADDA)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of DBES-1

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal)

[object HTMLDivElement]

41/41