# BAMU Revised B.Tech Sem III & IV Syllabus 2021

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

## Revised Syllabus of Second Year (SY) Bachelor of Technology

Computer Science and Engineering (III & IV Semester)

**Dr. Babasaheb Ambedkar Marathwada**

**University, Aurangabad**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021|Marathwada University B.Tech Syllabus Part 2| BAMU Second Year B.Tech Syllabus **

**Marathwada University New Syllabus 2021** is available for Downloading. The latest **BAMU Revised B.Tech Sem III & IV Syllabus 2021** is published by Marathwada University. The students looking for this syllabus can Download the PDF Syllabus from given respective Links. We keep adding More details about this Syllabus on this page. We given below the Details updated new syllabus. Students of BAMU are requested to go though the detail syllabus. You can also download the PDF of syllabus from given link. For More updates keep visiting us.

**Dr. Babasaheb Ambedkar Marathwada University Revised B.Tech Computer Science and Engineering Sem III & IV Syllabus 2021** -Marathwada University B.Tech Computer Science and Engineering Third and Four Semester New Revised Syllabus is given below for Downloading. The students can Download the respective Syllabus from following given details. Just go through the given links & read the given syllabus carefully. Marathwada University Second Year New Semester Online Detail syllabus given below.

**Under Faculty of Science and Technology**

**(Effective from 2020-21 and onwards)**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Minor and Honours Scheme is to be introduced from academic year 2020-21**

Every Department to develop and submit ‘Minor-Courses-List’ of 5-6 Theory courses with Titles and detailed syllabi, separately.

Every Department to develop and submit a ‘Honours-Courses-List’ of 5-6 Theory courses with Titles and detailed syllabi. MOOCs are permitted to be part of the list, so also a few PG courses. Multiple Verticals are encouraged.

The courses from main curriculum should not be in the list of the courses for Minor/Honours.

Host Department to float the courses from Minor/ Honours-List as One/Two in each

Semester (viz. 4th,5th ,6th ,7th,8th semester)

A Student opting for ‘Honours’ will NOT be ENTITLED to register for ‘Minor’.

As per this scheme students will get Minor Degree and Honours along with Degree (Major) which they are pursuing.

Regular learners can complete the B. Tech. degree with 168 credits, for Brighter and interested Students opting Honours/Minor scheme, the UG program would be of 168 + 20 = 188 credits.

The remedial assessment schemes such as Re-examination or summer term will NOT be applicable for Minor or Honors schemes. Student failing in any of the Minor or Honors courses, at any stage will be discontinued from the Scheme.

**01 Minor Degree** Students can select courses from other branches. e.g. If Mechanical Engineering student selects courses from Civil Engineering under this scheme, he/she will get Major degree of Mechanical Engineering with Minor degree of Civil Engineering

**02 Honours** Students can select advanced courses from their respective branch in which they are perusing the

degree. e.g. If Mechanical Engineering student selects advanced courses from same branch under this

scheme, he/she will get Major degree along with Honours of Mechanical Engineering.

**Detailed of this scheme are given below.**

**Minor Degree Scheme:**

Students can select courses from other branches. E.g. If Mechanical Engineering student selects courses from Civil Engineering under this scheme; he/she will get Major degree of Mechanical Engineering with Minor Degree of Civil Engineering.

Student from ANY department is ELIGIBLE to apply for Minor degree from ANY

OTHER DEPARTMENT.

Student can select one course per semester from the list of courses of a branch of which he or she want to peruse Minor Degree.

The Scheme will be started from second year 4th Semester of UG program.

An applicant must have a minimum CGPA of 6.75 (up to 2nd Semester) and for Second Year Direct Admitted Diploma Students, with CGPA of 6.75 or equivalent.

Mentor will be allotted from host departments to guide the students during his/her entire curriculum.

Online courses may be selected from platforms like NPTEL/ edX/ Coursera/ Udacity/ Purdue Next/ Khan Academy/ QEEE/Udemy etc.

While selecting the online course care must be take that it must be a certification course should be of 4/5 credits each as per the syllabus structure.

Lab course/Internship/Mini-project is permitted in Minor Scheme.

**Honours Scheme:**

Students can select advanced courses from their respective branch in which they are perusing the degree. e. g. If Mechanical Engineering student selects advanced courses from same branch under this scheme, he/she will get Major degree along with Honours in Mechanical Engineering. advanced courses from same branch under this

scheme, he/she will get Major degree along with Honours of Mechanical Engineering.

Students from same department are eligible for Honours.

The Scheme will be started from second year 4th Semester of UG program.

An applicant must have a minimum CGPA of 6.00 (up to 2nd Semester) and for Second Year Direct Admitted Diploma Students, with CGPA of 6.00 or equivalent.

Student can select one course per semester from the list of Honor courses of a branch in which they are perusing the degree.

Mentor will be allotted from host departments to guide the students during his/her entire curriculum.

Online courses may be selected from platforms like NPTEL/ edX/ Coursera/ Udacity/ Purdue Next/ Khan Academy/ QEEE/Udemy etc.

While selecting the online course care must be take that it must be a certification course should be of 4/5 credits each as per the syllabus structure.

Lab course/Internship/Mini -project is permitted in Honours Scheme.

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech.**

**(Electronics and Telecommunication, Electrical and Computer Science and Engineering)**

**Semester-III**

**(Circuit Branches)**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Vector and Partial Differential Equation **

**Prerequisite** Basic formulae of Trigonometry, Derivatives and Integration, fundamentals of Vector algebra, knowledge of multiple integrals, partial derivatives, evaluation of real integrals and odd and even function.

**Objectives**

1. To understand basic necessity for the foundation of Engineering & Technology

2. To enhance the mathematical skills and thinking power of students

3. To develop the ability, know the concept of Engineering mathematics and apply these to solve Engineering problem in various field

4. To apply mathematical concepts for solving the practical problem in Engineering and Technology

**Unit-I**

Linear Differential Equation (LDE) & Its Applications Solution of nth order linear differential equation with constant coefficients: Complementary function, Particular integral- short method, method of variation of parameters, Application of LDE to Mechanical systems, Beam and shaft

**Unit-II**

Vector Differentiation Differentiation of vectors, Scalar and Vector point functions, Gradient of a scalar point function, Directional derivative, Divergence and Curl of vector point function, Irrotational and Solenoidal vector fields

**Unit-III**

Vector Integration Line integral, Work done by a force, Surface integral, Green’s theorem, Stokes’s theorem

**Unit-IV**

**Laplace Transform**

Definition, Laplace Transforms of elementary functions, Theorems and properties of Laplace transform (without proof): First shifting and second shifting theorem, Change of scale, Multiplication by t, Division by t, Laplace transform of Derivatives, Laplace transform of integral, Evaluation of integrals using Laplace transform, Laplace transform of Unit step function and Dirac’s delta function, Inverse Laplace transform: Definition, Inverse Laplace transform using:

i. Laplace transform table

ii. Theorem and properties of Laplace transform

iii. Convolution theorem

Application of Laplace transform to solve linear differential equations with given initial conditions

**Unit-V**

**Fourier Transform**

Fourier transform and inverse Fourier transform, Fourier sine and cosine transform, Inverse Fourier sine and cosine transform

**Unit-VI**

Z – Transform

Definition, Z-transform of elementary function, properties of Z-transform (without proof), Inverse Z transform: Partial fraction method, inversion integral method (Residue method), Solution of Difference equation by using Z-transform

**References**

1. Advanced Engineering Mathematics Erwin Kreyszig Wiley eastern Ltd 10th Edition

2. Higher Engineering Mathematics B.V. Ramana Tata McGrawHill 11th Edition

3. Advanced Engineering Mathematics C.R. Wylie McGraw Hill Publications 6th Edition

4. Partial Differential Equations Fritz John Springer 4th Edition

5. Thomas’ Calculus Maurice D. Weir, Joel Hass, Frank R. Giordano Pearson Education 12th Edition

6. Applied Mathematics P. N. Wartikar & J. N. Wartikar Pune Vidyarthi Griha Prakashan,Pune 9th Edition

7. Higher Engineering Mathematics Dr.B.S.Grewal Khanna Publishers 46th Edition

8. Advanced Engineering Mathematics H. K. Dass. S.Chand And Co.Ltd 18th Edition

9. NPTEL, Swyam, edX, Coursera, Khan Academy…etc course related video

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Mathematics& Graph Theory**

**Prerequisite Basic Mathematics.**

**Objectives**

1. To use appropriate sets, relations and functions to understand practical examples.

2. To relate the ideas of mathematical induction to recursion and recursively defined structures.

3. To learn logic and proof techniques to expand mathematical maturity.

4. To apply logic to solve variety of problems

**Unit-I**

**Logic and proofs**

Discrete Mathematics, Significance of Discrete Mathematics in Computer Engineering. Propositional Logic, Application of Propositional Logic, Logical Connectives, Propositional Equivalences, Predicates and Quantifiers, Proof Methods and Strategy, Mathematical Induction.

**Unit-II**

**Sets**

Sets, Subsets, Venn Diagrams, Set Operations, Cardinality of Sets, Finite and Infinite Sets, Uncountable Infinite Sets, Principle of Inclusion and Exclusion

**Unit-III**

**Relations and Functions**

Relations – Definition, Properties of binary relations, N-ary Relations and their Applications, Representing Relations , Closures of Relations, Equivalence Relations, Partial Orderings, partitions, Hasse Diagram, Lattices, Chains and Anti Chains, Recurrence relations. Functions- Surjective, Injective and Bijective functions, Inverse Functions and

Compositions of Functions, The Pigeonhole Principle.

**Unit-IV**

**Counting**

The Basics of Counting, rule of sum and product, Permutations, Combinations, Binomial Coefficients, Generalized Permutations and Combinations, Algorithms for generating Permutations and Combinations.

**Unit-V**

**Graphs**

Basic terminology, multi graphs and weighted graphs, Representation of graph, Operations on Graphs, Hamiltonian and Eulerian paths and circuits, Shortest path Dijkstra’s algorithm, Traveling salesman problem, Factors of a graph, Planer graphs, Graph Coloring. Trees: Introduction, Basic Terminology.

**Unit-VI**

**Algebraic Structures**

The Structure of Algebras, Semigroups, Monoids and Groups, Homomorphism and Normal Subgroups, Rings, Integral Domains and Fields, Polynomial Rings and Polynomial Codes.

**References**

10. Elements of Discrete Mathematics C.L. Liu Tata McGraw-Hill 3rd Edition

11. Discrete Mathematics and its Application Kenneth H. Rosen Tata McGraw-Hill 7th Edition

12. Discrete Mathematics with Applications Susanna S. Epp. Cengage Learning 4th Edition

13. Discrete Mathematics R. Johnsonbaugh Pearson Education 8th Edition

14. Discrete Mathematics with Graph Theory E. Goodaire, M. Parmenter Pearson Education 3rd Edition

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Data structures **

**Prerequisite C++ Programming Language for implementation of data structures**

**Objectives**

1. To understand the importance of data structures in implementing efficient Programs.

2. To implement basic data structures- stack, queue, linked list.

3. To understand various searching and sorting techniques.

4. To study graphs, tree related algorithms and to identify appropriate data structure to solve real world problems.

**Unit-I**

**Introduction to Data Structures:** Concept of Data and Information. Data Type-primitive and non-primitive. Data Structures- Definition, classification, implementation aspects and memory representation, examples, applications, Abstract Data types- basics, importance, ADT representation of various data structures. Introduction to linear data structure- Arrays and its operations.

**Unit-II**

**Stacks and Queues:**

Stack- definition, terminology, memory representation, operations on stack- push, pop, peek, empty, full, implementation using arrays. Applications of stackrecursion, polish and reverse-polish notations- conversion and evaluation. Queues- definition, terminology, memory representation, operations on queue, implementation using array. Types of queues- linear, circular, double ended, priority queue and their applications.

**Unit-III**

**Linked Representation:**

Concept of Dynamic Memory Allocation. Linked List- definition, memory representation, importance, types- singly linked list, doubly linked list, circular linked list. Operations on linked lists. Applications of linked list- polynomial

manipulation. Comparison of various types of linked lists.

**Unit-IV**

**Trees:**

Tree- Basic terminology. Binary tree- definition, types- complete, almost complete, strictly binary tree. Binary search tree- definition, array and linked representation, operations- insertion, deletion, traversal- in-order, pre-order, post- order, levelorder, search. Application of binary search tree. Height Balance Tree (AVL)- Importance, rotations- left, right, left-right, rightleft, constructing an AVL tree, applications.Introduction to B tree, B+ tree, threaded binary tree.

**Unit-V**

**Graphs:**

Graphs- Basic terminology, types of graphs, representing graphs in memory. Graph Traversals- Breadth First Search, Depth First Search. Finding shortest path in graphs- Dijkstra’s algorithm, Bellman Ford algorithm. Minimum Spanning Tree- definition, constructing minimum spanning treeKruskal’s algorithm, Prim’s Algorithm, Application of graphs in real world.

**Unit-VI**

**Sorting and Searching :**

Sorting: Bubble sort, insertion sort, quick sort, heap sort. radix sort, shell sort. Comparison of sorting techniques.

Searching: Linear search, binary search. Hashing- concept, examples, collision, resolving collision, applications of hashing. Indexing.

**References**

1. Data Structures using C and C++. Augenstein and Tenenbaum Langsam. Prentice Hall Second, 2007

2. Data Structures and Program Design in C Robert L. Kruse, Bruce P. Leung. Prentice Hall Second , 1996

3. Data Structures, Algorithms and Object Oriented Programming Gregory L. Heilman Tata Mc Graw-Hill 2002

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Computer Organization & System**

**Prerequisite Basic Digital electronics**

**Objectives**

1. To learn the basics of computer arithmetic.

2. To learn the processor basics and memory Basics

3. To understand system software and their need

4. To understand internal working of system software- assembler, compiler,

interpreter, linker, loader

**Unit-I**

**Introduction:**

Computer organization and Computer Architecture, 1’s and 2’s complement, Sign magnitude representation ,2’s complement addition & subtraction, Booth’s algorithm.

**Unit-II**

**Processor Basics:**

Introduction, Processor organization, Processor Operation, Instruction Cycle, Machine Cycle, T-State, Fetch Decode Execute operation.

**Unit-III**

**Memory Organization:**

Memory Hierarchy Characteristics, Cache Memory, Levels of Cache memory, cache memory main memory mapping techniques, Cache Hit, Cache Miss, virtual memory

**Unit-IV**

**Introduction:**

System software, Need, Types, Components. Evolution of System Software and Operating System, Foundations of system Programming, Machine Structure Elements: Assemblers, Loader, Linker, Translator, Compiler, Interpreter.

**Unit-V**

**Macro Preprocessor and Assembler:**

Macro Instruction Definition and Expansion. One pass, Macro processor Algorithm and data structures, Machine Independent Macro Processor Features. Assembler: Functions, Machine dependent and Machine independent assembler, Assembler design options- Algorithm for Single Pass assembler.

**Unit-VI**

**Compiler & Software tools:**

Compiler :General model, introduction to various phases of compilers, Expressions and Control Structures

Software Tools – Spectrum of software tools, text editors, interpreters, Program generators debug monitors

**References**

1. Computer Architecture & Organization Subrata Ghoshal Pearson publication. second 15

2. Computer Architecture and organization John P. Hayes McGraw Hill publication second

3. Computer Organization Hamachaer and Zaky McGrawHill publication Second

4. System programming and operating system Dhamdhere D. M TMH

5. Introduction to system software Dhamdhere D. M TMH

6. System programming J. J. Donovan McGraw Hill

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Digital Electronics & Microprocessor**

**Prerequisite Basic Digital electronics**

**Objectives**

1. To introduce fundamental concepts of digital electronics, logic gates and number systems.

2. To understand the functionality and design of Combinational and Sequential Circuits

3. To gain understanding of 8086 microprocessor architecture, functionality and assembly language programming.

4. To understand the concept of interfacing of 8086 microprocessor with Peripherals

**Unit-I**

Fundamental of Digital systems: Digital Signal, Digital circuit, Basic & Universal logic gates, EX-OR & EX-NOR operations, examples of IC gates, Boolean algebra, Simplification of Boolean expressions.

**Unit-II**

Number systems: Introduction to number systems, Binary, octal decimal, hexadecimal, binary arithmetic, Number system conversion, one’s & two’s complement arithmetic, Codes & its types, Binary to gray and gray to binary code

conversion.

**Unit-III**

**Combinational & Sequential Logic Circuit:** Sum of product (SOP) form, Product of sum (POS) form, Representation of logical function, Simplification of logical functions, Minimization using K- Map (Upto 4 variables), Quin Mc-Clusky method for minimization. Half Adder, Full Adder, Half Subtractor, Full subtractor, Multiplexers (MUX), De-multiplexers (DEMUX), Decoders. Introduction to Sequential Circuits: Basic Latch, flip-flop & its type, Shift registers, Counters.

**Unit-IV**

**Microprocessor:**

**Fundamentals of Microprocessor:** Comparison of 8-bit, (8085) 16-bit (8086), and 32-bit microprocessors (80386), Comparison of microprocessor & microcontroller. 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, Interrupts. (06 Hrs)

**Unit-V**

**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. Instruction Set: Data transfer instructions, Arithmetic instructions, Logical instructions, Branch instructions, Subroutine instructions, Bit manipulation instruction. Assembler Directives and operators, Assembly language programs

**Unit-VI**

**Peripherals & their Interfacing with 8086 **: Introduction to Interfacing, Memory Interfacing, Programmable Input-Output Port 8255, Modes of operation of 8255, Programmable Communication Interface 8251 USART, Direct Memory Access Controller 8257

**References**

1. Modern Digital Electronics R.P. Jain Tata McGraw Hill 2009

2. Fundamentals of Digital Circuits A. Kumar Prentice Hall India 2016

3. Microprocessors and Interfacing Douglas Hall McGraw-Hill Publication Revised 2nd Edition, 2006.

4. Advanced Microprocessors & Peripherals A.K. Ray & K. M. Bhurchandi Tata McGraw Hill 2nd Edition

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Data Structures Lab**

**Objectives :**

1.To implement basic data structures- stack, queue, linked list using C++

2.To implement tree traversal techniques and operations on binary search tree using C++

3.To implement graph traversal algorithms using C++

4.To implement various searching and sorting techniques using C++

**List of practicals: **

1. Array based implementation of stack and queue.

2. Implementation of Evaluation of expressions.

3. Implementation of Singly and doubly linked list operations.

4. Implementation of stack and queue using linked list.

5. Implementation of Binary tree traversals.

6. Implementation of operations on BST.

7. Implementation of BFS and DFS.

8. Implementation of Quick sort.

9. Implementation of Merge sort.

10. Implementation of linear and binary search.

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Computer Organization and System Software Lab**

**Objectives :**

1. To perform basic integer operations and number system conversions

2. To implement Booth’s algorithm

3. To implement macros

4. To study system software functions

**List of practicals: **

1. To study number conversion systems.

2. Implementation of an integer arithmetic using a virtual lab

3. Implementation of Booths algorithm using a virtual lab.

4. A demo on an instruction cycle Execution

5. To study performance parameters of a computer system

6. To understand the compilation process of a Computer system

7. Write a program to create a macro

8. Write a program to record a macro

9. To study dynamic and static linking process of a computer system

10. Write a macro to perform various operations on the text.

**Dr. Babasaheb Ambedkar Marathwada University, Aurangabad**

**(Faculty of Science & Technology)**

**Syllabus of S. Y. B. Tech. (Computer Science and Engineering) Semester-III**

**BAMU Revised B.Tech Sem III & IV Syllabus 2021**

**Digital Electronics & Microprocessor Lab**

**Objectives : **

1.To demonstrate the concept logic gates, design of combinational and sequential logic circuits

2.To use addressing modes & instruction set to implement different assembly language programs

**List of practicals:**

1.Implementation of Boolean expression using AND/OR/NOT & NAND/NOR logic.

2.Realization of Half & Full Adder using logic gates.

3.Realization of Half & Full Subtractor using logic gates.

4. Design & Implement 8:1 Multiplexer and 1:8 De-multiplexer using logic gates.

5. Demonstrate the working of flip-flop.

6.Write an Assembly language program to print the string in 8086.

7.Write an Assembly language program for 8-bit & 16-bit addition in 8086.

8.Write an Assembly language program for 8-bit &16-bit subtraction in 8086.

9.Write an Assembly Language Program for 8-bit multiplication & 16-bit division in 8086.

10.Write an Assembly Language Program for finding smallest number from an array in 8086.