DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Semester —III (Second Year)

Proposed Scheme w.e.f. July — 2021

BTBS301 |Engineering Mathematics —

I 3 01 - 12020 60 | 100 4

BTCOC302 |Discrete Mathematics 3 |1 -1 20| 20 60 | 100

BTCOC303 |Data Structures 3 |1 -1 20| 20 60 | 100
BTCOC304 (C)ompgter_ Architecture & 3 0 1201 20 60 | 100 4
rganization
BTCOC305 |Elective —I
(a) Object - oriented
Programming in C++ 3 01 ]-]20]2 |60 100 4
(b) Object Oriented
IProgramming in Java

BTCOL306 |Data Structures Lab

& Object Oriented - - |4 60 - 40 | 100 2
Programming Lab
BTCOS307 |Seminar —I - 4 | 60 - 40 | 100 2

BTES211P | Field Training / Internship / | -

Industrial Training —I - - - - - - Audit
Evaluation

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 15

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTBS 301: Engineering Mathematics-IIT

Subject: Engineering Mathematics III (BTBS 301) Semester: IIT

Teaching Scheme Examination Scheme
Theory: 03 Hrs./Week Mid-term Test : 20 Marks
Tutorial: 01 Hr./Week Internal Assessment: 20 Marks
Credits: 04 End Semester Exam: 60 Marks
Duration: 03 Hrs.

Unit 1: Laplace Transform [09 Hours]

Definition — conditions for existence ; Transforms of elementary functions ; Properties of Laplace transforms -
Linearity property, first shifting property, second shifting property, transforms of functions multiplied by t", 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.
Unit 2: Inverse Laplace Transform [09 Hours]
Introductory remarks ; Inverse transforms of some 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.
Unit 3: Fourier Transform [09 Hours]
Definitions — integral transforms ; Fourier integral theorem (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.
Unit 4: Partial Differential Equations and Their Applications [09 Hours]
Formation of Partial differential equations by eliminating arbitrary constants and functions; Equations solvable by
direct integration; Linear equations of first order (Lagrange’s linear equations); Method of separation of variables
- . i . i .2 a2 . .
— applications to find solutions of one dimensional heat flow equation 6—1: =C? # and one dimensional wave
2
equation (i.e. % = ).
Unit 5: Functions of Complex Variables [09 Hours]
Analytic functions; Cauchy- Riemann 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. A course in Engineering Mathematics (Vol III) by Dr. B. B. Singh, Synergy Knowledgeware, Mumbai.
4. 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, Tata Mcgraw-Hill Publishing Company
Ltd., New Delhi.
4. Integral Transforms and their Engineering Applications by Dr. B. B. Singh, Synergy. Knowledge ware,
Mumbai.
5. Integral Transforms by I. N. Sneddon, Tata McGraw-Hill, New York.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 21

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC302: Discrete Mathematics

[UNIT 1] Fundamental Structures and Basic Logic [7 Hours]

Sets, Venn diagram, Cartesian product, Power sets, Cardinality and countability, Propositional logic, Logical
connectives, Truth tables, Normal forms, Validity, Predicate logic, Limitations of predicate logic, Universal and
existential quantification, First order logic, Principles of Mathematical Induction: The Well-Ordering Principle,
Recursive definition, The Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean
Algorithm, The Fundamental Theorem of Arithmetic.

[UNIT 2] Functions and Relations [7 Hours]

Subjective, Injective, Bijective and inverse functions, Composition of function, Reflexivity, Symmetry,
Transitivity and equivalence relations.
Combinatorics: Counting, Recurrence relations, generating functions.

[UNIT 3] Graph [7 Hours]

Basic terminology, Multi graphs and weighted graphs, Paths and circuits, Shortest path problems, Euler and
Hamiltonian paths, Representation of graph, Isomorphic graphs, Planar graphs, Connectivity, Matching
Colouring.

[UNIT 4] Trees [7 Hours]

Trees: Rooted trees, Path length in rooted tree, Binary search trees, Spanning trees and cut set, Minimal
spanning trees, Kruskal‘s and Prim‘s algorithms for minimal spanning tree.

[UNIT 5] Algebraic Structures and Morphism [7 Hours]

Algebraic Structures with one Binary 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, Identities of Boolean Algebra, Duality, Representation of Boolean Function,
Disjunctive and Conjunctive Normal Form.

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.Y. N. Singh, Discrete Mathematical Structures, Wiley Publication, 1st Edition, 2010.
5. Dr. Sukhendu Dey, Graph Theory with Applications, SPD Publication, 1st Edition, 2012.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 22

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC303: Data Structures

[UNIT 1] Introduction [7 Hours]

Data, Data types, Data structure, Abstract Data Type (ADT), representation of Information, characteristics of
algorithm, program, analyzing programs. Arrays and Hash Tables Concept of sequential organization, linear
and non-linear data structure, storage representation, array processing sparse matrices, transpose of sparse
matrices, Hash Tables, Direct address tables, Hash tables, Hash functions, Open addressing, Perfect hashing.

[UNIT 2] Stacks and Queues [7 Hours]

Introduction, stack and queue as ADT, representation and 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.

[UNIT 3] Linked list [7 Hours]

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

[UNIT 4] Trees and Graphs [7 Hours]

Basic terminology, binary trees and its representation, insertion and deletion of nodes in binary tree, binary
search tree and its traversal, threaded binary tree, Heap, Balanced Trees, Terminology and representation of
graphs using adjacency matrix, Warshall‘s algorithm.

[UNIT 5] Searching and Sorting [7 Hours]

Sequential, binary searching, skip lists — dictionaries, linear list representation, skip list representation,
operations— insertion, deletion and searching. Insertion sort, selection sort, radix sort, File handling.

Text Book:

1. Weiss, Data structures and algorithms analysis in C++, Pearson Education, 4th Edition,2013

Reference Books:
1. S. Lipschutz, Data Structures, McGraw-Hill Publication, Revised 1st Edition, 2014.
2. Y.Langsm, M. Augenstin, A. Tanenbaum , Data Structure using C and C++, Prentice Hall India
Learning Private Limited,
2™ edition,1998.
Horowitz and Sahani, Fundamentals of Data Structures, Universities Press, 2nd Edition,2008.
W

Thomas Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition,2002.

QO NVR

Venkatesan& Rose, Data Structures, Wiley Publication, 1st Edition,2015.

Goodrich &Tamassia, Data Structure & Algorithm in C++, Wiley Publication, 2nd Edition,2011.
R. G. Dromey, How to Solve it by Computer, 2nd Impression, PearsonEducation.
Kyle Loudon, Mastering Algorithms with C: Useful Techniques from Sorting to Encryption,
O'Reilly Media, 1st Edition,1999.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 23

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC 304: Computer Architecture and Organization

[UNIT 1] Introduction [7 Hours]

Concept of computer organization and architecture, Fundamental unit, Computer function and interconnection,
CPU structure and function

[Unit 2] Instruction Sets [7 Hours]

Characteristics, Types of operands, Types of operations, 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.

[Unit 3] Computer Arithmetic [7 Hours]

The arithmetic and logic Unit, Integer representation, Integer arithmetic, Floating point representation, Floating
point arithmetic, Introduction of arithmetic co-processor.

[Unit 4] Memory Organization [7 Hours]

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.

[Unit 5] Control Unit and Input / Output Organization [7 Hours]

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

Text Book:

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 Kaufman
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, Sth Edition,
2013.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 24

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Elective -1
(A) BTCOC 305: Object Oriented Programming in C++

[Unit 1] Introduction to Object Oriented Programming and Objects and Classes [7 Hours]

Need of object oriented programming, The object oriented approach, Characteristics of object oriented
languages, class, Objects as data types, Constructors, Objects as function arguments, Returning objects.

[Unit 2] Operator Overloading, Inheritance and Polymorphism [7 Hours]

Overloading unary and binary operators, Data conversion. Derived and base class, Public and private
inheritance, Levels of inheritance, multiple inheritance Examples.

[Unit 3] Polymorphism [7 Hours]

Virtual functions, Dynamic binding, Abstract classes and pure virtual functions, Friend functions, this pointer.

[Unit 4] Streams and Files [7 Hours]

Streams, Stream output and input, Stream manipulators, Files and streams, Creating, Reading, Updating
sequential and random files.

[Unit 5] Templates, Exception Handling and STL [7 Hours]

Function templates, Overloading function templates, Class templates, Exception handling overview, Need of
exceptions, An exception example, Multiple exceptions, Exception specifications. Standard Template Library
(STL) Introduction to STL-Containers, Iterators, Algorithms, Sequence containers, Associative containers,
Container adapters.

Text Book:

1. E. Balagurusamy, Object Oriented Programming with C++, McGraw-Hill Publication, 6th

Edition, 2013.
Reference Books:
1. Robert Lafore, Object Oriented Programming in C++, Sams Publishing, 4th Edition, 2001.
2. Dr. B. B. Meshram, Object Oriented Paradigms with C++ Beginners Guide for C and C++, SPD
Publication, 1st Edition, 2016.
3. Rajesh R. Shukla, Object-Oriented Programming in C++, Wiley India Publication, 1*Editio,2008
4. Bjarne Stroustrup, The C++ Programming Language, Addison-Wesley Publication, 4th Edition,
2013.
5. P.J. Deitel, H. M. Deitel, C++ How to Program, PHI Publication, 9th Edition, 2012.
6. John Hubbard, Programming with C++, Schaum‘s Outlines, McGraw-Hill Publication, 2nd
Edition, 2000.
7. Nicolai M. Josuttis, Object-Oriented Programming in C++, Wiley Publication, 1st Edition, 2002.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 25

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Elective -1
(B) BTCOC 305: Object Oriented Programming in JAVA

[Unit 1] Introduction to Java Applications [7 Hours]

Introduction, Java Class Libraries, Typical Java Development Environment, Memory Concepts, Arithmetic.
Introduction to Classes and Objects: Introduction, Classes, Objects, Methods and Instance Variables, Declaring
a Class witha 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.

[Unit 2] Control Statements [7 Hours]

Control structures if single-selection statement, if....else double-selection statement, while repetition statement,
do....while repetition statement, swifch 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.

[Unit3]Arrays [7 Hours]
Arrays,declaring and creating arrays in java, examples using arrays, passing arrays to methods,
multidimensional arrays, variable-length argument lists, using command-line arguments.

[Unit 4] Inheritance and Polymorphism in Java [7 Hours]

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

[Unit 5] Exception-handling and Java script [7 Hours]

Exception-handling overview, handling Arithmetic Exceptions and Input Mismatch Exceptions, when to use
exception handling, java exception hierarchy, finally block. Introduction to Java Applets. Java script:
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

Text Book:
1. Paul Deitel and Harvey Detail, Java: How to Program, Pearson's Publication, 9thEdition.

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, 9thEdition.
Patrick Niemeyer, Daniel Leuck, Learning Java, O'Reilly Media, 4th Edition, 2013.
bed

4. -JavaScript: The Good Partsl, Douglas Crockford,

and O‘Reilly, ISBN:
9782744055973.
-Microsoft® .NET: Architecting Applications for the Enterprisell, Microsoft Press; Ist
edition, ISBN:978-0735626096

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 26

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOL306: Data Structure Laboratory

f Experiments:

Write a program to implement stack using arrays.

BN

Write a program to evaluate a given postfix expression using stacks.

Write a program to convert a given infix expression to postfix form using stacks.
Write a program to implement circular queue using arrays.
Write a program to implement double ended queue (dequeue) using arrays.
SR

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.
10. Write a program to implement a stack using a linked list such that the push and pop operations of
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 construct an AVL tree for the given set of keys. Also write function for deleting
a key from the given AVL tree.
13. Write a program to implement hashing with (a) Separate Chaining and (b) Open addressing
methods.
14. Implement the following sorting algorithms: (a) Insertion sort (b) Merge sort (c) Quick sort (d)
Heap sort.
15. Write programs for implementation of graph traversals by applying: (a) BFS (b) DFS.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 27

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Elective —I

BTCOL306: Object Oriented Programming Lab

(a) Object Oriented Programming in C++

List of Experiments:

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

2. Programs on dealing with Arrays.
3. Programs on Classes: String and Math.
4. Programs on Inheritance and Polymorphism.
5 . Programs on Garbage collection, packaging, access Modifiers, as well as static and abstract
modifiers.
6. Programs on Interfaces block initializers, final Modifier, as well as static and dynamic binding.
7. Programs on file handling and stream manipulation.
8. Programs on Dynamic Polymorphism.
9. Programs on Dynamic Memory Management.
10. Programs on Exception Handling.
11. Programs on generic programming using templates.
12. Programs on STL-containers and iterators

(b) Object Oriented Programming in JAVA

List of Experiments:

Programs on Operators, Arithmetic Promotion, Method Calling.

(SRR

Programs on Classes: String and Math.

Write a program to demonstrate 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 simple package.
b) Accessing a package.
¢) Implementing interfaces.
11. Programs on Java script client side scripting.
12. Programs on Java script Operators, Comparisons, Statements, Loops, Events, Objects.
13. Programs on Java script User defined functions.
14. Programs on Java script Validations using object functions.
15. Programs on Java script Validations using regular expressions.
16. Programs on Java script JS document object model, Popovers, Windows.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 28

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Semester —IV (Second Year)

Proposed Scheme w.e.f. January — 2022

BTCOC401 |Design & Analysis of

Algorithms 311 |- 20 | 20 60 | 100 4

BTCOC402 | Operating Systems 3 /1 |- 20 | 20 60 | 100 4

BTHM403 |Basic Human Rights 3 - - 20 | 20 60 | 100
BTBSC404 Pro?aplhty and 3 - |- 20 | 20 60 | 100 3
Statistics
BTES405 |Digital Logic Design
& Microprocessors 3 - 20120 60 | 100 4
BTCOLA406 |Operating Systems &
Python Programming Lab - 4] 60 40 | 100 B
BTCOS407 |Seminar —1II 4 | 60 - 40 | 100 2
BTCOF408 |Field Training / Internship / /Audit to be
Industrial Training —IT - - evaluated in
Evaluation 'V Sem.

*Note: Lecture should be conducted only for Python Programming

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 16

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC401: Design and Analysis of Algorithms

[Unit 1] Introduction to Algorithms [7 Hours]

Definition, Properties of Algorithms, Expressing 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.

[Unit 2] Divide and Conquer [7 Hours]

Introduction, Binary Search, Merge Sort, Quick Sort, Strassen‘s Matrix Multiplication.

[Unit 3] Backtracking [7 Hours]

Backtracking Concept, N-Queens Problem, Four—Queens Problem, Eight—Queen Problem, Hamiltonian Cycle,
Sum of Subsets Problem, Graph Colouring Problem, Branch and Bound: Introduction, Travelling Salesperson
Problem, 15-Puzzle Problem, Comparisons between Backtracking and Branch and Bound.

[Unit 4] Greedy Algorithms [7 Hours]

Introduction to Greedy Technique, Greedy Method, Optimal Merge Patterns, Huffman Coding, Knapsack
Problem, Activity Selection Problem, Job Sequencing with Deadline, Minimum Spanning Tree, Single-Source
Shortest Path Algorithm

[Unit 5] Dynamic Programming [7 Hours]

Introduction, Characteristics of Dynamic Programming, Component of Dynamic Programming, Comparison
of Divide-and-Conquer and Dynamic Programming Techniques, Longest Common Sub-sequence, 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 Book:
1. T. Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition, 2002.

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, SartajSahni, 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

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 29

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC402: Operating Systems

[Unit 1] [7 Hours]
Introduction and Operating system structures: Definition, Types of Operating system, Real-Time operating
system, System Components: System Services, Systems Calls, System Programs, System structure, Virtual
Machines, System Design and Implementation, System Generations.

[Unit 2] [7 Hours]
Processes and CPU Scheduling: Process Concept, Process Scheduling, Operation on process, Inter-process
Communication, Cooperating processes, Threads, Multithreading model, Scheduling criteria, Scheduling
Algorithms, Thread Scheduling, Multiple-Processor Scheduling, Scheduling Algorithms evaluation.

[Unit 3] [7 Hours]
Process Synchronization: The critical-section problem, Critical regions, 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.

[Unit 4] [7 Hours]
Memory Management: Basic concept, Logical and Physical address map, 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).

[Unit 5] [7 Hours]
File Management: File Concept, Access methods, File types, File operation, 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 Book:
1. Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating System Concepts, Wiley
Publication, 8th Edition, 2008.
Reference Books:
1. Andrew S. Tanenbaum, Modern Operating System, PHI Publication, 4th Edition, 2015.
2. D. M. Dhamdhere, Systems Programming and Operating Systems, McGraw-Hill, 2" Edition,
1996.
Garry Nutt, Operating Systems Concepts, Pearson Publication, 3rd Edition, 2003.
w

4. Harvey M. Deitel, An Introduction to Operating Systems, Addison Wesley Publication, 2™

Edition, 1990.
5. Thomas W. Doeppner, Operating System in Depth: Design and Programming, Wiley Publication,
2011.
Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 30
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTHM403: Basic Human Rights

[Unit 1] [6 Hours]
The Basic Concepts: - Individual, group, civil society, state, equality, justice, Human Values, Human rights and
Human Duties: - Origin, Contribution of American bill of rights, French revolution, Declaration of
independence, Rights of citizen, Rights of working and exploited people.

[Unit 2] [6 Hours]
Fundamental rights and economic programme, Society, religion, culture, and their inter relationship, Impact
of social structure on human behavior, Social Structure and Social Problems: - Social and communal conflicts
and social harmony, rural poverty, unemployment, bonded labor.

[Unit 3] [6 Hours]
Migrant workers and human rights violations, human rights of mentally and physically challenged, State,
Individual liberty, Freedom and democracy, NGOs and human rights in India: - Land, Water, Forest issues.

[Unit 4] [6 Hours]
Human rights in Indian constitution and law:- i) The constitution of India: Preamble ii) Fundamental rights iii)
Directive principles of state policy vi)Fundamental duties v) Some other provisions.

[Unit 5] [6 Hours]
Universal declaration of human rights and provisions of India, Constitution and law, National human rights
commission and state human rights commission.

Text Book:
1. Shastry, T. S. N., India and Human rights: Reflections, Concept Publishing Company India (P
Ltd.), 2005.

Reference books:
1. Nirmal, C.J., Human Rights in India: Historical, Social and Political Perspectives (Law in
India), Oxford India

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 31

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTBSC404: Probability and Statistics

[Unit 1] Probability Theory [7 Hours]

Definition of probability: classical, empirical and axiomatic approach of probability, Addition theorem of
probability, Multiplication theorem of probability, Bayes‘theorem of inverse probability, Properties of
probabilities with proofs, Examples.

[Unit 2] Random Variable and Mathematical Expectation [7 Hours]

Random variables, Probability distributions, Probability mass function, Probability density function,
Mathematical expectation, Join and marginal probability distributions, Properties of expectation and variance
with proofs. Theoretical Probability Distributions : Binomial distribution, Poisson 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.

[Unit 3] Correlation [7 Hours]

Introduction, Types of correlation, Correlation and causation, 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.

[Unit 4] Linear Regression Analysis [7 Hours]

Introduction, Linear and non-linear regression, 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.

[Unit 5] Estimation and Hypothesis [7 Hours]

Estimation, Large Sample Estimation of a Population Mean, Small Sample Estimation of a Population Mean,
Large Sample Estimation of a Population Proportion, Sample Size Considerations, Testing Hypotheses, The
Elements of Hypothesis Testing, Large Sample Tests for a Population Mean, The Observed Significance of a
Test, Small Sample Tests for a Population Mean, Large Sample Tests for a Population Proportion.

Text Book:

1. S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House, 7th Revied and Enlarged
Edition, 2016.
Reference Books:
1. G. V.Kumbhojkar, Probability and Random Processes, C. Jamnadas and Co., 14th Edition, 2010.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
3. Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi, 2010.
4. G. Haribaskaran, Probability, Queuing Theory and Reliability Engineering, Laxmi Publications,
2nd Edition, 2009.
5. Murray Spiegel, John Schiller, R. ALU Srinivasan, Probability and Statistics, Schaum's Outlines,
4th Edition, 2013.
6. Kishor S. Trivedi, Probability, Statistics with Reliability, Queuing and Computer Science
Applications, Wiley India Pvt. Ltd, 2nd Edition, 2001.
7. Vijay K. Rohatgi, A. K. Md. Ehsanes Saleh, An Introduction to Probability And Statistics, Wiley

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 32

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Publication, 2nd Edition, 2001.

8. Roxy Peck, Chris Olsen, Jay Devore, Introduction to Statistics and Data Analysis, Third Edition,
Thomson Books/Cole.
9. Ronald Walpole; Raymond Myers; Sharon Myers; Keying Ye, Probability & statistics for
engineers & scientists, 9th edition, Prentice Hall.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 33

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTES405: Digital Logic Design & Microprocessor

[Unit1] Introduction [7 Hours]

Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations, Boolean algebra,
examples of IC gates, Number Systems: binary, signed binary, octal hexadecimal number, binary arithmetic,
one‘s and two‘s complements arithmetic, codes, error detecting and correcting codes.

[Unit 2] Combinational Digital Circuits [7 Hours]

Standard representation for logic functions, K-map representation, simplification of logic functions using K-
map, minimization of logical functions, Don‘t care conditions, Multiplexer, De-Multiplexer / Decoders,Adders,
Subtractors, BCD arithmetic, carry look ahead adder, serial adder, ALU, elementary ALU design, parity checker
/ generator.

[Unit 3] Sequential circuits and systems [7 Hours]

1-bit memory, the circuit properties of Bistable 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, special counter IC‘s, asynchronous sequential counters, applications of
counters.

[Unit 4] Fundamentals of Microprocessors [7 Hours]

Fundamentals of Microprocessor, Comparison of 8-bit, (8085) 16-bit (8086), and 32-bit microprocessors
(80386), The 8086 Architecture: Internal Block Diagram, CPU, ALU, address, data and control bus, Working
registers, SFRs, Clock and RESET circuits, Stack and Stack Pointer, Program Counter, I/O ports, Memory
Structures, Data and Program Memory, Timing diagrams and Execution Cycles.

[Unit 5] 8086 Instruction Set and Programming [7 Hours]

Memory Interfacing, I/O Interfacing, Direct Memory Access (DMA), Interrupts in 8086, 8086 Instruction Set
and Programming: Addressing modes: Introduction, Instruction syntax, Data types, Subroutines Immediate
addressing, Register addressing, Direct addressing, Indirect addressing, Relative addressing, Indexed
addressing, Bit inherent addressing, bit direct addressing, Instruction timings, Data transfer instructions,
Arithmetic instructions, Logical instructions, Branch instructions, Subroutine instructions, Bit manipulation
instruction, Assembly language programs, C language programs, Assemblers and compilers, Programming
and debugging tools.

Text Book:
1. R.P.Jain, Modern Digital Electronics, McGraw Hill Education, 2009.

Reference Books:
1. M. M. Mano, Digital logic and Computer design, Pearson Education India, 2016.
2. Kumar, Fundamentals of Digital Circuits, Prentice Hall India, 2016.
3. Douglas Hall, Microprocessors and Interfacing, McGraw-Hill Publication, Revised 2nd Edition,
2006.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 34

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOLA406: Python Programming

One hour per week is for program demonstration and instruction which can be conducted as a
classroom session or lab session.

[Unit 1] [2 Hours]
Informal introduction to programming, algorithms and data structures, downloading and installing Python, run
a simple program on Python interpreter.

[Unit 2] [2 Hours]
Variables, operations, control flow — assignments, conditionals, loops, functions: optional arguments, default
values, passing functions as arguments.

[Unit 3] [2 Hours]
Statements, Expressions, Strings: String processing. Exception handling, Basic input/output, handling files.

[Unit 4] [2 Hours]
Class and Object, Data Structure: List, Tuple and Sequences, Set, Dictionaries.

[Unit 5] [4 Hours]
Using Database and Structured Query Languages (SQL): SQLite manager, Spidering Twitter using a
Database, Programming with multiple tables, JOIN to retrieve data.

*Programming assignments are mandatory.

Text Book:
1. Michael Urban and Joel Murach, Murach‘s Python Programming, Murach's Publication, 2016.

Reference Books:
1. Charles Severance, Python for Informatics: Exploring Information, University of Michigan,
Version 2.7.0, 2014.
Dr. R. Nageswara Rao, Core Python Programming, Dreamtech Press, 1st Edition, 2016.
Mark Lutz, Learning Python, O'Reilly Media, 5th Edition, 2013.
Mark Pilgrim, Dive into Python 3, A press Publication, 2nd Edition, 2009.
S

Allen B. Downey, Think Python, O'Reilly Media, 2nd Edition, 2012.

Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson Education, 1st Edition, 2006.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 35

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOLA406: Python Programming

List of Experiments:

Program to calculate area of triangle, rectangle, circle

Program to find the union of two lists.

Program to find the intersection of two lists.

Program to remove the -ill th occurrence of the given word in a list where
IS

words repeat.
Program to count the occurrences of each word in a given string sentence.
W

Program to check if a substring is present in a given string.

o

Program to map two lists into a dictionary.

Program to count the frequency of words appearing in a string using a
dictionary.
Program to create a dictionary with key as first character and value as words
starting with that character.
10 Program to find the length of a list using recursion.
11 compute the diameter, circumference, and volume of a sphere using class
Program to read a file and capitalize the first letter of every word in the file.

BTCOLA406: Operating Systems Laboratory

List of Experi .

Hands on Unix Commands

Shell programming for file handling.
Shell Script programming using the commands grep, awk, and sed.
Implementation of various CPU scheduling algorithms (FCES, SJF, Priority).
Implementation of various page replacement algorithms (FIFO, Optimal, LRU).
Concurrent programming; use of threads and processes, system calls (fork and v-fork).
Study pthreads and implement the following: Write a program which shows the performance.
Improvement in using threads as compared with process.(Examples like Matrix Multiplication.
R

Hyper Quick Sort, Merge sort, Traveling Sales Person problem).

. Implementation of Synchronization primitives — Semaphore, Locks and Conditional Variables.
. 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.
Writing utilities and OS performance tuning

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 36

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOS407: Seminar — IT

[Unit 1]
Web Site development Essentials: Overview of Web Design Concepts, Web Project Management
Fundamentals, Web Site Development Process, HTML and the Evolution of Markup languages, HTML basic
tags, Web Page Layout and Elements, Create Hyperlinks, Create Tables, Create Web Forms, Image Inserting
Techniques, Create Frames, GUI HTML Editors, Site Content and Metadata.

[Unit 2]
Cascading Style Sheets: Cascading Style Sheets for Web page design, Creating CSS rules, Format Text with
CSS, Use of CSS Selectors, Embed Style Sheets, and Attach External Style Sheets. Using
CSS with Tables: Insert and Styling Tables, Import Table Data, Style Tables with CSS, Sort Data in Table.

[Unit 3]
Introduction to JavaScript, Variables, Basic in JavaScript — Numbers and operators, Handling text — Strings
in JavaScript, Useful string methods, Arrays, Troubleshooting JavaScript;
Programming fundamentals: If...Else Statements, Else...If Statements, For Loops, While Loops, Breaking Out
Of Loops, Switch Statements, Functions; JavaScript Events, Selecting HTML elements using get Element
BylId().

[Unit 4]
PHP: Basic Syntax, Defining variable and constant, PHP Data type, Operator and Expression, Handling Htm]
Form with PHP: Capturing Form Data, Dealing with Multi-value filed, redirecting a form after submission, PHP
Session.

[Unit 5]
JQuery: Introduction to JQuery, Validation using JQuery, JQuery Forms, JQuery Examples
AJAX: Introduction to AJTAX, PHP with ATAX Introduction to RDBMS: Connection with MySQL Database,
Performing basic database operation (DML)(Insert, Delete, Update, Select)

Suggestive List of Experiments:

1. Design an html form for displaying information using interactive css including images, tables.
2. Create a webpage with HTML describing your department with following specification:
a. Change the background color of the page. At the bottom create a link to take user to the top of
the page.
b. Insert an image and create a link such that clicking on image takes user to other page.
c. Also apply font styling like italics, underline and two other fonts to words you find appropriate.
Also use header tags.
3. Write a JavaScript to design a simple calculator to perform the following operations: sum, product,
difference and quotient.
4. Write a JavaScript to validate the following fields of employee on html form: email, name, mobile no.,
address, salary.
5. Develop and demonstrate a HTML file that includes JavaScript script that uses functions for the
following problems:
a. Parameter: A string
Output: Length of the String
b. Parameter: A number
Output: The number with its digits in the reverse order
6. Develop and demonstrate a HTML file that includes JavaScript for the following problems:
a. Input: A starting and ending number
b. Output: find all the prime numbers between starting and ending number.
7. Write a PHP program to display a digital clock which displays the current time of the server.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 37

 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

8. Write a PHP program to implement sign-In and Sign-out functionality.

9. Write a PHP program to keep track of the number of visitors visiting the Web page and to display this
count of visitors, with proper headings.
10. Write a PHP code to implement AJAX functionality.
11. Write a PHP program to perform search operation on the student records using AJAX.
12. Write a PHP program to sort the student records which are stored in the database using
ascending/descending order.

Text Book:
1. HTML 5 Black Book, Covers CSS 3, JavaScript, XML, XHTML, Ajax, PHP and jQuery, 2ed
(English, Paperback, DT Editorial Services).

Reference Books:
1. Robin Nixon, Learning PHP, MySQL & JavaScript with j Query, CSS & HTMLS5 Paperback
by Orielly Pub.
2. E.Robson, E. Freeman, Head First HTML & CSS, O‘Reilly Media, 2nd Edition, 2012.

Guidelines for Seminar:

1. Each candidate shall deliver a seminar as per the Scheme of Teaching and Examination
for a minimum 35 minutes including questions and answers.
2. Students can choose/propose any topic for web application development.
3. Students can use HTML, CSS, Java Script, AJAX, PHP or any other front-end tool for web
application development.
4. Applications developed must be demonstrated on desktop/laptop as a web based application in
the seminar.
5. A seminar report must be submitted at the end of semester on the base of application developed
and technology used.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 38