0% found this document useful (0 votes)
6 views5 pages

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 is divided into units that detail specific subjects and concepts, along with practical experiments and assignments. The curriculum emphasizes both theoretical knowledge and practical skills through a series of structured units and lab sessions.

Uploaded by

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

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 is divided into units that detail specific subjects and concepts, along with practical experiments and assignments. The curriculum emphasizes both theoretical knowledge and practical skills through a series of structured units and lab sessions.

Uploaded by

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

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.

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).

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


DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
[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.

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.

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.

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


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.

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

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


DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
4 Program to remove the ―i‖ th occurrence of the given word in a list where 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.
9 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


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
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().

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


DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
[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.
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.
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 5

You might also like