0% found this document useful (0 votes)
17 views9 pages

Sem Iv Syllabus

The document outlines the curriculum for various courses at Dr. Babasaheb Ambedkar Technological University, covering topics such as algorithms, operating systems, human rights, probability and statistics, digital logic design, microprocessors, and Python programming. Each course includes detailed units with specific learning objectives and recommended textbooks and reference materials. The curriculum is designed to provide a comprehensive understanding of each subject area, preparing students for practical applications in their respective fields.

Uploaded by

maskman080603
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views9 pages

Sem Iv Syllabus

The document outlines the curriculum for various courses at Dr. Babasaheb Ambedkar Technological University, covering topics such as algorithms, operating systems, human rights, probability and statistics, digital logic design, microprocessors, and Python programming. Each course includes detailed units with specific learning objectives and recommended textbooks and reference materials. The curriculum is designed to provide a comprehensive understanding of each subject area, preparing students for practical applications in their respective fields.

Uploaded by

maskman080603
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

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, 2nd Edition,
1996.
3. Garry Nutt, Operating Systems Concepts, Pearson Publication, 3rd Edition, 2003.
4. Harvey M. Deitel, An Introduction to Operating Systems, Addison Wesley Publication, 2nd
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

BTCOL406: 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.
2. Dr. R. Nageswara Rao, Core Python Programming, Dreamtech Press, 1st Edition, 2016.
3. Mark Lutz, Learning Python, O'Reilly Media, 5th Edition, 2013.
4. Mark Pilgrim, Dive into Python 3, A press Publication, 2nd Edition, 2009.
5. Allen B. Downey, Think Python, O'Reilly Media, 2nd Edition, 2012.
6. 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

BTCOL406: Python Programming


List of Experiments:

1 Program to calculate area of triangle, rectangle, circle


2 Program to find the union of two lists.
3 Program to find the intersection of two lists.
Program to remove the ―i‖ th occurrence of the given word in a list where
4
words repeat.
5 Program to count the occurrences of each word in a given string sentence.
6 Program to check if a substring is present in a given string.
7 Program to map two lists into a dictionary.
Program to count the frequency of words appearing in a string using a
8
dictionary.
Program to create a dictionary with key as first character and value as words
9
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
12 Program to read a file and capitalize the first letter of every word in the file.

BTCOL406: Operating Systems Laboratory

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

[Unit 4]
PHP: Basic Syntax, Defining variable and constant, PHP Data type, Operator and Expression, Handling Html
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 AJAX, PHP with AJAX 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

You might also like