34cscommsyll
34cscommsyll
s
correlation, transition probabilities, stationary distributions, and absorbing states for stochastic
systems.
bu
5. Apply statistical inference techniques including hypothesis testing, confidence intervals, large and
lla
small sample tests, Student's t-test, Chi-square test, and the Central Limit Theorem to draw valid
Sy
Introduction of modular arithmetic and its applications in Computer Science and Engineering. Introduction
ra
to Congruences, Linear Congruences, The Remainder theorem, Solving Polynomials, Linear Diophantine
Equation, System of Linear Congruences, Euler’s Theorem, Wilson Theorem and Fermat’s little theorem.
D
1
2
s
5.
bu
Practice problems on 𝑦 = 𝑎𝑥 𝑏 and correlation
lla
6. Practice problems on lines of regression and rank correlation
Sy
Textbooks:
1. Ronald E. Walpole, Raymond H Myers, Sharon L Myers & Keying Ye “Probability and Statistics for
Engineers and Scientists”, Pearson Education, Ninth edition, 2012.
2. Murray R. Spiegel, Larry J. Stephens, Statistics, Schaum’s outline series, Third edition,
3. Koshy, Thomas. Elementary number theory with applications. Academic press, 2nd Edition, 2009.
4. Seymour Lipschutz and Marc Lars Lipson, Probability, Schaum’s Outline Series, Second edition, 2011.
1. Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons, 9 th Edition, 2006.
2. B. S. Grewal “Higher Engineering Mathematics”, Khanna publishers, 44 th Ed., 2021.
3. Irwin Miller & Marylees Miller, John E. Freund’s “Mathematical Statistics with Applications” Pearson.
Dorling Kindersley Pvt. Ltd. India, 8th edition, 2014.
4. S C Gupta and V K Kapoor, “Fundamentals of Mathematical Statistics”, S Chand and Company, Latest
edition.
5. P. G. Hoel, S. C. Port and C. J. Stone, “Introduction to Probability Theory”, Universal Book Stall, (Reprint),
2003.
6. S. Ross, “A First Course in Probability”, Pearson Education India, 6 th Ed., 2002.
2
3
s
o Students review video lectures and reading materials before class.
bu
o Classroom sessions focus on problem-solving, discussions, and applications of transform techniques
lla
and optimization models.
● Problem-Based Learning (PBL)
Sy
o Use of MATLAB, Python, and online simulation tools to visualize transforms, optimization problems,
D
Assessment Structure:
The assessment in each course is divided equally between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each carrying 50% weightage.
● To qualify and become eligible to appear for SEE, in the CIE, a student must score at least 40% of 50
marks, i.e., 20 marks.
● To pass the SEE, a student must score at least 35% of 50 marks, i.e., 18 marks.
● Notwithstanding the above, a student is considered to have passed the course, provided the
combined total of CIE and SEE is at least 40 out of 100 marks.
3
4
Continuous Comprehensive Assessments (CCA)+ Internal Assessment Test (IA) = Continuous Internal
Evaluation - CIE [25+25=50 marks]
A minimum of two Internal Assessment Tests (IA)shall be conducted, carrying a total of 25 marks.
In addition, Continuous Comprehensive Assessment (CCA) shall be conducted for a total of 25 marks.
It is recommended to include a maximum of two learning activities as part of the CCA to foster the holistic
development of students. These activities shall be:
Sl. No. Name of the Learning activity Maximum Marks
1. Activity-1: Problem-solving assignment at RBTL-3/4 15
2. Activity-2: Solving GATE questions 10
s
Understanding of
Demonstrates bu
Good understanding Basic
excellent conceptual Poor understanding
Concepts with minor errors understanding
lla
clarity and application
Sy
ft
ra
Moderate
Accuracy & Precision Very high accuracy Good accuracy Low accuracy
accuracy
4
5
SL: Self Learning, MOOCs, spoken tutorials, online educational resources etc.
Sl. No. Self-Learning (SL) Activity Number of Hours /
Semester
1 Real-Life Applications of Continuous Probability Distribution 2
([Link]
continuous-probability-distribution/)
2 Probability and statistics 18
([Link]
probability/)
s
become eligible to appear for the SEE. bu
lla
Passing requirement in SEE
Sy
1. For a pass in the Semester End Examination (SEE), a student shall secure a minimum of 35
marks out of 100.
ft
2. For the declaration of a pass grade, the sum of the Continuous Internal Evaluation (CIE)
ra
marks (out of 50) marks and the SEE marks scaled down to 50 shall be greater than or equal
D
to 40 marks.
3. If the total (CIE + SEE) is less than 40 marks, the student shall be awarded the grade ‘F’ (Fail).
5
IPCC (4 Credits) template30.03.2026 1
Module-1
s
An Overview of Java: Object-Oriented Programming (Two Paradigms, Abstraction, The Three OOP
bu
Principles), Using Blocks of Code, Lexical Issues (Whitespace, Identifiers, Literals, Comments, Separators,
lla
The Java Keywords).
Sy
Data Types, Variables, and Arrays: The Primitive Types (Integers, Floating-Point Types, Characters,
ft
Booleans), Variables, Type Conversion and Casting, Automatic Type Promotion in Expressions, Arrays.
ra
D
Operators: Arithmetic Operators, Relational Operators, Boolean Logical Operators, The Assignment
Operator, The ? Operator, Operator Precedence, Using Parentheses.
Control Statements: Java’s Selection Statements (if, The Traditional switch), Iteration Statements (while,
do-while, for, The For-Each Version of the for Loop, Local Variable Type Inference in a for Loop,Nested
Loops), Jump Statements (Using break, Using continue, return).
Methods and Classes: Overloading Methods, Using Objects as Parameters, Argument Passing, Returning
Objects, Recursion, Introducing Access Control, Understanding static, Introducing final, Introducing Nested
and Inner Classes.
1
IPCC (4 Credits) template30.03.2026 2
Interfaces: Interfaces, Default Interface Methods, Use static Methods in an Interface, Private Interface
Methods.
Multithreaded Programming: The Java Thread Model, The Main Thread, Creating a Thread, Creating
Multiple Threads, Using isAlive() and join(), Thread Priorities,Obtaining a Thread’s State.
s
Generics: A Simple Generics Example, A Generic Class with Two Type Parameters, The General Form of a
bu
Generic Class.
lla
Textbook: Chapters 12, 14 Number of Hours: 8
Sy
2. Develop a stack class to hold a maximum of 10 integers with suitable methods. Develop a Java main
D
2
IPCC (4 Credits) template30.03.2026 3
9. Develop a Java program using an enumeration called Department containing CSE, ISE, ECE, and
MECH. Accept a department name as input and display the selected department using valueOf().
10. Develop a Java program to read the marks of three subjects as strings, convert them into wrapper
objects, calculate the total and average using autoboxing/unboxing and display the result.
11. Micro Project: A team of two to three students shall develop a project and submit a brief report for
a specific task assigned by the course instructor based on the concepts covered in the syllabus.
Note: Each experiment (1 to 10) will be evaluated for 30 marks (total 300), and the micro-project for 120
marks. Total marks (420) shall be scaled down to 15. Make use of the most recent version of the IDE tool for
program development.
Suggested Learning Resources: (Text Book/ Reference Book/ Manuals):
Textbooks:
1. Herbert Schildt and Danny Coward, Java: The Complete Reference, 13 th Edition, McGraw-Hill, 2024.
s
bu
1. Cay S. Horstmann, Core Java Volume I – Fundamentals, 14th Edition, Oracle Press, 2026.
lla
2. E. Balagurusamy, Programming with Java, 7th Edition, McGraw-Hill Education, 2024.
Web links and Video Lectures (e-Resources):
Sy
3
IPCC (4 Credits) template30.03.2026 4
Assessment Structure:
The assessment for each course is equally divided between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each component carrying 50% weightage (i.e., 50 marks each).
The CIE Theory component will be 25 marks and CIE Practical component will be 25 marks.
The CIE Theory component consists of IA tests for 25 marks. The CIE Practical component for continuous
assessments will be for 15 marks through rubrics and for lab tests will be for 10 marks.
● To qualify and become eligible to appear for SEE, in the CIE theory component, a student must
score at least 40% of 25 marks, i.e., 10 marks.
● To qualify and become eligible to appear for SEE, in the CIE Practical component, a student must
secure a minimum of 40% of 25 marks, i.e., 10 marks.
● To pass the SEE, a student must secure a minimum of 35% of 50 marks, i.e., 18 marks.
● A student is deemed to have successfully completed the course if the combined total of CIE and
SEE is at least 40 out of 100 marks.
CIE Practical component:
The CIE marks awarded in the case of the Practical component shall be based on the continuous evaluation of
the laboratory report using a defined set of rubrics. Each experiment report can be evaluated for 30 marks.
The summation of all the experiments marks to be scaled down to 15 marks.
s
bu
The laboratory test (duration 03 hours) at the end of the last week of the semester /after completion of all the
experiments (whichever is early) shall be conducted for 50 marks and scaled down to 10 marks. For the
lla
laboratory test, the student is required to conduct one experiment (excluding the micro project).
Sy
ft
ra
D
4
IPCC (4 Credits) template30.03.2026 5
s
justification. bu
Implementation Implements Correct Correct Implementation Unable to
lla
using Java optimal implementation implementation contains errors. implement the
solution using with good with partial solution.
Sy
OOP features.
ra
Program Compiles, Corrects errors Corrects errors Corrects errors Unable to debug
D
debugging and debugs, and with good with partial with assistance. and test
testing with tests without understanding. understanding. independently.
suitable tools errors;
demonstrates
[CO2-6] full
[PO5, PO8] understanding.
Results & Executes for Executes Executes for a Executes but Unable to verify
interpretation multiple test correctly for all few test cases cannot analyze correctness of
/analysis cases and test cases. and analyzes results. results.
performs results.
[CO1-6] detailed
[PO4, PO5] analysis.
Demonstration and Demonstration Demonstration Demonstration Demonstration Demonstration and
documentation and lab record and lab record is and lab record and lab record is lab record is poorly
is well- organized, with lacks clear poorly organized, organized, with
[CO1-6]
organized, with clear sections, organization or with missing or missing sections.
[PO8, PO9, PO11]
clear sections. but some structure. Some unclear sections. Record not
The record is sections are not sections are The record is not submitted on time.
well structured well-defined. unclear or properly The record is not
with suitable The record is incomplete. structured with structured with
formatting. structured with The record is suitable minimum
formatting. partially formatting. formatting.
structured with
formatting .
5
IPCC (4 Credits) template30.03.2026 6
s
(3) implementing of design and Student is not
bu core part of the and implementing
with best implementing with capable of design
construct for the with some
[CO2-6] suitable java some construct for and
lla
[PO3, PO5] given problem algorithm for the
construct for the given problem implementing.
given problem
Sy
definition.
ra
6
IPCC (4 Credits) template30.03.2026 7
s
(ii) Laboratory component bu
Out of 25 marks, 15 marks shall be assigned for assessment as per the rubrics listed in the
lla
course syllabus (30 marks scaled down to 15).
The remaining 10 marks shall be based on the practical test conducted by two Internal
Sy
examiners appointed by the HoD. The allotment of marks shall be as per the rubrics defined
for the practical test (50 marks scaled down to 10).
ft
ra
(i) To qualify and become eligible to appear for the SEE of the IC/IPCC, a student shall secure
D
at least 40 % of 25 marks, i.e., 10 marks, in the CIE theory component, and at least 40 % of
25 marks, i.e., 10 marks in the CIE Practical component.
7
VTU/PCC-PEC-OEC (3 Credits) template 20 06 20261
1. Apply Boolean algebra principles and logic minimization techniques to design and simplify digital
logic circuits using logic gates, K-maps, and NAND/NOR implementations.
2. Design combinational and sequential logic circuits using adders, decoders, encoders, multiplexers,
latches, and flip-flops.
3. Describe the organization and operation of computer systems, including functional units, bus
structures, instruction sets, and addressing modes.
4. Illustrate memory and input/output organization techniques, including interrupts, DMA, cache
memory, and semiconductor memory systems.
5. Contrast the operation of processing units, hardwired control systems, and pipelining techniques to
s
assess computer performance and [Link]
6. Identify computer architecture components, memory organization, and system performance through
lla
experimentation and case studies
Sy
Module-1
Boolean Algebra and Logic Gates: Basic Theorems And Properties of Boolean Algebra, Boolean Functions, Digital
ft
Gate-Level Minimization: Introduction, The Map Method, Four-Variable K-Map, Product of sums simplification,
Don’t-Care Conditions, NAND and NOR Implementation.
Textbook-1: Chapter- 2 (2.4, 2.5, 2.8,2.9), Chapter-3 (3.1, 3.2,3.3,3.4, 3.5, 3.6) Number of Hours: 12
Module-2
Combinational Logic: Introduction, Combinational Circuits, Analysis of Combinational Circuits, Design
Procedure, Binary Adder – Subtractor, Decoders, Encoders, Multiplexers.
Synchronous Sequential Logic: Introduction, Sequential Circuits, Storage Elements: Latches, Flip-Flops.
Textbook-1: Chapter- 4 (4.1, 4.2, 4.3, 4.4, 4.5, 4.9, 4.10, 4.11), Chapter-5 (5.1, 5.2, 5.3, 5.4)
Number of Hours: 12
Module-3
Basic Structure of Computers: Functional Units, Basic Operational Concepts, Bus structure, Performance –
Processor Clock, Basic Performance Equation, Clock Rate, Instruction Set: CISC an RISC, Performance
Measurement.
Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, Instruction and
Instruction sequencing, Addressing Modes.
Textbook-2: Chapter -1 (1.2, 1.3, 1.4, 1.6), Chapter -2 (2.2, 2.3, 2.4, 2.5) Number of Hours: 10
Module-4
Input/Output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Enabling and Disabling
Interrupts, Handling Multiple Devices, Direct Memory Access, Buses.
The Memory System: Some Basic Concepts, Semiconductor RAM Memories, Read Only Memory, Speed, size
and Cost of memory systems. Cache Memories – Mapping Functions.
1
VTU/PCC-PEC-OEC (3 Credits) template 20 06 20262
Textbook-2: Chapter – 4 (4.1, 4.2.1, 4.2.2, 4.2.3, 4.4, 4.5), Chapter-5 (5.1, 5.2, 5.3, 5.4, 5.5.1)
Number of Hours: 12
Module-5
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction, Multiple Bus
Organization. Hardwired Control.
Textbooks:
1. M. Morris Mano & Michael D. Ciletti, Digital Design, 6 th edition, Pearson Education.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, 5th Edition, Tata McGraw Hill.
1. Charles H Roth and Larry L Kinney, Analog and Digital Electronics, Cengage Learning
2. William Stallings: Computer Organization & Architecture, 9th Edition, Pearson, 2015.
s
Web links and Video Lectures (e-Resources):
bu
lla
1. NPTEL Video Course: Digital Computer Organization by Prof. P. K. Biswas, IIT Kharagpur -
Sy
[Link]
2. MIT OpenCourseWare: Computation Structures (6.004) by Prof. Chris Terman, MIT –
ft
[Link]
ra
● To qualify and become eligible to appear for SEE, in the CIE, a student must score at least 40% of 50
marks, i.e., 20 marks.
● To pass the SEE, a student must score at least 35% of 50 marks, i.e., 18 marks.
● Notwithstanding the above, a student is considered to have passed the course, provided the
combined total of CIE and SEE is at least 40 out of 100 marks.
2
VTU/PCC-PEC-OEC (3 Credits) template 20 06 20263
Continuous Comprehensive Assessments (CCA)+ Internal Assessment Test (IA) = Continuous Internal
Evaluation CIE [25+25=50 marks]
A minimum of two Internal Assessment Tests (IA) shall be conducted, carrying a total of 25 marks.
In addition, Continuous Comprehensive Assessment (CCA) shall be conducted for a total of 25 marks.
It is recommended to include a maximum of two learning activities as part of the CCA to foster the holistic
development of students. These activities shall be:
Sl. No. Name of the Learning activity Maximum Marks
1. Develop Verilog HDL programs for the given problem 25
statement
s
1.
bu
Simplify a given 4-variable Boolean expression using appropriate minimization
lla
techniques and implement the simplified function using basic logic gates through
simulation.
Sy
2. Design and simulate a 4-bit adder–Subtractor circuit using basic logic gates, and verify its
functionality for different input combinations.
ft
3. Design Verilog HDL to implement Binary Adder-Subtractor – Half and Full Adder, Half and
ra
Full Subtractor.
D
10. Compare the features, instruction formats, and performance characteristics of CISC and
RISC architectures through the study of modern processors, and summarize the findings
in a comparative table.
11. Study of semiconductor RAM and ROM organization with practical examples by
determining memory capacity, address lines, data lines, and memory locations, and
compare their characteristics.
12. Identify the major hardware components of a computer system through hands-on
inspection, and demonstrate the ability to safely disassemble and reassemble the system
while maintaining its functionality.
3
VTU/PCC-PEC-OEC (3 Credits) template 20 06 20264
Needs
Criteria/ Unacceptable
Superior (5) Good (4) Fair (3) Improvement
Scale (1)
(2)
Demonstrates
Understanding
complete Demonstrate Demonstrate
of Digital Logic
understanding of the s very good s adequate Shows limited
/ Computer Unable to
underlying digital understandin understandin understanding
Organization understand the
logic/computer g with g with minor and requires
Concepts(CO1, concepts.
organization concepts negligible misconceptio guidance.
CO2 / PO1,
and correctly explains errors. ns.
PO2)
the design approach.
Circuit Design Designs correct logic
Design/progr
/ Verilog circuits/Verilog Design/progr Design/progra Unable to
am is mostly
Program programs with am is correct m is partially develop a
correct but
Development( efficient with minor correct with functional
contains
CO2, CO3, CO4 implementation and improvement logical or circuit/progra
moderate
s
/ PO2, PO3, proper coding s possible.
bu coding errors. m.
errors.
PO5) practices.
Simulation is Simulation Simulation is
lla
Simulation, Successfully
correct for works for incomplete or Unable to
Testing and simulates the design,
Sy
4
VTU/PCC-PEC-OEC (3 Credits) template 20 06 20265
s
[Link] bu
OR
lla
Simulation Enabled Experiential Learning (SEEL)
[Link]
Sy
ft
ra
1. The CIE marks shall be decided based on internal tests and other outcome-based
activities. The continuous internal evaluation shall be carried out by the teacher
handling the course.
2. Out of 50 marks earmarked for CIE, 25 marks shall be assigned for internal tests. The
first test shall be conducted after completing two modules of the syllabus and the
second one after completing the remaining three modules.
3. The remaining 25 marks shall be assigned for Continuous Course Assessment (CCA),
(Learning Activity-Termworks) conducted as per the rubrics listed in the assessment
section of the respective syllabus.
4. A student shall obtain a minimum of 40% marks or 20 out of 50 marks allotted to CIE
to become eligible to appear for the SEE.
5
VTU/PCC-PEC-OEC (3 Credits) template30032026 1
OPERATING SYSTEMS
Course Code 1BCS304 Scheme 2025
Type of Course PCC Semester 3
Teaching Hours/Week (L:T:P) 3:0:0 CIE Marks 50
Total Hours of Pedagogy per semester 42:0:0:48:90
SEE Marks 50
L:T:P:SL:TW&SL:TH
Credits 3 Total Marks 100
Examination type (SEE) Theory Exam Hours 03
Course outcome (Course Skill Set)
At the end of the course, the student will be able to:
1. Recall the structure, functions, and services of an operating system.
2. Explain process management concepts, CPU scheduling algorithms, and process synchronisation
mechanisms.
3. Apply appropriate CPU scheduling algorithms and process synchronisation techniques to solve
operating system problems.
4. Apply memory management techniques and deadlock-handling strategies to ensure efficient
resource utilization.
5. Explain file system organisation and secondary storage management techniques.
6. Describe information protection mechanisms, security principles, and access control methods in
s
operating systems.
bu
Module-1
Introduction to operating systems, System structures: What operating systems do; Computer System
lla
organization; Computer System architecture; Operating System structure; Operating System operations;
Sy
Operating System Services: User - Operating System interface; System calls; Types of system calls;
ra
System programs; Operating system design and implementation; Operating System structure;
D
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
1
VTU/PCC-PEC-OEC (3 Credits) template30032026 2
Implementing File system: File system structure; File system implementation; Directory implementation;
Allocation methods; Free space management.
Mass Storage Structure: Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk
management.
Textbooks:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles, 9th edition,
Wiley-India, 2015.
s
bu
Reference books / Manuals:
lla
1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th Edition
Sy
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw- Hill, 2013.
ft
3. William Stallings Operating Systems: Internals and Design Principles, 6th Edition, Pearson.
ra
● To qualify and become eligible to appear for SEE, in the CIE, a student must score at least 40% of
50 marks, i.e., 20 marks.
● To pass the SEE, a student must score at least 35% of 50 marks, i.e., 18 marks.
● Notwithstanding the above, a student is considered to have passed the course, provided the
combined total of CIE and SEE is at least 40 out of 100 marks.
2
VTU/PCC-PEC-OEC (3 Credits) template30032026 3
List of Problems:
1. Develop a C program to implement the Process system calls (fork (), exec(), wait(), create process,
terminate process)
2. Simulate the following CPU scheduling algorithms to find the turnaround time and waiting time
s
a) FCFS b) SJF
bu
c) Round Robin d) Priority.
lla
3. Develop a C program to simulate producer-consumer problem using semaphores.
Sy
4. Develop a C program that demonstrates interprocess communication between a reader process and a
writer process. Use mkfifo, open, read, write, and close APIs in your program.
ft
a) FIFO b) LRU
Note: At the end of the course, the students need to submit the report on conduction of the activity with
relevant data to the course instructor. Evaluation is for 25 marks.
3
VTU/PCC-PEC-OEC (3 Credits) template30032026 4
s
C Program Implements the Program bu Program Program Unable to
Implementati solution executes works for executes implement the
lla
on completely in C correctly with most cases partially with solution in C.
Sy
programming, errors.
ra
and appropriate
D
data structures.
Output Produces Correct output Produces Output is Incorrect
Correctness correct results for most test acceptable partially output or no
and Analysis for all test cases cases with output for correct with meaningful
(CO3, CO4, and accurately minor analysis standard incorrect analysis.
CO5 analyzes the errors. cases. analysis.
/PO2, PO4) outcome.
Code Quality Code is well- Good coding Adequate Poor No
and structured, style with few documentatio documentatio documentatio
Documentatio properly documentation n and n and n; difficult to
n indented, issues. readability. inconsistent understand
(CO3- CO6 commented, and coding style. code.
/PO2,PO4) follows coding
standards.
4
VTU/PCC-PEC-OEC (3 Credits) template30032026 5
s
2. Out of 50 marks earmarked for CIE, 25 marks shall be assigned for internal tests. The
bu
first test shall be conducted after completing two modules of the syllabus and the
lla
second one after completing the remaining three modules.
Sy
3. The remaining 25 marks shall be assigned for Continuous Course Assessment (CCA),
conducted as per the rubrics listed in the assessment section of the respective
ft
syllabus.
ra
4. A student shall obtain a minimum of 40% marks or 20 out of 50 marks allotted to CIE
D
5
1
Pointers and Dynamic Memory Allocation, Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials.
s
bu
Sparse Matrices: Sparse Matrix Representation and Transposing a Matrix.
lla
Sy
Textbook: Chapter-1 (1.2), Chapter-2 (2.1-2.4, 2.5.2, 2.5.3), Reference Book-1 (1.3) Number of Hours: 08
Module-2
ft
Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic Arrays, Stack Applications:
ra
LINKED LISTS: Singly Linked Lists and Chains, Representing Chains in C, Linked Stacks and Queues, Additional List
Operations, Sparse Matrices: Sparse Matrix Representation, Doubly Linked List.
Textbook: Chapter-3 (3.4, 3.7), Chapter-4 (4.1 to 4.3, 4.5, 4.7.1, 4.8) Number of Hours: 09
Module-4
Trees: Introduction-Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary
Trees, Binary Tree Traversals – preorder, Inorder, postorder, Threaded Binary Trees.
Binary Search Trees – Definition, Searching, Insertion, Deletion, Counting Binary Trees.
Textbook: Chapter-5 (5.1.1, 5.2, 5.3.1-5.3.3, 5.5, 5.7.1- 5.7.4, 5.11.1) Number of Hours: 09
Module-5
GRAPHS: The Graph Abstract Data Types, Elementary Graph Operations.
PRIORITY QUEUES: Single and double ended Priority Queues, Leftist Trees.
Textbook: Chapter 6 (6.1, 6.2), Chapter 8 (8.1 to 8.3), Chapter 9 (9.1, 9.2) Number of Hours: 08
1
2
Textbooks:
1. Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed, Fundamentals of Data Structures in C, 2nd Ed,
Universities Press, 2023.
1. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed., McGraw-Hill, 2014.
3. Reema Thareja, Data Structures Using C, 3rd Ed., Oxford Press, 2012.
Web links and Video Lectures (e-Resources):
s
4. Trees: [Link]
bu
5. Hashing: [Link]
lla
6. Infosys Springboard: Data Structures & Algorithms using C++, C and Python – 2026:
Sy
[Link]
● To qualify and become eligible to appear for SEE, in the CIE, a student must score at least 40% of 50 marks,
i.e., 20 marks.
● To pass the SEE, a student must score at least 35% of 50 marks, i.e., 18 marks.
● Notwithstanding the above, a student is considered to have passed the course, provided the combined total
of CIE and SEE is at least 40 out of 100 marks.
2
3
Continuous Comprehensive Assessments (CCA) + Internal Assessment Test (IA) = Continuous Internal
Evaluation CIE [25 + 25 = 50 marks]
A minimum of two Internal Assessment Tests (IA) shall be conducted, carrying a total of 25 marks.
In addition, Continuous Comprehensive Assessment (CCA) shall be conducted for a total of 25 marks.
It is recommended to include a maximum of two learning activities in the CCA to foster students' holistic
development. These activities shall be:
s
bu
lla
Sy
ft
ra
D
3
4
s
/PO1, PO2)
bu
Hashing, etc.) and inefficiencies. optimization limitations.
justifies the choice or
lla
based on problem justification.
Sy
requirements.
Algorithm Design Designs an Develops a Develops a Algorithm is Unable to
ft
Solving Skills (CO3, with correct logic, algorithm with algorithm correct and workable
D
4
5
Needs
Unacceptable
Criteria/Scale Superior (5) Good (4) Fair (3) Improvement
(1)
(2)
Understanding Demonstrates Demonstrates Understands Shows partial Unable to
of Data comprehensive good basic understanding demonstrate
Structure understanding of understanding concepts and and requires understanding
Concepts fundamental and of concepts with terminology additional of fundamental
through advanced data minor gaps. with limited support. concepts.
Certification structure concepts, depth.
Modules terminology, and
(CO1, CO2 applications through
/PO1,PO2) successful completion
of certification
s
modules. bu
Application of Effectively applies Applies Applies basic Applies Unable to
lla
Data Structures suitable data appropriate data concepts with apply concepts
Sy
5
6
the certification
requirements.
s
bu
lla
Sy
ft
ra
D
Term work (includes assignments, seminars, micro-projects, industrial visits, any other
student learning activities etc.)
Sl. No. Term Work (TW) Activity Number of Hours /
Semester
1. Learning Activity -1 20
2. Learning Activity -2 10
SL: Self-learning, MOOCs, spoken tutorials, online educational resources, etc.
Sl. No. Self-Learning (SL) Activity Number of Hours /
Semester
1. Springboard certification on: Data Structures and Algorithms 18
6
7
3. The remaining 25 marks shall be assigned for Continuous Course Assessment (CCA),
conducted as per the rubrics listed in the assessment section of the respective
syllabus.
4. A student shall obtain a minimum of 40% marks or 20 out of 50 marks allotted to CIE
to become eligible to appear for the SEE.
s
bu
lla
Sy
ft
ra
D
7
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 1
Note:
1. The laboratory syllabus consists of PART-A and PART-B. While PART-A has 6 conventional
experiments, PART-B has 6 typical open-ended experiments. The maximum marks for the laboratory
course are 100.
s
bu
2. Both PART-A and PART-B are considered for CIE and SEE.
3. Students have answer 1(one) question from PART-A and 1(one) question from PART-B.
lla
a. The questions set for SEE shall be from among the experiments under PART-A. It is evaluated for
Sy
4. For Continuous Internal Evaluation (CIE) during the semester, classwork shall typically include open-
D
ended questions from Part-B, along with other similar questions designed to enhance the students’
skills.
PART – A
FIXED SET OF EXPERIMENTS
1. Develop a Program in C for the following:
a. Define a structure Book with the following fields: Book_ID, Title, Author, Price, Availability Status
(Available/Issued)
b. Dynamically allocate memory to store the details of N books, where N is entered by the user.
c. Implement the following functions:
i. create() – To allocate memory and read the details of N books and store them in the allocated
memory.
ii. display() – To display the details of all books available in the library.
iii. search() – To search for a book using Book ID and display the book details if found.
iv. issueBook() – To issue a book by updating its availability status and display an appropriate
message.
v. returnBook() – To return an issued book by updating its availability status and display an
appropriate message.
d. Provide a menu-driven interface with the following options:
i. Add Book Records
ii. Display All Book Records
1
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 2
2. Develop a menu driven Program in C for the following operations on STACK of Integers (Array
Implementation of Stack with maximum size MAX)
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Demonstrate how Stack can be used to check Palindrome
d. Demonstrate Overflow and Underflow situations on Stack
e. Display the status of Stack
f. Exit
Support the program with appropriate functions for each of the above operations
s
bu
3. Develop a program in C for simulating a Printer Queue using Queue data structure with the following
lla
operations:
Sy
4. Develop a menu-driven Program in C for the following operations on a Singly Linked List of Student
Records:
a. Create a linked list using front insertion.
b. Display all student records and count the number of nodes.
c. Insert and delete nodes at the beginning and end of the list.
d. Search for a student record using USN.
2
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 3
PART – B
OPEN ENDED EXPERIMENTS
Open-ended experiments are a type of laboratory activity where the outcome is not predetermined and students
are given the freedom to explore, design, and conduct the experiment based on the problem statements as per
the concepts defined by the course coordinator. It encourages creativity, critical thinking, and inquiry-based
learning.
1. Develop a C program to:
s
a. Read two sparse matrices of the same order.
bu
b. Convert both into 3-tuple representation.
lla
d. Display the resultant matrix in both normal matrix form and 3-tuple form.
ft
ra
2. Develop a C-based Expression Conversion tool that uses stack data structure to convert arithmetic
D
expressions from infix notation to postfix notation. The tool should support alphanumeric operands,
parentheses, and the operators (+, -, *, /, %, ^). Analyze the correctness of the conversion by testing various
valid expressions.
3. Develop a menu-driven Program in C for the following operations on Circular Queue (integer/floating point
data):
a. Insert an element into the Circular Queue.
b. Delete an element from the Circular Queue.
c. Display the contents of the Circular Queue.
d. Demonstrate overflow and underflow conditions.
e. Exit.
4. Develop a menu driven Program in C for the following operations on Doubly Linked List (DLL) of Employee
Data with the fields: SSN, Name, Dept, Designation, Sal, PhNo etc.
a. Create a DLL of N Employees Data by using end insertion.
b. Display the status of DLL and count the number of nodes in it
c. Perform Insertion and Deletion at End of DLL
d. Perform Insertion and Deletion at Front of DLL
3
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 4
5. Develop a menu driven Program in C for the following operations on Binary Search Tree (BST) of Integers.
a. Create a BST of N Integers
b. Traverse the BST in Inorder, Preorder and Post Order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Exit
6. Develop a Program in C for an Employee Record Management System using Hashing with the following
operations:
a. Create a hash table to store employee records using Employee ID as the key.
b. Insert employee records into the hash table using the Hash function H: K →L as H(K)=K mod m
c. Resolve collisions using Linear Probing.
s
d. Search for an employee record using a given Employee ID and display the details.
e.
bu
Display the contents of the hash table along with the corresponding memory locations.
lla
Sy
Text books:
ra
1. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, 2nd Ed,
D
1. Reema Thareja, Data Structures using C, 3rd Ed, Oxford press, 2023.
2. A M Tenenbaum, Data Structures using C, PHI, 1989
3. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014.
4
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 5
Assessment Structure:
The assessment for each course is equally divided between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each component carrying 50% weightage (i.e., 50 marks each).
The CIE marks awarded shall be based on the continuous evaluation of the laboratory report using a defined set
of rubrics. Each experiment report can be evaluated for 30 marks. Total marks for the all report shall be scaled
down to 30 marks. The laboratory test (duration 03 hours) at the end of the last week of the semester /after
completion of all the experiments (whichever is early) shall be conducted for 50 marks and Marks scored shall
be scaled down to 20 marks. Final average of marks for report and test shall be out of 50 marks.
For both CIE and SEE, the student is required to conduct one experiment each from both Part A and Part B.
s
structure g of data
the problem bu understandin understanding understand the
concepts and structure
g and selects and selects an problem or
statement and correctly concepts and
lla
a suitable inappropriate identify an
selection of identifies the selects an
data or partially appropriate data
Sy
Develops
multiple
algorithmic Develops
solutions, more than Develops a
Design of compares one design correct Develops an
Algorithm and Unable to design
them, and but provides algorithm incomplete
a suitable
Data Structure justifies the limited and data algorithm or
algorithm or
[CO1, CO2] [PO2, best design justification structure partially
data structure.
PO3] with for selecting with basic correct design.
appropriate the best explanation.
data solution.
structure
selection.
Implements
the selected
data
structure Implements
Implements Implements
Implementation efficiently the selected Unable to
the required the program
(Program using data structure implement the
data with significant
appropriate C correctly and required data
Coding) [CO1, structure errors or
constructs explains the structure
CO2] [PO5, PO8] with minor incomplete
with correct implementati program.
coding issues. operations.
operations on clearly.
and modular
programming
practices.
Program Successfully Identifies and Corrects most Corrects errors Unable to debug
Debugging and compiles, rectifies errors with only with or execute the
5
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 6
s
Demonstratio
n is excellent.
bu
Lab record is
lla
well-
Sy
organized
with problem Demonstratio
Demonstratio Demonstration is
ft
statement, n is Demonstration
Demonstration n is good. Lab poor or absent.
ra
organized incomplete,
Documentation structure contains most missing
with all major improperly
[CO3] [PO8, PO9, representatio required sections or
sections and formatted, or not
PO11] n, program, sections with inadequate
appropriate submitted on
output, acceptable formatting.
formatting. time.
observations, formatting.
and
conclusions
presented
using proper
formatting.
6
VTU/AEC Lab/LAB COURSE (1 Credit) template30032026 7
s
Analysis (2) cases, correctly and or analyze the
bu limited properly
[CO1, CO2] [PO4] validates all provides good program.
test cases analyze the
operations, analysis.
lla
and basic results.
and provides
analysis.
Sy
accurate
analysis.
ft
Clearly
ra
explains the
working of
D
Explains
the selected
Explains the basic
data Provides Unable to explain
concepts with concepts
Communication structure, incomplete the
good with
(Viva Voce) (2) algorithm, explanations implementation or
communication average
[CO3] [PO8, PO9] implementati with incorrect answer questions
and correct communic
on, and terminology. satisfactorily.
terminology. ation
application
skills.
using correct
technical
terminology.
● To qualify and become eligible to appear for SEE, in the CIE component, a student must secure a
minimum of 40% of 50 marks, i.e., 20 marks.
● To pass the SEE component, a student must secure a minimum of 35% of 50 marks, i.e., 18 marks.
● A student is deemed to have successfully completed the course if the combined total of CIE and
SEE is at least 40 out of 100 marks.
7
VTU/AEC Lab COURSE (1 Credit) template30032026 1
s
in data.
bu
6. Communicate insights through reports and visual presentations of end-to-end Exploratory Data
Analysis (EDA).
lla
SET OF EXPERIMENTS
Sy
1. Load a real-world dataset such as Student Performance, Employee Information, or Sales Data using
ft
Pandas in Jupyter Notebook. Explore the dataset by displaying the first few records, identifying the
ra
number of rows and columns, examining data types, and generating a summary of the dataset to
understand its structure and contents.
D
2. Extract numerical attributes from a dataset and perform basic statistical analysis using NumPy and
Pandas. Compute measures such as mean, median, mode, standard deviation, minimum, and
maximum values, and interpret the results to understand the distribution and characteristics of the
data.
a. Expected Input: Dataset containing numerical attributes.
b. Expected Output: Statistical summary showing central tendency and dispersion measures.
c. Learning Outcome: Ability to perform basic statistical analysis and interpret numerical data
characteristics.
3. Analyze the quality of a dataset by identifying missing values, counting null entries in each attribute,
and calculating the percentage of missing data. Generate a simple data quality report highlighting
attributes that require cleaning before further analysis.
a. Expected Input: Dataset containing missing or incomplete records.
b. Expected Output: Missing value count, percentage of missing data, and data quality report.
c. Learning Outcome: Ability to assess data quality and identify issues affecting analysis.
4. Perform data cleaning by handling missing values using suitable techniques such as replacement with
mean, median, or mode values and removal of incomplete records. Compare the dataset before and
after cleaning and analyze the impact of the cleaning process.
a. Expected Input: Dataset containing missing values.
b. Expected Output: Cleaned dataset and comparison report before and after preprocessing.
1
VTU/AEC Lab COURSE (1 Credit) template30032026 2
c. Learning Outcome: Ability to apply data cleaning techniques and prepare datasets for
analysis.
5. Detect and remove duplicate records from a dataset using Pandas functions. Compare the number of
records before and after duplicate removal and discuss the importance of maintaining data
consistency in analytical applications.
a. Expected Input: Dataset containing duplicate records.
b. Expected Output: Duplicate record count and cleaned dataset without duplicate entries.
c. Learning Outcome: Ability to identify and eliminate duplicate records to improve data
quality.
6. Perform data filtering, sorting, and selection operations on a dataset to answer business-oriented
questions such as identifying high-performing students, top-selling products, or employees with the
highest salaries. Present the extracted information in a meaningful format.
a. Expected Input: Dataset with categorical and numerical attributes.
b. Expected Output: Filtered and sorted data satisfying specified conditions.
c. Learning Outcome: Ability to retrieve and analyze relevant information from large datasets
using query operations.
7. Apply grouping and aggregation techniques using Pandas to generate summaries from a dataset.
Compute category-wise counts, averages, totals, and other statistical measures to derive meaningful
s
insights from grouped data.
bu
a. Expected Input: Dataset containing categorical and numerical attributes.
b. Expected Output: Group-wise summary tables and aggregated results.
lla
c. Learning Outcome: Ability to summarize and analyze data using grouping and aggregation
Sy
techniques.
ft
identifying patterns, variations, and unusual observations. Interpret the results to understand the
overall behavior of the dataset and support data-driven decision-making.
D
9. Create bar charts and pie charts using Matplotlib or Seaborn to visualize categorical data from a real-
world dataset. Analyze the visualizations and draw conclusions regarding trends, distributions, and
comparisons among different categories.
a. Expected Input: Dataset containing categorical attributes.
b. Expected Output: Bar chart and pie chart visualizations.
c. Learning Outcome: Ability to visualize categorical data and communicate insights effectively.
10. Develop line plots and scatter plots to visualize trends and relationships among variables in a dataset.
Analyze the generated plots to identify growth patterns, variations, correlations, and potential
business insights.
a. Expected Input: Dataset containing numerical attributes.
b. Expected Output: Line plots and scatter plots showing trends and relationships.
c. Learning Outcome: Ability to analyze trends and relationships using graphical visualization
techniques.
11. Perform correlation analysis on a dataset by computing the correlation matrix and visualizing it using
a heat map. Identify strongly and weakly related attributes and discuss the significance of correlation
analysis in exploratory data analysis and machine learning applications.
a. Expected Input: Dataset with multiple numerical attributes.
b. Expected Output: Correlation matrix and heat map visualization.
c. Learning Outcome: Ability to analyze relationships among variables and identify influential
attributes.
2
VTU/AEC Lab COURSE (1 Credit) template30032026 3
12. Carry out a comprehensive Exploratory Data Analysis (EDA) micro-project on a real-world dataset
from domains such as education, healthcare, finance, retail, sports, or social media. The analysis shall
include dataset understanding, data quality assessment, data cleaning, statistical analysis,
visualization, correlation analysis, and presentation of key findings and recommendations through a
Jupyter Notebook report.
a. Expected Input: Real-world dataset selected by the student.
b. Expected Output: Complete EDA report including visualizations, statistical summaries,
observations, and recommendations.
c. Learning Outcome: Ability to independently perform end-to-end exploratory data analysis
on real-world datasets and communicate actionable insights.
Suggested Learning Resources: (Text Book/ Reference Book/ Manuals):
Textbooks:
1. Jake VanderPlas, Python Data Science Handbook: Essential Tools for Working with Data, 2nd Edition,
O'Reilly Media, 2022.
2. Elbert L. Hearon, Data Analytics with Applications in Business, LibreTexts Open Educational
Resource, 2025.
s
1. Wayne L. Winston, Microsoft Excel 2019 Data Analysis and Business Modeling, 6th Edition, Microsoft
bu
Press, 2019.
lla
2. Wes McKinney, Python for Data Analysis: Data Wrangling with Pandas, NumPy and Jupyter, 3rd
Edition, O'Reilly Media, 2022.
Sy
[Link]
ra
[Link]
D
[Link]
[Link]
3
VTU/AEC Lab COURSE (1 Credit) template30032026 4
3. Encourage collaborative learning through team-based exploratory data analysis activities, peer
discussions, and presentation of analytical findings.
4. Integrate industry-relevant datasets from open repositories such as Kaggle, UCI Machine Learning
Repository, and Government Open Data Portals to expose students to real-world data challenges.
5. Demonstrate data analysis workflows using Python libraries such as NumPy, Pandas, Matplotlib,
and Seaborn, enabling students to learn concepts through practical implementation.
6. Promote inquiry-based learning by encouraging students to formulate analytical questions,
investigate datasets, and interpret results using statistical and visualization techniques.
7. Conduct mini-projects and case studies that require students to perform end-to-end exploratory
data analysis and communicate findings through reports and presentations.
8. Utilize online documentation, video tutorials, and interactive notebooks to support self-learning
and continuous skill development beyond classroom sessions.
Assessment Structure:
The assessment for each course is equally divided between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each component carrying 50% weightage (i.e., 50 marks each).
The CIE marks awarded shall be based on the continuous evaluation of the laboratory report using a defined
s
set of rubrics. Each experiment report can be evaluated for 30 marks. Total marks for the all report shall be
bu
scaled down to 30 marks. The laboratory test (duration 03 hours) at the end of the last week of the semester
/after completion of all the experiments (whichever is early) shall be conducted for 50 marks and Marks scored
lla
shall be scaled down to 20 marks. Final average of marks for report and test shall be out of 50 marks.
Sy
Needs
D
Unacceptabl
Criteria/Scale Superior (5) Good (4) Fair (3) Improvement
e (1)
(2)
Clearly
understands
dataset Understands Understands Limited Unable to
Dataset structure, dataset basic dataset understanding explain
Understanding attributes, and structure and characteristics of dataset dataset
[CO1, PO1] context; most with minor structure and characteristic
accurately attributes. gaps. attributes. s.
explains data
characteristics.
Correctly
performs
Performs Performs basic
Data Analysis and statistical Unable to
analysis and analysis but Incomplete
Processing analysis and data perform
preprocessin requires analysis and
[CO2, CO3, PO2, preprocessing required
g with minor guidance for preprocessing.
PO5] with appropriate analysis.
errors. interpretation.
methods and
interpretation.
Creates
Creates
appropriate
meaningful Generates
Visualization and visualization Visualizations Unable to
visualizations visualizations
Insight s and are incomplete create
and derives but provides
Generation [CO4, provides or poorly meaningful
accurate insights limited
PO3, PO4, PO5] reasonable interpreted. visualizations.
supported by insights.
interpretatio
data.
ns.
4
VTU/AEC Lab COURSE (1 Credit) template30032026 5
Efficiently
implements
Basic Significant
solutions using Correct Unable to
Implementation implementatio errors
Python, NumPy, implementati implement
and Tool Usage n with requiring
Pandas, and on with the
[CO1, CO4, PO5] moderate extensive
visualization minor errors. experiment.
assistance. assistance.
libraries with
minimal errors.
Well-organized
notebook/report Good
Adequate Incomplete Poor or
Documentation with clear documentati
documentatio documentation missing
and Presentation observations, on with
n with limited and documentatio
[CO5, CO6, PO9] conclusions, and proper
interpretation. observations. n.
presentation of observations.
results.
Writes clean,
modular, well- Functional Code contains
Code is Unable to
Code Quality, documented code with several
mostly develop
Debugging and code; efficiently moderate logical/syntax
organized functional
Best Practices debugs errors guidance and errors
with minor code or
[CO3, CO6, PO5, and follows limited requiring
debugging resolve
s
PO11] coding standards documentatio extensive
issues. bu errors.
and best n. assistance.
practices.
lla
Sy
Improvement (1)
D
(2)
Clearly
Problem understands the
Good Basic
Understanding problem Unable to
understandin understandi Limited
and Dataset statement and understand the
g with minor ng of the understanding
Analysis (2) accurately problem
clarification problem and of the task.
[CO1, CO2, PO1, analyzes the statement.
required. dataset.
PO2, PO5] dataset
requirements.
Develops and
Completes
executes a
Program major Partial
complete Unable to
Development and Executes the portions of implementatio
solution develop or
Execution (1) solution with the n with
independently execute the
[CO3, CO4, PO3, minor errors. implementat significant
with correct program.
PO5] ion with errors.
implementation
guidance.
and outputs.
Correctly
Result interprets
Interpretation outputs, Interprets Provides
Limited Unable to
and Insight visualizations, results with basic
interpretation interpret
Generation (3) and derives minor interpretatio
of outputs. results.
[CO2, CO4, CO5, meaningful inaccuracies. n of results.
PO4, PO5] insights from
the data.
Effectively Uses tools Demonstrate
Use of Data Limited ability Unable to use
utilizes Pandas, correctly with s basic usage
Analysis Tools to use tools. required tools.
NumPy, minor errors. of tools.
5
VTU/AEC Lab COURSE (1 Credit) template30032026 6
s
findings n.
confidently.
bu
lla
● To qualify and become eligible to appear for SEE, in the CIE component, a student must secure a
Sy
● A student is deemed to have successfully completed the course if the combined total of CIE and
ra
6
VTU/AEC Lab COURSE (1 Credit) template300320261
s
Initialize a new Git repository in a directory. Create a new file and add it to the staging area, and
bu
commit the changes with an appropriate commit message.
lla
2. Creating and Managing Branches:
Sy
Create a new branch named "feature-branch." Switch to the "master" branch. Merge the "feature-
branch" into "master."
ft
ra
Write the commands to stash your changes, switch branches, and then apply the stashed changes
4. Collaboration and Remote Repositories:
Clone a remote Git repository to your local machine.
5. Collaboration and Remote Repositories:
Fetch the latest changes from a remote repository and rebase your local branch onto the updated
remote branch.
6. Collaboration and Remote Repositories:
Write the command to merge "feature-branch" into "master" while providing a custom commit
message for the merge.
7. Git Tags and Releases:
Write the command to create a lightweight Git tag named "v1.0" for a commit in your local
repository.
8. Advanced Git Operations:
Write the command to cherry-pick a range of commits from "source-branch" to the current branch.
9. Analysing and Changing Git History:
Given a commit ID, how would you use Git to view the details of that specific commit, including the
author, date, and commit message?
10. Analysing and Changing Git History:
1
VTU/AEC Lab COURSE (1 Credit) template300320262
Write the Git command to display all commits made by the author "JohnDoe" between “January 1,
2025” and “December 31, 2025.”
11. Analysing and Changing Git History:
Write the command to display the last five commits in the repository's history.
12. Analysing and Changing Git History:
Write the command to undo the changes introduced by the commit with the ID "abc123".
Suggested Learning Resources: (Text Book/ Reference Book/ Manuals):
Textbooks:
1. Version Control with Git, 3rd Edition, by Prem Kumar Ponuthorai, Jon Loeliger Released October
2022, Publisher(s): O'Reilly Media, Inc.
2. Pro Git book, written by Scott Chacon and Ben Straub and published by Apress,
[Link]
s
guide/9781449327507/ bu
lla
Web links and Video Lectures (e-Resources):
Sy
shared/overview
ra
D
Assessment Structure:
The assessment for each course is equally divided between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each component carrying 50% weightage (i.e., 50 marks each).
The CIE marks awarded shall be based on the continuous evaluation of the laboratory report using a defined
set of rubrics. Each experiment report can be evaluated for 30 marks. Total marks for the all report shall be
scaled down to 30 marks. The laboratory test (duration 03 hours) at the end of the last week of the semester
/after completion of all the experiments (whichever is early) shall be conducted for 50 marks and Marks scored
shall be scaled down to 20 marks. Final average of marks for report and test shall be out of 50 marks.
2
VTU/AEC Lab COURSE (1 Credit) template300320263
Components Needs
Superior Good Fair Unacceptable
CO-PO Mapping Improvement
(5) (4) (3) (1)
(2)
Demonstrates
Git Demonstrates Demonstrates
comprehensive Unable to
Fundamentals good basic Limited
understanding of explain
and Repository understanding understandin understanding
Git concepts, fundamental
Operations of Git concepts g of Git of Git concepts.
repositories, Git concepts.
[CO1] with minor concepts.
commits, and
[PO1, PO5] gaps.
version control.
Performs Performs Requires
Branching and Independently Unable to
branch basic branch significant
Workflow creates, perform
operations operations assistance for
Management manages, and branch
with minor with some branch
[CO2] merges branches operations.
guidance. errors. management.
[PO2, PO3] correctly.
s
Collaboration
bu
Performs most Performs Difficulty in
Efficiently
lla
and Remote remote basic executing Unable to use
performs clone,
Repository repository collaboration remote remote
Sy
operations.
ra
Performs Performs
Tags, Releases Correctly applies Limited ability Unable to
advanced some
and Advanced tags, stash, to perform perform
operations advanced
Git Operations cherry-pick, and advanced advanced Git
with minor operations
[CO4] advanced Git operations. operations
mistakes. with
[PO4, PO11] operations.
guidance.
Git History
Accurately
Analysis and Performs Performs
analyses commit Requires Unable to
Repository history basic history
history and apply assistance to analyse Git
Maintenance analysis with viewing
history analyse history. history.
[CO5] minor errors. commands.
modification
[PO2, PO4,PO5,
commands.
PO11]
Demonstrates Demonstrates
Demonstrates all Demonstrates Unable to
basic limited
experiments most demonstrate
Demonstration experiments understanding
confidently and experiments experiments
and and of experiments
maintains a correctly and effectively and
documentation maintains an and maintains
complete, well- well-organized fails to
[CO1-CO5] adequate lab an incomplete
organized, and lab record with maintain a
[PO10, PO11] record with or poorly
accurate lab minor proper lab
some missing organized lab
record. omissions. record.
details. record.
3
VTU/AEC Lab COURSE (1 Credit) template300320264
Components Needs
Superior Good Fair Unacceptable
CO-PO Mapping Improvement
(5) (4) (3) (1)
(2)
Demonstrates Demonstrates
Git
excellent good Demonstrates Demonstrates
Fundamentals Unable to
understanding understanding basic limited
and Repository explain basic
of Git concepts of Git concepts understanding understanding
Operations (2) Git concepts.
and with minor of Git concepts. of Git concepts.
[CO1] [PO1, PO5]
workflows. gaps.
Clearly
understands Unable to
Understanding of Understands Demonstrates Shows limited
and accurately understand
Problem the task with basic understanding
interprets the the given task
Definition (1) minor understanding of the task
given Git task or
[CO1] [PO2] clarification. of the task. requirements.
and requirements.
requirements.
Designs and
Design and Demonstrates Unable to
implements Git Implements Git Requires
Implementation basic implement
workflows and workflows significant
s
(3) bu implementation the required
operations with minor assistance for
[CO2, CO3, CO4] of Git Git
accurately and errors. implementation
lla
[PO3, PO5] operations. operations.
efficiently.
Sy
Accurately
Result & Analysis analyses Unable to
ft
● To qualify and become eligible to appear for SEE, in the CIE component, a student must secure a
minimum of 40% of 50 marks, i.e., 20 marks.
● To pass the SEE component, a student must secure a minimum of 35% of 50 marks, i.e., 18 marks.
● A student is deemed to have successfully completed the course if the combined total of CIE and
SEE is at least 40 out of 100 marks.
4
VTU/PCC-PEC-OEC (3 Credits) template30032026 1
s
documentation, and reporting.
bu
CO3 (L3 – Apply): Apply principles of social responsibility in engineering practice through
lla
community-oriented interventions
CO4 (L4 – Analyze): Exhibit multidisciplinary learning, problem-solving ability, and communication
Sy
skills based on collected data (requirements), stakeholder feedback, and baseline conditions.
CO5 (L5 – Evaluate): Formulate feasible societal problem statements and solutions considering
ft
ra
Sl.
Broad Areas/Project titles Measurable engineering outcome Specific POs SDGs
No.
s
7
System bu
system that recommends suitable
crops based on user-provided
lla
parameters such as soil type, season,
rainfall, and water availability
Sy
Lost and Found Application Develop a Lost and Found Application 6 11, 16
ft
Digital Learning Platform for Rural Design and develop a digital learning 5, 6 4
Government Schools platform (Tool) that provides
interactive learning content and
15 activity-based learning materials in
regional languages for rural and small
village govt schools (primary govt.
schools often lack interactive learning
tools)
s
bu
Community Disaster Preparedness Design and develop a web/mobile 6 11, 13
17 and Emergency Information System application for disaster preparedness
lla
and emergency alerts during natural
disasters.
Sy
Cyber Security Awareness Platform Create a simple web app where users 5, 6 16
for Phishing, Digital Arrest Scams, paste suspected text/links to get a risk
19 and Malicious Applications score based on known phishing
patterns, deceptive URLs, and high-risk
keywords
Public Grievance and Civic Issue Develop a web/mobile application that 6 11,15, 16
Reporting System allows citizens to report civic issues such
26 as potholes, streetlight failures, and
drainage problems and monitor
complaint resolution status.
s
27
Exchange System bu
platform that enables community
members or schools to manage book
lla
donations, borrowing, returns, and
book exchange activities.
Sy
s
bu
improvements.
lla
Develop a multilingual digital library 6 4
Digital Library and Knowledge
with e-books, educational videos, and
Sy
s
52 Microloan and Repayment Tracker
bu
Develop an application helping small
vendors track micro-loans, 6 8
for Small Vendors
lla
repayments, and daily sales.
Sy
Awareness Tool
on roof area and local rainfall data.
ra
D
s
66 Community Borewell / Water bu
track water tanker deliveries for 6 6, 11
Tanker Scheduling App
water-scarce localities.
lla
practices.
ra
D
s
bu
maintenance, and maintain booking
records.
lla
6 9, 11
Monitoring System maintenance issues, assign
ra
status.
Teaching Learning Process:
The suggested TLP for Community / Societal Project.
The following structured sequence of activities is to be carried out during the semester.
Week Teaching–Learning
Faculty Role Student Activity Output / Evidence
/ Activity
Phase
Course introduction,
Explain course scope, Understand course
objectives, ethics,
1 rules, rubrics, and requirements and form Team list, course plan
conduct, and
expected deliverables teams
assessment briefing
Demonstrate survey
Stakeholder interaction methods and Collect initial data from Survey notes,
3
and preliminary survey stakeholder community/users interview record
engagement
Prepare problem
Problem statement and Review and refine Approved problem
4 statement, scope, and
objective formulation problem statement statement
objectives
Check technical
Feasibility analysis and Generate possible Solution alternatives
7 feasibility and
solution brainstorming engineering solutions sheet
practicality
s
Test results / revised
11 and implementation correctness and
bu validate proposal with
output
planning improvements users
lla
Conduct implementation
12 demonstration / interaction and implementation
or demonstration
awareness activity documentation record
ft
ra
s
● bu
For declaration of a pass grade, the sum of CIE marks (out of 50) and scaled SEE marks (out of 50) shall
be ≥ 40; otherwise, the student is awarded grade F (Fail).
lla
Problem clearly
Relevant
identified with Problem
Problem identification problem with
strong evidence defined but Problem unclear
& relevance to 8 clear scope and
of relevance and justification is or not relevant.
society/environment adequate
well-defined weak.
evidence.
scope.
Thorough Limited
Interaction with engagement; Good engagement; Little or no
stakeholders; data comprehensiv engagement; incomplete stakeholder
8
collection, analysis & e data and adequate data data and contact; no
interpretation well- and analysis. superficial data/analysis.
interpreted analysis.
analysis.
Complete, well-
Project documentation; Complete and Basic with Missing/poorly
organized,
clarity, organization & clear with omissions; organized; no
10 analytical, and
problem-solving some analytical problem- clear problem-
strong
demonstrated content. solving solving.
problem-
limited.
solving.
VTU/PCC-PEC-OEC (3 Credits) template30032026 1
Clear, Benefit
demonstrable plausible; Limited or
Contribution & benefit No evident
societal benefit sustainability unclear benefit;
to society (impact, 8 benefit or
and realistic considered sustainability
sustainability) sustainability.
sustainability with minor weak.
path. gaps.
s
Problem identification
Clearly
bu
& relevance to Clear with Problem stated but
lla
articulated with Poorly defined
society/environment 16 reasonable evidence/context
strong evidence or irrelevant.
Sy
evidence. weak.
and context.
ft
ra
D
Formation of
problem Precise; Technically
Basic; limited No viable
statement; demonstrates sound and
technical depth or engineering
engineering 20 engineering feasible with
feasibility approach or
approach, depth, novelty minor
concerns. infeasible plan.
innovation & and feasibility. limitations.
feasibility
Excellent
Interaction with
engagement; Good
stakeholders; data Superficial data Inadequate or
rigorous data engagement
collection, analysis & 16 collection and no data; poor
collection and and acceptable
interpretation limited analysis. analysis.
insightful analysis.
analysis.
Project
documentation; Comprehensive, Complete and Missing key
Lacks technical
clarity, technical technically technically elements or
20 depth or has
rigor & problem- rigorous, and correct with technically
notable omissions.
solving demonstrated systematic. minor gaps. incorrect.
Good
Presents expertly,
Communication, presentation Adequate but fails Poor
defends work
presentation & viva- and to answer some presentation
12 persuasively and
voce responses satisfactory technical and unable to
answers all
answers to questions. defend work.
queries correctly.
most queries.
VTU/PCC-PEC-OEC (3 Credits) template30032026 1
Clear, evidence-
Contribution & benefit Reasonable
based impact No coherent
to society; impact impact Limited evaluation
assessment with assessment of
assessment & 16 discussion and of impact or
scaling impact or
sustainability sustainability sustainability.
recommendation sustainability.
considerations.
s
.
s
bu
lla
Sy
ft
ra
D
VTU/PCC-PEC-OEC (3 Credits) template30032026 1
s
7. NGO and government field-action case studies related to sanitation, water, health, education, and
environment.
bu
Assessment Structure:
lla
Continuous Internal Evaluation (CIE) shall be conducted by the Departmental Project Review Committee consisting
Sy
of a Senior Professor, the Project Guide, and one additional faculty member nominated by the Head of the Department.
Semester End Evaluation (SEE) shall be conducted by university-appointed examiners. The evaluation shall be based
ft
on rubrics designed to assess the attainment of NBA-defined graduate attributes, including problem analysis,
ra