S.E.

Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
TCET Autonomy Scheme (w.e.f. A.Y. 2024-25)

B.E. (Information Technology) S.E. SEM: III

Course Name: Universal Human Values-II Course Code: HSMC-301
Teaching Scheme (Program Specific) Examination Scheme (Academic)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Practical/
Theory (100) Term
Oral/
Hours Per Week Work Total
40 60 Presentati
on (25) (25)
Contact IA
Theory Tutorial Practical Credits ESE PR/OR TW
Hours ISE IE
25 125
2 1 - 3 3 20 20 60 -
IA: In-Semester Assessment - Paper Duration – 1 Hour
ESE: End Semester Examination - Paper Duration – 2 Hours
The weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely completion of practical (40%) and
Attendance / Learning Attitude (20%)
Prerequisite: Basic Life skills and Values
Course Objective:
To provide a much needed orientational input in value education to the young enquiring minds

Course Outcomes: After the successful completion of the course, students will be able to:

S Course Outcomes Cognitive PO Mapping PSO

N Levels as Mapping
perBlooms
Taxonomy
1 To appreciate the essential complementarily LI, L2, 6,7, -
between 'VALUES' and 'SKILLS' to ensure L3 8,9,10,11
sustained happiness and prosperity which are the
core aspirations of all human being.
2 To develop Holistic perspective towards life and LI, 6,7, -
profession as well as towards happiness and L2,L3,L4 8,9,10,11
prosperity based on a correct understanding of
the Human reality and the rest of existence
3 To practise plausible implications of such a LI, 6,7, -
Holistic understanding in terms of ethical L2,L3,L4 8,9,10,11
human conduct, trustful and mutually fulfilling ,L5,L6
human behaviour and mutually enriching
interaction with Nature.

Detailed Syllabus:

Module Topics Hrs Cognitive

No. Levels as
per Blooms
Taxonomy
1 Introduction to Value Education LI,L2
Understanding Value Education, Self-exploration as the Process for Value 6
Education, Continuous Happiness and Prosperity — the Basic Human
Aspirations, Right Understanding, Relationship and Physical Facility ,Happiness and
Prosperity — Current Scenario, Method to Fulfill the Basic Human Aspirations
2 Harmony in the Human Being 6 L I ,L2,L3
 Understanding Human being as the Co-existence of the Self and the Body,
Distinguishing between the Needs of the Self and the Body, The Body as an Instrument
of the Self, Understanding Harmony in the Self, Harmony of the Self with the Body
, Programme to ensure self-regulation and Health
3 Harmony in the Family and Society 6 L I ,L2,L3,
Harmony in the Family — the Basic Unit of Human Interaction, Values in Human-to- L4
Human Relationship, Trust' — the Foundational Value in Relationship, Respect' — as
the Right Evaluation, Understanding Harmony in the Society, Vision for the
Universal Human Order
4 Harmony in the Nature/Existence L I ,L2,L3,
Understanding Harmony in the Nature, Interconnectedness, self-regulation and L4
Mutual Fulfilment among the Four Orders of Nature, Realizing Existence as 4
Co-existence at All Levels, The Holistic Perception of Harmony in Existence
5 Implications of the Holistic Understanding L I ,L2,L3,
Natural Acceptance of Human Values, Definitiveness of (Ethical) Human Conduct, L4
A Basis for Humanistic Education, Humanistic Constitution and Universal Human 3
Order
6 Professional Ethics L I ,L2,L3,
Competence in Professional Ethics, Holistic Technologies, Production Systems and L4,L5,L6
Management Models-Typical Case Studies, Strategies for Transition towards Value-
based Life and Profession 3

Books and References:

S. No. Title Authors Publisher Edition Year

1 Jeevan Vidya: Ek A Nagaraj Jeevan Vidya Prakashan, 1999
Parichaya„ Amarkantak,
2 Human Values A.N. Tripathi New Age Intl. Publishers, New - 2004.
Delhi,
3 Small is Beautiful - E. F Sorab K. Gandhi - - 1973
Schumacher
4 Economy of Permanence J C Kumarappa Sarva Seva Sangh Prakashan - 2017
5 India Wins Freedom Maulana Abdul Stosius Inc/Advent Books Division 1989
Kalam Azad
6 Vivekananda Romain Rolland Advaita Ashrama, India 2010
7 A Foundation Course in R R Gaur, R Excel Books, New Delhi. ISBN 2nd 2019
Human Values and Asthana, G P 978-93-87034-47-1 Revise
Professional Ethics Bagaria d
Edition

Online References:

S. No. Website Name URL

1 https://www.youtube.co https://www.youtube.com/watch?v=PXSEpPFCn38
m
 List of Tutorial:
Tutorial Topic Hrs.
Number

1 Sharing about Oneself 1

2 Exploring Human Consciousness 1
3 Exploring Natural Acceptance I
4 Exploring the difference of Needs of Self and Body
5 Exploring Sources of Imagination in the Self 1
6 Exploring Harmony of Self with the Body 1
7 Exploring the Feeling of Trust 1
8 Exploring the Feeling of Respect 1
9 Exploring Systems to fulfil Human Goal 1
10 Exploring the Four Orders of Nature 1
11 Exploring Co-existence in Existence 1
12 Exploring Ethical Human Conduct 1
13 Exploring Humanistic Models in Education 1

14 Exploring Steps of Transition towards Universal Human Order 1

Total 15

Suggested Assessment for Term work :

The assessment is to provide a fair state of development of the student, so participation in classroom discussions, self-
assessment, peer assessment etc. will be used in evaluation.

Example: Assessment by faculty mentor: 10 marks Self-assessment: 10 marks Assessment by peers: 10 marks Socially
relevant project/Group Activities/Assignments: 20 marks

Semester End Examination: 50 marks , the overall pass percentage is 40%. In case the student fails, he/she must repeat
the course.
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Proposed TCET Autonomy Scheme (w.e.f. A.Y. 2024-25)

B.E. (Information Technology) S.E. SEM: III

Course Name: Mathematics-III Course Code: BSC- IT301
Teaching Scheme (Program Specific) Examination Scheme (Academic)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Theory (100) Practical/
Term
Hours Per Oral/
Work Total
Week 40 60 Presentati
on (25) (25)
IA
Contact
Theory Tutorial Practical Credits ESE PR/OR TW
Hours ISE IE

125
3 1 - 4 4 20 20 60 - 25

IA: In-Semester Assessment - Paper Duration – 1 Hour

ESE: End Semester Examination - Paper Duration – 2 Hours
The weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely completion of
practical (40%) and Attendance / Learning Attitude (20%)
Prerequisite: Basic Mathematics

Course Objectives: The objective of the course is to understand the discrete mathematical preliminaries
and apply the knowledge of sets, relations, functions, graphs, lattices, logic and algebraic structures in formal
representation of various computing constructs.

Course Outcomes: Students will be able to:

PSO
Cognitive levels of PO Mapping Mapping
SN Course Outcomes attainment as per (Write only (Write
Bloom’s
Taxonomy Number/s) only
Number/s)
1 Understand the basic concepts of set theory and able to
apply basic set operations in problem solving. L1, L2, L3 1,2,3,4 1,2

2 Understand relation and function and their properties

and also able to understand their use in programming L2, L3 1,2,3,4 1,2
applications.
3 Understand Partially ordered set, lattice concept in
various application. L1, L2, L3 1,2,3,4,5 1,2
4 Understand the concept of graph, Euler graph,
Hamiltonian graph and special kind of graph and
L1, L3 1,2,3,4,5 1,2
also able to model real world problems using
graph theory.
5 Develop an understanding of how to read and construct
valid mathematical statements, arguments and L1, L3 1,2,3,4,5 1,2
understand mathematical statements.
6 Understand use of groups and codes in Encoding-
Decoding and apply discrete structures into other
computing problems such as formal specification, L1, L3 1,2,3,4,5 1,2
verification, artificial intelligence, cryptography, Data
Analysis and Data Mining.
Detailed Syllabus:

Modu Topics Hr Cognitive levels of

le No. s. attainment as per
Bloom’s
Taxonomy
Introduction to Set Theory and Proofing Techniques
Definition of Sets, Venn Diagrams, complements, Cartesian
products, power sets, Cantor's theorem on power sets, cardinality 7
1 L1, L2, L3
and countability (Countable and Uncountable sets), Cardinal
numbers, counting principle: The Principle of Inclusion and
Exclusion, Pigeonhole Principle
Relation and Functions
Relation: Definition and types of relation, composition of relations,
2 pictorial representation of relation (Digraphs), partial ordering relation, 7 L2, L3
Closures, Warshall’s algorithm.
Function: One to one, onto and bijective functions, Direct and
inverse image of a function.
Lattices
Posets, Hasse Diagram, chain, Upper bounds, Lower bounds,
3 GLB & LUB of sets, Definition & properties of Lattice, 7 L1, L2, L3
sublattice, Distributive & modular Lattices, complemented &
bounded Lattices, Complete lattices, Zorn’s Lemma
Graph Theory
Definitions: Graphs, digraphs, Multigraphs, Paths and cycles
4 (Hamiltonian and Eulerian), Subgraphs, Isomorphism, Special kinds 8 L1, L3
of graphs: Bipartite graphs, Planer graphs, Connected Graphs, Trees.
Logic
Propositions and logical operations, Truth tables Equivalence, L1, L3
5 Implications Laws of logic, Normal Forms, Predicates and 7
Quantifiers, Mathematical Induction
Algebraic Structures
Algebraic structures with one binary operation: semigroup, monoid
6 and group, Abelian group, Cyclic groups, Homomorphism, 9 L1, L3
Isomorphism, Field. Coding theory: Coding of binary information
and error detection, decoding and error correction.
Total Hours 45
 Books and References:
S Title Authors Publisher Edition Year
N
1 Elements of Discrete Mathematics C. L. Liu and D. McGraw Hill 2nd
P. Mohapatra Editio 2010
n
2 Discrete Mathematical Structures McGra 5th Edition
with Applications to Computer J. P. Trembley, w Hill 2011
Science R. Manohar
3 Discrete Mathematics Seymour McGra 5th Edition
Lipschutz, Marc w Hill 2010
Lars Lipson,“
4 Advanced Engineering Erwin kreyszig John Wiley Ninth 2006
Mathematics & Sons Editio
n
5 Higher Engineering Mathematics B.S. Grewal Khanna Thirt 2010
Publishe y
rs Sixth
Editio
n

List of Tutorials:

Sr. Topic Hrs. Cognitive levels of

attainment as per
No
Bloom’s Taxonomy

1 Tutorial on Set theory 1 L1, L2

2 Tutorial on Principle of Inclusion and Exclusion 1 L1, L2, L3
3 Tutorial on Pigeonhole Principle 1 L1, L2, L3
4 Tutorial on Relation 1 L1, L2
5 Tutorial on Warshall’s Algorithm 1 L1, L2, L3
6 Tutorial on Functions 1 L1, L2
7 Tutorial on isomorphism 1 L1, L2, L3
8 Tutorial on poset, Hasse diagram 1 L1, L2
9 Tutorial on Lattice, Sublattice 1 L1, L2, L3
10 Tutorial on types of lattices 1 L1, L2, L3
11 Tutorial on planar graphs 1 L1, L2
12 Tutorial on Eulerian and Hamiltonian Graphs 1 L1, L2, L3
13 Tutorial on logic operations and truth tables equivalence 1 L1, L2
14 Tutorial on Normal Forms, Predicates and Quantifiers 1 L1, L2, L3
15 Tutorial on Algebraic structures with one binary operation 1 L1, L2, L3

Total Hours 15
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
TCET Autonomy scheme with effect from 2024-25

B.E (Information Technology) S.E. (SEM : III)

Course Name :Digital Circuit Design Course Code : ESC-IT 301
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory Practical/Oral (25) Term Work (25) Total
(100)
Contact
Theory Tutorial Practical Credits ISE IE ESE OR TW
Hours
150
3 - 2 5 4 20 20 60 25 25

ISE: In-Semester Examination - Paper Duration – 1 Hours

IE: Innovative Examination
ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely completion of practical (40%) and
Attendance/Learning Attitude (20%)
Prerequisite :Fundamentals of BJT and Logic signal levels.

Course Objective: The course intends to deliver the fundamental knowledge of Digital logic, number system,
conversions and Boolean algebra, apply and analyze the concept to create and troubleshoot a broad range of
combinational circuits using digital ICs, flip-flops, counters, and registers. To prepare students to perform the
analysis and design of various digital electronic circuits.

Course Outcomes: Upon completion of the course students will be able to:
Sr. Course Cognitive levels PO Mapping PSO Mapping
No Outcomes of attainment as
. per Bloom’s (Write only (Write only
Number/s) Number/s)
Taxonomy
1 Apply the knowledge of basic number system L1,L2,L3,L4 1,2,9,10,11 2
concepts to perform binary conversions, coding and
arithmetic
2 Apply the concept of Boolean algebra, K-Map and L1, L2, L3 1,2,4,9,10,11 2
Tabular method for simplification of Boolean
expression
3 Analyze, design and implement combinational L1, L2, L3,L4 1,2,3,9,10,11 2
logic circuit

4 Analyze, design and implement sequential logic L1, L2, L3,L4 1,2,3,9,10,11 2
circuit such as flip flop
5 Analyze,design and implement shift registers L1, L2, L3,L4 1,2,3,9,10,11 2

6 Analyze, design and implement counters L1, L2, L3,L4 1,2,3,9,10,11 2

Detailed Syllabus:

Cognitive
levels of
Module No. Topics Hrs. attainment as
per Bloom’s
Taxonomy
0 Prerequisite 02 L1,L2

Introduction to bipolar junction transistor and configurations, Representation of

analog signal level in to digital signals through basic TTL circuits.
01 Number Systems and codes 06 L1, L2, L3,L4

Representation of signed numbers: fixed and floating point numbers,

Introduction to Number systems, Binary Number systems, Signed, Binary
Numbers, Binary, Octal, Decimal and Hexadecimal number, Systems and their
conversion, Binary arithmetic using compliments, Gray Code, BCD Code,
Excess-3 code, ASCII Code. inter-conversion of codes
02 Logic Design and Minimization Techniques 07 L1, L2, L3
Introduction to basic logic gates, Operations on NAND and NOR gates, XOR
and X-NOR operations, understanding Boolean Algebra and its Standard
representation of logic functions- SOP and POS forms. Min term and Max term.
Don’t care conditions. Simplification of logic functions-using Karnaugh Map
(K- Map) for 2, 3 and 4 variables. Quine-McClusky Method, NAND,NOR
Realization
03 Combinational logic Circuit and design 06 L1, L2, L3
Half- Adder, Full Adder, Half Subtractor or Full Sub tractor, BCD adder using
and subtractor using IC 7483, Multiplexers (MUX): Working of MUX,
Implementation of expression using MUX (IC 74153, Demultiplexers IC
74151). Demultiplexers (DEMUX):- Implementation of expression using
DEMUX, Decoder (IC 74138)
04 Latches and Flip-Flop 09 L1, L2, L3,L4
Introduction: SR latch, Concepts of Flip Flops: SR, D, J-K, T, Truth Tables and
Excitation Tables of all types, Race around condition, Master Slave JK Flip
Flops, Timing Diagram, Flip-flop conversion
05 Shift Register 06 L1, L2,L3,L4
Registers-SISO, SIPO, PISO AND PIPO 4 –BIT REGISTER. Shift Register-
Right shift, left shift and Bidirectional Register. Application of shift Register-
Ring and Twisted Ring Counter.
06 Counter 09 L1, L2
Counters : Types of counters- Asynchronous and Synchronous .Up, Down and
Up-Down Counters Asynchronous Counter-2,3 and 4 Bit Up ,down and
Up/Down Counters. Synchronous Counter-2, 3 and 4 Bit Up, down and Up-
Down Counters.
Total Hrs. 45
 List of Practicals/Experiments:

Exp.
No. Category Experiments Hrs RBT Levels
Basic Verify the truth table of logic gates
1 2 L1, L2
Experiments (Basic/ Universal Gates)
2 To verify universal property of NAND & NOR 2 L1, L2, L3

3 Realization of Boolean expression using gates 2 L1, L2, L3

Design Design (truth table, K map) and implement 4 bit Code converter.
4 2 L1, L2, L3,L4
Experiments Binary to gray and vice versa. ii. BCD to Excess-3 and vice versa.
5 Design of Half and Full Adder 2 L1, L2, L3
6 Design of Half and Full Subtractor. 2 L1, L2, L3
Realization of Boolean expression using multiplexer IC
7 2 L1, L2, L3,L4
74151/74153.
8 To verify and observe the operation of JK and T flip-flops. 2 L1, L2, L3
9 Design and implement 2-bit up counter. 2 L1, L2, L3,L4
10 Advanced To design SISO or SIPO shift registers. 2
11 Experiments To design automated system for washing machine. 5 L1, L2, L3,L4
12 Mini Project To design control system for lift 5 L1, L2, L3,L4
Total Hours 30

Books and References:

Title Authors Publishers Edition Year

Modern Digital Electronics R. P. Jain Tata McGraw Hill 4th 2009
Digital Logic and computer Design M. Morris Mano Pearson education India 4th 2016
Fundamentals of Digital Circuits A Anand Kumar Prentice Hall India 2nd 2009
Digital Electronics Subrata Ghosal Cengage Learning 1st 2012
Digital Electronics Principles and Integrated Anil K. Maini Wiley India 1st 2007
Circuits

Online References:

Sr. No. Website Name URL Modules

Covered
1. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_circuit M1
s_number_systems.htm
2. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_circuit M2
s_logic_gates.htm
3. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_combi M3
national_circuits.htm
4. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_circuit M4
s_latches.htm
5. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_circuit M5
s_shift_registers.htm
6. https://www.tutorialspoint.com https://www.tutorialspoint.com/digital_circuits/digital_circuit M6
s_counters.htm
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
TCET Autonomy scheme with effect from 2024-25
B.E (Information Technology) SEM : III
Course Name: Data Structures & Algorithms Course Code :PCC-IT 301
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Hours Per Week Theory (100) Practical/ Term Tota
Oral (25) Work l
(25)
Theory Tutorial Practical Contact Cre IA E PR T
Hours dits S W
E
IS I
E E 6 2 150
3 1 2 6 5 20 2 25
0 5
0
ISE: In-Semester Examination - Paper Duration – 1 Hours
IE: Innovative Examination
ESE: End Semester Examination - Paper Duration - 2 Hours
The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical and tutorial (40%) and Attendance/Learning Attitude (20%)
Prerequisite: C Programming Language
RBT: Revised Bloom’s Taxonomy

Course Objective: The course intends to deliver the fundamentals of data structures and analysis of various
algorithms by providing a platform to learn, compare and apply different data structures in real world scenario.

Course Outcomes: Upon completion of the course students will be able to:

S. Course Outcomes Cognitive PO PSO

No levels of Mapping Mapping
. attainmen (Write (Write
t as per only only
Bloom’s Numbers) Numbers)
Taxonomy
1 Understand various data structures and its L1, L2, 1,2,12 1,2,3
application. L3,L4,L5

2 Apply Appropriate sorting and searching L1, L2, L3 1,2,12 1,2,3

technique to specified problem definition.

3 Implement various linked operations like L1, L2, L3, 2,4,12 1,2,3
searching, insertion, and deletion, traversing L4, L5
mechanism etc. on various data structures to solve
problems
4 Analyze Stack & Queue operations along with its L1, L2, L3, 2,4,5,12 1,2,3
applications. L4, L5

5 Analyze the operations & applications on Tree L1, L2, L3 2,3,4,12 1,2,3
data structure.

6 Apply appropriate operations on Graph data L1, L2, L3 2,3,4,12 1,2,3

structure.
Detailed Syllabus (Total No. of Hours: 45):

Cognitive levels of
Module Hrs attainment as per
Topics
No. . Bloom’s
Taxonomy
Introduction to Data Structure and
Algorithms
01 Introduction to Data Structures, Need of Data structures, ADT, ADT structure, 4
Linear and Nonlinear Data structure, Introduction to Analysis of Algorithms: L1, L2, L3,L4, L5
Properties of an Algorithm, Complexity analysis techniques, Recursion:
Advantages & Disadvantages, Applications - Social media platforms and
analyze its time and space complexity
Searching and Sorting Techniques
Introduction to Searching: Linear search, Binary search - Applications – 8
02 searching algorithms in Image processing
L1, L2, L3
Introduction to Sorting: Selection Sort, Insertion Sort, Quick Sort, Merge Sort,
Radix Sort. Complexity Analysis of searching and sorting techniques.
Case study: Store pixel values for manipulation and analysis of images using
Arrays;
Linked List
03 Linked List as an ADT, Difference between Linked list & Arrays, Linked list
10
operations - searching, insertion, and deletion, traversing, Memory Allocation & L1, L2, L3,L4,L5
De-allocation of Linked list, Singly Linked list, Doubly Linked list, Circular
linked list, Application of linked list.- Music and Video Player Playlists;
Dynamic Path Planning of a robot
Stack and Queue

10
Introduction to Stack, Stack as ADT, Operations on stack – PUSH, POP,
04 traversing, Stack implementation using array and Linked List, Polish notations,
Applications of stack- Arithmetic expression evaluation, Infix, prefix, Postfix
notations and conversions. L1, L2, L3,L4,L5
Introduction to Queue, Queue as ADT, Operations on Queue: ENQUEUE,
DEQUEUE, Queue implementation using array and Linked List, Linear Queue
and Circular queue, Priority Queue, De-queue, Application of Queues
Case study: Implement a real-time ticketing system using both Stack And Queue
Data Structures
Tree
Tree: Introduction to Trees, Tree terminology, Types of Trees, Binary tree
05 representation, Operations on binary tree, Traversal of binary tree, Binary search 08
L1, L2, L3
tree, Expression tree, Threaded Binary Tree. Application of Trees - file system
structure of an operating system case study : Decision trees for machine learning
or game development.
Graph
Graph: Introduction to Graph, Graph terminology, Graph Representation- Matrix
and adjacency list, Graph traversal: Depth first search(DFS) and Breadth First
06 search(BFS), Minimum Spanning Tree: Prim’s & Kruskal’s, Application of 05
L1, L2, L3
Graphs, Case study on graph data structures - social media analysis, route
planning

Total Hrs. 45
 List of Practical’s / Experiments:

Experim Category of RBT Levels

Practical/ Experiment Topic H Cognitive
ent Experiment rs levels of
No. . attainment as
per Bloom’s
Taxonomy
Implement Linear and Binary Search
1 Techniques 2 L1, L2, L3
Basic
Experiments Implement Selection and insertion sort. L1, L2, L3
2 2
(Based on
3 measurements Implement Quick Sort and Merge sort L1, L2, L3
4
of properties)
4 Implement Singly Linked List and
2 L1, L2, L3
Advance different Operations on it
5 Experiments Implementation of Doubly Linked list
2 L1, L2,
(Based on and different Operations on it L3,L4
Volumetric Implementation of Stack using
6 Analysis) L1, L2,
array and Linked List.
2 L3,L4
Implementation of Linear Queue using array L1, L2,
7 and Linked List. 2 L3,L4
Implementation of Circular and Priority
8 2 L1, L2, L3,L4
Queue.
Implementation of Binary Search Tree with
9 2 L1, L2, L3,L4
insertion, deletion and Traversal operations.
Implementation of Graph Traversal
10 2 L1, L2, L3,L4
Techniques: DFS & BFS
a) Develop the code on Stack Application
11 Design Based b) Develop the code for job scheduling L1, L2,
4
Experiments using Queue based operation L3,L4
12 Project Based Mini Project:
Experiments- Design Application of Data Structure & its
implementation.
Group Activity)
(Students should
complete any one
project Based 4 L1, L2, L3,L4
experiment from the
list or any other
project in discussion
with Faculty in-
Charge)
Total 30

5
List of Tutorials:

RBT Levels
Tutoria Cognitive levels of
Tutorial Topic Hrs. attainment as per
l No.
Bloom’s Taxonomy
1 Linear and Binary Search Techniques. 2 L1, L2, L3
2 Sorting Techniques. 2 L1, L2, L3
3 Sorting Techniques. 2 L1, L2, L3
4 Linked List and different operations on it 1 L1, L2, L3
5 Circular Linked list and different Operations on it 1 L1, L2, L3
6 Stack Applications 1 L1, L2, L3,L4
7 Queue Applications 1 L1, L2, L3,L4
8 Circular and Priority Queue. 2 L1, L2, L3,L4
9 Expression tree, Threaded Binary Tree 1 L1, L2, L3,L4
10 Minimum Spanning Tree: Prim’s & Kruskal’s Algorithm 2 L1, L2, L3,L4
Total 15

Books and References:

S. Titl Autho Publishe Editi Yea

No e rs r on r

1 Data structures Tenenbaum, Langsam, Pearson Seco 201

using C Augenstein nd 5

2 Data Structures Oxford Seco 201

using C Reema Thareja 5
nd
Dreamte 201
3 C and Data P. S. Deshpande , O. G. Thir
ch 0
structures Kakde d
Press.
ALGORITHMS OXFO 201
4 Design and First
Harsh Bhasin RD 5
Analysis
Universit 200
5 Computer Ellis Horowitz and Sartaj First
ies 8
Algorithms Sahni,
Press
Roberto Tamassia,
6 Data Structures and Michael Wiley Seco 201
Algorithms in C++ T. Goodrich nd 1

6
Online References:

S. Website Name URL Modu

No. les
Cover
ed
1. NPTEL https://nptel.ac.in/courses/106103069 M1
2. NPTEL https://archive.nptel.ac.in/courses/106/106/10610613 M2
1/
3. NPTEL http://digimat.in/nptel/courses/video/106106130/L07.html M3
4. NPTEL https://archive.nptel.ac.in/courses/106/106/106106130/ M4
5. NPTEL https://archive.nptel.ac.in/courses/106/102/106102064/ M5
6. NPTEL https://archive.nptel.ac.in/courses/106/106/106106130/ M6

7
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
TCET Autonomy scheme with effect from 2024-25

B.E (Information Technology) SEM: III

Course Name :Database Management Systems Course Code: PCC-IT 302
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Term
Practical/Oral
Hours Per Week Theory (100) Work Total
(25)
(25)
Contact
Theory Tutorial Practical Credits ISE IE ESE PR TW
Hours 150
3 - 2 5 4 20 20 60 25 25
ISE: In-Semester Examination - Paper Duration – 1 Hours IE: Innovative Examination

ESE: End Semester Examination - Paper Duration - 2 Hours

The weightage of marks for continuous evaluation of Term work/ Report: Formative (40%), Timely
completion of practical (40%) and Attendance/Learning Attitude (20%)
Prerequisite: Fundamentals of computer programming

Course Objective: The course intends to deliver the fundamental knowledge of Database & Database
Management System. To provide good formal foundation on the Entity Relationship Model, the relational model
of data and usage of Relational Algebra and basic SQL as a universal Database language. To demonstrate the
principles behind systematic database design approaches by covering conceptual design, logical design through
normalization and to introduce advanced concepts of transaction management and recovery techniques.

Course Outcomes: Upon completion of the course students will be able to:

PSO
Cognitive levels of
PO Mapping Mapping
S. Course attainment as per
(Write only (Write
No. Outcomes Bloom’s
Number/s) only
Taxonomy
Number/s)
1 Define & Explain the features & functions of L1,L2 1,2,3 2
Database Management Systems and Relational
Database
2 Analyze database models & entity relationship L1,L2,L3,L4,L5, L6 1,2,3,4,5 2
models.
3 Construct queries in Relational Algebra, create L1,L2,L3 1,2,3,4,5,11 2
a RDBMS for a real life application, with
constraints and keys using SQL. Analyze the
performance of SQL queries and can able to
identify optimum query.
4 Apply various techniques for securing Database L1,L2,L3,L4 1,2,3,4,5,11,12 2
and Backup & Recovery
5 Analyze the existing design of a database schema L1,L2,L3 1,2,3,4,5,9,11,12 2
and apply concepts of normalization to design an
optimal database.
6 Explain and understand the concept of a L2,L3,L4 1,2,3,4,5,9,11,12 2
transaction and how ACID properties are
maintained when concurrent transaction occurs
in a database

8
 Detailed Syllabus (Total No. of Hours: 45):

Module Topics Hrs. Cognitive levels

No. of attainment as
per Bloom’s
Taxonomy
0 Prerequisite 02 L1,L2
Basic knowledge of operating systems and file systems,
Any programming Language
01 Introduction to Database Concepts 06 L1, L2,
Introduction, Purpose of Database System- Database System
Terminologies, Database characteristics,File system V/s
Database system, Users of a Database System, Data Models,
Schemas, and Instances, Three-Schema Architecture and
Data Independence, Database Administrator (DBA), Role of a
DBA.
02 Entity– Relationship Data Model 06 L1, L2, L3,
Conceptual Modelling of a database, The Entity-Relationship L4,L5,L6
(ER) Model, Components of E-R Model , Entity Types, Entity
Sets, Attributes, and Keys, Relationship Types, Relationship
Sets, Weak Entity Types Generalization, Specialization and
Aggregation, Extended Entity Relationship (EER) Model.
03 Relational Model and SQL Overview 09 L1, L2, L3
Relational model concepts, Constraints, converting E-R diagram
into Relational Model
Relational Algebra: Basic Operations-Selection, projection,
Complex Operations- Cartesian product, Join, Set operations
SQL: Characteristics of SQL, SQL data types, SQL Constraints
,Data Definition Language, Data Manipulation Language,
Aggregate Functions, Group by, Order by clause.
Graphical User Interface with DB connectivity: GUI forms,
connection of front-end GUI with database. Insert , update
delete , select operation from GUI.
Advance SQL with integrity, Security and Authorization 08 L1, L2, L3
Nested sub queries, complex queries, Stored procedures and
triggers, Database security and Authorization.
04
Develop connection between Front End and Back End
Managing Views: Creating and modifying views, using views,
Inserting, Updating and deleting data through views
Recovery Model- Backup types - Full, Differential, and
Transaction.

05 Relational Database Design 07 L1, L2, L3,L4

Design guidelines for relational schema, Functional
Dependencies, Definition of Normal Forms- 1NF, 2NF,
3NF, BCNF, Converting Relational Schema to higher
normal forms.
06 Transactions Management, 07 L1, L2,L3
Concurrency and Recovery

9
 Transaction Management: Transaction Concepts, Transaction
state, ACID properties, testing of serializability, serializability
of schedules, conflict & view serializable schedule, Recovery
system: recoverability, Recovery from transaction failures, log
based recovery, checkpoints, deadlock handling. Transaction
Control Language
Concurrency control: Lock based, Timestamp based,
validation based protocol, Deadlock Handling.
Total Hrs. 45

List of Practicals/Experiments:

Cognitive levels of
Type of Total attainment as per
Sr.No. Title of Experiment
Experiment Hours Bloom’s
Taxonomy
Construct an Entity Relationship (ER) L1,L2
1 diagram for a given case study 2
Basic
Experiments Write Relational Algebra queries for L1,L2
2 a given case study 2

Implementation of Data Definition L1,L2,L3

3 Commands with Constraints. 2

Implementation of Data L1,L2,L3

4 Manipulation Commands and 2
Design Data Control Commands
Experiments Implementation of Sets, string and L1,L2,L3
5 aggregate functions 2
6 Implementation of Join Queries and 2 L1,L2,L3
Nested Queries
Implementation of triggers 2 L1,L2,L3
8
9 Advanced Develop GUI using frontend tools 4 L1,L2,L3
Experiments
10 Develop a connection between front end and 2 L1, L2, L3, L4
back end
11 Mini/Minor Design a Mini Project for a given case study 10 L1,L2,L3,L4
Projects/
Seminar/
Case Studies
Total Hrs. 30

10
 Books and References:

S.NO. Title Authors Publishers Edition Year

1 Database System Korth, McGraw – 6th 2012
Concepts Slberchatz,Sudarsha n Hill Edition
2 Fundamentals of Elmasri and Navathe Pearson 6th 2014
Database Systems Education Edition
3 Database Management G. K. Gupta McGraw – 6th 2011
Systems Hill Edition
4 An Introduction C. J. Date, A. Pearson 8th 2007
To Database Kannan, S. Education Edition
Systems Swamynathan
Database System Korth, Slberchatz, McGraw – 6th 2012
Concepts Sudarshan Hill Edition

Online References:

S. Website Name URL Modules

No. Covered
1 https://www.tutorialspoint.com/dbms/dbms_overview.htm,
. https://www.tutorial https://www.tutorialspoint.com/dbms/dbms_architecture.ht m
M1
spoint.com/ https://www.tutorialspoint.com/dbms/dbms_data_models.ht
m
2 https://www.tutorialspoint.com/dbms/er_model_basic_conc
. https://www.tutorial epts.htm
M2
spoint.com/ https://www.tutorialspoint.com/dbms/dbms_generalization_
aggregation.htm
3
. https://www.tutorial https://www.tutorialspoint.com/dbms/relational_data_model.ht
M3
spoint.com/ m https://www.tutorialspoint.com/dbms/sql_overview.htm
4 https://www.tutorial
. https://www.tutorialspoint.com/Database-Backup-and-Recovery M4
spoint.com/
5
https://www.tutorial
. https://www.tutorialspoint.com/dbms/database_normalizatio n.htm M5
spoint.com/
6 https://www.tutorial https://www.tutorialspoint.com/dbms/dbms_transaction.htm
. spoint.com/ https://www.tutorialspoint.com/dbms/dbms_concurrency_contr M6
ol.htm

11
 S.E. Semester – III
Choice Based Credit Grading Scheme with Holistic Multidisciplinary Education (CBCGS-HME-2023)
TCET Autonomy scheme with effect from 2024-25

B. E. Information Technology S.E. (SEM: III)

Course Name: Attitude and Aptitude Development- III Course Code: MC301
Teaching Scheme (Program Specific) Examination Scheme (Formative/ Summative)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment/ Evaluation
Practical/ Term
Hours Per Week Theory Total
Oral Work
Contact
Theory Tutorial Practical Credits IA ESE PR TW
Hours
25
Non- Passing is mandatory for this
1 - - 1 25
Credit course
AC- Activity Evaluation/ Term work based on presentation
Total weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely
Completion of Practical (40%) and Attendance/ Learning Attitude (20%)
Pre-requisite: Logical and analytical abilities, English Language skills, positive outlook

Course Objective: The course aims to impart aptitude skills which will develop students’ logical, analytical,
and reasoning skills. Moreover, it also focuses on developing a positive outlook which will carve out a charismatic
personality with ethics and etiquette required at personal and professional life.

Course Outcomes: Upon completion of the course students will be able to:

Cognitive levels of
attainment as per
S.No. Course Outcomes
Revised Bloom’s
Taxonomy
1 Develop personality traits to become a charismatic personality L1, L2, L3
2 Understand various leadership styles, develop, and use leadership qualities as L1, L2, L3
per the situations
3 Understand the hiring process and prepare themselves for the recruitment L1, L2, L3
process
4 Develop quantitative aptitude by using tactics, shortcuts, etc L1, L2, L3, L4
5 Enhance reasoning skills through observations, tricks, and practice L1, L2, L3, L4
6 Develop verbal reasoning skills with quick shortcuts L1, L2, L3

12
 Detailed Syllabus:

Module Topics Hr Cognitive levels of

No. s. attainment as per
Revised Bloom’s
Taxonomy

1 Personality
The Personality Attribute of Taking Bold Decisions, Types of
Personality, Five-factor Inventory, Empiricists and Rationalists, 2 L1, L2, L3
The Big Five personality traits.

2 Leadership Skills
The Concept, Types of Leaders, Leadership styles, Situational
and Contingency theories, and Ontological-phenomenological L1, L2, L3
2
model of leadership

3 Pre-Hire Assessment
The concept, Types, Process, Pre-hire assessment tools,
prejudices, Responsibilities of the candidates, Introduction to 2 L1, L2, L3
professional ethics

4 Quantitative Aptitude
Permutations & Combinations, Probability, Mensuration, Data 4 L1, L2, L3, L4
Interpretation, Basics of Trigonometry, Coordinate Geometry

5 Reasoning Aptitude
Inferences, Arguments, Probability, Data Sufficiency, Seating
Arrangements, Sequencing & Ordering, Scheduling, Puzzles, 3 L1, L2, L3, L4
Data Interpretation, Venn Diagram

6 Verbal Aptitude
Reading Comprehension, Closet Test, Error Detection, Idioms 2 L1, L2, L3
and Phrases, Critical Reasoning, one-word substitution

Total Hrs. 15

13
 Books and References:

SN Title Authors Publisher Edition Year

1. Quantitative Aptitude for Dr. R.S. Aggarwal S. Chand 2022nd 2022
Competitive Examinations Edition

2 A Modern Approach to Dr. R.S. Aggarwal S. Chand 2nd Edition 2018

Verbal & Non-Verbal
Reasoning

3 A Modern Approach to Dr. R.S. Aggarwal S. Chand 2022nd 2022

Logical Reasoning Edition

4 Puzzles to Puzzle You Shakuntala Devi Orient Paperbacks - 2005

Online References:

S. No. Website Name URL Modules

Covered
1 Practice Aptitude Tests https://www.practiceaptitudetests.com/?msclkid=42 M4, M5
7f71c485311d3df786154c3006c155&utm_source=b
ing&utm_medium=cpc&utm_campaign=Brand%20
Global&utm_term=Practice%20Aptitude%20Tests
&utm_content=_B_Exact
2 Quantitative Aptitude Tutorials https://www.youtube.com/playlist?list=PLpyc33gO M4
cbVA4qXMoQ5vmhefTruk5t9lt
3 Spatial Reasoning Test https://www.testgorilla.com/test-library/cognitive- M6
ability-tests/spatial-reasoning-
test/?utm_term=verbal%20reasoning%20for%20apti
tude%20test&utm_campaign=&utm_source=bing&
utm_medium=cpc&hsa_acc=4932434860&hsa_cam
=407261470&hsa_grp=1355698998617911&hsa_a
d=&hsa_src=o&hsa_tgt=kwd-
84732378233231&hsa_kw=verbal%20reasoning%2
0for%20aptitude%20test&hsa_mt=b&hsa_net=bing
&hsa_ver=3&msclkid=ef084e72adf410827bed2afa
1849c514&utm_content=Reasoning
4 Personality Types https://www.16personalities.com/personality-types M1

5 Ted Talk https://www.ted.com/topics/leadership M2

6 Randstad-Pre-Hire Assessment https://www.randstad.in/hr-news/recruitment/7-pre- M3

hire-assessment-tools-you-should-be-aware/

14
 S.E. Semester – III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
TCET Autonomy scheme with effect from 2024-25

B. E. Information Technology S.E. SEM: III

Course Name: Summer Internship Course Code: SI-IT301

Contact Hrs. during Weekend / Semester Break/ End of Assessment/Evaluation Scheme
Semester (Between 21st and 25th Week) Presentation Report
Contact TW
Theory AC Practical Credits AC AC
Hours
- - - 120* - - - -
AC- Activity evaluation TW – Term Work Examination
* This is part of Summer Internship but can start in winter. Students may go up to 160 hrs. to acquire maximum 4
credits in Semester 4.

Total hrs. mentioned should be completed till end of Semester 4. Credits will be awarded at the end of 4th Semester
and will be reflected in the Grade Card of 4th Semester.

Prerequisite: Fundamental knowledge of Information Technology related tools

Course Objectives:
To get industry like exposure in the college laboratories by carrying out projects using subject studied till
4th semester. Also design innovative techniques / methods to develop the products. To gain knowledge of
marketing and publicizing products developed.

Course Outcomes: Upon completion of the course students will be able to:

Cognitive levels of
Sr. No. Course Outcomes attainment as per
Bloom’s Taxonomy
To apply subject’s knowledge in the college laboratories for carrying out
1 L1, L2,L3
projects
Able to developed innovative techniques / methods to develop the products
2 L1, L2,L3

Able to do marketing and publicity of products developed

3 L1, L2,L3

Detailed Syllabus:
Cognitive levels of
Module
Topics attainment as per
No.
Bloom’s Taxonomy
Program Specific Internship
Training and certification on emerging technologies in domains offered by
Department of Computer Engineering L1, L2, L3
1
Applying classroom and laboratory knowledge to design, develop and deploy
the products
Inter disciplinary Internship

 To explore and understand issues and challenges in the other disciplines L1, L2, L3
2
(E&TC, ELEX, MECH and CIVIL)

15
  Design , develop and deploy cost effective products using
multidisciplinary approach

Industry Specific Internship

 To explore and understand issues and challenges in industry
3  Developing solutions for industry specific problems L1, L2, L3
 Design , develop and deploy products for startup and SMEs

Interpersonal Internship
 To develop interpersonal skills such as leadership, marketing, publicity
4 L1, L2, L3
and corporate ethics and communication
 To get competence in problem solving , presentation , negotiation skills
Social Internship
 Identify and study different real life issues in the society
5 L1, L2, L3
 Identify societal problems and provide engineering solutions to solve
these problems
Academic Internship
 Study report preparation, preparation of presentations, copy table book
preparation , business proposal and IPR
6  Capture aspirations & expectations through interviews of students.
 Ways to connect research in technical institutes with industry. L1, L2, L3
 Taking inputs from self, local stakeholders and global stake holders which
will help to develop process with comparative and competitive study.

Books and References:

Sr. No. Title Authors Publisher Edition Year

1
The Ultimate Guide to Internships: 100
Steps to Get a Great Internship and Eric Woodard Allworth First 2015
Thrive in It (Ultimate Guides)

Online References:

Sr. Website Name URL Modules

No. Covered
1 https://www.letsintern.com/ https://www.letsintern.com/internships/summer-internships M1-M6
2 https://codegnan.com https://codegnan.com/blog/benefits-of-internships-and- M1-M6
importance

3 https://www.honorsociety.org https://www.honorsociety.org/articles?category=internships M1-M6

16
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Proposed TCET Autonomy Syllabus (w.e.f. A.Y. 2023-2024)

B.E. (Information Technology) S.E. SEM : III

Course Name : Professional Skills II (Dept Specific Skill - Cloud Infrastructure Course Code : HME -ITPS301
Analysis I)
Teaching Scheme (Program Specific) Examination Scheme (Academic)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation
Theory Tutorial Practical Contact Credits Presentation Report TW
Hours 25
AC AC

- - 2 2 1 15 10 25

The weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely completion
ofpractical (40%) and Attendance / Learning Attitude (20%)

Prerequisite: Computer Basics, Procedural Programming Languages, Infrastructure Security

Course Objective: To comprehend cloud concepts involves grasping the fundamental principles of on-demand
resource provisioning, scalability, and virtualization, while understanding the cloud environment entails familiarity
with the infrastructure, services, and deployment models. Utilizing cloud services involves efficiently leveraging
platforms, software, and infrastructure provided by cloud service providers to meet diverse computing needs.

Course Outcomes: Upon completion of the course students will be able to:

Cognitive levels PO PSO

Sr. of attainment as Mapping Mapping
Course Outcomes
No. per Bloom’s (Write only (Write only
Taxonomy Number/s) Number/s)
1 L1-L6 1-6, 8-12 1,2,3,4
Configure, test and deploy cloud infrastructure
2 L1-L6 1-6, 8-12 1,2,3,4
Maintain compute, network and storage systems
deployed on cloud and ensure backups and recovery

3 L1-L6 1-6, 8-12 1,2,3,4

Automate cloud infrastructure management
4 L1-L6 1-6, 8-12 1,2,3,4
Use cloud development tools
5 L1-L6 1-6, 8-12 1,2,3,4
Logical Volume Manager Implementation
6 Cloud VM with Multiple Volumes L1-L6 1-6, 8-12 1,2,3,4

17
 List of Experiments:

Cognitive levels of
attainment as per
Sr. No. Practical/Experiment topic Hrs.
Bloom’s
Taxonomy
1. Design and Deploy static web application on web server. 2 L1,L2.L3,L4,L5,L6

2. Design and Deploy static web application on web server virtual Machine 2 L1,L2.L3,L4,L5,L6

3. Creating an account on a cloud service provider (e.g., AWS, Azure, Google Cloud) 2 L1,L2.L3,L4,L5,L6
and demonstrate deployment of Cloud Virtual Machine instance using SSH/RDP.

4. Design and Deploy static web application on Cloud Virtual Machine 2 L1,L2.L3,L4,L5,L6

5. Implement Logical volume manager 2 L1,L2.L3,L4,L5,L6

6. Launch a Cloud Virtual Machine instance with multiple volumes Attached and 2 L1,L2.L3,L4,L5,L6
analysis it.
7. Creating and managing object storage in cloud environment and Configuring 2 L1,L2.L3,L4,L5,L6
storage lifecycle policies and versioning
8. Implementing data backup and recovery strategies. 2 L1,L2.L3,L4,L5,L6

9. Create a function and perform CRUD operations in relational database in cloud. 2 L1,L2.L3,L4,L5,L6

10. Design and Deploy static web application in local environment and connect 2 L1,L2.L3,L4,L5,L6
database hosted on cloud.
11. Use cloud development tools and frameworks (e.g., AWS CLI) to automate the 2 L1,L2.L3,L4,L5,L6
provisioning of cloud resources
12. Configuring IAM roles, users, and permissions. and enabling multi-factor 2 L1,L2.L3,L4,L5,L6
authentication (MFA).
13. Implementing encryption for data at rest and in transit. Setting up logging and 2 L1,L2.L3,L4,L5,L6
monitoring for security events
14. Case study on various available cloud computing services with its features 2 L1,L2.L3,L4

15. Mini Project 2 L1,L2.L3,L4,L5,L6

Total Hrs. 30

Online References:
Sr. Website URL Practical’s
No. Name
1 www.aws.amazone. https://aws.amazon.com/getting-started/hands-on/?nc2=h_ql_le_gs_t&getting- 1-15
com started-all.sort-by=item.additionalFields.content-latest-publish-date&getting-
started-all.sort-order=desc&awsf.getting-started-category=*all&awsf.getting-
started-content-type=*all

18
 S.E. Semester –III
Choice Based Credit Grading Scheme with Holistic and Multidisciplinary Education (CBCGS-HME 2023)
Proposed TCET Autonomy Syllabus (w.e.f. A.Y. 2024-2025)

B.E. (Information Technology) S.E. SEM : III

Course Name : Industry Practice-I (Employability Skills) (HTML &CSS) Course Code : HME -IP301
Teaching Scheme (Program Specific) Examination Scheme (Academic)
Modes of Teaching / Learning / Weightage Modes of Continuous Assessment / Evaluation

Contact Presentation Report

Theory Tutorial Practical Credits TW 25
Hours AC AC

- - 2 2 1 15 10 25

The weightage of marks for continuous evaluation of Term work/Report: Formative (40%), Timely completion of
practical (40%) and Attendance / Learning Attitude (20%)

Prerequisite: Computer Basics, Procedural Programming Languages

Note:- IP Syllabus is Design Looking into the Current Market Scenario & Industry Trends. In
Future Contents may be revised based on Industry Requirements.

Course Objective: The course intends to make students learn how to make applications in
HTML & CSS. The course intends to develop expert level skills necessary for becoming
technically skilled personnel.

Course Outcomes: Upon completion of the course students will be able to:

Sr. Course Outcomes Cognitive PO PSO

No. levels of Mapping Mapping
attainment as
per Bloom’s (Write only (Write only
Taxonomy Number/s) Number/s)
1 Understand CLI Basic and shell programming L1, L2 1-6,8-12 1

2 Understand concept of GIT VCS software L1, L2, L3

1-6,8-12 1,2
designed
3 1-6,8-12 1,3
Implement web services using HTML L1, L2, L3
4 Comprehend concepts of application HTML 1-6,8-12 1,2,3
L1, L2
Document Object Model
5 Comprehend concepts of CSS Basic and 1-6,8-12 1,2,3
L1, L2, L3
Framework .
6 Implement Different Types of Hosting L1, L2, 1-6,8-12 1,2,3
L3, L4

19
 Detailed Syllabus:

Cognitive levels
Module Self of attainment as
Topics Hrs.
No. Study per Bloom’s
Taxonomy
1 CLI Basic 05 2
Introduction to Command Line Interface (shell-based, package managers,
L1, L2
containerization, build tools). Running CLI commands for file system
navigation and management, file operations, permissions, shell scripting,
etc.
2 GIT VCS 05 3

Introduction to Version Control, Git basics, Installation and L1, L2, L3

Configuration, Creating a repository, Commiting changes, Branching
and Merging, Resolving Conflicts, Git Branching Workflows.

3 HTML 05 2
Introduction to HTML5, HTML Tags and Elements, Forms, L1, L2, L3
Multimedia, HTML Attributes, Meta Tags, Best Practices and
Optimization
4 DOM 05 2 L1, L2
HTML Document Object Model: The Tree Structure, Semantic HTML,
Accessing and Manipulating Elements, Dynamic Updates, Cross-
Language Integration
5 CSS 05 3 L1, L2, L3
CSS Syntax, Selectors, Properties, The Box Model: Box Shadow,
Gradient, and Transitions. Layout Techniques, Selectors Specificity,
CSS Frameworks: Bootstrap, Tailwind CSS
6 Hosting 05 3 L1, L2, L3, L4
Types of Hosting: VPS, dedicated servers, Cloud. Domain names and
DNS, Web Servers, Deployment Methods, Database Hosting,
Scalability and Load Balancing
Total Hours 30 15

Text /Reference Books:

Sr.
Title Authors Publisher Year
No.
1 HTML and CSS: Design and Build Jon Duckett Wiley, 2011
Websites
2 Learning Web Design: A Beginner's Jennifer Niederst Robbins O'Reilly Media, 2018
Guide to HTML, CSS, JavaScript, and
Web Graphics
3 "HTML5 for Web Designers Jeremy Keith and Rachel Andrew A Book Apart, 2010
4 HTML and CSS: Visual QuickStart Elizabeth Castro Peachpit Press, 2013
Guide
5 HTML & CSS: The Good Parts Ben Henick O'Reilly Media, 2010

6 Head First HTML and CSS Elisabeth Robson and Eric Freeman O'Reilly Media, 2012

20
 Online References:

Sr.
Website Name URL ModulesCovered
No.
1 www.geeksforgeeks.org https://www.geeksforgeeks.org/html/ M1-M5

2 www.w3schools.com https://www.w3schools.com/html/default.asp M3,M4

3 www.w3schools.com https://www.w3schools.com/css/default.asp M5

4 www.hostinger.com https://www.hostinger.com/tutorials/vps M6

21