Course handout-21SC1101

8/11/2021
K L Deemed to be University
Department of DBES-1 -- KLVZA
Course Handout
2021-2022, Odd Sem
Course Title :CTSD
Course Code :21SC1101
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
Edition2007. 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 G.Sorenson, “An Introduction to Data Structures with
applications”, 2nd Edition.
MOOCS :1. www.hackerrank.com 2. www.codechef. 3. www.spoj.com
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.
1/32
8/11/2021
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.
Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
2/32
8/11/2021
COURSE OUTCOMES (COs):

CO1 Design Basic and Complex Building Blocks for real world PO1,PO2 3
problems using structured programming paradigm
Translate computational thinking into Logic Design for Solving real
world problems PO2,PO1
CO2 3
Apply and Analyse CRUD operations on Basic Data Structures

CO3 PO1,PO2 4
using Asymptotic Notations
Apply and Analyse CRUD operations on Linear Data Structures
CO4 PO4 4
using Asymptotic Notations.
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 develop
CO6 PO2,PO4,PO1 6
logic that help them to create programs as well as applications in C
COURSE OUTCOME INDICATORS (COIs)::
Outcome Highest
COI-1 COI-2 COI-3 COI-4
No. BTL
Btl-1 Btl-3
Btl-2
Describe problem Design modularized
Write programs using
solving techniques code with Decision
CO1 3 Complex Building
and translate making constructs in
blocks with different
algorithm/ flowchart solving computational
modes of user Input
to a C program problems
Btl-2
Convert among
definite and indefinite
Btl-1 Btl-3
iterative statements
Syntactically Design iterative and
and able to write
CO2 3 differentiate definite recursive logic to
alternate logic for a
and indefinite solve real world
given problem.
iterative statements problems
convert recursive
functions to iterative
statements
Btl-4
Btl-3
Btl-2 Analyse CRUD
Apply DMA to Solve
Write syntactically operations on
real world problems
accurate code for 1-D multidimensional
CO3 4 and perform CRUD
and 2-D Arrays, arrays using
operations on
demonstrates dynamic asymptotic notations
multidimensional
memory allocation in solving real world
Arrays.
problems
Btl-2
Btl-4
Write syntactically Btl-3
Analyse CRUD
accurate code for Apply CRUD
CO4 4 operations on Linear
Implementing stacks, operations on stacks,
Data Structures using
queues and SLL (with queues, and SLL
asymptotic notations
structure pointers
3/32
8/11/2021
such a way that

students will be able
to develop logic that
help them to create
programs as well as
applications in C
Btl-6
Apply the structured
programming
paradigm with logic
CO5 3
building skills on
Basic and Linear Data
Structures for solving
real world problems.
CO6 6 Btl-6
Skill the students in
PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES
(POs/PSOs)
Po
Program Outcome
No.
Engineering Knowledge :An ability to apply knowledge of mathematics, science, engineering
PO1 fundamentals and an engineering specialization for the solution of complex engineering problems in
engineering
Problem Analysis :An ability to identify, formulate, research literature, analyze complex engineering
PO2 problems in mechanical engineering using first principles of mathematics, natural sciences and
engineering sciences
Design/ development of solutions :An ability to design solutions for complex engineering problems and
PO3 system component or processes that meet the specified needs considering public health & safety and
cultural, societal & environment
Conduct investigations of complex problems :An ability to use research-based knowledge and research
PO4 methods including design of experiments, analysis and interpretation of data and synthesis of the
information to obtain solutions to engineering problems
Modern tool usage :Ability to create, select and apply appropriate techniques, resources and modern
PO5
engineering activities, with an understanding of the limitations
The engineer and society :Ability to apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice
Environment and sustainability Ability to demonstrate the knowledge of engineering solutions,
PO7 contemporary issues understanding their impacts on societal and environmental contexts, leading towards
sustainable development
Ethics : An ability to apply ethical principles and commit to professional ethics and responsibilities and
PO8
norms of engineering practice
Individual and team work :An ability to function effectively as an individual, and as a member or leader
PO9
in diverse teams and in multi-disciplinary settings
Communication :Ability to communicate effectively oral, written reports and graphical forms on complex
PO10
engineering activities
Project management and finance :Ability to demonstrate knowledge and understanding of the engineering
PO11 and management principles and apply those one’s own work, as a member and leader in team, to manage
projects and in multi-disciplinary environments
4/32
8/11/2021
Lifelong learning An ability to recognize the need for and having the preparation and ability to engage
PO12
independent and life-long learning in 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.
Lecture Course DELIVERY Plan:
Book No[CH Teaching-
Sess.No. CO COI Topic EvaluationComponents
No][Page No] Learning Methods
5/32
8/11/2021
Book No[CH Teaching-

Sess.No. CO COI Topic No][Page Learning EvaluationComponents
No] Methods
ALM,Continuous
Evaluation - Lab
Exercise,End Semester
Exam,Home
Assignment,Lab In
Semester
Structured Exam,LCE,Ratings on
programming Global Platforms,SEM-
paradigm- EXAM1,Skilling
1 CO1 COI1 modularization RB1/PP:9-11 Chalk,PPT,Talk Continuous Evaluation
ALM,Home
Assignment,Lab End
Semester Exam,Lab In
Semester
Exam,LCE,Ratings on
Global Platforms,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
RB1:PP:12- Exam,Skilling
2 CO1 COI1 Designing Algorithms 24 PPT Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
Semester
Exam,LCE,SEM-
EXAM1,Skill In-Sem
Exam,Skill Sem-End
RB1/PP:12- Exam,Skilling
3 CO1 COI1 Flowcharts 25 Chalk,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
Semester Exam,Ratings
on Global
Platforms,SEMEXAM1,Skill
Data types: int, int In-Sem
pointer, float, float Exam,Skill Sem-End
pointer, char, char Exam,Skilling
4 CO1 COI2 pointer T1-PP.1-46 Chalk,PPT,Talk Continuous Evaluation
Book No[CH Teaching-Learning

Sess.No. CO COI Topic No][Page Methods EvaluationComponents
No]
6/32
8/11/2021
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab In Semester
Exam,Ratings
on Global
In-Sem
Exam,Skill Sem-End
Data types: int array, Exam,Skilling
5 CO1 COI2 float array, char array T1-PP.1-46 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
on Global
In-Sem
Exam,Skill Sem-End
User input from T1- Exam,Skilling
6 CO1 COI2 console PP.370384 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
on Global
In-Sem
Exam,Skill Sem-End
T1- Exam,Skilling
7 CO1 COI3 User Input from files PP.370384 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
on Global
In-Sem
Storage classes - auto, Exam,Skill Sem-End
global, static, register, T1- PP. Exam,Skilling
8 CO1 COI3 extern 295303 Chalk,LTC,PPT,Talk Continuous Evaluation
7/32
8/11/2021
Book Teaching-Learning
No[CH Methods
No][Page
No]
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab In
Semester
Exam,LIT,Ratings on
EXAM1,Skill In-Sem
Storage classes - auto, Exam,Skill Sem-End
global, static, register, TB PP. Exam,Skilling
9 CO1 COI3 extern 295303 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
on Global
summary of In-Sem
operators, data types Exam,Skill Sem-End
& keywords, T1- Exam,Skilling
10 CO2 COI1 Terinary Operators PP.114119 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
Semester Exam,Ratings on
Global
In-Sem
T1- Exam,Skilling
11 CO2 COI1 if-else, else if lader PP114132 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,End Semester
Exam,Home
Assignment,Lab In
T1- Semester Exam,SEM-
12 CO2 COI1 Nested if-else, switch PP:114132 Chalk,LTC,PPT,Talk EXAM1
8/32
8/11/2021
ALM,End Semester
Exam,Home
Assignment,Lab End
Global
In-Sem
increment, decrement Exam,Skill Sem-End
operators and Iterative Exam,Skilling
13 CO2 COI2 loops T1- PP.61-63 Chalk,LTC,PPT,Talk Continuous Evaluation
No[CH Methods
No][Page
No]
ALM,Continuous
Evaluation - Lab
Exercise,Lab End
Semester Exam,Lab In Semester
Exam,Ratings on Global
Iterative statements In-Sem
- for, while, do- T1- Exam,Skill Sem-End
14 CO2 COI2 while PP.154158 Chalk,LTC,PPT,Talk Exam
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End
Exam,SEM-
EXAM1,Skill In-Sem
T1- Exam,Skill Sem-End
15 CO2 COI2 Nesed Loops PP.157158 Chalk,LTC,PPT,Talk Exam
ALM,Home
Assignment,Lab In
T1- Semester Exam,SEM-
16 CO2 COI3 Bitwise Operators PP.114119 Chalk,LTC,PPT,Talk EXAM1
ALM,Home
Bit-wise operators- T1- Exam,Ratings on Global
17 CO2 COI3 II PP.114119 Chalk,LTC,PPT,Talk Platforms,SEM-EXAM1
9/32
8/11/2021
ALM,Home
Assignment,Lab End
EXPRESSION Semester Exam,Lab In Semester
EVALUATION Exam,Ratings
RULES, on Global
Operator T1- PP.61- Platforms,SEMEXAM1,Skilling
18 CO2 COI3 precedency 63 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Ratings on
Global
In-Sem
T1- PP Exam,Skilling
19 CO3 COI2 Recursion 288289 Chalk,LTC,PPT,Talk Continuous Evaluation
No[CH Methods
No][Page
No]
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab End
Logic translation from Global Platforms,Skill Sem-
recursive statements T1- End Exam,Skilling
20 CO3 COI2 to iterative statements PP288289 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab In
Semester Exam,SEM-
EXAM2,Skill In-Sem
Logic Building using Exam,Skilling
21 CO3 COI2 Recursion T2-156-158 Chalk,LTC,PPT,Talk Continuous Evaluation
10/32
8/11/2021
ALM,Continuous
Evaluation - Lab
Exam,Home
Data types: char In-Sem
pointer, command line Exam,Skilling
22 CO3 COI2 arguments T1- PP.1-46 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Global
In-Sem
T1- Exam,Skilling
23 CO3 COI3 Strings PP.229241 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
EXAM2,Skill In-Sem
Exam,Skill Sem-End
T1- Exam,Skilling
24 CO3 COI3 String library PP.229241 Chalk,LTC,PPT,Talk Continuous Evaluation
Book No[CH Teaching-Learning

No][Page No] Methods
ALM,Continuous
Evaluation - Lab
Exercise,Home
Assignment,Lab End Semester
Exam,Ratings
on Global
In-Sem
1D Arrays - T1- PP.192- Exam,Skill Sem-End
creation and 198, T3PP.597- Exam,Skilling
25 CO3 COI3 insertion 600 Chalk,LTC,PPT,Talk Continuous Evaluation
11/32
8/11/2021
ALM,Continuous
Evaluation - Lab
Exam,Home
In-Sem
T1- PP.192- Exam,Skill Sem-End
1D Arrays - 198, T3PP.597- Exam,Skilling
26 CO3 COI4 Linear Search 600 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Lab End
Exam,Ratings
on Global
1D Arrays - [T1- 603-607] Platforms,SEMEXAM2,Skilling
27 CO3 COI4 Binary search [Web Ref – 1] Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
T3- Exam,Ratings
Dynamic PP.197202,216- on Global
Memory 219] Platforms,SEMEXAM2,Skilling
28 CO3 COI4 Allocation [Web Ref -3 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exam,Home
Assignment,Lab In
Semester
Exam,SEMEXAM2,Skill In-
Sem
2-D Arrays - Exam,Skill Sem-End
creation and Exam,Skilling
29 CO3 COI4 insertion T1- PP.199208 Chalk,LTC,PPT,Talk Continuous Evaluation
No[CH Methods
No][Page
No]
12/32
8/11/2021
ALM,Continuous
Evaluation - Lab
Exam,Home
Global
In-Sem
30 CO3 COI4 Matrix Algebra T1:258-260 Chalk,LTC,PPT,Talk Exam
ALM,End Semester
Exam,Home
Assignment,Lab End
Semester Exam,SEM-
T1- EXAM2,Skilling
31 CO4 COI2 Structures PP.317326 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,End Semester
Exam,Home
Assignment,Lab In
Semester Exam,SEM-
32 CO4 COI2 Array of Structures T1:256-259 Chalk,LTC,PPT,Talk EXAM2
ALM,Continuous
Evaluation - Lab
Exercise,Home
Exam,Ratings
on Global
In-Sem
Exam,Skill Sem-End
T1- Exam,Skilling
33 CO4 COI2 Structure Pointer PP.317326 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
In-Sem
Linear Data T3-PP.79- Exam,Skill Sem-End
Structures Stacks 82] [Web Exam,Skilling
34 CO4 COI3 using arrays Ref – 2 Chalk,LTC,PPT,Talk Continuous Evaluation
13/32
8/11/2021
ALM,Continuous
Evaluation - Lab
Exercise,Lab End
Linear Data Exam,Ratings on Global
Structures Stacks Platforms,SEMEXAM2,Skilling
35 CO4 COI3 using arrays T3: 289-293 Chalk,LTC,PPT,Talk Continuous Evaluation
14/32
8/11/2021
No[CH Methods
No][Page
No]
ALM,Continuous
Evaluation - Lab
Exam,Home
Linear Data Assignment,Lab End Semester
Structures Queue Exam,Ratings on Global
36 CO4 COI3 using arrays TB-3 Chalk,LTC,PPT,Talk Platforms
ALM,Continuous
Evaluation - Lab
Exam,Home
Linear Data Platforms,SEMEXAM2,Skill
Structures Single In-Sem
Linked List - using Exam,Skilling
37 CO4 COI4 structures TB:3 Chalk,LTC,PPT,Talk Continuous Evaluation
ALM,Continuous
Evaluation - Lab
Exercise,Home
Exam,Ratings
Introduction to non- on Global
linear data Platforms,SEMEXAM2,Skilling
38 CO4 COI4 structures TB:3 Chalk,LTC,PPT,Talk Continuous Evaluation
Lecture Session wise Teaching – Learning Plan
SESSION NUMBER : 1
Session Outcome: 1 Understand the concept of structured Programming
Session Outcome: 2 understand the Need of Modular Programming

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
Explanation Structured Programming What is a Structured
50 1 Talk APPLICABLE
Programming? And its need in Programming
---
SESSION NUMBER : 2
Session Outcome: 1 Design modularized solutions using algorithmic constructs to solve computational problems
TeachingLearning Active
Time(min) Topic BTL Methods Learning
Methods
Designing Algorithms and flowcharts for problem Leading
50 1 Chalk
solving question
15/32
8/11/2021
SESSION NUMBER : 3
Teaching- Active
Methods Methods
One minute
50 Designing Algorithms and flowcharts for problem solving 2 Talk
paper
SESSION NUMBER : 4
Session Outcome: 1 Understand Basic Data Types and to create variable of int, float data types and to read input
from user
Session Outcome: 2 Understand the concept and use of array and pointers of int and float data type
Teaching- Active
Methods Methods
Introduction to Data Types in C. Define Integer data type,
Array of Integers and Pointers to int. Define Float Data
--- NOT
Type, array of float and Pointers to float. 1. Write a C
50 2 Chalk APPLICABLE
Program to create an integer variable to store Employ ID
---
and a float variable to store Employee salary and print those
values
SESSION NUMBER : 5
Session Outcome: 1 Understand the concept and use of array and pointers of int and float data type.
Teaching- Active
Methods Methods
Leading
50 Data types: int array, float array, char array 2 Talk
question
SESSION NUMBER : 6
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
Methods Methods
--- NOT
Explanation about User Input though • Console- Formatted
Input-scanf() • File- Explanation of use of files, different file
---
SESSION NUMBER : 7
Session Outcome: 1 Develop interactive solutions using files for real world problems
Teaching- Active
Methods Methods
50 Explanation about User Input though • Console- Formatted 2 Talk Leading
Input-scanf() • File- Explanation of use of files, different file question
operations(r,w,a+,w+), fopen(),fclose(),fscanf(),fprintf())
1.Using File concepts, perform a simple addition by storing

the data into the file and retrieving it.
16/32
8/11/2021
SESSION NUMBER : 8
Session Outcome: 1 Think in logical way to solve real-time applications using storage classes
Session Outcome: 2 Solve computer applications using structured programming

Methods
Leading
50 Storage classes - auto, global, static, register, extern 2 Talk
question
SESSION NUMBER : 9
Session Outcome: 1 Think in logical way to solve real-time applications using storage classes.
Teaching- Active
Methods Methods
Leading
50 Storage classes 2 Talk
question
SESSION NUMBER : 10
Session Outcome: 1 Apply operators to solve problems

Teaching- Active
Methods Methods
Leading
50 keywords, Operators 3 Chalk
question
SESSION NUMBER : 11
Session Outcome: 1 Understand the usage of conditional statements

Teaching- Active
Methods Methods
Leading
50 Conditional Statements 2 Talk
question
SESSION NUMBER : 12
Session Outcome: 1 Develop solutions using conditional statements

Teaching- Active
Methods Methods
Leading
50 Nested if-else, swith 3 Talk
question
SESSION NUMBER : 13
Session Outcome: 1 Apply increment and decrement operators to solve problems

Time(min) Topic BTL Teaching- Active
Learning Learning
Methods Methods
Introduction to Increment and Decrement operators 1) What
will be the result after executing the program? main() { int Leading
50 3 Talk
a=10; printf(“%d”,a++); printf(“%d”,++a); printf(“%d”,a); question
printf(“%d”,a--); printf(“%d”,--a); printf(“%d”,
17/32
8/11/2021
SESSION NUMBER : 14
Session Outcome: 1 1. Develop iterative solutions using While loop to solve real world problems
Teaching- Active
Methods Methods
Introduction of iterative statements(for, while, do-while)
Explanation of While loop syntax and flow chart 1. Write a
Leading
50 program to print numbers from 1 to n using while loop. 2. 3 PPT
question
Give a task to students to print first n even numbers using
while loop.
SESSION NUMBER : 15
Session Outcome: 1 1. Develop iterative solutions using While loop to solve real world problems
Methods
Nested lops: Explain about for loop Syntax, Flow
Chart, parts of for loop and working procedure with --- NOT
50 suitable Example 1. Write a program to print numbers 3 PPT APPLICABLE
from 1 to 20 using for loop 2. Write a program to find ---
the factorial of a given number
SESSION NUMBER : 16
Session Outcome: 1 Use bitwise operators

Teaching- Active
Methods Methods
Explain Bitwise operators Bitwise AND(&) Bitwise OR(|) Leading
50 3 Talk
Bitwise Not(~) question
SESSION NUMBER : 17
Session Outcome: 2 1. Use bitwise operators

Teaching- Active
Methods Methods
Explain Bitwise operators Bitwise XOR (^) Bitwise Left Leading
50 2 Talk
shift (<<) Bitwise Right shift (>>) question
SESSION NUMBER : 18
Session Outcome: 1 understand operaotr precedency

Time(min) Topic BTL TeachingLearning Active
Learning
Methods Methods
Evaluate the following expression using BODMAS rule.

7+
(8%3)-12*30/6. Explain operator precedence and --- NOT
50 associativity 1. find o/p of following: void main() { Int 3 Talk APPLICABLE
a,b=3; char c=’a’; a=b+c; printf(“%d\n”,a); } 2. Write a ---
C Program to find out Reynold Number, Prandtl No.,
Heat Transfer Coefficients, Catalyst Surface
18/32
8/11/2021
temperature. 3. Write a C Program for "Newton

Raphson" method (To find out the root of the equation).
SESSION NUMBER : 19
Session Outcome: 1 Apply recursion for solving some mathematical related problems
Methods
Explain what a recursion is & how recursive functions
work? 1. Write a C program to find nth term in Fibonacci Leading
50 3 PPT
Series using Recursion. 2. Write a program to print the question
sum of natural numbers using recursion
SESSION NUMBER : 20
Session Outcome: 1 Traslate iterative solutions to recursive solutions

Teaching- Active
Methods Methods
Explain what a recursion is & how recursive functions
--- NOT
work? 1. Write a C program to find nth term in Fibonacci
Series using Recursion. 2. Write a program to print the sum
---
of natural numbers using recursio
SESSION NUMBER : 21
Session Outcome: 1 Develop solutions using recursive logic

Teaching- Active
Methods Methods
: 1.C program to find out the GCD (Greatest Common
Divisor )of the two numbers using recursion Sample Input :
8 12 Sample Output : 4 2. Write a program in C to convert a
decimal number to binary using recursion. Sample Input :
--- NOT
66 Sample Output: 1000010 3. Write a program in C to find
whether the user input number is a prime number or a
---
composite number using recursion. Sample Input :31
Sample Output: Prime number 5. Write a C program to find
the first upper case letter in the given string using recursion.
Sample Input : kl University
SESSION NUMBER : 22
Session Outcome: 1 To Build problems on char data type, char array, char pointer
Teaching- Active
Methods Methods
19/32
8/11/2021
50 Explanation of char data type, char array, char pointer 2 Talk --- NOT
Develop a function that takes character as an argument and APPLICABLE
displays the keyed-in character along with previous and next ---
characters as per ASCII values. Explain about command
line arguments
SESSION NUMBER : 23
Session Outcome: 1 Understand the Strings

Methods
Explanation of String and Library functions (strlen(),
strrev(), strcat(), strcpy(), strcmp()etc..) with the help of
following problem Develop a program to read two
Leading
50 strings which can perform following operations • Finding 2 Talk
question
the string length • Comparing two strings • Appending
second string to first string • Reverse the string •
Palindrome
SESSION NUMBER : 24
Session Outcome: 1 Apply String Library functions

Teaching- Active
Methods Methods
Explanation of String and Library functions (strlen(),
strrev(), strcat(), strcpy(), strcmp()etc..) with the help of
--- NOT
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
SESSION NUMBER : 25
Session Outcome: 1 Understand and implement 1D arrays

Methods
Explain need of arrays, array definition and declaration. Leading
50 2 Talk
Input/output statements and how to use it in coding question
SESSION NUMBER : 26
Session Outcome: 1 Apply linear search operation on array

Methods
Explanation on Searching an element in a array by using
Linear Search. Suppose you use Uber application as a
ride and you request a ride to go from one place to
Leading
50 another. Your driver just arrived at the parking lot of 3 Talk
your place. The only thing you know about the ride is question
the license plate number.
How do you find your Uber ride?
20/32
8/11/2021
SESSION NUMBER : 27
Session Outcome: 1 Apply binary search operation on array and analyse with time complexity
Teaching- Active
Methods Methods
Explain Divide and Conquer Concept. Introduction to Binary
Leading
50 Search, Binary Search algorithm with recursive and with 2 Talk
question
Iterative and its time complexity
SESSION NUMBER : 28
Session Outcome: 1 Implementing and solving through DMA operations

Teaching- Active
Methods Methods
Identify error in the following statement? int a[5]; a[7]=15;
Leading
50 Explanation of Dynamic Memory Allocation and its 3 Talk
question
functions malloc(),calloc(),realloc(),free()
SESSION NUMBER : 29
Session Outcome: 1 Implement 2Dimensional Arrays and Multidimensional arrays.

Methods
Explain 2D array (Multidimensional array) with syntax,
Leading
50 memory layout and initialization in different ways with 2 Talk
question
suitable examples.
SESSION NUMBER : 30
Session Outcome: 1 Implement 2Dimensional Arrays and Multidimensional arrays.

Teaching- Active
Methods Methods
: 1. 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 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] [1]. 2. You Leading
50 3 Talk
are given a two-dimensional array starting from A [0][0]. question
You should print diagonal elements of a Matrix if a matrix
is square matrix. otherwise print it is not a square Matrix.
Example: It should print A [0][0], A [1] [1], A [2] [2], A [3]
[3] …. etc if it is a square matrix.
SESSION NUMBER : 31
Session Outcome: 1 Illustrate the usage of Structures

Teaching- Active
Methods Methods
50 Explanation of structures and discuss the implementation of 2 Talk Leading
user defined data-type ‘struct’. Study the information question
displayed on ID card and analyzes their types of data values.
21/32
8/11/2021
Now discuss how to store the above information into a record

format
SESSION NUMBER : 32
Session Outcome: 1 Solve real world problems using structure array.

Teaching- Active
Methods Methods
Explanation of array of structures (how to declare, how to
initialize, how to access elements) Define a structure Bank
Video
50 with members Name,AccountNo,Branch,BranchCode, 3 Talk
Balance and read 2 records and display them using structure synthesis
array
SESSION NUMBER : 33
Session Outcome: 1 Develop solutions to real time problems using structure POINTER
Methods
--- NOT
50 eXPLANATION OF POINTER TO STRUCTURE 2 Talk APPLICABLE
---
SESSION NUMBER : 34
Session Outcome: 1 Examine the rules to be imposed over collection to convert it into Stack data structure
Session Outcome: 2 Analyze time complexity of stack operations
Teaching- Active
Methods Methods
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 --- NOT
50 points to topmost element on stack. TOP is initialized to -1. 2 Talk APPLICABLE
Show the value of TOP after each statement has been ---
executed. Indicate any errors that might occur. Push( 4);
Push(1); Push(20); Push(-50); Push(120); Push( 230); int
de1 = Pop(); int de2 = Pop(); int de3 = Pop(); int de4 =
Pop(); int de5 = Pop(); int de6 = Pop();
SESSION NUMBER : 35
Session Outcome: 1 Implement stack using arrays

Methods
: Introduction to data structures. Types of data --- NOT
structures. Introduction to stack data structure and APPLICABLE
50 2 Talk
operations on stack data structure (Push, Pop, and ---
Display Operations)
SESSION NUMBER : 36
22/32
8/11/2021
Session Outcome: 1 Infer the rules to be imposed over collection to convert it into Queue data structure
Session Outcome: 2 Analyze queue operations
Teaching- Active
Methods Methods
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
arraybased 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 = _____ Q.enqueue ( 30120 ); front = _____ back
= _____ Q.enqueue ( 30541); front = _____ back = _____ Group
50 3 Talk
Q.enqueue ( 40850 ); front = _____ back = _____ Discussion
Q.enqueue
( 10020 ); front = _____ back = _____ int de1 = Q.dequeue(
); front = _____ back = _____ Q.enqueue (31252 ); front =
_____ back = _____ int de2 = Q.dequeue( ); front = _____
back = _____ int de3 = Q.dequeue( ); front = _____ back =
_____ int de4 = Q.dequeue( ); front = _____ back = _____
Q.enqueue (70024 ); front = _____ back =
SESSION NUMBER : 37
Session Outcome: 1 Implement insert operation on single linked list
Session Outcome: 2 Analyse time complexity of insert operation

Teaching- Active
Methods Methods
Explanation of self-referencing structure and making them
--- NOT
understand how it is different from ordinary structure.
Explanation of its types with program example. Discussing
---
applications
--- NOT
Single linked list-Insert Explain SLL-Insertion Operations
(Insert at beginning, end and middle)
---
SESSION NUMBER : 38
Session Outcome: 1 Understand trees and tree terminology

Teaching- Active
Methods Methods
Explain Tree, tree terminology, Tree nomenclature, Binary Leading
50 2 Talk
tree, Properties of binary tree, Different kinds of binary Tree question
Tutorial Course DELIVERY Plan: NO Delivery Plan Exists
Tutorial Session wise Teaching – Learning Plan
No Session Plans Exists
Practical Course DELIVERY Plan:
23/32
8/11/2021
Tutorial
Session Topics CO-Mapping
no
1 Algorithms, Flowcharts CO5
2 Simple Problem Solving using varied data types with IO from Console CO5
3 Simple Problem Solving using file I/O & Storage Classes CO5
4 Practice session on conditional statements and logical operators CO5
5 Iterative Statements CO5
6 Bitwise operators CO2
7 Problem solving using Recursion CO5
8 Problem solving using strings CO5

Practical Session wise Teaching – Learning Plan
SESSION NUMBER : 1
Teaching- Active
Methods Methods
--- NOT
50 Practice son Algorithmsession 2 LTC APPLICABLE
---
--- NOT
50 Practice session on Flowcharts 2 LTC APPLICABLE
---
SESSION NUMBER : 2
Session Outcome: 1 Develop inteactive solutions to real world problems

Teaching- Active
Methods Methods
--- NOT
Simple Problem Solving using varied data types with IO
50 3 LTC APPLICABLE
from Console
---
--- NOT
Simple Problem Solving using varied data types with IO
50 3 LTC APPLICABLE
from Console
---
SESSION NUMBER : 3
Session Outcome: 1 Develop inteactive solutions to real world problems
24/32
8/11/2021

Learning
Methods Methods
--- NOT
Simple Problem Solving using file I/O & Storage
50 2 LTC APPLICABLE
Classes
---
--- NOT
Simple Problem Solving using file I/O & Storage
50 2 LTC APPLICABLE
Classes
---
SESSION NUMBER : 4
Session Outcome: 1 Develop solutions for real-time problems using Decision making statements
Teaching- Active
Methods Methods
Practice session: 1. Based on ICMR guidelines the Myuria company want
to test their employees based on their body temperature and cold condition.
If body temperature is>99 and the person having cold to be send for
COVID19 center. Or if person not effected from cold, send him to
QUARANTINE center. If body temperature is<99 and the person having
cold to allocate separate work place. Or if person not effected from cold,
send him to regular Work place. 2. Write a C Program to count minimum
--- NOT
number of denominations for given amount.
50 https://www.hackerrank.com/contests/justcode/challenges/minimumnumber- 3 Talk APPLICABL
of-coins-for-possible-sum 3. The BOUNCE bike company offer bikes for ---
rental based on the usage of time and kilometer used by the customer. The
company charges rent Rs.1.25/- per Km. additionally the customer have to
pay minimum charges based on time taken.
https://www.hackerrank.com/challenges/c-tutorialconditional-if-
else/problem
Practice session: 1. Based on ICMR guidelines the Myuria company want

to test their employees based on their body temperature and cold condition.
If body temperature is>99 and the person having cold to be send for
COVID19 center. Or if person not effected from cold, send him to
QUARANTINE center. If body temperature is<99 and the person having
cold to allocate separate work place. Or if person not effected from cold,
send him to regular Work place. 2. Write a C Program to count minimum
--- NOT
number of denominations for given amount.
50 https://www.hackerrank.com/contests/justcode/challenges/minimumnumber- 3 Talk APPLICABL
of-coins-for-possible-sum 3. The BOUNCE bike company offer bikes for ---
rental based on the usage of time and kilometer used by the customer. The
company charges rent Rs.1.25/- per Km. additionally the customer have to
pay minimum charges based on time taken.
https://www.hackerrank.com/challenges/c-tutorialconditional-if-
else/problem
SESSION NUMBER : 5
Session Outcome: 1 1. Develop iterative solutions using for loop to solve real world problems.
Methods
25/32
8/11/2021
--- NOT
50 Practice session on Iterative statements 3 LTC APPLICABLE
---
50 Practice session on Nested loops 3 LTC --- NOT
APPLICABLE
---
SESSION NUMBER : 6
Session Outcome: 1 Develop applications using bitwise operators

Methods
Ask the students to practice the following problems 1.
Void
main() { int a=12,b=25; printf(“a&b=%d”,a&b); --- NOT
50 printf(“a|b=%d”,a|b); printf(“~a=%d”,~a); 3 LTC APPLICABLE
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
1. Swap two values by using XOR operators. 2. Ask
student to solve the following problem: Void main() {
--- NOT
int a=212,b,c; b=a<<2; c=a>>3;
50 3 LTC 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
SESSION NUMBER : 7
Session Outcome: 1 Develop recusive solutions

Teaching- Active
Methods Methods
: 1. Ask the student to write the implementation of finding
factorial of number using recursion as well as iteration 2.
Write a 3 LTC Leading question 6/9/2021 25/81 C program
to count digits of a number using Recursion and Iteration. 3. --- NOT
50 Write a C program to find sum of all digits using Recursion 3 LTC APPLICABLE
and Iteration. 4. Ask the student to Calculate power of a ---
number program using Recursion and Iteration 5. Ask the
student to write C program to calculate length of the string
using Recursion and Iteration
: 1. Ask the student to write the implementation of finding
factorial of number using recursion as well as iteration 2.
Write a 3 LTC Leading question 6/9/2021 25/81 C program
to count digits of a number using Recursion and Iteration. 3. --- NOT
50 Write a C program to find sum of all digits using Recursion 3 LTC APPLICABLE
and Iteration. 4. Ask the student to Calculate power of a ---
number program using Recursion and Iteration 5. Ask the
student to write C program to calculate length of the string
using Recursion and Iteration
SESSION NUMBER : 8
26/32
8/11/2021
Session Outcome: 1 Apply string library functions
Methods
50 . Develop a program which initializes character array 2 LTC --- NOT
with set of n characters and display the sum of all APPLICABLE
characters as per their 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.
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 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
--- NOT
program to declare to three strings and take input into
LTC APPLICABLE
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:
50 strncmp(str1, str2,BUFFERSIXE) 3
Skilling Course DELIVERY Plan:
Skilling
session Topics/Experiments CO-Mapping
no
1 Basic problems CO6
2 Data Types operators CO6
3 Skill-3 CO6
4 skill-4 CO6
5 skill-5 CO6
Skilling Session wise Teaching – Learning Plan
SESSION NUMBER : 1
Session Outcome: 1 Develop solutions for simple problems

Teaching- Active
Methods Methods
27/32
8/11/2021
1. Write a C program to print "Hello World" 2. Write a C --- NOT

50 program to read and print an Integer value, Float value, 6 LTC APPLICABLE
Char value from keyboard ---
3. Write a C program to perform Addition, Subtraction, --- NOT
multiplication and division of two numbers. 4. Write a C APPLICABLE
50 6 LTC
program to swap two variables without a temporary ---
variable.
SESSION NUMBER : 2
Session Outcome: 1 Understand Basic Data Types and to create variable of int, float data types and to read input
from user
Learning
Methods Methods
5. Write C functions to calculate area of circle, square. --- NOT

6. APPLICABLE
50 Write a C function to convert Celsius to Fahrenheit. 6 LTC ---
(HINT:
(0°C × 9/5) + 32 = 32°F).
7. Write a C function to find x2+4x+12 Equation for --- NOT
50 given x value. 8. Write a C function to calculate Simple 6 LTC APPLICABLE
Interest given principal, time and rate as arguments. ---
SESSION NUMBER : 3
Session Outcome: 1 Develop code for real world problems

Teaching- Active
Methods Methods
Cutting Paper Squares
https://www.hackerrank.com/challenges/p1-papercutting/problem
--- NOT
Maximum Draws
60 https://www.hackerrank.com/challenges/maximumdraws/problem 6 LTC APPLICABLE
Handshake ---
https://www.hackerrank.com/challenges/handshake/problem
SESSION NUMBER : 4
Session Outcome: 1 Develop programs to solve different kinds of computational problems

Teaching- Active
Methods Methods
Summing the N series
https://www.hackerrank.com/challenges/summing-the-
nseries/problem Minimum Height Triangle --- NOT
60 https://www.hackerrank.com/challenges/lowesttriangle/problem 6 LTC APPLICABLE
"Connecting Towns " ---
https://www.hackerrank.com/challenges/connectingtowns/problem
SESSION NUMBER : 5
Session Outcome: 1 Develop solutions for real-time problems using Decision making statements
28/32
8/11/2021
Methods
Filling jars
https://www.hackerrank.com/challenges/fillingjars/problem
Find the Point
https://www.hackerrank.com/challenges/find-
point/problem Army game
https://www.hackerrank.com/challenges/gamewith- --- NOT
60 cells/problem Best Divisors 6 LTC APPLICABLE
https://www.hackerrank.com/challenges/best- ---
divisor/problem Restaurent
https://www.hackerrank.com/challenges/restaurant/problem
Points on a Line
https://www.hackerrank.com/challenges/points-on-
aline/problem
WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:
Week Assignment Assignment Topic Details co

Type No
COURSE TIME TABLE:
Hour 1 2 3 4 5 6 7 8 9
Day Component
Theory --- --- --- --- --- V-S1 --- --- ---
Tutorial --- --- --- --- --- -- --- --- ---

Mon
Lab --- --- --- --- --- -- --- --- ---
Skilling --- --- --- --- --- -- --- --- ---
Theory --- --- --- --- V-S1 V-S1 --- --- ---
Tutorial --- --- --- --- -- -- --- --- ---

Tue
Lab --- --- --- --- -- -- --- --- ---
Skilling --- --- --- --- -- -- --- --- ---
Theory --- --- -- --- --- --- --- --- ---
Tutorial --- --- -- --- --- --- --- --- ---

Wed
Lab --- --- V-S1 --- --- --- --- --- ---
Skilling --- --- -- --- --- --- --- --- ---
Theory -- -- --- --- --- --- --- --- ---
Thu Tutorial -- -- --- --- --- --- --- --- ---
Lab -- -- --- --- --- --- --- --- ---
29/32
8/11/2021
Skilling V- V- --- --- --- --- --- --- ---

S1 S1
Theory -- -- --- --- -- -- --- --- ---
Tutorial -- -- --- --- -- -- --- --- ---

Fri
Lab -- -- --- --- -- -- --- --- ---
Skilling V- V- --- --- V-S1 V-S1 --- --- ---

S1 S1
Theory --- -- --- --- --- --- --- --- ---
Tutorial --- -- --- --- --- --- --- --- ---

Sat
Lab --- V- --- --- --- --- --- --- ---
S1
Skilling --- -- --- --- --- --- --- --- ---
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.

S.no 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
S.no 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)
Skill Sem-End Weightage 6 6
Exam 110
End Max Marks 50 50
Semester
Summative End Semester Weightage 24 6 6 6 6
Evaluation Exam
180
Total= 40 Max Marks 100 25 25 25 25
%
Lab End Weightage 10 110 10
30/32
8/11/2021
Semester Exam Max Marks 50 50
Ratings on Weightage 4 1 1 1 1
Global 20
Platforms Max Marks 50 12.5 12.5 12.5 12.5
Skilling Weightage 4 4
Continuous 110
Evaluation Max Marks 50 50
In
Semester Weightage 5 2 1 1 1
Formative
ALM 20
Evaluation Max Marks 50 12.5 12.5 12.5 12.5
Total= 24
% Home Weightage 5 2 1 1 1
Assignment and 20
Textbook Max Marks 50 12.5 12.5 12.5 12.5
Continuous Weightage 6 6
Evaluation - Lab 110
Exercise Max Marks 50 50
Semester in Weightage 12 6 6
Exam-I 120
Max Marks 50 25 25
Semester in Weightage 12 6 6
In Exam-II
Semester 120
Max Marks 50 25 25
Summative
Evaluation Lab In Semester Weightage 8 8
Total= 36 Exam 110
% Max Marks 50 50
Skill In-Sem Weightage 4 4

Exam 110
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:
31/32
8/11/2021
Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature of
Consultation
Name of Faculty Component of Consultation Consultation Course
Timings for each
of Faculty Faculty Day (s) Room No: faculty:
day
SREERAM
L 1-MA - - - -
NIMMAGADDA
SREERAM
P 1-MA - - - -
NIMMAGADDA
SREERAM
S 1-MA - - - -
NIMMAGADDA
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.
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 ]
32/32

Course handout-21SC1101

Uploaded by

Copyright:

Available Formats

Course handout-21SC1101

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Course handout-21SC1101

Uploaded by

Copyright:

Available Formats

8/11/2021

COURSE OUTCOMES (COs):

Apply and Analyse CRUD operations on Basic Data Structures

such a way that

Book No[CH Teaching-

Book No[CH Teaching-Learning

Book No[CH Teaching-Learning

Session Outcome: 1 Understand the concept of structured Programming

Session Outcome: 2 understand the Need of Modular Programming

1.Using File concepts, perform a simple addition by storing

Session Outcome: 2 Solve computer applications using structured programming

Session Outcome: 1 Apply operators to solve problems

Session Outcome: 1 Understand the usage of conditional statements

Session Outcome: 1 Develop solutions using conditional statements

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

Session Outcome: 1 Use bitwise operators

Session Outcome: 2 1. Use bitwise operators

Session Outcome: 1 understand operaotr precedency

Evaluate the following expression using BODMAS rule.

temperature. 3. Write a C Program for "Newton

Session Outcome: 1 Traslate iterative solutions to recursive solutions

Session Outcome: 1 Develop solutions using recursive logic

Session Outcome: 1 Understand the Strings

Session Outcome: 1 Apply String Library functions

Session Outcome: 1 Understand and implement 1D arrays

Session Outcome: 1 Apply linear search operation on array

Session Outcome: 1 Implementing and solving through DMA operations

Session Outcome: 1 Implement 2Dimensional Arrays and Multidimensional arrays.

Session Outcome: 1 Implement 2Dimensional Arrays and Multidimensional arrays.

Session Outcome: 1 Illustrate the usage of Structures

Now discuss how to store the above information into a record

Session Outcome: 1 Solve real world problems using structure array.

Session Outcome: 1 Implement stack using arrays

Session Outcome: 1 Implement insert operation on single linked list

Session Outcome: 2 Analyse time complexity of insert operation

Session Outcome: 1 Understand trees and tree terminology

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan:

1 Algorithms, Flowcharts CO5

4 Practice session on conditional statements and logical operators CO5

5 Iterative Statements CO5

6 Bitwise operators CO2

7 Problem solving using Recursion CO5

8 Problem solving using strings CO5

Session Outcome: 1 Develop inteactive solutions to real world problems

Session Outcome: 1 Develop inteactive solutions to real world problems

Time(min) Topic BTL TeachingLearning Active

Practice session: 1. Based on ICMR guidelines the Myuria company want

Session Outcome: 1 Develop applications using bitwise operators

Session Outcome: 1 Develop recusive solutions

1 Basic problems CO6

2 Data Types operators CO6

Session Outcome: 1 Develop solutions for simple problems

1. Write a C program to print "Hello World" 2. Write a C --- NOT

5. Write C functions to calculate area of circle, square. --- NOT

Session Outcome: 1 Develop code for real world problems

Session Outcome: 1 Develop programs to solve different kinds of computational problems