3rd Sem PDA
3rd Sem PDA
III SEMESTER
1
About the institution: The Hyderabad Karnataka Education (HKE) society founded by
Late Shri. Mahadevappa Rampure, a great visionary and educationist. The HKE Society runs
46 educational institutions. Poojya Doddappa Appa College of Engineering, Gulbarga is the
first institution established by the society in 1958. The college is celebrating its golden jubilee
year, setting new standards in the field of education and achieving greater heights. The college
was started with 50% central assistance and 50% state assistance, and a desire to impart
quality technical education to this part of Karnataka State. The initial intake was 120 with
degree offered in three branches of engineering viz, Civil, Mechanical and Electrical
Engineering. Now, it houses 11 undergraduate courses, 10 post Graduate courses and
12 Research centers, established in Civil Engg., Electronics & Communication Engg,
Industrial & Production Engg, Mechanical Engg, Electrical Engg., Ceramic Cement Tech.,
Information Science & Engg., Instrumentation Technology, Automobile Engg., Computer Sc.
and Engg., Mathematics and Chemistry All the courses are affiliated to Visveswaraya
Technological University, Belgaum. At present the total intake at UG level is 980 and PG
level 193.
The college receives grant in aid funds from state government. A number of projects have
been approved by MHRD /AICTE, Govt. of India for modernization of laboratories. KSCST,
Govt. of Karnataka is providing financial assistance regularly for the student's projects.
The National Board of Accreditation, New Delhi, has accredited the College in the year 2005-
08 for 09 UG Courses out of which 08 courses are accredited for three years and 01 course is
accredited for five years. And second time accredited for Six Course in the year 2009-2012
Our college is one among the 14 colleges selected under TEQIP, sponsored by World Bank. It
has received a grant of Rs 10.454 Crores under this scheme for its development. The
institution is selected for TEQIP phase II in year 2011 for four years. Institution is
receiving a grant of Rs. 12.50 Crores under TEQIP Phase -II scheme for its
development and selected for TEQIP-III as mentoring Institute for BIET Jhansi(UP).
Recognizing the excellent facilities, faculty, progressive outlook, high academic standards
and record performance, the VTU Belgaum reposed abundant confidence in the capabilities of
the College and the College was conferred Autonomous Status from the academic year 2007-
08, to update its own programme and curriculum, to devise and conduct examinations, and to
evaluate student's performance based on a system of continuous assessment. The academic
programmers are designed and updated by a Board of Studies at the department level and
Academic Council at the college level. These statutory bodies are constituted as per the
guidelines of the VTU Belgaum. A separate examination section headed by a Controller of
Examinations conducts the examinations.
At present the college has acquired the Academic autonomous status for both PG and UG
courses from the academic year 2007-08 and it is one among the six colleges in the state of
Karnataka to have autonomous status for both UG and PG courses.
One of the unique features of our college is, it is the first college in Karnataka State to start
the Electronics and Communication Engineering branch way back in the year 1967, to join
NIT Surathkal and IISc, Bangalore. Also, it is the only college in the state and one among the
three colleges across the country, offering a course in Ceramic and Cement Technology. This
2
is the outcome of understanding by faculty and management about the basic need of this
region, keeping in view of the available raw material and existing Cement Industries.
Bharatiya Vidya Bhavan National Award for an Engineering College having Best Overall
Performance for the year 2017 by ISTE (Indian Society for Technical Education). In the year
2000, the college was awarded as Best College of the year by KSCST, Bangalore in the state
levelstudents projects exhibition.
The college campus is spread over 71 acres of land on either side of Mumbai-Chennai railway
track and has a sprawling complex with gardens and greenery all around.
About the department: The Computer Science and Engineering department was started in
the year 1984 with an intake of 40 students for UG. The department has seen phenomenal
growth and now the department has increased UG intake to 120 students and offering two
Post Graduation programmes: PG (Computer Science and Engineering with an intake of
25students) and PG(Computer Network and Engineering with an intake of 18 students). The
department is offering research program under its recognized research center. Computer
Science and Design course was started from 2021 with an intake of 60 students. The
department is having state- of-the-art computing facilities with high speed internet facilities
and laboratories. The department library provides useful resources like books and journals.
The department has well qualified and experienced teaching faculty. The department has been
conducting several faculty development programs and student training programs.
To be an institute of excellence in technical education and research to serve the needs of the
industry and society at local and global levels.
To provide a high quality educational experience for students with values and
ethics thatenables them to become leaders in their chosen professions.
To explore, create and develop innovations in engineering and science through
research anddevelopment activities.
To provide beneficial service to the national and multinational industries and
communitiesthrough educational, technical, and professional activities
Vision of the Department
3
Mission of the Department
4
Program Outcomes:
5
Program Specific Outcomes (PSOs):
PSO3: Apply cutting edge technologies using modern tools to find novel solutions
ethicallyto existing problems.
6
Poojya Doddappa Appa Engineering College, Kalaburagi
(An Autonomous Institution)
Department of Computer Science & Engineering
SCHEME OF TEACHING FOR III SEMESTER–22 SERIES for Academic 2023-2024 (Approved)
Self Study
Duration in
Practical
Credits
Tutorial
Sl. Course
Lecture
Theory
Marks
Marks
Marks
No Code Course Title
hours
Total
SEE
CIE
(S)
(T)
(L)
Engineering Mathematics-III for
1 BSC 22MATS31 Computer Science Engineering 3 0 0 0 3 50 50 100 3
Stream
IPCC 22CS32 Analog and Digital Electronics 0
2 3 0 2 3 50 50 100 4
Object Oriented Programming with
3 IPCC 22CS33 3 0 2 0 3 50 50 100 4
JAVA
4 PCC 22CS34 Data Structures 3 0 0 0 3 50 50 100 3
5 PCCL 22CSL35 Data Structures Lab 0 0 2 0 3 50 50 100 1
Course Learning Objectives: To enable the students to obtain the knowledge of Engineering
Mathematics in the following topics
1. Probability distribution of discrete and continuous random variables
2. Joint probability distributions and discrete and continuous random variables
3.Analyse the sample data using Large sample test, t-distribution and chi- distribution
MODULES Teaching Hours
Module - I
Probability distributions: Random variable (Discrete and continuous) probability density 09 Hrs
function, cumulative density function. Binomial distribution, Poisson distributions, Normal
distribution and problems.
Module - II
Joint probability distributions: Concept of joint probability distribution, discrete and
continuous random variables independent random variables .problems on expectation 08 Hrs
and variance
Module – III
Sampling theory -I : Sampling, sampling distribution, standard error, null and
alternative hypothesis, Type-I and Type-II errors, Confidence limits. Test of 09 Hrs
significance for Large sample: Test for single proportion, difference of proportions,
single mean, difference of means, and difference of standard deviations
Module – IV
Sampling Theory – II: Test of significance Small samples student’s t-distribution: 08 Hrs
Test for single mean, difference of means, test for ratio of variances - Chi-square test
for goodness of fit and independence of attributes and problems
Module – V
Optimization techniques: Linear Programming: Mathematical formulation of linear
Programming problem (LPP), Types of solutions, Graphical Method, basic feasible 08 Hrs
solution, canonical and standard forms and simplex method.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text books:
1 Higher Engineering Mathematics by B.S.Grewal, Khanna publishers; 40th Edition.2007
2 Engineering Mathematics by N. P. Bali and Manish Goyal. Laxmi publications, latest edition
8
Reference books:
1.Advanced Engineering Mathematics by E. Kreyszig, John Willey & sons 8th Edn.
2.A short course in differential equations – Rainvile E.D.9th Edition.
3.Advanced Engineering Mathematics by R.K.Jain & S.R.K Iyengar; Narosa publishing House.
4.Introductory methods of numerical analysis by S.S.Sastry
4. Statistical Methods Authored By Gupta S.P. Publisher: Sultan Chand & Sons. Publishing Year: 2021
5. Fundamentals of Mathematical Statistics Authored By Gupta S.C.& Kapoor V.K. Publisher: Sultan
Chand & Sons. Publishing Year: 2020
Course outcomes:
On completion of the course, the student will have the ability to:
9
Course Title: ANALOG AND DIGITAL ELECTRONICS
Subject Code :22CS32 Credits :04 CIE: 50
Number of Lecture Hours/Week (L:T:P) 3 : 0 : 2 SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: Knowledge of Basic Electronics and Boolean algebra.
Course Objectives:
● Recall and Recognize characteristics of PDs, optocouplers, BJT.
● Demonstrate and analyze operational amplifier circuits and their applications
● Describe and analyze combinational logic circuits, simplifications of algebraic
equationsusing Karnaugh maps and Quine McClaskey techniques
● Design decoders, encoders and substractors , Binary comparators latches and flip flops.
● Design registers and counters , A/D and D/A converter.
MODULES Teaching Hours
Module – I
Photo diodes , Light emitting diodes, Optocouplers, BJT Biasing: Fixed Bias ,
Collector to Base Bias, Voltage Divider Bias, Operational Amplifiers, 10 Hrs
Application circuits: Multivibrators using 555 IC, Peak detector, Schmitt
trigger, Active filters, Non linear Amplifier, Relaxation Oscillator, Current to
voltage, voltage to Current converter, Regulated power supply parameters,
Adjustable voltage Regulator.
Module – II
The Basic Gates: Review of Basic Logic gates, Positive and Negative Logic.
Combinational Logic Circuits: Sum-of-Products Method, Truth Table to
Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications, Don‟t-
care Conditions, Product-of-sums Method, Product-of-sums simplifications, 08 Hrs
Simplification by Quine-McClusky Method, Hazards and Hazard covers.
Module – III
10
Module – V
1. Design and construct a Schmitt trigger using OP-Amp for given UTP and LTP values
anddemonstrate its working.
2. Design and implement an Astable multivibrator circuit using 555 timer for a
givenfrequency and duty cycle.
3. Design and implement Half adder, Full Adder, Half Subtractor, Full Subtractor using
basicgates.
4. Given a 4-variable logic expression, simplify it using Entered Variable Map and realize
thesimplified logic expression using 8:1 multiplexer IC.
5. Design and implement code converter I) Binary to Gray (II) Gray to Binary Code
usingbasic gates.
6. Design and verify the Truth Table of 3-bit Parity Generator and 4-bit Parity
Checker using basic Logic Gates with an even parity bit.
7. Realize a D,T,JK Flip-Flop using NAND gates and verify its truth table.
8. Design and implement a mod-n (n<8) synchronous up counter using JK Flip Flop ICs
and Demonstrate its working
9. Design and implement an Asynchronous counter using decade counter IC to count from
0to n(n<=9) and demonstrate on seven segment display(using IC 7447).
11. Generate a Ramp output waveform using DAC0800 (Inputs are given to DAC
throughIC74393 dual 4-bit binary counter).
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Anil K Maini, Varsha Agarwal, “Electronic Devices and Circuits”, Wiley, 2012.
2. Donald P Leach, Albert Paul Malvino & Goutam Saha, “Digital Principles and
Applications”, 8th Edition, Tata McGraw Hill, 2015
11
Reference Books:
1. R D Sudhaker Samuel, “Illustrative Approach to Logic Design”, Sanguine-Pearson, 2010.
2. M Morris Man, “Digital Logic and Computer Design”, 10th Edition, Pearson, 2008.
Course outcomes:
On completion of the course, the student will have the ability to:
12
Course Title: OBJECT ORIENTED PROGRAMMING WITH JAVA
Subject Code : 22CS33 Credit : 04 CIE: 50
Number of Lecture Hours/Week (L:T:P) 3: 0:2 SEE: 50
Module II
13
Module III
Module V
Applets: Applet basics, A complete Applet Skeleton, Applet Initialization and
Termination, A key Aspect of an Applet Architecture, Requesting Repainting, using
the status window, Passing parameters to Applets.
Event Handling- Two Event Handling Mechanisms.The Delegation Event Model-
Events: Event Sources, Event Listeners.Event Classes: The ActionEvent Class,
The AdjustmentEvent Class, The Component EventClass, The ContainerEvent 08 Hrs
Class, The FocusEventClass, TheInputEvent Class, The ItemEvent Class, The
KeyEvent Class, The MouseEvent Class, The MouseWheelEvent Class, The
TextEventClass, TheWindowEvent Class.Using the Delegation Event Model-
Handling Mouse Events, Handling Keyboard Events, Adapter Classes, Inner
Classes, Anonymous Inner Classes.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
14
Text Books:
1. Mastering C++, K R Venugopal, Rajkumar, T Ravishankar , 2012 Tata McGraw hill education
private limited
2. Java Fundamentals: A comprehensive Introduction by Herbert Schildt, Dale Skrien. Tata
McGraw Hill Edition 2013.
Reference Books:
1. Herbert Schildt , The Complete Reference, JAVA 7th/9th Edition, Tata McGraw Hill, 2013.
2. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education,2004.
Lab Programs:
1. Write a Java Program to demonstrate the creation of class for student information.
2. Write a program in Java for String handling which performs the following:
i) Checks the capacity of String Buffer objects.
ii) Reverses the contents of a string given on console and converts the resultant string in upper
case.
iii) Reads a string from console and appends it to the resultant string of ii.
15
8. Write a Java program to implement multithreading in JAVA which demonstrate built in
methods available for thread.
10. Write a JAVA applet program to create a basic Applet having buttons, text area GUI
controls to add & subtract two nos. Use appropriate event listeners.
11. Write a Java program to store, delete and update data in a database with the support of JDBC-
ODBC connectivity
CourseCode CO # Course Outcome (CO)
16
Course Title: DATA STRUCTURES
Subject Code : 22CS34 Credits :03 CIE: 50
Number of Lecture Hours/Week (L:T:P) 3 :0:0 SEE: 50
Total Number of Lecture Hours 42 SEE Hours: 03
Prerequisites: C language fundamentals and programming skill, Basic knowledge of
algorithm development, Knowledge of linear and Non-linear data types
Course Objectives:
To study the behavior of data structures such as stacks, queues, trees, hash
techniques,search trees and their representations.
To choose the appropriate data structure for a specified application.
To analyze various searching and sorting algorithms.
MODULES Teaching
Hours
Module - I
Structures and Unions: Structure definition, giving value to members, Structure
initialization, Comparison of structure variables , Arrays of structures, Arrays within
structures, Structure within structures, Structure and functions, Unions, Size of
structures, Bit-fields.
Pointers: Understanding pointers, and the address of operator, Declaring and
initializing pointer, Accessing a variable through it's pointer, Pointer and arrays, Pointer 08 Hrs
and character strings, Pointer and functions, Pointer and Structures.
Dynamic memory allocation: Meaning of dynamic memory allocation, MALLOC,
CALLOC, Free and REALLOC functions, Pointer revisited.
File management: Definition and opening a file, closing a file, I/O operations on files,
Error handling during file operation, Radom access to files, Command line arguments
Module - II
Definition and Representing Stack in C: Primitive operation, Example. Implementing
the pop() operation, Testing for exceptional conditions, Implementing the push()
operation, Example: Infix, Postfix and Prefix, Basic definitions and Examples,
Evaluating a postfix expression, Program to evaluate postfix expression , Converting an
expression from infix to postfix, Program to convert expression from infix to postfix. 08 Hrs
Recursive definition and processes: Factorial function, Multiplication of natural
numbers, Fibonacci sequence, Binary search, Properties of recursive definition or
algorithm Recursion in C: Factorial of a number Generation of Fibonacci numbers,
Binary searching, Towers of Hanoi problem.
Module – III
The queue and it's sequential representation: C implementation of queues, Insert
operation, Priority queues, Array implementation of priority Linked lists: Inserting and
removing nodes from a list. Linked implementation of stacks, Get node and Free node 08 Hrs
operations, Linked list implementation of queues, Linked list as a data structure,
Example of list operations, Header nodes. Array implementation of list, Linked
implementation of lists. Limitations of array implementation, Allocating and freeing
dynamic variables, Linked list using dynamic variable, Queues as lists in C,
Example of list operations in C, Non- integer and non -homogeneous lists.
17
Module - IV
Other list structures: Circular lists, Stack as circular list, Queues as a circular list,
Primitive operations on circular list, doubly linked list.
Binary trees: Operations on binary trees and applications of binary trees Binary tree
representation: Node representation of binary tree, Internal and external nodes, Implicit 09 Hrs
array representation of binary trees, Choosing a binary tree representation, Binary tree
traversals in C, Threaded Binary trees.
Trees and their applications: C representation of trees, Tree traversals, General
expression as trees, Evaluating an expression tree, Constructing a tree.
Module - V
Sorting & Searching: Binary tree sort, Simple insertion sort, Address calculation sort,
Radix sort. Sequential searching, Searching an ordered table, Indexed sequential 09 Hrs
search, Interpolation search. Tree searching: Inserting into a binary search tree,
Deleting from a binary search tree.
Hashing: Resolving hash clashed by open addressing, Choosing a hash function.
Question paper pattern:
The question paper will have ten questions.
There will be 2 questions from each module, covering all the topics from a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text book :
1. E. Balgurusamy , “Programming in ANSI C”, 7 th Edition, Tata McGraw-Hill Publication,
2017.
2. Yedidyah Langsam, Moshe J. Augenstein and Aaron M. Tannenbaum, “Data Structures
Using C and C++”, 2nd Edition, Prentice-Hall of India publication, 2005.
Reference Books:
1. Debasis Samanta, “Classic Data Structures”, 2nd Edition, PHI, 2009.
2. Richard F. Gilberg and Behrouz A. Forouzan:, “Data Structures APseudocode Approachwith
C”, Cengage Learning, 2005.
3. Robert Kruse & Bruce Leung, “Data Structures & ProgramDesign in C”,
Pearson Education, 2007.
4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education, 2007.
Course outcomes:
On completion of the course, the student will have the ability to:
18
Course Title: DATA STRUCTURES LAB
Subject Code : 22CSL35 Credits :01 CIE: 50
Number of Lecture Hours/Week (L:T:P) 0:0:2 SEE: 50
SEE Hours: 03
Prerequisite: C Language : Functions and Pointers
Course Objectives :
1. To study the working of data structures such as stacks, queues, trees, hash techniques, search
trees.
2. Apply the appropriate data structure for a specified application.
3. To learn various searching and sorting algorithms.
List of
Programs
1. Design, Develop and Implement a menu driven Program in C for the following
Arrayoperations
a. Creating an Array of N Integer Elements
b. Display of Array Elements with Suitable Headings
c. Inserting an Element (ELEM) at a given valid Position (POS)
d. Deleting an Element at a given valid Position(POS)
e. Exit.
Support the program with functions for each of the above operation.
3. Design, Develop and Implement a menu driven Program in C for the following operations
onSTACK of Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Display the status of Stack
d. Demonstrate Overflow and Underflow situations on Stack
e. Exit
Support the program with appropriate functions for each of the above operations.
4. Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix
Expression. Program should support for both parenthesized and free parenthesized expressions
with the operators: +, -, *, /, %( Remainder), ^ (Power) and alphanumeric operands.
19
5. 5. Design, Develop and Implement a Program in C for the following Stack Application. Evaluation
of Suffix expression with single digit operands and operators: +, -, *, /, %, ^.
6. 6. Design, Develop and Implement a menu driven Program in C for the following operations on QUEUE of
Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to QUEUE
b.Delete an Element from QUEUE
c. Demonstrate Overflow and Underflow situations on QUEUE
d.Display the status of QUEUE
e. Exit
Support the program with appropriate functions for each of the above operations
10. Design, Develop and Implement a Program in C for the following operations on
BinarySearch Tree(BST) of Integers
a. Create a BST of N integers: 6,9,5,2,8,15,24,14,7,8,5,2.
b. Traverse the BST in Inorder
c. Traverse the BST in Preorder
d. Traverse the BST in Postorder
11. 11. Given a File of N employee records with a set K of Keys(4- digit) which uniquely determine the
records in file F. Assume that file F is maintained in memory by a Hash Table(HT) of m memory
locations with L as the set of memory addresses (2- digit) of locations in HT. Let the keys in K and
Addresses in L are Integers. Design and develop a Program in C that uses Hash function H: K ®L as
H(K)=K mod m (remainder method), and implement hashing technique to map a given key K to the
address space L. Resolve the collision (if any) using linear probing.
20
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Demonstrate the concepts of arrays and strings.
CO2 Design and develop various data structure using pointers ,dynamic memory
22CSL35 allocation and recursion
CO3 Demonstrate basic operation on Linked list using suitable data structures.
CO4 Illustrate the implementation of different sorting and searching techniques.
CO5 Construct Binary trees and binary search trees and demonstrate the concepts
of hashing technique.
21
Course Title: OPERATING SYSTEM
Subject Code:22CS36A Credit:3 CIE:50
Number of Lecture Hours/Week (L:T:P) 3 : 0: 0 SEE:50
Total Number of Lecture Hours 42 SEE Hours:03
Prerequisites: Microprocessor
Course Objectives:
Learn services provided by the operating system and design of operating system
Gain knowledge on how processes are synchronized and scheduled how different resources are
managed.
Understand structure and organization of file system and approaches to memory
management.
MODULES Teaching
Hours
Module– I
Introduction: Operating Systems, Computer-System Organization, Computer-System
Architecture, Operating-System Operations, Process Management, Memory
Management, Storage Management, Security and Protection, Kernel Data Structures,
Computing Environments.
Operating-System Structures: Operating-System Services, User and Operating- 08 Hrs
System Interface, System Calls, Types of System Calls, System Programs, Operating-
System Design and Implementation, Operating System Structure.
Case Studies: Architecture of UNIX, The Kernel of Unix; The Kernel of Solaris;
Architecture of Windows.
Module-II
Process Management: Process Concept, Process Scheduling, Operations on
Processes, Interprocess Communication, Communication in Client–Server Systems.
Multithreaded Programming: Overview, Multicore Programming, 08 Hrs
Multithreading Models, Thread Libraries, Implicit Threading, Threading Issues
Module– III
Process Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms,
Thread Scheduling, Multi-Processor Scheduling, Real-Time CPU Scheduling
Process Synchronization: The Critical-Section Problem, Petersons Solution, 09 Hrs
Synchronization hardware, Mutex Locks, Semaphores, Classic Problems of
Synchronization, Monitors.
Module– IV
Deadlocks: System Model, Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery 08 Hrs
from Deadlock.
Memory Management: Background, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table.
22
Module– V
Virtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement,
Allocation of Frames, Thrashing, Memory mapped files, Allocating Kernel Memory 09 Hrs
File System: File-System Interface: File Concept, Access Methods, Directory and
disk Structure, File system Mounting, File Sharing, and Protection.
23
Course Title: Social Connect & Responsibility
Subject Code: 22UHV37 Credit : 1 CIE: 100
Number of Lecture Hours/Week (L:T:P:S) 0:0:3:1 Hrs
Total Hours of Pedagogy 40 hour Practical Session +15
(No SEE – Only CIE) hour Planning
Module-II
Heritage walk and crafts corner: Heritage tour, knowing the history and culture of
the city, connecting to people around through their history, knowing the city and its
craftsman, photo blog and documentary on evolution and practice of various craft forms
- – Objectives, Visit, case study, report, outcomes.
24
Module-III
Organic farming and waste management: Usefulness of organic farming, wet
waste management in neighboring villages, and implementation in the campus
Objectives, Visit, case study, report, outcomes.
Module-IV
Water conservation: Knowing the present practices in the surrounding villages and
implementation in the campus, documentary or photo blog presenting the current
practices – Objectives, Visit, case study, report, outcomes.
Module-V
Food walk: City’s culinary practices, food lore, and indigenous materials of the region
used in cooking – Objectives, Visit, case study, report, outcomes.
Course outcomes (Course Skill Set):
At the end of the course, the student will be able to:
CO1: Communicate and connect to the surrounding. CO2: Create a responsible connection with the
society.
CO3: Involve in the community in general in which they work.
CO4: Notice the needs and problems of the community and involve them in problem –solving.
CO5: Develop among themselves a sense of social & civic responsibility & utilize their knowledge in
finding practical solutions to individual and community problems.
CO6: Develop competence required for group-living and sharing of responsibilities & gain skills
in mobilizing community participation to acquire leadership qualities and democratic attitudes.
Activities:
Jamming session, open mic, and poetry: Platform to connect to others. Share the stories with others.
Share the experience of Social Connect. Exhibit the talent like playing instruments, singing, one-act
play, art-painting, and fine art.
PEDAGOGY:
The pedagogy will include interactive lectures, inspiring guest talks, field visits, social immersion, and
a course project. Applying and synthesizing information from these sources to define the social
problem to address and take up the solution as the course project, with your group. Social immersion
with NGOs/social sections will be a key part of the course. Will all lead to the course project that will
address the needs of the social sector?
COURSE TOPICS:
The course will introduce social context and various players in the social space, and present
approaches to discovering and understanding social needs. Social immersion and inspiring
conversional will culminate in developing an actual, idea for problem-based intervention, based on an
in-depth understanding of a key social problem.
Duration :
A total of 40 - 50 hrs engagement per semester is required for the 3rd semester of the B.E.
/B.Tech. program. The students will be divided into groups. Each group will be handled by faculty
mentor. Faculty mentor will design the activities (particularly Jamming sessions open mic ,and poetry)
Faculty mentors has to design the evaluation system as per VTU guidelines ofscheme & syllabus.
25
Guideline for Assessment Process:
Continuous Internal Evaluation (CIE):
After completion of the course, the student shall prepare, with daily diary as reference, a
comprehensive report in consultation with the mentor/s to indicate what he has observed and learned
in the social connect period. The report should be signed by the mentor. The report shall be evaluated
on the basis of the following criteria and/or other relevant criteria pertaining to the activity completed.
Marks allotted for the diary are out of 50. Planning and scheduling the social connect Information/Data
collected during the social connect Analysis of the information/data and report writing Considering all
above points allotting the marks as mentioned below
Excellent : 80 to 100
Good : 60 to 79
Satisfactory : 40 to 59Unsatisfactory and fail : <39
Special Note:
NO SEE – Semester End Exam – Completely Practical and activities based evaluation
Pedagogy – Guidelines:
It may differ depending on local resources available for the study as well as environment and
climatic differences, location and time of execution.
Sl Topic Grou Location Activity Reporting Evaluation of
No psize execution the Topic
1. Plantation May be Farmers land/ Site selection Report should Evaluation
andadoption individual parks / Villages / /proper be submitted by as per the
of a tree: or team roadside/ consultation/ individual to the rubrics Of
community area / Continuous concerned scheme and
College campus monitoring/ evaluation syllabus by
etc….. Information authority Faculty
board
2. Heritage May be Temples / Site selection Report should Evaluation
walk and individual monumental places /proper be submitted by as per the
crafts or team / Villages/ City consultation/ individual to the rubrics Of
corner: Areas / Grama Continuous concerned scheme and
panchayat/ public monitoring/ evaluation syllabus by
associations/ Information authority Faculty
Government board
Schemes officers/
campus etc…..
3. Organic May be Farmers land / Group selection Report should Evaluation
farmingand individual parks / Villages / proper be submitted by as per the
waste or team visits consultation individual to the rubrics Of
management / roadside/ / Continuous concerned scheme and
: community area / monitoring / evaluation syllabus by
College campus Information authority Faculty
etc….. board
26
4. Water May be Villages/ City site selection / Report should be Evaluation
conservation individual Areas / Grama proper submitted by as per the
:& or team panchayat/ public consultation/ individual to the rubrics Of
conservation associations/ Continuous concerned scheme and
techniques Government monitoring/ evaluation syllabus by
authority
Schemes officers / Information Faculty
campus etc….. board
5. Food walk: May be Villages/ City Group selection / Report should Evaluation
Practices in individual Areas / Grama proper be submitted by as per the
society or team panchayat/ public consultation individual to the rubrics Of
associations/ / Continuous concerned scheme and
Goverment monitoring / evaluation syllabus by
authority
Schemes officers/ Information Faculty
campus etc….. board
27
Video based seminar for 10 minutes sheet should be sent to the
by each student At the end of university and also to be made
25 Marks
semester with Report. available at LIC visit.
Activities 1 to 5, 5*5 = 25
Total marks for the course in each
100 Marks
semester
For each activity, 20 marks CIE will be evaluated for IA marks at the end of semester,
Report and assessment copy should be made available in the department.
Students should present the progress of the activities as per the schedule in the prescribed
practical session in the field.
There should be positive progress in the vertical order for the benefit of society in general through
activities.
28
Course Title: Mastering Office
Subject Code : 22CSAE381 Credit : 1 CIE: 50
Number of Practical Hours/Week/batch (L:T:P) 0:0:2 SEE: 50
Total Number of Practical Hours 12 SEE Hours: 03
Pre-requisites: Basic computer knowledge.
Course objectives:
Understand the use of MS-Office tools.
Develop skills in analyzing the usability office tools.
Programs
MS-Word -
1. Create Word document illustrating Text – Formatting, Moving, copying and pasting text,
Styles – Lists – Bulleted and numbered lists, Nested lists, Formatting lists. Table
Manipulations.
2. Create Word document illustrating -Graphics – Adding clip Art, add an image from a file,
editing graphics, Page formatting - Header and footers, page numbers, Protect the Document,
Mail Merge, Macros – Creating & Saving web pages, Hyperlinks.
MS-Excel-
3. Modifying a Worksheet – Moving through cells, adding worksheets, rows and columns,
Resizing rows and columns, selecting cells, Moving and copying cells, freezing panes - Macros
– recording and running.
4. . Linking worksheets - Sorting and Filling, Alternating text and numbers with Auto fill, Auto
filling functions. Graphics – Adding clip art, add an image from a file, Charts – Using chart
Wizard, Copy a chart to Microsoft Word.
MS-Power Point -
5. Create a Presentation from a template- Working with Slides – Insert a new slide, applying a
design template, changing slide layouts – Resizing a text box, Text box properties, delete a text
box.
6. Video and Audio effects, Color Schemes & Backgrounds Adding clip art, adding an image
from a file, Save as a web page.
MS-Access -
7. Create Access database wizard, pages and projects. Creating Tables – Create a Table in design
view. Datasheet Records – Adding, Editing, deleting records
8. Implement Adding and deleting columns Resizing rows and columns, finding data in a table &
replacing, Print a datasheet. Queries - MS-Access.
Microsoft Outlook
Course outcomes:
On completion of the course, the student will have the ability to:
29
Course CO # Course Outcome (CO)
Code
CO1 Know the basics of computers and prepare documents, spreadsheets,
make small presentations with audio, video and graphs and would be
acquainted with internet.
CO2 Create, edit, save and print documents with list tables, header, footer,
graphic, spellchecker, mail merge and grammar checker
22CSAE381 CO3 Attain the knowledge about spreadsheet with formula, macros spell
checker etc.
CO4 Demonstrate the ability to apply application software in an office
environment.
CO5 Use Google Suite for office data management tasks
30
Course Title : NATIONAL SERVICE SCHEME (NSS)
Subject Code : 22NS39 Credits :00 CIE: 50
Number of Lecture Hours/Week(L:T:P) 0:0:2 Hrs SEE: 00
Total Number of Lecture Hours 28 SEE Hours: 00
Prerequisites:
1. Students should have a service oriented mind set and social concern.
2. Students should have dedication to work at any remote place, anytime with available
resources and proper time management for the other works.
Students should be ready to sacrifice some of the time and wishes to achieve service oriented
targets on time
Course Objectives:
1. Understand the community in which they work
2. Identify the needs and problems of the community and involve them in problem-solving
3. Develop among themselves a sense of social & civic responsibility & utilize their knowledge in
finding practical solutions to individual and community problems
4. Develop competence required for group-living and sharing of responsibilities & gain skills in
mobilizing community participation to acquire leadership qualities and democratic attitudes
Develop capacity to meet emergencies and natural disasters & practice national integration and
social harmony
Modules
1. Organic farming, Indian Agriculture (Past, Present and Future) Connectivity for marketing.
2. Waste management– Public, Private and Govt organization, 5 R’s.
3. Setting of the information imparting club for women leading to contribution in social and
economic issues.
4. Water conservation techniques – Role of different stakeholders– Implementation.
5. Preparing an actionable business proposal for enhancing the village income and approach for
implementation.
6. Helping local schools to achieve good results and enhance their enrolment in Higher/ technical/
vocational education.
7. Developing Sustainable Water management system for rural areas and implementation
approaches.
8. Contribution to any national level initiative of Government of India. Foreg. Digital India, Skill
India, Swachh Bharat, Atmanirbhar Bharath,Make in India, Mudra scheme, Skill development
programs etc.
31
9. Spreading public awareness under rural outreach programs.(minimum5 programs).
10. Social connect and responsibilities.
11. Plantation and adoption of plants. Know your plants.
12. Organize National integration and social harmony events /workshops /seminars. (Minimum 02
programs).
13. Govt. school Rejuvenation and helping them to achieve good infrastructur
ONE NSS – CAMP @ College /University /State or Central Govt Level / NGO’s / General
Social Camps:
Students have to take up anyone activity on the above said topics and have to prepare content for
awareness and technical contents for implementation of the projects and have to present strategies for
Implementation of the same. Compulsorily students have to attend one camp.
CIE will be evaluated based on their presentation, approach and implementation strategies.
Course outcomes:
On completion of the course, the student will have the ability to:
Course CO # Course Outcome (CO)
Code
CO1 Understand the importance of his / her responsibilities towards society.
CO2 Analyze the environmental and societal problems/issues and will be able to
22NS39 design solutions for the same.
CO3 Evaluate the existing system and to propose practical solutions for the same
for sustainable development.
CO4 Implement government or self-driven projects effectively in the field.
32
Course Title : PHYSICAL EDUCATION AND SPORTS
Subject Code : 22PE39 Credits :00 CIE: 50
Number of Lecture 0:0:2 Hrs SEE: 00
Hours/Week(L:T:P)
Total Number of Lecture Hours 28 SEE Hours: 00
SEMESTER COURSE
Fitness Components
III
Kabaddi/ Kho Kho
Athletics
IV Volleyball
Throw ball / Chess
Athletics
V
Football/Hockey
Athletics
VI
Cricket/Base ball
Athletics
VII
Netball/Basketball
Individual Games
VIII
Handball/ Badminton
Notes:
· One Hour of Lecture is equal to 1 Credit
· One Hour of Tutorial is equal to 1 Credit (Except Languages)
· Two Hours of Practical is equal to 1 Credit
· SEE : Semester End Examination
· CIE : Continuous Internal Examination
· L+T+P : Lecture + Tutorial + Practical
COURSE
SEMESTER CONTENT NO. HOURS
TITLE
III Fitness Meaning and Importance, Fit India Movement,
Component Definition of fitness, Components of fitness,
Speed Benefits of fitness, Types of fitness and Fitness
Strength tips.
Endurance Practical Components: Speed, Strength,
Agility Endurance, Flexibility, and Agility Total 32 Hrs
Flexibility KABADDI 2 Hrs/Week
A. Fundamental skills
1.Skills in Raiding: Touching with hands, Use
of leg-toe touch, squat leg thrust, side kick,
mule kick, arrow fly kick, crossing of baulk
line. Crossing of Bonus line.
2.Skills of holding the raider: Various
formations, catching from particular
position, different catches, catching
formation and techniques. 2-3-2 System Chain
Formation
3.Additional skills in raiding: Escaping from
various holds, techniques of escaping from
chain formation, offense and defense.
4.Game practice with application of Rules and
33
Regulations.
B. Rules and their interpretations and duties
of the officials.
Kho kho A. Fundamental skills
1. Skills in Chasing: Sit on the box (Parallel &
Bullet method), Get up from the box
(Proximal & Distal method), Give Kho (Simple,
Early, Late &Judgment), Pole Dive, Tapping,
Hammering, Rectification of foul.
2.Skills in running: Chain Play, Ring play and
Double and Single chain & Ring mixed play
figure of 8-3 by 6.
3.Game practice with application of Rules and
Regulations.
B. Rules and their interpretations and
duties of the officials.
REFERENCES
1. Saha, A. K. Sarir Siksher Ritiniti, Rana Publishing House, Kalyani.
2. Bandopadhyay, K. Sarir Siksha Parichay, Classic Publishers, Kolkata.
3. Petipus, et al. Athlete’s Guide to Career Planning, Human Kinetics.
4. Dharma, P.N. Fundamentals of Track and Field, Khel Sahitya Kendra, New Delhi.
5. Jain, R. Play and Learn Cricket, Khel Sahitya Kendra, New Delhi.
6. Vivek Thani, Coaching Cricket, Khel Sahitya Kendra, New Delhi.
7. Saha, A. K. Sarir Siksher Ritiniti, Rana Publishing House, Kalyani.
8. Bandopadhyay, K. Sarir Siksha Parichay, Classic Publishers, Kolkata
9. Naveen Jain, Play and Learn Basketball, Khel Sahitya Kendra, New Delhi.
10. Dubey, H. C. Basketball, Discovery Publishing House, New Delhi.
11. Rachana Jain, Teach Yourself Basketball, Sports Publication.
12. Jack Nagle, Power Pattern Offences for Winning asketball, Parker Publishing Co., New York.
13. Renu Jain, Play and Learn Basketball, Khel Sahitya Kendra, New Delhi.
14. Sally Kus, Coaching Volleyball Successfully, Human Kinetics.
15. Saha, A. K. Sarir Siksher Ritiniti, Rana Publishing House, Kalyani. 16 Bandopadhyay, K.
Sarir
Siksha Parichay, Classic Publishers, Kolkata
16. Test and Measurement (by Cleark and Cleark)
17. Evaluation in Physical Education (by Dr. Devendraya Kausal)
18. Methods of Physical Education (by Haridrash & Prof. Tirumalay Swamy)
19. Athletics (by Hardayal Singh)
20. Efficienting and Coaching (by Dr. Anand Nadigri)
21. Modern and Ancient History of Physical Education (by Dr. D. M. Jyothi)
22. Organization and Administration (by K. G. Nadigir or Vastrad)
38
Course Title : YOGA AND MEDITATION
Subject Code : 22YO39 Credits :00 CIE: 50
Number of Lecture Hours/Week(L:T:P) 0:0:2 Hrs SEE: 00
Total Number of Lecture Hours 28 SEE Hours: 00
SEMESTER CONTENTS
III 1) Introduction of Yoga, Aim and Objectives of yoga, Prayer
2) Brief introduction of yogic practices for common man
3) Rules and regulations
4) Misconceptions of yoga
5) Suryanamaskara
6) Different types of Asanas
a. Sitting
b. Standing
c. Prone line
d. Supine line
IV 1) Patanjali’s Ashtanga Yoga
2) Suryanamaskara
3) Different types of Asanas
a. Sitting
b. Standing
c. Prone line
d. Supine line
4) Kapalbhati
5) Pranayama
V 1) Patanjali’s Ashtanga Yoga
2) Suryanamaskara
3) Different types of Asanas
a. Sitting
b. Standing
c.Prone line
d.Supine line
4) Kapalbhati
5) Pranayama
39
VI 1) Patanjali’s Ashtanga Yoga
2) Suryanamaskara
3) Different types of Asanas
a. Sitting
b. Standing
c.Prone line
d.Supine line
4) Kapalbhati
5) Pranayama
VII 1) Patanjali’s Ashtanga Yoga
2) Suryanamaskara
3) Different types of Asanas
a. Sitting
b. Standing
c.Prone line
d.Supine line
4) Kapalbhati
5) Pranayama
VIII 1) Patanjali’s Ashtanga Yoga
2) Suryanamaskara
3) Different types of Asanas
a. Sitting
b. Standing
c. Prone line
d. Supine line
4) Kapalbhati
5) Pranayama
6) Shat Kriyas
Notes:
· One Hour of Lecture is equal to 1 Credit
· One Hour of Tutorial is equal to 1 Credit ( Except Languages)
· Two Hours of Practical is equal to 1 Credit
· SEE : Semester End Examination
· CIE : Continuous Internal Examination
· L+T+P : Lecture + Tutorial + Practical
40
41
42
43