Dr.

Babasaheb Ambedkar Technological University

B. Tech. (Computer Engineering / Computer Science and

Engineering and Allied) Syllabus
Aligned with New Education Policy 2020
Effective from 2025 - 2026

(Affiliated Colleges)

Department of Computer Engineering

Dr. Babasaheb Ambedkar Technological University, Lonere - 402103
www.cse.dbatu.ac.in

Department of Computer Engineering ​ ​ 1

 Dr. Babasaheb Ambedkar Technological University
Second Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2025 - 2026)
Third Semester

Weekly Examination
Hours Scheme
Course Course
Course Name M E Credit
Category Code
L P CA S S
E E

BSC 24AF2000BS301 Engineering Mathematics-III 3 - 20 20 60 3

PCC1 24AF1245PC302 Data Structures 3 - 20 20 60 3
PCC2 24AF1245PC303 Discrete Mathematics 3 - 20 20 60 3
PCC3 24AF1245PC304 Object-Oriented Programming 2 - 20 20 60 2
Open A)​ Digital Electronics
24AF1245OE305 2 - 20 20 60 2
Elective B)​ Elective from Other Dept.
MDM 24AF1245MD306 Object-Oriented Programming 2 - 20 20 60 2
HSSM 24AF1245AE307 Business Economics 2 - 20 20 60 2
Life of Chhatrapati Shivaji
VEC 24AF1245AE308A 1 - 50 - - 1
Maharaj
PCC Lab 24AF1245PCL309 Data Structures Laboratory - 2 60 - 40 1
VSEC 24AF1VE310 UHV - II 3 - 20 20 60 3
Object-Oriented Programming in
PCC Lab 24AF1245PCL311 1 2 60 - 40 2
JAVA Laboratory
CEP/FP 24AF1245CP312 Seminar - 2 60 - 40 1
PCC Lab 24AF1245L313 Digital Electronics Laboratory - 2 60 - 40 1
Total 22 8 450 160 640 26

Course Type and Acronyms used

1.​ Basic Science Course (BSC) L - Lecture,

2.​ Engineering Science Course (ESC) P / PR - Practical,
3.​ Program Core Course (PCC) CA - Continuous Assessment, TH - Theory,
4.​ Vocational Skill Enhancement Course (VSEC) MSE - Mid Semester Examination,
5.​ Co-curricular Course (CC) ESE - End Semester Examination,
6.​ Ability Enhancement Course (AEC)​ CR - Credit
7.​ Indian Knowledge System (IKS)​

Department of Computer Engineering ​ ​ 2

 Dr. Babasaheb Ambedkar Technological University
Second Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2025 - 2026)
Fourth Semester

Weekly Examination
Course Hours Scheme
Course Code Course Name Credit
Categories
L P CA MSE ESE
PCC1 24AF1245PC401 Design and Analysis of Algorithms 3 - 20 20 60 3
Computer Architecture and
PCC2 24AF1245PC402 3 - 20 20 60 3
Organization
PCC3 24AF1245PC403 Probability and Statistics 3 - 20 20 60 3
HSSM 24AF1245AE404 Operating Systems 3 - 20 20 60 3
1.​ Data Science
Open
24AF1245OE405 2.​ Elective from Other 2 - 20 20 60 2
Elective
Departments
MDM 24AF1245MD406 Data Structures and Algorithms 2 - 20 20 60 2
VSEC 24AF1COIVE407 Constitution of India 2 - 60 - 40 Audit
Life of Bharat Ratna Dr. Babasaheb
VSEC 24AF1000VE408B 1 - 50 - - 1
Ambedkar
Design and Analysis of Algorithms
VSEC 24AF1245S409 - 2 60 - 40 2
Laboratory
Modern Indian Languages
A)​ Marathi
AEC 24AF1000AE410 2 - 20 20 60 2
B)​ Hindi
C)​ Sanskrit
VSEC 24AF1245S411 Full Stack Development 1 2 60 - 40 2
PCC Lab 24AF1245PCL412 Operating Systems Laboratory - 2 60 - 40 1
Total 22 6 430 140 580 24
Exit Requirements for Certificate Program
VSEC 23AF1245VE414 Full Stack Development Project - 16 60 - 40 8

Course Type and Acronyms used

1.​ Basic Science Course (BSC) L - Lecture, TH - Theory,
2.​ Engineering Science Course (ESC) P / PR - Practical,
3.​ Program Core Course (PCC) CA - Continuous Assessment,
4.​ Vocational Skill Enhancement Course (VSEC) MSE - Mid Semester Examination,
5.​ Co-curricular Course (CC) ESE - End Semester Examination,
6.​ Ability Enhancement Course (AEC) CR - Credit.
8.​ Indian Knowledge System (IKS)​

Department of Computer Engineering ​ ​ 3

 Dr. Babasaheb Ambedkar Technological University
Third Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2026 - 2027)
Fifth Semester

Weekly Examination
Course Hours Scheme
Course Name Credit
Code
L P CA MSE ESE

PCC1 Machine Learning 3 - 20 20 60 3

PCC2 Theory of Computations 4 - 20 20 60 4

PCC3 Software Engineering 3 - 20 20 60 3
PCC4 Database Management 3 - 20 20 60 3
Elective I:
PEC A.​ Computer Graphics 3 - 20 20 60 3
B.​ Embedded Systems
MDM AI Ethics 2 - 20 20 60 2
PCC Lab Machine Learning Laboratory - 2 40 - 60 1
PCC Lab Software Engineering Laboratory - 2 40 - 60 1
Database Management System
PCC Lab - 2 40 - 60 1
Laboratory
Total 21

Course Type and Acronyms used

1.​ Basic Science Course (BSC) L - Lecture,

2.​ Engineering Science Course (ESC) P / PR - Practical,
3.​ Program Core Course (PCC) CA - Continuous Assessment, TH - Theory,
4.​ Vocational Skill Enhancement Course (VSEC) MSE - Mid Semester Examination,
5.​ Co-curricular Course (CC) ESE - End Semester Examination,
6.​ Ability Enhancement Course (AEC)​ CR - Credit
7.​ Indian Knowledge System (IKS)​

Department of Computer Engineering ​ ​ 4

 Dr. Babasaheb Ambedkar Technological University
Third Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2026 - 2027)
Sixth Semester

Weekly Examination
Course Hours Scheme
Course Name Credit
Code
L P CA MSE ESE
PCC1 Compiler Design 3 - 20 20 60 3
PCC2 Computer Networks 3 - 20 20 60 3
Elective II:
PEC A.​ Internet of Things 3 - 20 20 60 3
B.​ Advanced Algorithms
Elective III:
PEC A.​ Distributed Systems 3 - 20 20 60 3
B.​ Big Data Analytics
Open Elective I:
A.​ Human Computer Interaction
OE 3 - 20 20 60 3
B.​ Object Oriented Analysis and
Design
ICT for Sustainable Development
MDM 2 - 40 - 60 2
(ICT4SD)
PCC Lab Compiler Design Laboratory - 2 40 - 60 1
PCC Lab Computer Networks Laboratory - 2 40 - 60 1
VSEC Mini Project - 4 40 - 60 2
Total 16 12 460 100 540 21
Exit Requirements for Certificate program (any two courses from following courses)
A Data Analysis Project 16 60 - 40 8

Department of Computer Engineering ​ ​ 5

 Dr. Babasaheb Ambedkar Technological University
Fourth Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2027 - 2028)
Seventh Semester

Weekly Examination
Course Hours Scheme
Course Name Credit
Code
L P CA MSE ESE

PCC1 Artificial Intelligence 3 - 20 20 60 3

PCC2 Cloud Computing 3 - 20 20 60 3
Elective IV:
A.​ Natural Language Processing
PEC 2 - 20 20 60 2
B.​ Research Methodology
C.​ Software Testing
MDM Deep Learning 2 - 20 20 60 2
Internship /
Project Phase - I - 24 60 - 40 12
OJT
Total 22

Course Type and Acronyms used

1.​ Basic Science Course (BSC) L - Lecture,

2.​ Engineering Science Course (ESC) P / PR - Practical,
3.​ Program Core Course (PCC) CA - Continuous Assessment, TH - Theory,
4.​ Vocational Skill Enhancement Course (VSEC) MSE - Mid Semester Examination,
5.​ Co-curricular Course (CC) ESE - End Semester Examination,
6.​ Ability Enhancement Course (AEC)​ CR - Credit
7.​ Indian Knowledge System (IKS)​

Department of Computer Engineering ​ ​ 6

 Dr. Babasaheb Ambedkar Technological University
Fourth Year in B.Tech in Computer Engineering and Allied Programs
Course Curriculum Aligned with New Education Policy 2020
(Effective from Academic Year 2027 - 2028)
Eighth Semester

Weekly Examination
Course Code Course Name Hours Scheme Credit
L P CA MSE ESE
PCC1 Software Architecture 3 - 20 20 60 3
PCC2 Cryptography and Network Security 3 - 20 20 60 3
Elective V:
A.​ Blockchain Technology
PEC 3 - 20 20 60 3
B.​ Virtual Reality
C.​ Social Network Analysis
MDM System Administration 2 - 40 - 60 2
Open Elective Information Theory & Coding 3 2 20 20 60 4
Entrepreneurship
/ Economics / Intellectual Property Rights 2 - 40 - 60 2
Management
VSEC Foreign Language Studies - 2 40 - 60 1
AEC Project Phase - II - 4 40 - 60 2
Total 16 12 460 100 540 22

Department of Computer Engineering ​ ​ 7

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Engineering Mathematics - III Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60

COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction, Vectors in Rn, Vector Addition and Scalar Multiplication, Dot 05 Hrs
(Inner) Product, Located Vectors, Hyperplanes, Lines, Curves in Rn, Vectors in
R3 (Spatial Vectors), ijk Notation, Complex Numbers, Vectors in Cn.

2 Introduction, Matrix Addition and Scalar Multiplication, Summation Symbol, 06 Hrs

Matrix Multiplication, Transpose of a Matrix, Square Matrices, Powers of
Matrices, Polynomials in Matrices, Invertible (Nonsingular) Matrices, Special
Types of Square Matrices, Complex Matrices, Block Matrices.

3 Introduction, Basic Definitions, Solutions, Equivalent Systems, Elementary 07 Hrs

Operations, Small Square Systems of Linear Equations, Systems in Triangular
and Echelon Forms, Gaussian Elimination, Echelon Matrices, Row Canonical
Form, Row Equivalence, Gaussian Elimination, Matrix Formulation, Matrix
Equation of System of Linear Equations, Systems of Linear Equations and
Linear Combinations of Vectors, Homogeneous Systems of Linear Equations,
Elementary Matrices, LU Decomposition. Applications: Linear Programming,
Fourier series: Linear Algebra for Functions, Computer Graphics, Linear
Algebra for Cryptography.

4 Determinants: Introduction, Determinants of Orders 1 and 2, Determinants of 07 Hrs

Order 3, Permutations, Determinants of Arbitrary Order, Properties of
Determinants, Minors and Cofactors, Evaluation of Determinants, Classical
Adjoint, Applications to Linear Equations, Cramer‘s Rule, Submatrices, Minors,
Principal Minors, Block Matrices and Determinants, Determinants and Volume,
Determinant of a Linear Operator, Multilinearity and Determinants.

5 Diagonalization Introduction, Polynomials of Matrices, Characteristic 07 Hrs

Polynomial, Cayley–Hamilton Theorem, Diagonalization, Eigenvalues and
Eigenvectors, Computing Eigenvalues and Eigenvectors, Diagonalizing
Matrices, Diagonalizing Real Symmetric Matrices and Quadratic Forms,
Minimal Polynomial, Characteristic and Minimal Polynomials of Block
Matrices. Applications: Graphs and Networks, Matrices in Engineering, Markov
Matrices, Population, and Economics.

Text Books:
1.​ Linear Algebra, Seymour Lipschutz, Schaum's outlines, 4th Edition,
McGraw-Hill Publication.

Department of Computer Engineering ​ ​ 8

 Dr. Babasaheb Ambedkar Technological University

Reference Books:
1.​ Introduction to Linear Algebra, Gilbert Strang, 5th Edition, Wellesley -
Cambridge Press.
2.​ K. Hoffman and R. Kunze, Linear Algebra, 2nd Edition, Prentice-Hall of
India, 2005.
3.​ M. Artin, Algebra, Prentice-Hall of India, 2005.

Department of Computer Engineering ​ ​ 9

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Data Structures Scheme

TH 3 Course Objectives: CA 20
1.​
PR - 2.​ MSE 20

CR 3 ESE 60

COURSE CONTENT

Unit
Topic Hours
No.

1 Data, Data types, Data structure, Abstract Data Type (ADT), representation of 06 Hrs
Information, characteristics of algorithm, program, analyzing programs. Arrays
and Hash Tables: Concept of sequential organization, linear and non-linear data
structures, storage representation, array processing, sparse matrices, transpose of
sparse matrices, Hash Tables, Direct address tables, Hash tables, Hash functions,
Open addressing, Perfect hashing.
2 Stacks and Queues: Introduction, stack and queue as ADT, representation and 06 Hrs
implementation of stack and queue using sequential and linked allocation,
Circular queue and its implementation, Application of stack for expression
evaluation and expression conversion, recursion, priority queue.

3 Linked Lists: Concept of linked organization, singly and doubly linked list, and 06 Hrs
dynamic storage management, circular linked list, operations such as insertion,
deletion, concatenation, traversal of linked list, dynamic memory management,
garbage collection.

4 Trees and Graphs: Basic terminology, binary trees and their representation, 07 Hrs
insertion and deletion of nodes in binary trees, binary search tree and its
traversal, threaded binary tree, Heap, Balanced Trees, Terminology and
representation of graphs using adjacency matrix, Warshall’s algorithm.

5 Searching and Sorting: Sequential, binary searching, skip lists – dictionaries, 07 Hrs
linear list representation, skip list representation, operations – insertion, deletion,
and searching. Insertion sort, selection sort, radix sort, and File handling.

Reference Books:
1.​ Horowitz and Sahani, Fundamentals of Data Structures, Universities
Press, 2nd Edition, 2008.
2.​ Thomas Cormen, Introduction to Algorithms, PHI Publication, 2nd
Edition, 2002.
3.​ Venkatesan & Rose, Data Structures, Wiley Publication, 1st Edition,
2015.
4.​ Goodrich & Tamassia, Data Structure & Algorithm in C++, Wiley
Publication, 2nd Edition, 2011.

Department of Computer Engineering ​ ​ 10

 Dr. Babasaheb Ambedkar Technological University

5.​ R. G. Dromey, How to Solve it by Computer, 2nd Impression, Pearson

Education.
6.​ Kyle Loudon, Mastering Algorithms with C: Useful Techniques from
Sorting to Encryption, O'Reilly Media, 1st Edition, 1999.

Text Books:
1.​ Mark Allen Weiss, Data structures and algorithms analysis in C++,
Pearson Education, 4th Edition, 2013.
2.​ S. Lipschutz, Data Structures, McGraw-Hill Publication, Revised 1st
Edition, 2014.
3.​ Y. Langsm, M. Augenstin, A. Tanenbaum, Data Structure using C and
C++, Prentice Hall India Learning Private Limited, 2nd Edition, 1998.
4.​ Trembley and Sorenson, Introduction to Data Structures, PHI
Publication, 2nd Revised Edition, 1983.
5.​ Vishal Goyal, Lalit Goyal, A Simplified Approach To Data Structure,
SPD Publication, 1st Edition, 2014.

Department of Computer Engineering ​ ​ 11

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Discrete Mathematics Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to Propositional Logic: Propositions, truth values, Truth tables 09 Hrs

for operators, Truth Tables of Compound Propositions, Precedence of Logical
Operators. Propositional Equivalences: Logical Equivalences, Constructing
New Logical Equivalences, Normal Forms.
Predicates and Quantifiers: Predicates, Quantifiers: Universal and Existential,
Quantifiers with Restricted Domains, Precedence of Quantifiers, Binding
Variables, Logical Equivalences Involving Quantifiers, Negating Quantified
Expressions, Translating from English into Logical Expressions, Examples from
Lewis Carroll, Nested Quantifiers: Understanding Statements Involving Nested
Quantifiers, The Order of Quantifiers, Negating Nested Quantifiers.
Rules of Inference: Valid Arguments in Propositional Logic, Rules of Inference
for Propositional Logic, Using Rules of Inference to Build Arguments,
Resolution, Fallacies.

2 Basic notions in set Theory: Sets, Venn Diagrams, Subsets, The Size of a Set, 09 Hrs
Power Sets, Cartesian Products, Set operations, Set Identities, Generalized
Unions and Intersections, Cardinality of Sets.
Functions: Introduction, Subjective, Injective, Bijective, inverse functions,
Composition of functions.
Relations: Relations and Their Properties, n-ary Relations and Their
Applications, Representing Relations, Closures of Relations, Equivalence
Relations, Equivalence classes and partitions, Partial Ordering, Hasse Diagram,
Topological Sort.

3 Combinatorics: Applications of Recurrence Relations, Solving Linear 07 Hrs

Recurrence Relations.

4 Graph: Some Special Simple Graphs, Bipartite Graphs, New Graphs from Old, 07 Hrs
Shortest path problems, Euler and Hamiltonian paths, Isomorphic graphs, Planar
graphs, Connectivity, Matching Coloring.
Trees: Prefix Codes, Huffman coding, Spanning trees and cut sets, Minimal
spanning trees, Kruskal‘s and Prim‘s algorithms for minimal spanning trees.

5 Algebraic Structures and Morphism: Algebraic Structures with one Binary 05 Hrs
Operation, Semi Groups, Monoids, Groups, Congruence Relation and Quotient
Structures, Free and Cyclic Monoids and Groups, Permutation Groups,
Substructures, Normal Subgroups, Algebraic Structures with two Binary
Operation, Rings, Integral Domain and Fields, Boolean Algebra and Boolean
Ring.

Department of Computer Engineering ​ ​ 12

 Dr. Babasaheb Ambedkar Technological University

Text Books:
1.​ C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill Publication,
3rd Edition, 2008.

Reference Books:
1.​ Lipschutz, Discrete Mathematics, McGraw-Hill Publication, 3rd Edition,
2009.
2.​ V. K. Balakrishnan, Schaum's Outline of Graph Theory, McGraw-Hill
Publication, 1st Edition, 1997.
3.​ Eric Gossett, Discrete Mathematics with Proof, Wiley Publication, 2nd
Edition, 2009.
4.​ Kenneth H. Rosen, Discrete Mathematics and its Applications,
McGraw-Hill Publication, 6th Edition, 2010.
5.​ Y. N. Singh, Discrete Mathematical Structures, Wiley Publication, 1st
Edition, 2010.
6.​ Dr. Sukhendu Dey, Graph Theory with Applications, SPD Publication, 1st
Edition, 2012.

Department of Computer Engineering ​ ​ 13

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Object-Oriented Programming Scheme

TH 2 Course Objectives: CA 20
1.​ To explain the fundamental properties of C++.
PR - 2.​ To describe the usefulness of basic OO abstractions like class, MSE 20

CR 2 Methods, and Interfaces. ESE 60

3.​ To apply code reuse techniques through inheritance.
4.​ To apply design OO libraries for designing UI and other
programmatic features.
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to Java Applications: Introduction, Java Class Libraries, Typical 07 Hrs

Java Development Environment, Memory Concepts, Arithmetic.
Introduction to Classes and Objects: Introduction, Classes, Objects, Methods and
Instance Variables, Declaring a Class with a Method and Instantiating an Object
of a Class, Declaring a Method, Instance variables, set Methods and get
Methods, Primitive Types vs. Reference type double Types, Initializing Objects
with Constructors, floating point numbers.

2 Control Statements: Control structures if single-selection statement, if….else 07 Hrs

double-selection statement, while repetition statement, do….while repetition
statement, switch multi-selection statement, break and continue statements,
logical operators. Methods: Introduction, Program modules in Java, static
methods, static Fields and Class Math, declaring methods with multiple
parameters, scope of declaration, method overloading, and Java API packages.

3 Arrays: Arrays, declaring and creating arrays in Java, examples using arrays, 07 Hrs
passing arrays to methods, multidimensional arrays, variable-length argument
lists, using command-line arguments.

4 Inheritance and Polymorphism in Java: Inheritance: Super classes and 07 Hrs

Subclasses, protected members, relationship between super classes and
subclasses, constructors in subclasses, object class. Polymorphism: Abstract
classes and methods, final methods and classes, polymorphism examples, and
Interfaces.

5 Exception-handling and JavaScript: Exception-handling overview, handling 07 Hrs

Arithmetic Exceptions and Input Mismatch Exceptions, when to use exception
handling, Java exception hierarchy, finally block. Introduction to Java Applets.
JavaScript: Introduction to client-side scripting, Syntax basics, Operators,
Comparisons, Statements, Loops, Events, Objects, and user-defined functions,
Validations using object functions, Validations using regular expressions, JS
document object model, popovers, windows

Department of Computer Engineering ​ ​ 14

 Dr. Babasaheb Ambedkar Technological University

Text Books:
1.​ Paul Deitel and Harvey Detail, Java: How to Program, Pearson's
Publication, 9th Edition.

Reference Books:
1.​ Joel Murach and Michael Urban, Murach’s Beginning Java with Eclipse,
Murach's Publication, 1st Edition, 2016. Doug Lowe, Java All-in-One
For Dummies, Wiley Publication, 4th Edition,2014.
2.​ Herbert Schildt, Java The Complete Reference, McGraw-Hill
Publication, 9th Edition.
3.​ Patrick Niemeyer, Daniel Leuck, Learning Java, O'Reilly Media, 4th
Edition, 2013.
4.​ JavaScript: The Good Parts‖, Douglas Crockford, O‘Reilly, ISBN:
9782744055973.

Department of Computer Engineering ​ ​ 15

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Digital Electronics Scheme

TH 2 Course Objectives: CA 20
1.​ To acquaint the students with the fundamental principles of
PR - two-valued logic and various devices to implement logical MSE 20

CR 2 operations on variables. ESE 60

2.​ To lay the foundation for further studies in areas such as
communication, VHDL, and computer.
3.​ Understand the principles of asynchronous counters and design
them to meet specific counting requirements.
4.​ Solve real-world problems related to arithmetic operations,
code conversion, counter applications, and other digital logic
scenarios.
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction: Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and 07 Hrs
Exclusive-OR operations, Boolean algebra, examples of IC gates.

2 Number Systems: binary, signed binary, octal hexadecimal number, binary 07 Hrs
arithmetic, one‘s and two‘s complements arithmetic, codes, error detecting and
correcting codes

3 Combinational Logic Design: Standard representations for logic functions, k map 07 hrs
representation of logic functions (SOP and POS forms), minimization of logical
functions for min-terms and max-terms (upto four variables), don’t care conditions

4 Design Examples: Arithmetic Circuits, BCD-to-7 segment decoder, Code 07 Hrs

converters. Adders and their use as subtractors, look ahead carry, ALU, Digital
Comparator, Parity generators/checkers, Design of Multiplexers and
Demultiplexers, and Decoders.

5 Sequential Circuits and Systems: 1-bit memory, the circuit properties of Bistable 07 Hrs
latch, the clocked SR flip flop, J-K-T, and D-types flip flops, applications of flip
flops, shift registers, applications of shift registers, serial to parallel converter,
parallel to serial converter, ring counter, sequence generator, ripple (Asynchronous)
counters, synchronous counters, counters design using flip flops, a special counter
IC‘s, asynchronous sequential counters, applications of counters.

Text/Reference Books:
1.​ R. P. Jain, Modern Digital Electronics, McGraw Hill Education, 2009.
2.​ M. Morris Mano, Digital Logic and Computer Design 4th edition, Prentice
Hall of India, 2013.
3.​ Anand Kumar, Fundamentals of digital circuits 1st edition, Prentice Hall of
India, 2001.
Department of Computer Engineering ​ ​ 16
 Dr. Babasaheb Ambedkar Technological University

4.​ Pedroni V.A., Digital Circuit Design with VHDL, Prentice Hall India, 2nd
Edition, 2001.

Department of Computer Engineering ​ ​ 17

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Business Economics Scheme

TH 2 Course Objectives: CA 20
1.​ .
PR - MSE 20

CR 2 ESE 60

COURSE CONTENT
Unit
Topic Hours
No.
1 Nature and scope of Business Economics; Microeconomics vs. 03 Hrs
Macroeconomics; Basic concepts: scarcity, choice, opportunity cost;
Economic systems: capitalism, socialism, mixed economy; Role of
economists in business decision-making; Law of demand and supply:
determinants and graphical representation; Elasticity: price, income, and cross
elasticity of demand.

2 Consumer Behavior and Demand Forecasting: Cardinal and ordinal utility 04 Hrs
approaches; Law of diminishing marginal utility; Indifference curve analysis
and consumer equilibrium; Budget constraint and consumer choice; Demand
estimation techniques; Objectives and methods of demand forecasting;
Factors influencing demand forecasting in business.

3 Production, Cost, and Revenue Analysis: Factors of production; Laws of 03 Hrs

production: Law of variable proportions and Returns to Scale; Isoquants and
producer equilibrium; Cost concepts: fixed, variable, total, marginal, average;
Short-run and long-run cost curves; Revenue analysis: Total, Average, and
Marginal Revenue; Break-even analysis and cost-volume-profit analysis.

4 Market Structures and Pricing Practices: Market structures: perfect 03 Hrs

competition, monopoly, monopolistic competition, oligopoly; Price and
output determination under different market forms; Pricing strategies:
cost-plus pricing, penetration pricing, price skimming; Price discrimination;
Game theory basics and strategic behavior in oligopoly; Kinked demand
curve theory; Government regulation of markets and anti-trust policies

5 Macroeconomic Environment and Business Decisions: National income: 03 Hrs

concepts, methods of measurement; Business cycles: phases, features, and
causes; Inflation and deflation: causes, consequences, and control measures;
Monetary and fiscal policy: tools and impact on business; Balance of
payments and exchange rates; Globalization and its impact on business;
Economic indicators and business forecasting

Department of Computer Engineering ​ ​ 18

 Dr. Babasaheb Ambedkar Technological University

Text/Reference Books:
1.​ R. Paneerselvam, Engineering Economics, PHI publication.
2.​ Robbins S.P. and Decenzo David A., Fundamentals of Management:
Essential Concepts and Applications, Pearson Education.
3.​ L. M. Prasad, Principles and Practices of Management.
4.​ K. K. Dewett & M. H. Navalur, Modern Economic Theory, S. Chand
Publications

Department of Computer Engineering ​ ​ 19

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Life of Chhatrapati Shivaji Maharaj Scheme

TH 1 Course Objectives: CA 50

PR - MSE -

CR 1 ESE -
COURSE CONTENT
Unit
Topic Hours
No.

1 Shivaji Maharaj as a Great Conqueror, Master Strategist and innovator in 05 Hrs

Military Tactics Guerrilla Warfare (Ganimi Kava), Fortress Strategy, Avoidance
of Direct Confrontation, Diplomacy and Alliances, Naval Power.

2 Shivaji Maharaj's Management and leadership strategies, Architecture and 05 Hrs

metallurgy of Raigad Fort, Use of Light Cavalry, Intelligence Network,
Asymmetric Warfare, Logistics and Supply Chains, Fortifications and Military
Architecture

3 Shivaji Maharaj’s views about Women's rights, their dignity and religious views. 05 Hrs
His views on Democracy & Nationalism

Department of Computer Engineering ​ ​ 20

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Data Structures Laboratory Scheme

TH - Course Objectives: CA 60

PR 2 MSE –

CR 1 ESE 40

List of Experiments:

1.​ Write a program to implement a stack using arrays.

2.​ Write a program to evaluate a given postfix expression using stacks.
3.​ Write a program to convert a given infix expression to postfix form using stacks.
4.​ Write a program to implement a circular queue using arrays.
5.​ Write a program to implement double ended queue (dequeue) using arrays.
6.​ Write a program to implement a stack using two queues such that the push operation runs in constant
time and the pop operation runs in linear time.
7.​ Write a program to implement a stack using two queues such that the push operation runs in linear
time and the pop operation runs in constant time.
8.​ Write a program to implement a queue using two stacks such that dequeue operation runs in constant
time and dequeue operation runs in linear time.
9.​ Write programs to implement the following data structures: (a) Single linked list, (b) Double linked
list, (c) Circular linked list
10.​Write a program to implement a stack using a linked list such that the push and pop operations of the
stack still take O (1) time.
11.​Write a program to create a binary search tree (BST) by considering the keys in given order and
perform the following operations on it. (a) Minimum key (b), Maximum key, (c) Search for a given
key, (d) Find predecessor of a node, (e) Find successor of a node, (f) Delete a node with given key.
12.​Write a program to implement hashing with (a) Separate Chaining and (b) Open addressing methods.
13.​Implement the following sorting algorithms: (a) Insertion sort, (b) Merge sort, (c) Quick sort, (d)
Heap sort.
14.​Write programs for the implementation of graph traversals by applying: (a) BFS, (b) DFS.

Department of Computer Engineering ​ ​ 21

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Universal Human Values - II Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to Value Education: Understanding Value Education, 05 Hrs

Self-exploration as the Process for Value 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: Understanding Human being as the Co-existence 05 Hrs
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: Harmony in the Family, the Basic Unit of 04 Hrs
Human Interaction, Values in Human-to-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): Understanding Harmony in the Nature, 05 Hrs

Interconnectedness, self-regulation and Mutual Fulfillment among the Four
Orders of Nature, Realizing Existence as Co-existence at All Levels, The
Holistic Perception of Harmony in Existence.

5 Implications of the Holistic Understanding – a Look at Professional Ethics: 05 Hrs

Natural Acceptance of Human Values, Definitiveness of (Ethical) Human
Conduct, A Basis for Humanistic Education, Humanistic Constitution and
Universal Human Order, Competence in Professional Ethics- Holistic
Technologies, Production Systems and Management Models-Typical Case
Studies, Strategies for Transition towards Value-based Life and Profession

Text Books:
1.​ A Foundation Course in Human Values and Professional Ethics, R R
Gaur, R Asthana, G P Bagaria, 2nd Revised Edition, Excel Books, New
Delhi, 2019. ISBN 978-93-87034-47-1.

Reference Books:
1.​ Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan,
Amarkantak, 1999.
2.​ Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi,
2004.

Department of Computer Engineering ​ ​ 22

 Dr. Babasaheb Ambedkar Technological University

3.​ The Story of Stuff (Book).

4.​ The Story of My Experiments with Truth - by Mohandas Karamchand
Gandhi
5.​ Small is Beautiful - E. F Schumacher.
6.​ Slow is Beautiful - Cecile Andrews
7.​ Economy of Permanence - J C Kumarappa
8.​ Bharat Mein Angreji Raj - Pandit Sunderlal
9.​ Rediscovering India - by Dharampal
10.​Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11.​India Wins Freedom - Maulana Abdul Kalam Azad
12.​Vivekananda - Romain Rolland (English)
13.​Gandhi - Romain Rolland (English)

Department of Computer Engineering ​ ​ 23

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Object-Oriented Programming in Java Laboratory Scheme

TH 1 Course Objectives: CA 60

PR 2 MSE –

CR 1 ESE 40

List of Experiments:

1.​ Programs on Operators, Arithmetic Promotion, and Method Calling.

2.​ Programs on Classes: String and Math.
3.​ Write a program to demonstrate the following Function concepts
i. Function overloading
ii. Constructors of all types
iii. Default parameters, returning by reference
4.​ Programs on dealing with Arrays.
5.​ Programs on Classes: String and Math.
6.​ Programs on Inheritance and Polymorphism.
7.​ Programs on Garbage collection, packaging, access Modifiers, as well as static and abstract
modifiers.
8.​ Programs on Interfaces, block initializers, final Modifier, as well as static and dynamic binding.
9.​ Programs on Exception Handling.
10.​Write a Java program that illustrates the following
a) Creation of a simple package.
b) Accessing a package.
c) Implementing interfaces.
11.​Read and write text files using FileReader, FileWriter, and BufferedReader. Count the number of
lines, words, and characters in a file.
12.​Create a simple GUI using JFrame, JButton, JLabel, and JTextField. Handle user events using action
listeners.
13.​Demonstrate usage of List, Set, and Map. Iterate using an enhanced for-loop and an Iterator.

Department of Computer Engineering ​ ​ 24

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Seminar Scheme

TH - Course Objectives: CA 60

PR 2 MSE –

CR 1 ESE 40

Guidelines:

1.​ Choose a topic related to your course, recent technological advancement, or emerging research
area.
2.​ Select a topic that genuinely interests you so that you can invest time and effort in understanding
and presenting it.
3.​ Avoid selecting overly common or outdated topics. Instead, try to find a niche or unexplored
aspect of a broader subject.
4.​ Ensure availability of sufficient resources such as research papers, technical documentation,
books, and online references.
5.​ The selected topic must be approved by the seminar guide or course coordinator before
proceeding further.
6.​ Seminar Report Writing in LaTeX
7.​ Presentation Guidelines:
●​ Use 12–15 slides for a 10–15 minute presentation.
●​ Maintain clarity and visual appeal: minimal text, use diagrams and bullet points.
●​ Be prepared for a brief Q&A session after your presentation.

Department of Computer Engineering ​ ​ 25

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Digital Electronics Laboratory Scheme

TH - Course Objectives: CA 60

PR 2 MSE –

CR 1 ESE 40

Guidelines:

1.​ Study of gates – AND; OR; NOT; NAND; NOR; EX-OR; EX-NOR
2.​ Verification of Boolean Theorems using basic gates.
3.​ Design a circuit to convert a binary number to its two's complement representation.
4.​ Design and realize a given function using K-maps and verify its performance.
5.​ Verify
a.​ Demorgan’s Theorem for 2 variables.
b.​ The sum-of product and product-of-sum expressions using universal gates.
6.​ Design and implement
a.​ Full Adder using basic logic gates.
b.​ Full subtractor using basic logic gates.
7.​ Implementation of 4x1 multiplexer using Logic Gates.
8.​ To verify the truth tables of S-R; J-K; T and D type flip flops.
9.​ Design, and Verify the 4- Bit Synchronous Counter.
10.​Design, and Verify the 4-Bit Asynchronous Counter.
11.​Design and implementation of a simple digital system (Mini Project).

Department of Computer Engineering ​ ​ 26

 Dr. Babasaheb Ambedkar Technological University

Semester - IV

Department of Computer Engineering ​ ​ 27

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Design and Analysis of Algorithms Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to Algorithms: Definition, Properties of Algorithms, Expressing 07 Hrs

Algorithm, Flowchart, Algorithm Design Techniques, Performance Analysis of
Algorithms, Types of Algorithm's Analysis, Order of Growth, Asymptotic
Notations, Recursion, Recurrences Relation, Substitution Method, Iterative
Method, Recursion Tree, Master Theorem, Changing Variable, Heap Sort.

2 Divide and Conquer: Introduction, Binary Search, Merge Sort, Quick Sort, 07 Hrs
Strassen‘s Matrix Multiplication.

3 Backtracking: Backtracking Concept, N–Queens Problem, Four–Queens 07 Hrs

Problem, Eight–Queen Problem, Hamiltonian Cycle, Sum of Subsets Problem,
Graph Coloring Problem, Branch and Bound: Introduction, Traveling
Salesperson Problem, 15-Puzzle Problem, Comparisons between Backtracking
and Branch and Bound.

4 Greedy Algorithms: Introduction to Greedy Technique, Greedy Method, 07 Hrs

Optimal Merge Patterns, Huffman Coding, Knapsack Problem, Activity
Selection Problem, Job Sequencing with Deadline, Minimum Spanning Tree,
Single-Source Shortest Path Algorithm.

5 Dynamic Programming: Introduction, Characteristics of Dynamic 07 Hrs

Programming, Component of Dynamic Programming, Comparison of
Divide-and-Conquer and Dynamic Programming Techniques, Longest Common
Subsequence, matrix multiplication, shortest paths: Bellman Ford, Floyd
Warshall, Application of Dynamic Programming.
NP Completeness: Introduction, the Complexity Class P, the Complexity Class
NP, Polynomial-Time Reduction, the Complexity Class NP-Complete.

Text Books:
1.​ T. Cormen, Introduction to Algorithms, PHI Publication, 4th Edition,
2022.

Reference Books:
1.​ Aho, Ullman, Data Structure and Algorithms, Addison-Wesley
Publication, 1st Edition, 1983.
2.​ Michel Goodrich, Roberto Tamassia, Algorithm Design – Foundation,
Analysis & Internet Examples, Wiley Publication, 2nd Edition,2006.
3.​ George T. Heineman, Gary Pollice, Stanley Selkow, Algorithms in a
Nutshell, A Practical Guide, O'Reilly Media, 2nd Edition, 2016.

Department of Computer Engineering ​ ​ 28

 Dr. Babasaheb Ambedkar Technological University

4.​ Ellise Horowitz, Sartaj Sahni, S. Rajasekaran, Fundamentals of

Computer Algorithms, University Press (India) Private Ltd, 2nd Edition,
2008.
5.​ Sara Base, Computer algorithms: Introduction to Design and Analysis,
Addison-Wesley Publication, 2nd Edition, 1988.

Department of Computer Engineering ​ ​ 29

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Computer Architecture and Organization Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60

COURSE CONTENT

Unit
Topic Hours
No.

1 Introduction: Concept of computer organization and architecture, Fundamental 07 Hrs

unit, Computer function and interconnection, CPU structure and function.

2 Instruction Sets: Characteristics, Types of operands, Types of operations, 07 Hrs

Assembly language, Addressing modes, Instruction format, Types of instruction,
Instruction execution, Machine state and processor status, Structure of program,
Introduction to RISC and CISC architecture.

3 Computer Arithmetic: The arithmetic and logic Unit, Integer representation, 08 Hrs
Integer arithmetic, Floating point representation, Floating point arithmetic,
Introduction of arithmetic co-processor.

4 Memory Organization 08 Hrs

Internal Memory: Semiconductor main memory, Error correction, Advanced
DRAM organization, Virtual memory systems and cache memory systems.
External Memory: Organization and characteristics of magnetic disk, Magnetic
tape, Optical memory, RAID, Memory controllers.

5 Control Unit and Input / Output Organization 08 Hrs

Control Unit Operation: Micro-operations, Control of the processor,
Hardwired implementation, Micro-programmed Control Unit, Basic concepts,
Microinstruction sequencing, Microinstruction execution, Applications of
micro-programming.
Input / Output Organization: External devices, I/O module, Programmed I/O,
Interrupt driven I/O, Direct memory access, I/O channels and processors,
External interface.
Instruction Pipe-lining and Parallel processing: Multiple processor
organization, Symmetric multiprocessor, Cache coherence and the MESI
protocol.

Text Books:
1.​ William Stalling, Computer Organization and Architecture: Designing
for Performance, Prentice Hall Publication, 8th Edition, 2009.

Reference Books:
1.​ Hayes, Computer Architecture and Organization, McGraw-Hill
Publication, 3rd Edition, 2012.

Department of Computer Engineering ​ ​ 30

 Dr. Babasaheb Ambedkar Technological University

2.​ Zaky, Computer Organization, McGraw-Hill Publication, 5th Edition,

2011.
3.​ Hennessy and Patterson, Computer Architecture: A Quantitative
Approach, Morgan and Kaufmann Publication, 4th Edition, 2007.
4.​ Morris Mano, Computer System Architecture, Pearson Education India,
3rd Edition, 2007.
5.​ Mostafa Abd-El-Barr, Hesham El-Rewini, Fundamentals of Computer
Organization and Architecture, Wiley Publication, 1st Edition, 2004.
6.​ Miles J. Murdocca, Vincent P. Heuring, Computer Architecture and
Organization: An Integrated Approach, Wiley Publication, 1st Edition,
2007.
7.​ Sajjan G. Shiva, Computer Organization: Design, and Architecture, CRC
Press, 5th Edition, 2013.

Department of Computer Engineering ​ ​ 31

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Probability and Statistics Scheme

TH 3 Course Objectives: CA 20
1.​ To explain basic concepts in statistics and probability.
PR - 2.​ To describe various probabilistic distributions. MSE 20

CR 3 3.​ To apply regression and correlation techniques. ESE 60

COURSE CONTENT

Unit
Topic Hours
No.

1 Probability Theory​ Definition of probability: classical, empirical, and 10 Hrs

axiomatic approach of probability, Addition theorem of probability,
Multiplication theorem of probability, Bayes’ theorem of inverse probability,
Properties of probabilities with proofs, Examples.

2 Random Variable and Mathematical Expectation: Random variables, 06 Hrs

Probability distributions, Probability mass function, Probability density function,
Mathematical expectation, Join and marginal probability distributions, Properties
of expectation and variance with proofs.

3 Theoretical Probability Distributions: Binomial distribution, Poisson 10 Hrs

distribution, Normal distribution, Fitting of binomial distributions, Properties of
binomial, Poisson, and normal distributions, Relation between binomial and
normal distributions, Relation between Poisson and normal distributions,
Importance of normal distribution, Examples.

4 Correlation: Introduction, Types of correlation, Correlation and causation, 06 Hrs

Methods of studying correlation, Karl Pearson's correlation coefficient,
Spearman’s rank correlation, Coefficient, Properties of Karl Pearson's correlation
coefficient and Spearman’s rank correlation coefficient, Probable errors.

5 Linear Regression Analysis: Introduction, Linear and non-linear regression, 06 Hrs

Lines of regression, Derivation of regression lines of y on x and x on y, Angle
between the regression lines, Coefficients of regression, Theorems on regression
coefficient, Properties of regression coefficient.

Text Books:
1.​ S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House, 7th
Revised and Enlarged Edition, 2016.
2.​ G. V. Kumbhojkar; Probability and Random Processes, C. Jamnadas and
Co., 14th Edition, 2010.
3.​ Erwin​ Kreyszig, Advanced Engineering Mathematics, 9th Edition, John
Wiley​ & Sons, 2006.

Department of Computer Engineering ​ ​ 32

 Dr. Babasaheb Ambedkar Technological University

4.​ Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi,

2010.
5.​ G. Haribaskaran; Probability, Queuing Theory and Reliability
Engineering, Laxmi Publications, 2nd Edition, 2009.
6.​ Murray Spiegel, John Schiller, R. ALU Srinivasan, Probability And
Statistics, Schaum's Outlines, 4th Edition, 2013.

Department of Computer Engineering ​ ​ 33

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Operating Systems Scheme

TH 3 Course Objectives: CA 20

PR - MSE 20

CR 3 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction and Operating System Structures: Definition, Types of 06 Hrs

Operating system, Real-Time operating system, System Components: System
Services, Systems Calls, System Programs, System structure, Virtual Machines,
System Design and Implementation, System Generations.

2 Processes and CPU Scheduling: Process Concept, Process Scheduling, 06 Hrs

Operation on process, Inter-process Communication, Cooperating processes,
Threads, Multithreading model, Scheduling criteria, Scheduling Algorithms,
Thread Scheduling, Multiple-Processor Scheduling, Scheduling Algorithms
evaluation.

3 Process Synchronization: The critical-section problem, Critical regions, 06 Hrs

Peterson‘s Solution, Synchronization Hardware, Semaphores, Classical
Problems of synchronization, and Monitors Deadlocks: Systems Model,
Deadlock characterization, Methods for handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock,
Combined approach to deadlock Handling.

4 Memory Management: Basic concept, Logical and Physical address map, 06 Hrs
Memory allocation: Continuous Memory Allocation, Fixed and variable
partition, Internal and external fragmentation and compaction, Paging: Principle
of operation, Page allocation – Hardware support for paging, Protection and
sharing, Disadvantages of paging; Segmentation. Virtual Memory: Basics of
Virtual Memory – Hardware and control structures – Locality of reference, Page
fault, Working Set, Dirty page / Dirty bit – Demand paging, Page Replacement
algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not
recently used (NRU) and Least Recently used (LRU).

5 File Management: File Concept, Access methods, File types, File operation, 06 Hrs
Directory and disk structure, File System Structure, File System Implementation,
Allocation methods (contiguous, linked, indexed), Free-space management (bit
vector, linked list, grouping), directory implementation (linear list, hash table),
efficiency and performance. Mass-Storage Structure: Disk Structure, Disk
attachment, Disk scheduling, Disk management, Swap Space Management.

Text/Reference Books:
1.​ Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating
System Concepts, Wiley Publication, 8th Edition, 2008.
2.​ Andrew S. Tanenbaum, Modern Operating System, PHI Publication, 4th
Edition, 2015.
Department of Computer Engineering ​ ​ 34
 Dr. Babasaheb Ambedkar Technological University

3.​ D. M. Dhamdhere, Systems Programming and Operating Systems,

McGraw-Hill, 2nd Edition, 1996.
4.​ Garry Nutt, Operating Systems Concepts, Pearson Publication, 3rd
Edition, 2003.
5.​ Harvey M. Deitel, An Introduction to Operating Systems, Addison
Wesley Publication, 2nd Edition, 1990.
6.​ Thomas W. Doeppner, Operating System in Depth: Design and
Programming, Wiley Publication, 2011.

Department of Computer Engineering ​ ​ 35

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Data Science Scheme

TH 2 Course Objectives: CA 20
1.​
PR - MSE 20

CR 2 ESE 60

COURSE CONTENT
Unit
Topic Hours
No.

1 Statistical Data and Concepts: The statistical Methods, Misuse, 08 Hrs

Misinterpretation, and bias, Sampling and sampling size, Data preparation and
cleaning, Missing data and data errors, Exploratory Data Analysis, Statistical
error, Statistical Modeling, Computational Statistics, Inference, Bias,
Cofounding, Hypothesis testing, Types of error, Statistical significance,
Confidence Interval, Power and robustness, Degrees of freedom, Non parametric
analysis.

2 Descriptive Statistics: Counts and specific values, Measure of central tendency, 07 Hrs
Measure of spread, Measure of distribution shape, Statistical indices, Moments,
Key functions, Measures of complexity and model selection.

3 Data Transformation and Standardization: Box-Cox and power transforms, 06 Hrs

Freeman-Tukey (square root and arcsine) transforms, Log and Exponential
transforms, Logit transforms, Normal transform.

4 Classical Tests and Contingency Tables: Goodness of fit tests: 05 Hrs

Anderson-Darling, Chi-square test, Kolmogorov-Smirnov, Ryan-Joiner,
Shapiro-Wilk, Jarque-Bera, Lilliefors.
Z-test: Test of single mean, standard deviation known, Test of the difference
between two means, standard deviation known, test for proportions.
T-tests: Test of single mean, standard deviation not known, Test of the
difference between two means, standard deviation not known, Test of regression
coefficients

5 Analysis of Variance and Covariance: 05 Hrs

Variance test: Chi square test of single variable, F-test of two variables, test of
homogeneity; Wilcoxon rank-sum/Mann-Whitney U test; Sign test.
Contingency Tables: Chi-square contingency table test, G contingency table
test, Fisher's exact test, Measures of association, McNemar's test.
ANOVA: Single factor or one way ANOVA, Two factor or two-way and
higher-way ANOVA, MANOVA, ANCOVA; Non Parametric ANOVA: Kruskal
Wallis ANOVA, Friedam ANOVA test, Mood’s median.

Department of Computer Engineering ​ ​ 36

 Dr. Babasaheb Ambedkar Technological University

Text/Reference Books:
1.​ Dr. Michael J de Smith, Statistical Analysis Handbook: A
Comprehensive Guide to Statistical Concepts, Methods and Tools, The
Winchelsea Press, Drumlin Security Ltd, Edinburgh, 2018 edition.
https://www.statsref.com/HTML/index.html
2.​ Douglas C. Montgomery, George C. Runger, Applied Statistics and
Probability for Engineers, Sixth Edition, Wiley, 2013.
3.​ Dr.J.Ravichandran, Probability And Statistics For Engineers, First
Edition, Wiley, 2010.
4.​ Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. Mining of
Massive Datasets. V2.1, Cambridge University Press. 2014. (free online)
5.​ Kevin P. Murphy. Machine Learning: A Probabilistic Perspective. ISBN
0262018020, 2013.
6.​ Foster Provost and Tom Fawcett. Data Science for Business: What You
Need to Know about Data Mining and Data-analytic Thinking. ISBN
1449361323. 2013.
7.​ Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk
From The Frontline, O’Reilly. 2014.

Department of Computer Engineering ​ ​ 37

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Constitution of India Scheme

TH 2 Course Objectives: CA 60

PR - MSE -

CR AU ESE 40
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction: Constitution’ meaning of the term, Indian Constitution: Sources 05 Hrs

and constitutional history, Features: Citizenship, Preamble, Fundamental Rights
and Duties, Directive, Principles of State Policy.

2 Union Government and its Administration: Structure of the Indian Union: 05 Hrs
Federalism, Centre- State, relationship, President: Role, power and position, PM
and Council of ministers, Cabinet and Central Secretariat, Lok Sabha, Rajya
Sabha.

3 State Government and its Administration 04 Hrs

Governor: Role and Position, CM and Council of Ministers, State Secretariat:
Organisation, Structure and Functions.

4 Local Administration: District’s Administration head: Role and Importance, 05 Hrs

Municipalities: Introduction, Mayor and role of Elected Representative, CEO of
Municipal Corporation, Pachayati Raj: Introduction, PRI: Zila Pachayat, Elected
officials and their roles, CEO Zila Pachayat: Position and role, Block level:
Organizational Hierarchy (Different departments), Village level: Role of Elected
and Appointed officials, Importance of grass root democracy.

5 Election Commission: Election Commission: Role and Functioning, Chief 05 Hrs

Election Commissioner and Election Commissioners, State Election
Commission: Role and Functioning, Institute and Bodies for the welfare of
SC/ST/OBC and women.

Text/Reference Books:
1.​ Sastry, T. S. N., (2005). India and Human Rights: Reflections, Concept
Publishing Company India (P Ltd.).
2.​ Nirmal, C.J., (1999). Human Rights in India: Historical, Social and
Political Perspectives (Law in India), Oxford India.

Department of Computer Engineering ​ ​ 38

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Life of Bharat Ratna Dr. Babasaheb Ambedkar Scheme

TH 1 Course Objectives: CA 50

PR - MSE -

CR 1 ESE -
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to the socio-political context of Ambedkar's era, British 05 Hrs

Colonialism, Indian National Movement, Caste Hierarchy, Untouchability,
Social Reform Movements, Role in the Indian freedom struggle.

2 Contributions to the Constitution of India, Vision for social justice and 05 Hrs
empowerment.

3 Dr. Ambedkar and Marxism: An Exploration of His Thoughts on Marxism, 05 Hrs

Common ground with Marxism, Focus on class struggle, Caste vs. Caste,
Primacy of Caste in Indian Society, Economic ideas and policies

Department of Computer Engineering ​ ​ 39

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Design and Analysis of Algorithm Laboratory Scheme

TH - Course Objectives: CA 60

PR 2 MSE -

CR 1 ESE 40

List of Experiments:

1.​ Implementation of Binary Search.

2.​ Implementation of finding maximum and minimum numbers using divide and conquer.
3.​ Implementation of Merge / Quick sort.
4.​ Implementation of Selection sort.
5.​ Implementation of Job Sequencing with deadlines.
6.​ Program for finding the minimum cost Spanning Tree.
7.​ Implementation of single-source shortest path.
8.​ Implementation of all-pairs shortest path.
9.​ Program for Tree traversal techniques.
10.​Program for Graph Traversal Technique.

Department of Computer Engineering ​ ​ 40

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(A) Marathi

TH 2 Course Objectives: CA 20

PR - MSE 20

CR 2 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 मराठीचा उगम आणि विकास: मराठीचा उगम आणि विकास, मराठी भाषेवर संत 02 Hrs
परं परे चा प्रभाव- ज्ञानेश्वर, तक
ु ाराम, नामदे व आणि एकनाथ यांच्या रचनांचा अभ्यास,
मराठीत बखरी लेखन व इतिहास दर्शन, आधनि ु क मराठी आणि सध ु ारणा चळवळी-
टिळक, फुले, आणि आगरकर यांचे योगदान.

2 स्वातंत्र्यानंतरची मराठी भाषा: महाराष्ट्र राज्य निर्मिती व मराठीचा अधिकृत दर्जा, 02 Hrs
डिजिटल यग ु ातील मराठी भाषा : ब्लॉग, सोशल मीडिया आणि ई-साहित्य, मराठी भाषा
संरक्षणासाठी उपाययोजना, शिक्षण व्यवस्थेतील मराठीचा वापर, जागतिक स्तरावर
मराठी भाषेचा प्रभाव.

3 मराठी लेखनाचे नियम आवण व्याकरण: संधि, वाक्यप्रकार (विधानार्थी वाक्य, प्रश्नार्थी 02 Hrs
वाक्य, आज्ञार्थी वाक्य इ.), विरामचिन्हे आणि त्यांचे उपयोग, शद्
ु धलेखन, समानाथी
शब्द (पर्यायवाची शब्द), विरुद्धाथी शब्द.

4 लेखन कौशल्य: लेखन कौशल्याचा परिचय, लेखन कौशल्याचे महत्त्व आणि 02 Hrs
आवश्यकता ▪ पत्रलेखन ▪ निबंध लेखन ▪ वत्त
ृ लेखन (वत्त
ृ पत्रीय लेखन) ▪ इतिवत्त
ृ लेखन ▪
सारांश लेखन

5 भाषांतर (मराठीतन ू इंग्रजी आणि इंग्रजीतन

ू मराठी): भाषांतराचा मल ू भत
ू परिचय- 02 Hrs
भाषांतराची व्याख्या आणि स्वरूप, महत्त्व आणि उपयोग, भाषांतराचे प्रकार इ. ▪
पारिभातषक शब्दावली, मराठीतन ू इंग्रजी आणि इंग्रजीतन
ू मराठी भाषांतर.
Text / Reference Books:
1.​ प्रशासनिक लेखन, भाषा संचालनालय , महाराष्ट्र शासन, मंब ु ई १९६६
2.​ सग ु म मराठी व्याकरण व लेखन - मो.रा. वाळं बे
3.​ "अनव ु ाद तसद्धांत आणि प्रयोग" – डॉ. भालचंद्र नेमाडे (लोकवाङ्मय गह
ृ
प्रकाशन)
4.​ मराठी भाषा आणि साहित्याचा इतिहास – वि.का. राजवाडे प्रकाशक : राजवाडे
संशोधन मंडळ, धळ ु े
5.​ भाषांतर : सिद्धांत आणि प्रयोग – डॉ. अशोक केळकर प्रकाशक : लोकवाङ्मय
गह ृ , मंब
ु ई

Department of Computer Engineering ​ ​ 41

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(B) Hindi

TH 2 Course Objectives: CA 20

PR - MSE 20

CR 2 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 हिंदी भाषा का उद्भि और स्रोत: ▪ हिंदी भाषा की उत्पत्ति और स्वरूप ▪ संस्कृत, प्राकृत 02 Hrs
और अपभ्रंश से हिंदी का विकास ▪ हिंदी की प्रमखु बोलियााँ (ब्रज, अवधी, खडी बोली,
भोजपरु ी, राजस्थानी आदी) ▪ हिंदी पर फारसी, अरबी और अंग्रेजी भाषा का प्रभाव.

2 स्वातंतंत्र्योत्तर काल में हिंदी भाषा ▪ प्रशासन, शिक्षा और संचार माध्यमों में हिंदी की 02 Hrs
भमि
ू का ▪ राजभाषा के रूप में हिंदी – संवध ै ानिक स्थिति और व्यावहारिक उपयोग ▪ हिंदी
का वैश्र्विक विस्तार और डिजिटल माध्यमों में हिंदी की उपस्थिति ▪ प्रशासन और संचार
माध्यमों में हिंदी

3 हिंदी भाषा लेखन के नियम और व्याकरण ▪ वणिमाला ▪ शब्द-भेद ▪ संधि ▪ वाक्य रचना 02 Hrs
▪ वर्तनी ▪ उपसर्ग, प्रत्यय और शब्द निर्मांण की प्रक्रिया ▪ विराम चिन्हों का प्रयोग ▪
पर्यायवाची शब्द ▪ विलोम शब्द.

4 लेखन कौशल ▪ पत्र लेखन ▪ प्रतिवेदन (रिपोटि) लेखन ▪ विज्ञप्ति, नोटिस और परिपत्र 02 Hrs
लेखन निबंध लेखन ▪ सार लेखन.

5 अनव ु ाद (अंग्रेजी से हिंदी और हिंदी से अंग्रेजी) 02 Hrs

अनव ु ाद : सिद्धांत और परं परा, अनव ु ाद : क्षेत्र, प्रकार, पारिभाषीक शब्दावली, अंग्रेजी से
हिंदी और हिंदी से अंग्रेजी अनवु ाद
Text / Reference Books:
1.​ "हिंदी भाषा का उद्भव और विकास" – डॉ. हरीशचंद्र वर्मा (लोकभारती प्रकाशन)
2.​ "हिंदी भाषा का इतिहास" – डॉ. रामविलास शर्मा (राजकमल प्रकाशन)
3.​ "भारत में राजभाषा हिंदी" – डॉ. विश्वनाथ प्रसाद (भारतीय राजभाषा पररषद)
4.​ "हिंदी व्याकरण और रचना" – डॉ. हरीशचंद्र वर्मा (लोकभारती प्रकाशन)
5.​ "हिंदी लेखन कौशल" – डॉ. रमेश गुप्ता (सातहत्य भवन)
6.​ "अनव ु ाद विज्ञान और सिद्धांत" – डॉ. ओमप्रकाश (राजकमल प्रकाशन)

Department of Computer Engineering ​ ​ 42

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(C) Sanskrit

TH 2 Course Objectives: CA 20

PR - MSE 20

CR 2 ESE 60
COURSE CONTENT
Unit
Topic Hours
No.

1 Introduction to Sanskrit: Importance and history of Sanskrit, Sanskrit 02 Hrs

alphabets (Varnamala), Swaras (Vowels), Vyanjanas (Consonants),
Pronunciation and script (Devanagari).

2 Basic Grammar: Nouns, pronouns, Grammatical numbers, Grammatical 02 Hrs

genders, Grammatical person, Verbs, Tenses, Sandhi (Combination of letters),
Karaka (Case system) – Nominative, Accusative, Instrumental, etc., Vibhakti
(Declensions of nouns and pronouns), Linga (Gender: Masculine, Feminine,
Neuter), Vakya Rachana (Sentence construction).

3 Simple Vocabulary and Sentence Formation: Basic words and their meanings 02 Hrs
(nature, family, animals, objects, etc.), Greetings and basic conversational
phrases, Formation of simple sentences

4 Selected Sanskrit Shlokas and Subhashitas: Recitation and meaning of simple 02 Hrs
verses from Bhagavad Gita, Hitopadesha, or Panchatantra, Common proverbs
(Subhashitas)

5 Reading and Writing Practice: Reading simple Sanskrit texts, Writing small 02 Hrs
paragraphs in Sanskrit

Department of Computer Engineering ​ ​ 43

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Full Stack Development Scheme

TH 1 Course Objectives: CA 60

PR 2 MSE -

CR 2 ESE 40
COURSE CONTENT
Unit
Topic Hours
No.

1 Bootstrap: Introduction to Bootstrap, Bootstrap Basics, Bootstrap Grids, 02 Hrs

Bootstrap Themes, Bootstrap CSS, Bootstrap JS.

2 Javascripts: Introduction to JavaScript, JavaScript Language Basics, JavaScript 02 Hrs

Events, JavaScript Strings, JavaScript Type Conversion, JavaScript RegExp,
JavaScript Error, JavaScript Hoisting,

3 jQuery: jQuery Events, jQuery Effects, jQuery HTML, jQuery Traversing, 02 Hrs
jQuery AJAX & Misc.

4 PHP & Mysql: Embedding PHP in HTML, Adding Dynamic Content, Accessing 02 Hrs
Form Variables, Storing and retrieving data, Using Arrays perform different
operations, String Manipulation and Regular Expressions.

5 MVC with Laravel: Laravel Installation, Working with Forms, Working with 02 Hrs
Controller, Laravel Blade Template with Bootstrap, Responses with Html,
Laravel Migration, Laravel Requests, Models; Laravel Eloquent ORM, Build a
Complete App in Laravel.

Text / Reference Books:

6.​ Learning PHP, MySQL, JavaScript, CSS & HTML5: A Step-by-Step
Guide to Creating Dynamic Websites by Robin Nixon.
7.​ Full-Stack JavaScript Development by Eric Bush.
8.​ Web Design with HTML, CSS, JavaScript, and JQuery Set Book by Jon
Duckett Professional JavaScript for Web Developers Book by Nicholas
C. Zakas.
9.​ “Laravel: Up and Running" by Matt Stauffer.
10.​Title: Head First jQuery by Ryan Benedetti, Ronan Cranley, September
2011, O'Reilly Media, Inc.

Lab Assignments:

1.​ Create a responsive webpage using Bootstrap classes for typography, buttons, alerts, and tables.
Apply proper layout and spacing.
2.​ Design a multi-column layout using Bootstrap's grid system. Include responsive breakpoints
for mobile, tablet, and desktop views.
3.​ Develop a login/registration page using Bootstrap form controls and implement form validation
using Bootstrap's built-in utilities and JavaScript.
Department of Computer Engineering ​ ​ 44
 Dr. Babasaheb Ambedkar Technological University
4.​ Write a script to perform simple DOM manipulations like hiding/showing content, changing text,
and style on button click using JavaScript events.
5.​ Create a form where input strings are validated, formatted, and manipulated using string methods and
type conversion.
6.​ Demonstrate function and variable hoisting using examples. Show the difference between var,
let, and const with scope illustrations.
7.​ Create a dynamic webpage that responds to user actions like clicks, hover, and form input
using jQuery event listeners and animation effects.
8.​ Develop a web page that fetches data asynchronously using jQuery AJAX (e.g., weather API
or random user data API). Display results dynamically.
9.​ Write PHP scripts that perform sorting, searching, and merging operations on arrays. Validate
input using regular expressions and manipulate strings (e.g., format names or extract domains
from emails).
10.​Develop a complete Laravel-based CRUD application (e.g., blog, task manager, or product
inventory) using routes, controllers, models, migrations, and Blade templates. Include
user-friendly error messages and Bootstrap styling.

Department of Computer Engineering ​ ​ 45

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Operating Systems Laboratory Scheme

TH - Course Objectives: CA 60

PR 2 MSE –

CR 1 ESE 40

List of Experiments:

1.​ Hands on Unix Commands

2.​ Shell programming for file handling.
3.​ Shell Script programming using the commands grep, awk, and sed.
4.​ Implementation of various CPU scheduling algorithms (FCFS, SJF, Priority).
5.​ Implementation of various page replacement algorithms (FIFO, Optimal, LRU).
6.​ Concurrent programming; use of threads and processes, system calls (fork and v-fork).
7.​ Study pthreads and implement the following: Write a program which shows the performance.
8.​ Improvement in using threads as compared with process.(Examples like Matrix Multiplication.
9.​ Hyper Quick Sort, Merge sort, Traveling Sales Person problem).
10.​Implementation of Synchronization primitives – Semaphore, Locks and Conditional Variables.
11.​Implementation of Producer-Consumer problem, Bankers algorithm.
12.​Implementation of various memory allocation algorithms, (First fit, Best fit, and Worst fit), Disk.
13.​Scheduling algorithms (FCFS, SCAN, SSTF, C-SCAN).
14.​Kernel reconfiguration, device drivers, and systems administration of different operating systems.
15.​Writing utilities and OS performance tuning

Department of Computer Engineering ​ ​ 46