SVKM’s Narsee Monjee Institute of Management Studies

Mukesh Patel School of Technology Management & Engineering

Program: B Tech (All program except CSBS, CSDS), MBA Semester : III / IV / VII /VIII
Tech Mechanical and Computer, B Tech Integrated
Mechanical and Computer
Course: Complex Variables and Transforms Code: 702BS0C057
Teaching Scheme Evaluation Scheme
Lecture Practical Tutorial Internal Continuous Term End
(Hours (Hours per (Hours Credit Assessment (ICA) Examinations(TEE)
per week) week) per week) (Marks - 50) (Marks- 100)
3 0 1 4 Marks Scaled to 50 Marks Scaled to 50
Pre-requisite: Calculus, Linear Algebra and Differential Equations
Course Objective
This course aims to instil in students an understanding of Complex Variables, Laplace
Transforms, Fourier series, Fourier Transforms and their applications. It equips the students
with mathematics
fundamentals necessary to formulate, solve and analyse complex engineering problems.
Course Outcomes
After completion of the course, the student will be able to -
1. demonstrate understanding of the concepts of Complex variables, Laplace Transforms,
Fourier series and Fourier Transforms
2. solve problems based on complex variables, Laplace Transforms, Fourier series and
Fourier Transforms
3. apply the techniques of Complex variables, Laplace Transforms, Fourier series and
Fourier
Transforms to solve engineering problems
Detailed Syllabus
Unit Description Duration
1 Complex Variables – Differentiation
Complex differentiation, Cauchy-Riemann equation, analytic functions,
07
harmonic functions, harmonic conjugate, Elementary analytic functions
(exponential, trigonometric, logarithmic functions), Conformal mappings:
definition and problems, Mobius transformation and their properties.
2 Complex Variables – Integration
Contour Integrals: definition and problems, Cauchy-Goursat theorem, Cauchy 08
Integral formula, Zeros and singularities of analytic functions, Taylor’s series,
Laurent’s series, Residues, Cauchy Residue theorem.
3 Laplace Transforms
Definition of Laplace Transform, Laplace Transform of 1, eat , sin at, cos at, sinh

at, cosh at, t n , Properties of Laplace Transforms: Linearity property, First and
second
n
shifting theorems of Laplace Transform, Change of scale property, L t f t
11
,
f t t
n
L ,L f t ,L f u du , Evaluation of Inverse Laplace Transform
by t
0
partial fraction, Convolution theorem, Laplace Transforms of Periodic
functions, Unit step functions, Dirac delta functions.
Applications: Evaluation of Integrals using Laplace Transforms, Solving initial
and boundary value problems involving ordinary differential equations.
AY 2024-25
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

4 Fourier Series
Orthogonality and Orthonormality, Periodic function, Trigonometric Series,
Dirichlet’s conditions, Euler’s formulae (Derivative of Fourier coefficients a0, an ,bn
is not expected), Fourier Series of Functions for the interval [ , 2 ] and [ , 12
2c]
, Functions having points of discontinuity, Even and odd functions, half range
sine and cosine expansions, Complex form of Fourier Series.
Applications: Applications to Wave equation, Heat equation and Laplacian
equation.
5 Fourier Transforms
Fourier integral theorem, Fourier sine and cosine integral. Fourier Transform,
Fourier Sine Transform, Fourier Cosine Transform, Properties of Fourier
07
Transforms (Linearity property, Change of scale property, Shifting property),
Inverse Fourier Transform, Inverse Fourier Sine Transform, Inverse Fourier Cosine
Transform, Finite Fourier Transform.
Applications: Solving differential equations using Fourier Transforms.
Total 45
Text Books
1. B. V. Ramana, Higher Engineering Mathematics, 1st Edition, McGraw Hill Education, 2017.
2. T. Veerarajan, Engineering Mathematics, 3rd Edition, McGraw Hill Education, 2007.
Reference Books
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley India, 2017.
2. B. S. Grewal, Higher Engineering Mathematics, 44th Edition, Khanna Publishers, 2017.
3. James Ward Brown, Ruel V. Churchill, Complex Variables and Applications, 8th Edition,
McGraw Hill Education”, 2014.
Tutorial Work
Minimum Ten Tutorial exercises based on the syllabus.

Signature
(Prepared by Concerned Faculty/HOD)

AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Program: B Tech /MBA Tech (Computer Engineering /IT) Semester: IV/III/VIII

B Tech ( AI & ML, Cyber Security, CSBS)
BTI Computer Engineering
Course: Computer Organization and Architecture Code: 702CO0C023
Teaching Scheme Evaluation Scheme
Lecture Practical Tutorial
(Hours (Hours (Hours Credit Internal Continuous Term End
per per per Assessment (ICA) Examinations (TEE)
week) week) week) (Marks- 50) (Marks- 100)

3 0 0 3 Marks Scaled to 50 Marks Scaled to 50

Prerequisite: NA
Course Objective
To provide knowledge of the basic principles of the organization, operation and performance
of modern day computer systems and the underlying semiconductor circuit architectures
used to construct parallel computer components.
Course Outcomes: After completion of the course, student will be able to -
1. Discuss the functional blocks of computers and the interconnections
2. Evaluate the memory system
3. Explain the components of the Central Processing Unit
4. Describe Input Output and Parallel Organization
Detailed Syllabus
Unit Description Duration
1 Overview 03
General Organization and architecture, Structural/functional
view of a computer, Computer Functional Components.

2 System Buses 06
Overview of basic instruction cycle, Interrupts, Bus
interconnection, Elements of bus design, Read and write timings
diagram, Bus hierarchy, Bus arbitration techniques.
3 Memory Organization 10
Internal Memory- Memory characteristics and memory
hierarchy. Cache Memory- Elements of cache design, Address
mapping and Translation-Direct mapping, Address mapping and
translation- Associative mapping, Address mapping and
translation -Set associative mapping, Performance characteristics
of two level memory, Semiconductor main memory- Types of
RAM, DRAM and SRAM, Chip logic, Memory module

Signature
(Prepared by Concerned Faculty/HOD) AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

organization. High speed memories- Associative memory, High

speed memories- Interleaved memory.
4 Data path Design 09
IEEE 754 data format, IEEE 754 data format numerical, Design of
serial and parallel adder and subtractor, Booth’s algorithm, ALU
-Combinational and sequential ALU. Block diagrams of high
speed adders multipliers, Block diagrams of high speed
multipliers, Overview of math coprocessor.
5 Central Processing Unit 06
Basic Instruction Cycle and Instruction set, Formats and
addressing, Processor Organization and Register Organization,
Instruction Pipelining, Co-processors, Pipeline processors, RISC
and CISC computers.
6 Control Unit and Peripheral Devices 09
Control Unit- Micro Operations, Hardwired Implementations,
Micro Programmed control, Micro instruction format and
applications of microprogramming, I/O modules- Programmed
I/O, I/O modules-Interrupt Driven I/O, DMA.I/O processors
and channels, General-Purpose Graphics Processing Unit, GPU
applications, synchronization, coherence.
7 Multiprocessor Processor Organizations 02
Flynn’s classification of parallel processing Systems, Superscalar
Processors.
Total 45
Text Books
1. William Stallings, Computer Organization and Architecture: Designing and Performance,
Prentice Hall, 11th Edition, Pearson Education, 2022.
2. John P. Hayes Mc-Graw Hill, Computer Architecture and Organization, 2nd Edition, 2010.
ISBN-13 : 978-1259028564
3. Morris Mano, Computer System Architecture, PHI, 3rd Edition, Pearson Education,
2017.
Reference Books:
1. Andrew Tannenbaum, Structured Computer Organization, 6th Edition, PHI, Pearson
Education, 2016.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig “Computer Organization and
Embedded Systems “ 6th Edition, 2023.

Signature
(Prepared by Concerned Faculty/HOD) AY 2024-25
 SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering

Program: B Tech/MBA Tech Semester : IV/ V/VII /VIII

(Computer Engineering, Artificial Intelligence)
B Tech (CSBS, Computer Science)
BTI Computer Engineering
Course: Design and Analysis of Algorithms Code: 702CO0C010

Teaching Scheme Evaluation Scheme

Lecture Practical Tutorial
Internal Continuous Term End
(Hours (Hours (Hours
Credit Assessment (ICA) Examinations (TEE)
per per per
(Marks-50) (Marks -100 )
week) week) week)
2 2 0 3 Marks Scaled to 50 Marks Scaled to 50
Pre-requisite: Programming for Problem Solving, Data Structures, Discrete Mathematics
Course Objective
Objective of this course is to demonstrate a familiarity with major algorithm design paradigm.
Analyze the asymptotic performance of algorithms and Devise efficient algorithms in common
engineering design situations.
Course Outcomes-
After completion of the course, student will be able to -
1. Understand the space-time complexity of an algorithm
2. Evaluate divide and conquer approach of algorithm design
3. Apply greedy technique of algorithm design
4. Analyze dynamic programming and Backtracking algorithm design paradigm.
Detailed Syllabus
Unit Description Duration
1. Introduction
What is Algorithms, types of Algorithms: greedy, divide & conquer,
04
backtracking, etc. Analysis of Algorithms complexity. Introduction of P,
NP, NP Complete and NP hard problems.
2. Analysing the Algorithms
Time and Space Complexity of Algorithms, Asymptotic notations,
Asymptotic order, Properties of big oh, big omega, and big theta,
06
Classifying functions by their asymptotic growth rates, Best case, average
Case and worst case analysis. Master’s Theorem and Substitution
Method, Recursion Tree Method.
3. Divide and Conquer Technique
04

Signature
(Prepared by Concerned Faculty/HOD) AY 2024-25
 SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering

The general method, control abstraction for divide and conquer, Finding
the maximum and minimum: straightforward and recursive algorithm,
Merge sort, Quick sort.
4. Greedy Technique
The general method, control abstraction, Optimal storage on tapes, 05
Knapsack problem, Job sequencing with deadlines, Optimal merge
patterns, Huffman code.
5. Dynamic Programming
The general method, principle of optimality, Multistage graphs, Single 08
source shortest path - Bellman Ford algorithm, 0/1-knapsack, Matrix
Chain multiplication, Longest Common Subsequence problem.
6. Backtracking 03
The general method, The n–queens problem, Sum of subsets, Graph
coloring.
Total 30

Text Books:
1. Ellis Horowitz, and Sartaj Sahani, Fundamentals of Computer Algorithms,
2nd Edition, University Press, 2008.
2. Thomas H. Cormen, Charles E., Leiserson, Ronald L. Rivest, Introduction to
Algorithms, 2nd Edition, PHI Learning, 2010.
Reference Books:
1. Sara Baase and Alan Van Gelder, Computer Algorithms Introduction to
Design and Analysis, 3rd Ed, Pearson Education, 2002 ISBN-13 : 978-8131702444
2. Aho, Hopcroft and Ullman, Data Structures and Algorithms, Addison-
Wesley, Pearson Education 2000. ISBN-13 : 978-8178081021
Laboratory Work
8 to 10 experiments (and a practicum where applicable) based on the syllabus

Signature
(Prepared by Concerned Faculty/HOD) AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Program: B Tech/ MBA Tech (Computer Semester: IV/III/ /VIII

Engineering) / B Tech (CSBS, Computer
Science)
BTI Computer Engineering
Course: Theoretical Computer Science Code:702CO0C011
Teaching Scheme Evaluation Scheme
Internal
Lecture Practical Tutorial Continuous Term End
Hours Hours Hours Assessment Examinations (TEE)
Credit
per per per (ICA) (Marks- 100 )
week week week (Marks - 50)

Marks Scaled to Marks Scaled to 50

2 0 1 3 50

Pre-requisite: Data Structures

Course Objective
To introduce fundamental principle of automata theory and formal
languages. To understand various types of automata and their
relationships.
Course Outcomes- After successful completion of the course, student will
be able to-
1. Understand the concepts of Automata theory and formal language,
2. Identify different formal language classes and their relationships,
3. Design grammars and recognizers for different formal languages.
Detailed Syllabus
Unit Description Duration
Introduction to Automata theory: Basic concepts of 03
String, Formal languages, Chomsky hierarchy, Grammar
1.
and its type – Type 0, 1, 2 and 3, Derivation Tree,
Application of the subject in complier construction
Finite State Machine & Regular Set: Concept of DFA, 08
NFA, E p si lo n NF A , Converting NFA to Minimized
2. DFA, Regular Expressions, DFA to R. E Conversion,
Regular language, Closure properties & Pumping
Lemma for regular sets

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III / AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Moore and Mealy machine: Designing of Mealy machine 03

3. and Moore machine, Conversion from Mealy to Moore and
Moore to Mealy

Context Free Grammar: Basic concept of Context Free 05

4. Grammar and Language, Ambiguous CFG, Simplification
of CFG, Chomsky's Normal Form, Griebach Normal Form.
Push Down Automata: Tuples and elements in PDM, 05
5. Design of PDA for CFL, Power of PDA over FSM, Closure
Properties of CFL
6. Turing Machine: Turing Machine Definition, Examples 06
of TM designing, Recursive and recursively enumerable,
Universal Turing machine, Church Turing Hypothesis,
Halting problem, Power of TM over PDA
Total 30
Text Books:
1. Peter Linz, Narosa, "Introduction to Formal Languages and Automata",
6 th Edition, 2016.
2. Vivek Kulkarni, "Theory of Computation", Oxford, 1st Edition,
2013.
Reference Books:
1. J .E. Hopcrof t, J.D. Ullman, Motwani, "Introduction to Automata theory,
Languages and Computation", 3rd Edition, Pearson Education, 2008.
2. Michael Sipser, Introduction to the Theory of Computation, 3rd edition,
Cengage Learning, 2013.
Laboratory/ Tutorial Work
8 to 10 tutorials based on the syllabus.

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III / AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Program: B Tech/ MBA Tech (Computer Engineering) / Semester: IV/ VIII

B Tech Computer Science/ BTI Computer Engineering
Course: Object Oriented Programming through JAVA Code: 702CO0C038

Teaching Scheme Evaluation Scheme

Internal
Tutorial Continuous Term End
Lecture Practical
Hours Assessment Examinations
Hours per Hours per Credit
per (ICA) (Marks - (Marks- 50)
week week
week 50 )

Marks Scaled to Marks Scaled to 50

0 2 0 1 50

Pre-requisite: Programming for Problem Solving

Course Objective
To develop the abilities for object-oriented programming using Java, to gain knowledge of
the basic data structures supported by Java, concepts of object-oriented programming,
exception handling, graphical user interface and collection framework in Java.
Course Outcomes: After successful completion of this course, student will be able to -
1. Understand java programming fundamentals
2. Write program using object-oriented programming concepts
3. Use exception handling and collection framework in Java
4. Design graphical user interface
Detailed Syllabus:
Unit Description Duration
Introduction to object-oriented programming 02
1. Features of object-oriented programming, datatypes,
variables, literals, operators, constants, identifiers.
Control Statements 02
2.
selection statements, Iterations, Jump statements.
OOP’s concept 07
Class, methods, objects, constructor, polymorphism-method
3.
overloading, encapsulation, access modifiers, packages,
introduction to string & string buffer.
Inheritance in Object Oriented design 07
Types of inheritance, method overriding, abstraction-
4.
abstract class, abstract method, Introduction to interfaces,
implementing interface, keywords-super, final. JS3 pages.
5. Exception handling 02

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III / AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

What is exception handling, Difference between exception

and error, try, catch, finally, throw, throws, finally.
Spring 06
MVC Architecture using spring, Containers- JFrame, JApplet,
6. JWindow, JDialog, JPanel, Controlling Layout, Event
Handling.

Collection Framework Overview 04

The Collection Interfaces-List interface, set interfaces, The
7.
Collection Class- The Array List, The Linked List, accessing a
collection- using an Iterator and For-each loop.
Total 30
Text Books:
1. R. Nageswara Rao, Core Java: An Integrated Approach, New: Includes All Versions upto Java
8, Dreamtech Press ,1st January 2016.
Reference books
1. E Balaguruswamy, Programming with Java, 6th edition, Tata McGraw Hill,2019.
2. Herbert Schildt, Java The Complete Reference - Eleventh Edition, McGraw Hill, 11th
edition.
Laboratory / Tutorial work
8 to 10 experiments (and a practicum where applicable) based on the syllabus.

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III / AY 2024-25
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Program: B Tech / MBA Tech (Computer Semester: IV /VIII

Engineering)
BTI Computer Engineering
Course: Microprocessor and Microcontroller Code-702CO0C009
Teaching Scheme Evaluation Scheme
Internal
Lecture Continuous Term End
Practical Tutorial
Hours Assessment Examinations (TEE)
Hours per Hours Credit
per (ICA) (Marks- 100 )
week per week
week (Marks - 50)

Marks Scaled to Marks Scaled to 50

3 2 0 4 50

Pre-requisite: Digital Logic Design, Computer Organization and Architecture

Course Objective
Introduction on architecture of 8086 and 8051.To cover different instruction set and
addressing modes in 8086 and 8051 to develop programs for desired microprocessor and
microcontroller
Course Outcomes- After successful completion of this course, student will be able to
1. Understand the architectural design of 8086 along with its features,
2. Design Interfacing of 8085 with peripherals and develop programs for 8086,
3. Analyze the architectural design of 8051 and develop programs for 8051 using
instruction set,
4. Understand the key features of advanced microcontroller and
microprocessor.
Detailed Syllabus:
Unit Description Duration
Intel 8086/8088 microprocessor family: 08
Feature of 8086 Architecture and programming model of 8086,
1. Microprocessor family Latches 8282, clock generator 8284,
Transceiver 8286. Min and Max Mode Timing diagram of 8086,
8288 bus controller.
Programming of 8086: 06
Introduction, Addressing Modes, Instruction sets of 8086,
2.
Assembly language programming, Assembler Directive,
Passing parameter to Procedure and Macro.
8086 Interrupt Structure: 06
3. Instruction, Hardware software and program generated
interrupts in 8086. Response to interrupt, Interrupt vector

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III AY 2024-25 /
 SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Table, Interrupt acknowledge machine cycle, 8259 PCI, EOI,

and interfacing with 8086.
8087 Math Co-processor: 05
4. Study of architecture of 8087, architecture of NIC
architecture of 8087. Data type Supported by 8087.
Introduction and Hardware of 8051 Microcontrollers: 08
Comparison of microprocessor and microcontroller,
architecture and pin functions of 8051 chip controller, CPU
5.
timing and machine cycles, internal memory Organization,
program counter and stack, input/output ports, counters and
timers, Serial data input and output interrupts
8051 Assemble language programming: 07
Introduction to 8051 Assembly programming, Data Types
and directives, 8051 flag bits an PSW register. Register banks
and stack. Jump loop and call instructions, I/O Port
6.
Programming: Addressing modes and accessing memory
using various addressing modes. Arithmetic instructions and
programs, Logic instructions and programs, Timer/counters
of 8051
Introduction to Advanced Microprocessor and 05
Microcontrollers:
7. Introduction to Arduino-features, types, basic Architecture
Overview on advanced processor and controller used in
Industry
Total 45
Text Books:
1. Badri Ram, “Advanced Microprocessors and Interfacing”, 3rd Edition, Tata McGraw
Hill Publication, 2018.
2.Muhammad Ali Mazidi, “Microcontroller & Embedded system”, 2nd Edition, Prentice
Hall publication, 2011.
Reference Books:
1. Douglas Hall, “Microprocessors Interfacing and Programming”, Tata McGraw Hill
publication, 2017.
2. Raj Kamal , “Microcontrollers-architecture, programming, Interfacing and system
design”, 2nd Edition, Pearson publication, 2012.
Laboratory/ Tutorial Work
8 to 10 experiments (and a practicum where applicable) based on the syllabus

Signature
(Prepared by Concerned Faculty/HOD)
B. Tech. AI / Semester-III AY 2024-25 /