Dr.

Babasaheb Ambedkar Technological University

B. Tech. (Computer Engineering / Computer Science and

Engineering / Computer Technology and Allied) Syllabus
Aligned with the New Education Policy 2020
Effective from AY 2025 - 2026
(All Years)

(Affiliated Colleges)

Note: Refer this Syllabus for Second Year in Computer Engineering / Computer
Technology / Computer Science and Engineering / Computer Science and Cyber
Security with branch codes (11242, 11245,)

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
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 25AF1000BS301 Engineering Mathematics-III 3 - 20 20 60 3

PCC1 25AF1245PC302 Data Structures 3 - 20 20 60 3
PCC2 25AF1245PC303 Discrete Mathematics 3 - 20 20 60 3
PCC3 25AF1245PC304 Object-Oriented Programming 2 - 20 20 60 2
PCC4 25AF1245PC305 Digital Electronics 2 - 20 20 60 2
MDM 25AF1245MD306 Multi-Disciplinary Minor* Bucket - - 20 20 60 -
OE-I+ 25AF1245OE307 Any Course from OE Bucket 2 - 20 20 60 2
VSEC 25AF1000VE308A Life of Chhatrapati Shivaji Maharaj 1 - 50 - - 1
PCC Lab 25AF1245PCL309 Data Structures Laboratory - 2 60 - 40 1
VSEC 25AF1000VE310 Universal Human Values - II 2 - 20 20 60 2
Object-Oriented Programming in
PCC Lab 25AF1245PCL311 - 2 60 - 40 1
Java Laboratory
PCC Lab 25AF1245PCL312 Digital Electronics Laboratory - 2 60 - 40 1
Total 18 06 390 160 600 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)

*A student must select a course or courses from the minor degree program s/he wishes to pursue.
+​ A student needs to select a course from the list of open elective courses attached to the Open Elective
(OE) Bucket

Department of Computer Engineering ​ ​ 2

 Dr. Babasaheb Ambedkar Technological University
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 25AF1245PC401 Design and Analysis of Algorithms 3 - 20 20 60 3
Computer Architecture and
PCC2 25AF1245PC402 3 - 20 20 60 3
Organisation
PCC3 25AF1245PC403 Probability and Statistics 3 - 20 20 60 3
OE-II 25AF1245OE404 Any Course from OE Bucket List 2 - 20 20 60 2
PCC Lab 25AF1245PCL05 Python Programming 1 2 60 - 40 2
MDM 25AF1245MD406 Multi-Disciplinary Minor* Bucket - - 20 20 60 -
VSEC 25AFCOIAE407 Constitution of India 2 - 60 - 40 Audit
Life of Bharat Ratna Dr. Babasaheb
VSEC 25AF1000VE308B 1 - 50 - - 1
Ambedkar
Design and Analysis of Algorithms
PCC Lab 25AF1245PCL409 - 2 60 - 40 1
Laboratory
Modern Indian Languages
A)​ Marathi
AEC 25AF1000VE410 2 - 20 20 60 2
B)​ Hindi
C)​ Sanskrit
Total 17 4 350 120 480 17
Exit Requirements for Certificate Program
VSEC 23AF1245VE411 Full Stack Development Project - 16 60 - 40 8

* A student must select a course or courses from the minor degree program s/he wishes to pursue.
+​ A student must select a course from the list of open elective courses attached to the Open Elective
(OE) Bucket.

Department of Computer Engineering ​ ​ 3

 Dr. Babasaheb Ambedkar Technological University
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 Code Course Name Credit
Categories
L P CA MSE ESE
PCC1 26AF1245PC501 Machine Learning 3 - 20 20 60 3
PCC2 26AF1245PC502 Theory of Computations 3 - 20 20 60 3
PCC3 26AF1245PC503 Operating Systems 3 - 20 20 60 3
PCC4 26AF1245PC504 Database Management 3 - 20 20 60 3
Program Elective
A.​ Computer Graphics
PEC 26AF1245PE505 3 - 20 20 60 3
B.​ Introduction to Quantum
Technologies
MDM 26AF1245MD506 MDM Bucket* - - 20 20 60 -
OE-3 26AF1000OE507 Open Elective Bucket 2 - 20 20 60 2
PCC Lab 26AF1245PCL508 Machine Learning Laboratory - 2 60 - 40 1
PCC Lab 26AF1245PCL509 Operating System Laboratory - 2 60 - 40 1
Database Management System
PCC Lab 26AF1245PCL510 - 2 60 - 40 1
Laboratory
AEC 25AF1245SEM511 Seminar - 2 60 - 40 1
Total 17 8 380 140 580 21

*A student must select a course or courses from the minor degree program s/he wishes to pursue.
A student must select a course from the list of open elective courses attached to the Open Elective (OE)
Bucket.

Department of Computer Engineering ​ ​ 4

 Dr. Babasaheb Ambedkar Technological University
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 Code Course Name Credit
Categories
L P CA MSE ESE
PCC 25AF1245PC601 Compiler Design 3 - 20 20 60 3
Data Communication & Computer
PCC 25AF1245PC602 3 - 20 20 60 3
Networks
PCC 25AF1245PC603 Software Engineering 3 - 20 20 60 3
Program Elective
PEC 25AF1245PE604 A.​ Internet of Things 3 - 20 20 60 3
B.​ Big Data Analytics
Program Elective
PEC 25AF1245PE605 A.​ Human Computer Interaction 3 - 20 20 60 3
B.​ Deep Learning
MDM 25AF1245MD606 MDM Bucket - - 20 20 60 -
PCC Lab 25AF1245PCL607 Computer Network Lab - 2 60 - 40 1
PCC Lab 25AF1245PCL608 Full Stack Development 1 2 60 - 40 2
PCC Lab 25AF1245PCL609 Prompt Engineering 1 2 60 - 40 2
Total 17 6 300 120 480 20

*A student must select a course or courses from the minor degree program s/he wishes to pursue.
A student must select a course from the list of open elective courses attached to the Open Elective (OE)
Bucket.

Department of Computer Engineering ​ ​ 5

 Dr. Babasaheb Ambedkar Technological University
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 Code Course Name Credit
Categories
L P CA MSE ESE
PCC 27AF1245PC701 Distributed Computing 3 - 20 20 60 3
Program Elective:
A.​ Natural Language Processing
PEC 27AF1245PE702 2 - 20 20 60 2
B.​ Advanced Algorithms
C.​ Optimization Techniques
PCC Lab 27AF1245MD703 Distributed Computing-Lab - 2 60 - 40 1
Project 27AF1245P704 Project-Phase - 4 60 - 40 2
MDM 27AF1245PC705 MDM Bucket - - 20 20 60 -
Internship 27AF1000O706 Internship - 24 60 - 40 12
Total 5 30 240 60 300 20

*A student must select a course or courses from the minor degree program s/he wishes to pursue.
A student must select a course from the list of open elective courses attached to the Open Elective (OE)
Bucket.

Department of Computer Engineering ​ ​ 6

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

Weekly Examination
Course Hours Scheme
Course Code Course Name Credit
Categories
L P CA MSE ESE
PCC 25AF1245PC801 Artificial Intelligence 3 - 20 20 60 3
Program Elective
1.​ Cryptography and Network
Security
PCC 25AF1245PE802 3 - 20 20 60 3
1.​ Computer Vision
2.​ ICT for Sustainable
Development
Program Elective
A.​ Blockchain Technology
PEC 25AF1245PE803 3 - 20 20 60 3
B.​ Virtual Reality
C.​ AI Ethics
MDM 25AF1245MD804 MDM Bucket 2 - 40 - 60 2
RM 25AF1245RM805 Research Methodology 3 2 40 - 60 4
PCC Lab 25AF1245PL806 Project Phase - II - 4 40 - 60 2
Total 14 6 180 60 360 17

*A student must select a course or courses from the minor degree program s/he wishes to pursue.
A student must select a course from the list of open elective courses attached to the Open Elective (OE)
Bucket.

Department of Computer Engineering ​ ​ 7

 Dr. Babasaheb Ambedkar Technological University

MDM Bucket List for Minor in B.Tech. (Computer Engineering Program)

A student wishing to pursue a Minor program in B. Tech. (Computer Engg) needs to complete a minimum of
14 credits from the list of courses.

Course
Sem Course Name L P CA MSE ESE CR
Code

III 25AF1245MD306A Data Structures 3 2 20 20 60 4

III 25AF1245MD306B Object-Oriented Programming 2 2 20 20 60 3

IV 25AF1245MD406A Design and Analysis of Algorithms 3 2 20 20 60 4

IV 25AF1245MD406B Python Programming 1 2 60 - 40 2
Proposed Courses to be offered in V and VI Semesters

V 25AF1245MD506A Operating Systems 3 2 20 20 60 4

V 25AF1245MD506B Database Management System 3 2 20 20 60 4

V 25AF1245MD506C Theory of Computation 3 - 20 20 60 3

VI 25AF1245MD606A Software Engineering 3 - 20 20 60 3

VI Data Communication &

25AF1245MD606B 3 - 20 20 60 3
Computer Networks

Department of Computer Engineering ​ ​ 8

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives (OE)

In the vertical of Multidisciplinary courses, students need to cover Open Elective Courses (OE) of 08
credits. These 08 credits over semesters III to V are included in the basic minimum of 160-max.176 Credits.
It is offered in the Second and/or Third year. Refer to the wise credit distribution table given below.
Faculty-wise baskets of OE are prepared by the university. They are chosen from faculty other than that of
the Major Faculty, i.e., in this case, the Major Faculty is the Faculty of Engineering. Other Faculties
considered are as follows:
1.​ Faculty of Management and Commerce
2.​ Faculty of Law
3.​ Faculty of Humanities and Arts
4.​ Faculty of Architecture and Planning
5.​ Faculty of Health Sciences
6.​ Faculty of Science
Students must take up three courses of 08 credits over semesters III to V.

Department of Computer Engineering ​ ​ 9

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives for Faculty of Management and Commerce

Name of
Institute
Sr. Teaching Duration Professor/
No.
Course Name
Scheme (Weeks)
Credits Offering
Resource
Link
Course
Person
1 Advanced 4 Hrs / 8 2 IIT, Kanpur Prof. https://nptel.ac.in/cour
Algorithmic Week Abhinava ses/110104169
Trading and Tripathi
Portfolio
Management
2 Business 4 Hrs / 8 2 IIT, Roorkee Prof. Gaurav https://nptel.ac.in/cour
​ Analytics & Text Week Dixit ses/110107129​
Mining Modeling
using Python
3 Commodity 4 Hrs / 12 3 IIT, Kharagpur Prof. Prabina https://nptel.ac.in/cour
​ Derivative & Week​ Rajib ses/110105168
Risk
​ Management
4 E-Business 4 Hrs / 12 3 IIT, Prof. Mamata https://nptel.ac.in/cour
Week Kharagpur Jenamani ses/110105083
5 Econometric 4 Hrs / 8 2 IIT, Roorkee Prof. Sujata https://nptel.ac.in/cour
​ Modelling Week Kar ses/110107153
6 Introduction to 4 Hrs / 12 3 IIT, Roorkee Prof. Zillur https://nptel.ac.in/cour
​ Marketing Week Rahman ses/110107147
Essentials ​
7 Security 4 Hrs / 12 3 IIT, Roorkee Prof. J. P. https://nptel.ac.in/cour
​ Analysis & Week Singh ses/110107154
Portfolio
Management
8 Equity ​ Stock 6 3 Indian P. C. Narayan https://onlinecourses.s
​ Market ​ Institute ​of wayam2.ac.in/imb23_
Management, mg59/preview
​ Bangalore
(IIB)

Department of Computer Engineering ​ ​ 10

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives for Faculty of Law

Name of
Institute
Sr. Teaching Duration Professor /
No.
Course Name
Scheme (Weeks)
Credits Offering
Resource
Link
Course
Person
1 Introduction to 4 Hrs / 8 2​ IIT, Kharagpur Prof. Uday https://nptel.ac.in/co
​ Law on Week Shankar urses/129105004
Electricity

2 New Labour 4 Hrs / 12 3 IIT, Kharagpur Prof. K. D. https://nptel.ac.in/co

​ Codes of India Week Raju urses/129105006
3 Right to 4 Hrs / 12 3 National Law Prof. Sairam https://nptel.ac.in/co
​ Information and Week School of India Bhat urses/129106001
Good University
Governance
4 Conflict ​ 4 Hrs / 8 2 Vice-Chancell Prof. (Dr.) https://nptel.ac.in/co
​ Management Week or, National Ashok R. urses/129106008
through Mediation University of Patil
Study and
Research in
Law, Ranchi
(NUSRL)

5 Biodiversity 4 Hrs / 8 2 IIT, Prof. Padmavati https://nptel.ac.in/co

​ Protection, Week Kharagpur Manchikanti urses/129105008
Farmers and Prof. Narendran
​
Breeders Rights Thiruthy

Department of Computer Engineering ​ ​ 11

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives for Faculty of Humanities and Arts

Name of
Institute
Sr. Teaching Duration Professor /
No.
Course Name
Scheme (Weeks)
Credits Offering
Resource
Link
Course
person
1 Developing Soft 4 Hrs / 8 2 IIT, Kanpur Prof. T. https://nptel.ac.in/cour
Skills and Week Ravichandran ses/109104107
Personality
2 Folk ​ and 4 Hrs / 8 2 IIT, Kanpur Prof. ​ https://nptel.ac.in/cour
​ Minor Art in Week Shatarupa ses/109104106
India Thakurta Roy
​
3 Sustainable ​ 4 Hrs / 8 2 IIT, Prof. Atasi https://nptel.ac.in/cour
​ Happiness Week Kharagpur Mohanty ses/109105493
4 Soft Skill 4 Hrs / 8 2 IIT, Prof. ​ https://nptel.ac.in/cour
​ Development​ Week Kharagpur Priyadarshi ses/109105110
Patnaik,
Prof. V. N. Giri,
Prof. D. Suar
5 Introduction ​ 4 Hrs / 12 3 IIT, Guwahati Prof. Amarjyoti https://nptel.ac.in/cour
​ to Market ​ Week Mahanta​ ses/109103187​
Structures​

6 Human Resource 4 Hrs / 12 3 IIT, Prof. KBL https://nptel.ac.in/cour

​ Development Week Kharagpur Srivastava ses/109105121

7 Educational ​ 4 Hrs / 12 3 IIT, Prof. Atasi https://nptel.ac.in/cour

​ Leadership Week Kharagpur Mohanty ses/109105122​

Department of Computer Engineering ​ ​ 12

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives for Faculty of Architecture and Planning

Name of
Institute
Sr. Teaching Duration Professor /
No.
Course Name
Scheme (Weeks)
Credits Offering
Resource
Link
Course
person
1 Architectural 4 Hrs / 12 3 School of Prof. ​ Iyer https://nptel.ac.in/cour
​ Approaches to Week Planning and Vijayalaxmi ses/124106454
Decarbonization Architecture, Kasinath
of Buildings Vijayawada,
An Institute of
National
Importance
under the
Ministry of
Education
Govt. of India
2 Building 4 Hrs / 8 2 IIT, Kharagpur Prof. Sumana https://nptel.ac.in/cour
​ Materials and Week Gupta ses/124105013​
Composites
3 Building 4 Hrs / 12 3 School of Prof. ​ Iyer https://nptel.ac.in/cour
​ Materials as a Week Planning and Vijayalaxmi ses/124106455
Cornerstone to Architecture, Kasinath
Sustainability Vijayawada,
An Institute of
National
Importance
under the
Ministry of
Education
Govt. of India
4 Modern ​Indian 4 Hrs / 8 2 IIT, Roorkee Prof. P. S. Chani https://nptel.ac.in/cour
​ Architecture​ Week ses/124107161

Department of Computer Engineering ​ ​ 13

 Dr. Babasaheb Ambedkar Technological University

List of Open Electives for Faculty of Science

Name of
Institute
Sr. Teaching Duration Professor
No.
Course Name
Scheme (Weeks)
Credits Offering
/ Resource
Link
Course
Person
1 Quantum ​ 4 Hrs / 12 3 IIT, Kanpur Prof. https://onlinecourses.npte
​ Computing​ Week Debabrata l.ac.in/noc19_cy31/previe
Goswami w#:~:text=Building%20u
p%20on%20the%20digit
al,the%20laws%20of%20
quantum%20mechanics.
2 Introduction to 4 Hrs / 4 1 IIT Madras, Prof. Prabha https://onlinecourses.n
​ Quantum Week IBM Mandayam, ptel.ac.in/noc24_cs67/
Computing: Research, Prof. Anupama preview
Quantum IBM Systems Ray,
Algorithms and Prof.
Qiskit Sheshashayee
Raghunathan
3 Quantum 4 Hrs / 8 2 IIT, Bombay Prof. Dipan https://archive.nptel.a
​ Information Week Ghosh c.in/courses/115/101/
and Computing ​ Department of 115101092/
​ ​ ​ Physics

4 Dynamics of 4 Hrs / 12 3 IIT, Guwahati Prof. ​ Girish S. https://onlinecourses.n

​ Classical and Week Setlur​ ptel.ac.in/noc22_ph29/
Quantum Fields preview

Department of Computer Engineering ​ ​ 14

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Engineering Mathematics - III Scheme

TH 3 Course Objectives: CA 20
1.​ Able to comprehend the fundamental knowledge of the Laplace
PR - and inverse Laplace transforms and their derivatives for MSE 20

CR 3 elementary functions ESE 60

2.​ Able to apply the properties of Laplace and inverse Laplace
transforms to solve simultaneous linear and linear differential
equations with constant coefficients.
3.​ Able to conceptualise the definitions and properties of Fourier
transforms and to solve boundary value problems using Fourier
transforms.
4.​ Able to find the solutions of partial differential equations
governing real-world problems.
5.​ Able to conceptualise limit, continuity, derivative and
integration of complex functions, complex integrals useful in
real-world problems.

COURSE CONTENT
Unit
Topic Hours
No.

1 Laplace Transform: Definition – conditions for existence; Transforms of 08 Hrs

elementary functions; Properties of Laplace transforms - Linearity property, first
shifting property, second shifting property, transforms of functions multiplied by
tn, scale change property, transforms of functions divided by t, transforms of
integral of functions, transforms of derivatives; Evaluation of integrals by using
Laplace transform; Transforms of some special functions- periodic function,
Heaviside-unit step function, Dirac delta function.

2 Inverse Laplace Transform: Introductory remarks; Inverse transforms of some 07 Hrs

elementary functions; General methods of finding inverse transforms; Partial
fraction method and Convolution Theorem for finding inverse Laplace
transforms; Applications to find the solutions of linear differential equations and
simultaneous linear differential equations with constant coefficients.

3 Fourier Transform: Definitions – integral transforms; Fourier integral theorem 07 Hrs

(without proof); Fourier sine and cosine integrals; Complex form of Fourier
integrals; Fourier sine and cosine transforms; Properties of Fourier transforms;
Parseval’s identity for Fourier Transforms.

4 Partial Differential Equations and Their Applications: Formation of Partial 08 Hrs

differential equations by eliminating arbitrary constants and functions; heat
Equations solvable by direct integration; Linear equations of first order
(Lagrange’s linear equations); Method of separation of variables – applications

Department of Computer Engineering ​ ​ 15

 Dr. Babasaheb Ambedkar Technological University
2
𝛛𝑢 2 𝛛𝑢
to find solutions of one-dimensional flow equation (𝑖𝑒. 𝛛𝑡
=𝐶 2 ), and
𝛛𝑡
2 2
𝛛𝑦 2 𝛛𝑦
one-dimensional wave equation (𝑖𝑒. 2 = 𝐶 2 ).
𝛛𝑡 𝛛𝑥

5 Functions of Complex Variables: Analytic functions; Cauchy-Riemann 07 Hrs

equations in Cartesian and polar forms; Harmonic functions in Cartesian form;
Cauchy’s integral theorem; Cauchy’s integral formula; Residues; Cauchy’s
residue theorem (All theorems without proofs).

Text Books:
1.​ Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers,
New Delhi.
2.​ Higher Engineering Mathematics by H. K. Das and Er. Rajnish Verma, S.
Chand & Co. Pvt. Ltd., New Delhi.
3.​ Higher Engineering Mathematics by B. V. Ramana, Tata McGraw-Hill
Publications, New Delhi.

Reference Books:
1.​ Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley &
Sons, New York.
2.​ A Text Book of Engineering Mathematics by Peter O’ Neil, Thomson
Asia Pte Ltd., Singapore.
3.​ Advanced Engineering Mathematics by C. R. Wylie & L. C. Barrett,
McGraw-Hill Publishing Company Ltd., New Delhi.
4.​ Integral Transforms by I. N. Sneddon, Tata McGraw-Hill, New York.

Department of Computer Engineering ​ ​ 16

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Data Structures Scheme

TH 3 Course Objectives: CA 20
1.​ Explain fundamental concepts of data, data types, data
PR - structures, and Abstract Data Types (ADT), and analyse MSE 20
algorithms in terms of time and space complexity.
CR 3 ESE 60
2.​ Solve computational problems by applying appropriate data
structures such as arrays, hash tables, stacks, queues, and linked
lists.
3.​ Implement tree and graph data structures, including binary
trees, binary search trees, heaps, and adjacency matrix
representations, and perform related operations and traversals.
4.​ Demonstrate proficiency in searching and sorting algorithms,
including sequential, binary search, skip lists, insertion sort,
selection sort, and radix sort, along with file handling
techniques.
5.​ Select and implement suitable data structures and algorithms to
develop efficient, maintainable, scalable software solutions.

COURSE CONTENT

Unit
Topic Hours
No.

1 Data, Data types, Data structure, Abstract Data Type (ADT), representation of 06 Hrs
Information, characteristics of an algorithm, program, analysing programs.
Arrays and Hash Tables: Concept of sequential organisation, 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.

Department of Computer Engineering ​ ​ 17

 Dr. Babasaheb Ambedkar Technological University

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 Structures & Algorithms in C++, Wiley
Publication, 2nd Edition, 2011.
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 ​ ​ 18

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Discrete Mathematics Scheme

TH 3 Course Objectives: CA 20
1.​ Apply principles of propositional and predicate logic to model,
PR - analyze, and validate logical arguments using truth tables, MSE 20
standard forms, rules of inference, and quantifiers.
CR 3 ESE 60
2.​ Use set theory, functions, and relations to represent, manipulate,
and reason about mathematical structures and their properties.
3.​ Solve combinatorial problems using counting principles,
recurrence relations, and graph theory concepts, including
paths, connectivity, colouring, and spanning trees.
4.​ Implement algorithms for graph and tree problems such as
shortest paths, minimal spanning trees, Huffman coding, and
topological sorting.
5.​ Analyse and apply algebraic structures, including groups, rings,
fields, and Boolean algebras, to formulate and solve problems
in computer science and related domains.
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 06 Hrs

Recurrence Relations.

Department of Computer Engineering ​ ​ 19

 Dr. Babasaheb Ambedkar Technological University

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.

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 ​ ​ 20

 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 OOP.
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 Classes and Objects (Java): Introduction, Java Class Libraries, 05 Hrs
Typical Java Development Environment, Memory Concepts, Arithmetic.
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.
Contro Statements and Array

2 Modulization in Java: Java Package, importing packages, Methods: static 05 Hrs

methods, static Fields, scope of declaration, method overloading, and Java API
packages.

3 Inheritance and Polymorphism in Java: Inheritance: Super classes and 05 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.

4 Exception-handling: Exception-handling overview, handling Arithmetic 06 Hrs

Exceptions and Input Mismatch Exceptions, when to use exception handling,
Java exception hierarchy, finally block. Java Iterator Methods Parametrized
Classes in Java.

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.

Department of Computer Engineering ​ ​ 21

 Dr. Babasaheb Ambedkar Technological University

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 ​ ​ 22

 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 05 Hrs
Exclusive-OR operations, Boolean algebra, examples of IC gates.

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

3 Combinational Logic Design: Standard representations for logic functions, 05 hrs

K-map representation of logic functions (SOP and POS forms), minimization of
logical functions for min-terms and max-terms (upto four variables), and don’t care
conditions.

4 Design Examples: Arithmetic Circuits, BCD-to-7 segment decoder, Code 05 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 06 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.
Department of Computer Engineering ​ ​ 23
 Dr. Babasaheb Ambedkar Technological University

3.​ Anand Kumar, Fundamentals of digital circuits, 1st edition, Prentice Hall of
India, 2001.
4.​ Pedroni V. A., Digital Circuit Design with VHDL, Prentice Hall India, 2nd
Edition, 2001.

Department of Computer Engineering ​ ​ 24

 Dr. Babasaheb Ambedkar Technological University

Teachin Semester III Examinati

g Universal Human Values - II on Scheme
Scheme

TH 3 Course Objectives: CA 20
1.​ Explain the concept of value education,
PR - self-exploration, and the relationship between MSE 20
happiness, prosperity, and basic human aspirations.
CR 3 ESE 60
2.​ Distinguish between the needs of the self and the body,
and apply methods to achieve harmony within the
individual and between the self and the body.
3.​ Demonstrate understanding of harmony in the family
and society by applying foundational values such as
trust and respect in human relationships.
4.​ Analyse the interconnectedness and mutual fulfilment
among the four orders of nature and relate it to
sustainable living and coexistence.
5.​ Apply a holistic understanding of human values to
professional ethics, decision-making, and strategies for
value-based life and profession.
COURSE CONTENT
Uni
t 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 05 Hrs

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: Harmony in the Family, the 04 Hrs
Basic Unit of 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 05 Hrs

Nature, 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 05 Hrs

Ethics: Natural Acceptance of Human Values, Definitiveness of
(Ethical) Human Conduct, A Basis for Humanistic Education,

Department of Computer Engineering ​ ​ 25

 Dr. Babasaheb Ambedkar Technological University

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.
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 ​ ​ 26

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Life of Chhatrapati Shivaji Maharaj Scheme

TH 1 Course Objectives: CA 50
1.​ Analyse Shivaji Maharaj’s military strategies, including
PR - guerrilla warfare, fortress defence, naval power, and MSE -

CR 1 intelligence networks, in historical and tactical contexts. ESE -

2.​ Evaluate Shivaji Maharaj’s leadership, management practices,
and innovations in logistics, fortifications, and military
technology.
3.​ Interpret Shivaji Maharaj’s views on women’s rights, religious
tolerance, democracy, and nationalism, and relate them to
contemporary socio-political values.

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 ​ ​ 27

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Data Structures Laboratory Scheme

PR: 2 CA: 60
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 ​ ​ 28

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Object-Oriented Programming in Java Laboratory Scheme

PR: 2 CA: 60
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 Interfaces, block initializers, final Modifier, as well as static and dynamic
binding.
8.​ Programs on Exception Handling.
9.​ Write a Java program that illustrates the following
a) Creation of a simple package.
b) Accessing a package.
c) Implementing interfaces.
10.​Create a simple GUI using JFrame, JButton, JLabel, and JTextField. Handle user events
using action listeners.
11.​Demonstrate usage of List, Set, and Map. Iterate using an enhanced for-loop and an Iterator.

Department of Computer Engineering ​ ​ 29

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester III Examination

Scheme Digital Electronics Laboratory Scheme

PR: 2 CA: 60
CR: 1 ESE: 40

List of Experiments

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 ​ ​ 30

 Dr. Babasaheb Ambedkar Technological University

Semester - IV

Department of Computer Engineering ​ ​ 31

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Design and Analysis of Algorithms Scheme

TH 3 Course Objectives: CA 20
1.​ Explain fundamental algorithm design, analysis, and
PR - performance evaluation concepts using asymptotic notations MSE 20
and recurrence solving techniques.
CR 3 ESE 60
2.​ Solve computational problems by applying algorithmic
paradigms such as divide-and-conquer, greedy, dynamic
programming, backtracking, and branch-and-bound.
3.​ Implement algorithms for searching, sorting, shortest path,
matrix operations, and combinatorial optimisation, and evaluate
their time and space complexity.
4.​ Compare algorithmic strategies for problem-solving and justify
the choice of technique based on efficiency and problem
constraints.
5.​ Classify problems into complexity classes P, NP, and
NP-complete, and apply polynomial-time reductions to analyse
computational hardness.

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 Algorithms 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.
Department of Computer Engineering ​ ​ 32
 Dr. Babasaheb Ambedkar Technological University

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.
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 ​ ​ 33

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Computer Architecture and Organization Scheme

TH 3 Course Objectives: CA 20
1.​ Explain the structure, function, and interconnection of computer
PR - components, including CPU, memory, and I/O systems. MSE 20
2.​ Interpret instruction set architectures, addressing modes, and
CR 3 ESE 60
execution flow, and compare RISC and CISC architectures.
3.​ Apply principles of computer arithmetic to perform integer and
floating-point operations, and analyse ALU design.
4.​ Evaluate memory organisation techniques, including cache,
virtual memory, and external storage systems, for performance
and reliability.
5.​ Analyse control unit design, I/O organisation, pipelining, and
parallel processing techniques for improving system
performance.

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.

Department of Computer Engineering ​ ​ 34

 Dr. Babasaheb Ambedkar Technological University

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.
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 ​ ​ 35

 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 ​ ​ 36

 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 ​ ​ 37

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Constitution of India Scheme

TH 2 Course Objectives: CA 60
1.​ Explain the historical background, sources, features, and key
PR - provisions of the Indian Constitution, including citizenship, MSE -
fundamental rights, duties, and directive principles.
CR AU ESE 40
2.​ Describe the structure, roles, and functions of the Union and
State governments, and analyze the relationship between the
Centre and States.
3.​ Interpret the organization and functioning of local
self-government institutions and evaluate their role in
strengthening grassroots democracy.
4.​ Analyze the functions of the Election Commission and other
constitutional bodies related to the welfare of marginalized
communities and women.
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

Department of Computer Engineering ​ ​ 39

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Life of Bharat Ratna Dr. Babasaheb Ambedkar Scheme

TH 1 Course Objectives: CA 50
1.​ Analyze the socio-political context of Dr. Ambedkar’s era and
PR - his role in the Indian freedom struggle and social reform MSE -
movements.
CR 1 ESE -
2.​ Evaluate Dr. Ambedkar’s contributions to the framing of the
Indian Constitution and his vision for social justice and
empowerment.
3.​ Interpret Dr. Ambedkar’s views on Marxism, class struggle, and
caste, and assess their relevance to contemporary Indian society
and economic policy.
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 ​ ​ 40

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Design and Analysis of Algorithm Laboratory Scheme

TH - 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 ​ ​ 41

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(A) Marathi

TH 2 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 ​ ​ 42

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(B) Hindi

TH 2 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 ​ ​ 43

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Modern Indian Languages Scheme
(C) Sanskrit

TH 2 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 ​ ​ 44

 Dr. Babasaheb Ambedkar Technological University

Teaching Semester IV Examination

Scheme Python Programming Scheme

TH 1 Course Objectives: CA 60
1.​ Understand algorithms, data structures, and core
PR 2 programming concepts while setting up Python and running MSE -

CR 2 your first programs.Work with variables, operations, control ESE 40

flow, functions, strings, and file handling to create interactive
and robust applications.
2.​ Apply object-oriented programming principles and efficiently
use Python’s built-in collections like lists, tuples, sets, and
dictionaries.
3.​ Use SQLite and SQL queries to store, retrieve, and manage
data, including practical projects like spidering Twitter and
joining multiple tables.
COURSE CONTENT

Unit
Topic Hours
No.

1 Informal introduction to programming, algorithms and data structures, 02 Hrs

downloading and installing Python, run a simple program on Python interpreter.

2 Variables, operations, control flow – assignments, conditionals, loops, functions: 02 Hrs

optional arguments, default values, passing functions as arguments, Statements,
Expressions.
Strings: String processing. Exception handling, Basic input/output, handling
files.

3 Class and Object, Data Structure: List, Tuple and Sequences, Set, Dictionaries. 04 Hrs

4 Using Database and Structured Query Languages (SQL): SQLite manager, 04 Hrs
Spidering Twitter using a Database, Programming with multiple tables, JOIN to
retrieve data.

Text/Reference Books:
1.​ Michael Urban and Joel Murach, Murach‘s Python Programming,
Murach's Publication, 2016
2.​ Charles Severance, Python for Informatics: Exploring Information,
University of Michigan, Version 2.7.0, 2014.
3.​ Dr. R. Nageswara Rao, Core Python Programming, Dreamtech Press, 1st
Edition, 2016.
4.​ Mark Lutz, Learning Python, O'Reilly Media, 5th Edition, 2013.

Department of Computer Engineering ​ ​ 45

 Dr. Babasaheb Ambedkar Technological University

5.​ Mark Pilgrim, Dive into Python 3, A press Publication, 2nd Edition,
2009.
6.​ Allen B. Downey, Think Python, O'Reilly Media, 2nd Edition, 2012.
7.​ Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson Education, 1st
Edition, 2006.

Department of Computer Engineering ​ ​ 46