Digital Image processing

Topic: Advances in Digital Image processing

Couse: MTECH

Sem: 1

--------------------------------------------------------------------------------------------------------

Text book: Click here to download

---------------------------------------------------------------------------------------------------------

Computer Networks II

Topic: Computer Networks II

Sem: 6

Syllabus:

Subject Code: 10CS64                                                                        I.A. Marks : 25
Hours/Week : 04                                                                                 Exam Hours: 03
Total Hours : 52                                                                                   Exam Marks: 100
                                                             PART - A
UNIT - 1 6 Hours
Packet Switching Networks - 1: Network services and internal network operation, Packet network topology, Routing in Packet networks, Shortest path routing: Bellman-Ford algorithm.

UNIT – 2 6 Hours
Packet Switching Networks – 2: Shortest path routing (continued), Traffic management at the Packet level, Traffic management at Flow level, Traffic management at flow aggregate level.

UNIT – 3 6 Hours
TCP/IP-1: TCP/IP architecture, The Internet Protocol, IPv6, UDP.

UNIT – 4 8 Hours
TCP/IP-2: TCP, Internet Routing Protocols, Multicast Routing, DHCP, NAT and Mobile IP.

                                                             PART – B
UNIT - 5 7 Hours
Applications, Network Management, Network Security: Application layer overview, Domain Name System (DNS), Remote Login Protocols, E-mail, File Transfer and FTP, World Wide Web and HTTP, Network management, Overview of network security, Overview of security methods, Secret-key encryption protocols, Public-key encryption protocols, Authentication,
Authentication and digital signature, Firewalls.

UNIT – 6 6 Hours
QoS, VPNs, Tunneling, Overlay Networks: Overview of QoS, Integrated Services QoS, Differentiated services QoS, Virtual Private Networks, MPLS, Overlay networks.

UNIT - 7 7 Hours
Multimedia Networking: Overview of data compression, Digital voice and compression, JPEG, MPEG, Limits of compression with loss, Compression methods without loss, Overview of IP Telephony, VoIP signaling protocols, Real-Time Media Transport Protocols, Stream control Transmission Protocol (SCTP)

UNIT – 8 6 Hours
Mobile AdHoc Networks and Wireless Sensor Neworks: Overview of Wireless Ad-Hoc networks, Routing in AdHOc Networks, Routing protocols for and Security of AdHoc networks, Sensor Networks and protocol structures, Communication Energy model, Clustering protocols, Routing protocols, ZigBee technology and 802.15.4.
---------------------------------------------------------------------------------------------------------------------------------------------------------
Text Books:
1. Communication Networks – Fundamental Concepts & key architectures, Alberto Leon Garcia & Indra Widjaja, 2nd Edition, Tata McGraw-Hill, India (7 - excluding 7.6, 8) Click to download

2. Computer & Communication Networks, Nadir F Mir, Pearson Education, India (9, 10 excluding 10.7, 12.1 to 12.3, 16, 17.1 to 17.6, 18.1 to18.3, 18.5, 19, 20)

-------------------------------------------------------------------------------------------------------

Operations Reasearch

Topic: Operations Reasearch

Sem: 6

Syllabus:

Subject Code: 10CS661                                                               I.A. Marks : 25
Hours/Week : 04                                                                          Exam Hours: 03
Total Hours : 52                                                                            Exam Marks: 100
                                                        PART - A
UNIT – 1 6 Hours
Introduction, Linear Programming – 1: Introduction: The origin, nature and impact of OR; Defining the problem and gathering data; Formulating a mathematical model; Deriving solutions from the model; Testing the model;
Preparing to apply the model; Implementation . Introduction to Linear Programming: Prototype example; The linear
programming (LP) model.

UNIT – 2 7 Hours
LP – 2, Simplex Method – 1: Assumptions of LP; Additional examples. The essence of the simplex method; Setting up the simplex method; Algebra of the simplex method; the simplex method in tabular form; Tie breaking in
the simplex method

UNIT – 3 6 Hours
Simplex Method – 2: Adapting to other model forms; Post optimality analysis; Computer implementation Foundation of the simplex method.

UNIT – 4 7 Hours
Simplex Method – 2, Duality Theory: The revised simplex method, a fundamental insight.
The essence of duality theory; Economic interpretation of duality, Primal dual relationship; Adapting to other primal forms
 

                                                                        PART - B
UNIT – 5 7 Hours
Duality Theory and Sensitivity Analysis, Other Algorithms for LP : The role of duality in sensitive analysis; The essence of sensitivity analysis;Applying sensitivity analysis. The dual simplex method; Parametric linear programming; The upper bound technique.

UNIT – 6 7 Hours
Transportation and Assignment Problems: The transportation problem; A streamlined simplex method for the transportation problem; The assignment problem; A special algorithm for the assignment problem.

UNIT – 7 6 Hours
Game Theory, Decision Analysis: Game Theory: The formulation of two persons, zero sum games; Solving simple games- a prototype example; Games with mixed strategies; Graphical solution procedure; Solving by linear programming, Extensions.
Decision Analysis: A prototype example; Decision making without experimentation; Decision making with experimentation; Decision trees.

UNIT – 8 6 Hours
Metaheuristics: The nature of Metaheuristics, Tabu Search, Simulated Annealing, Genetic Algorithms.

-----------------------------------------------------------------------------------------------------------------------------------------------------
Text Books:
1. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research: Concepts and Cases, 8th Edition, Tata McGraw Hill, 2005.
(Chapters: 1, 2, 3.1 to 3.4, 4.1 to 4.8, 5, 6.1 to 6.7, 7.1 to 7.3, 8, 13, 14, 15.1 to 15.4)

Click here to download

----------------------------------------------------------------------------------------------------

Question papers: Click here to download 1 

                           Click here to download 2

MANAGEMENT AND ENTREPRENEURSHIP

Topic: MANAGEMENT AND ENTREPRENEURSHIP

Sem :6

Subject Code: 10AL61

-----------------------------------------------------------

Notes: Click to download

Notes 2: Click to download

------------------------------------------------------------------------------------------

Compiler Design

Topic : Compiler Design

Sem : 6

Syllabus

COMPILER DESIGN
Subject Code: 10CS63                                                                           I.A. Marks : 25
Hours/Week : 04                                                                                     Exam Hours: 03
Total Hours : 52                                                                                      Exam Marks: 100
                                                                PART – A
UNIT – 1 8 Hours
Introduction, Lexical analysis: Language processors; The structure of a Compiler; The evolution pf programming languages; The science of building a Compiler; Applications of compiler technology; Programming language
basics. Lexical analysis: The Role of Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.
 

UNIT – 2 6 Hours
Syntax Analysis – 1: Introduction; Context-free Grammars; Writing a Grammar. Top-down Parsing; Bottom-up Parsing.

UNIT – 3 6 Hours
Syntax Analysis – 2: Top-down Parsing; Bottom-up Parsing.

UNIT – 4 6 Hours
Syntax Analysis – 3: Introduction to LR Parsing: Simple LR; More powerful LR parsers (excluding Efficient construction and compaction of parsing tables) ; Using ambiguous grammars; Parser Generators.

                                                                                     PART – B
UNIT – 5 7 Hours
Syntax-Directed Translation: Syntax-directed definitions; Evaluation orders for SDDs; Applications of syntax-directed translation; Syntax-directed translation schemes.

UNIT – 6 6 Hours
Intermediate Code Generation: Variants of syntax trees; Three-address code; Translation of expressions; Control flow; Back patching; Switchstatements; Procedure calls.

UNIT – 7 6 Hours
Run-Time Environments : Storage Organization; Stack allocation of space; Access to non-local data on the stack; Heap management; Introduction to garbage collection.

UNIT – 8 7 Hours
Code Generation: Issues in the design of Code Generator; The Target Language; Addresses in the target code; Basic blocks and Flow graphs; Optimization of basic blocks; A Simple Code Generator

------------------------------------------------------------------------------------------------------------------------------
Text Books:
1. Alfred V Aho, Monica S.Lam, Ravi Sethi, Jeffrey D Ullman: Compilers- Principles, Techniques and Tools, 2nd Edition, Pearson Education, 2007.
(Chapters 1, 3.1 to 3.4, 4 excluding 4.7.5 and 4.7.6, 5.1 to 5.4, 6.1,
6.2, 6.4, 6.6, 6.7 to 6.9, 7.1 to 7.5, 8.1 to 8.6.)

Click to download

----------------------------------------------------------------------------------------------------

Unix and Shell Programming

Topic:  Unix and Shell Programming
Sem: 4

Syllabus

------------------------------------------------------------------------------------------
Notes:

Unix operating system, architecture and file system : Click here
Basic file attributes, vi editor : Click Here
Vi editor : Click Here

Some useful questions : Click here

DESIGN AND ANALYSIS OF ALGORITHMS

Topic: DESIGN AND ANALYSIS OF ALGORITHMS

Sem: 4

Syllabus:
Subject Code: 10CS43                                                           I.A. Marks : 25
Hours/Week : 04                                                                     Exam Hours: 03
Total Hours : 52                                                                      Exam Marks: 100
                                                    PART – A
UNIT – 1 7 Hours
INTRODUCTION: Notion of Algorithm, Review of Asymptotic Notations, Mathematical Analysis of Non-Recursive and Recursive Algorithms Brute Force Approaches: Introduction, Selection Sort and Bubble Sort, Sequential Search and Brute Force String Matching.

UNIT - 2 6 Hours
DIVIDE AND CONQUER: Divide and Conquer: General Method, Defective Chess Board, Binary Search, Merge Sort, Quick Sort and its performance.

UNIT - 3 7 Hours
THE GREEDY METHOD: The General Method, Knapsack Problem, Job Sequencing with Deadlines, Minimum-Cost Spanning Trees: Prim’s Algorithm, Kruskal’s Algorithm; Single Source Shortest Paths.

UNIT - 4 6 Hours
DYNAMIC PROGRAMMING: The General Method, Warshall’s Algorithm, Floyd’s Algorithm for the All-Pairs Shortest Paths Problem, Single-Source Shortest Paths: General Weights, 0/1 Knapsack, The Traveling Salesperson problem.

                                                            PART – B
UNIT - 5 7 Hours
DECREASE-AND-CONQUER APPROACHES, SPACE-TIME TRADEOFFS: Decrease-and-Conquer Approaches: Introduction, Insertion Sort, Depth First Search and Breadth First Search, Topological Sorting
Space-Time Tradeoffs: Introduction, Sorting by Counting, Input Enhancement in String Matching.

UNIT – 6 7 Hours
LIMITATIONS OF ALGORITHMIC POWER AND COPING WITH THEM: Lower-Bound Arguments, Decision Trees, P, NP, and NP-Complete Problems, Challenges of Numerical Algorithms.

UNIT - 7 6 Hours
COPING WITH LIMITATIONS OF ALGORITHMIC POWER: Backtracking: n - Queens problem, Hamiltonian Circuit Problem, Subset – Sum Problem.
Branch-and-Bound: Assignment Problem, Knapsack Problem, Traveling Salesperson Problem.
Approximation Algorithms for NP-Hard Problems – Traveling Salesperson Problem, Knapsack Problem

UNIT – 8 6 Hours
PRAM ALGORITHMS: Introduction, Computational Model, Parallel Algorithms for Prefix Computation, List Ranking, and Graph Problems.
-----------------------------------------------------------------------------------------
Text Books:
1. Anany Levitin: Introduction to The Design & Analysis of Algorithms, 2nd Edition, Pearson Education, 2007. (Listed topics only from the Chapters 1, 2, 3, 5, 7, 8, 10, 11).
3rd edition: Click here to download 1

2nd edition: Click to download 2

Solution manual : Download

2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer Algorithms, 2nd Edition, Universities Press, 2007. (Listed topics only from the Chapters 3, 4, 5, 13)
----------------------------------------------------------------------------------------

Microprocessors

Topic: Microprocessors

Sem:4

Syllabus:

Subject Code: 10CS45                                                        I.A. Marks : 25
Hours/Week : 04                                                                  Exam Hours: 03
Total Hours : 52                                                                   Exam Marks: 100
                                                            PART A
UNIT – I                     7 Hours
Introduction, Microprocessor Architecture – 1: A Historical Background, The Microprocessor-Based Personal Computer Systems. The Microprocessor and its Architecture: Internal Microprocessor
Architecture, Real Mode Memory Addressing.

UNIT – 2                    7 Hours
Microprocessor Architecture – 2, Addressing Modes: Introduction to Protected Mode Memory Addressing, Memory Paging, Flat Mode Memory Addressing Modes: Data Addressing Modes, Program Memory Addressing Modes, Stack Memory Addressing Modes

UNIT – 3                   6 Hours
Programming – 1: Data Movement Instructions: MOV Revisited, PUSH/POP, Load-Effective Address, String Data Transfers, Miscellaneous Data Transfer Instructions, Segment Override Prefix, Assembler Details. Arithmetic and Logic Instructions: Addition, Subtraction and Comparison, Multiplication and Division.

UNIT - 4                   6 Hours
Programming – 2: Arithmetic and Logic Instructions (continued): BCD and ASCII Arithmetic, Basic Logic Instructions, Shift and Rotate, String Comparisons. Program Control Instructions: The Jump Group, Controlling the Flow of the Program, Procedures, Introduction to Interrupts, Machine Control and Miscellaneous Instructions.

                                                          PART B
UNIT - 5                             6 Hours
Programming – 3: Combining Assembly Language with C/C++: Using Assembly Language with C/C++ for 16-Bit DOS Applications and 32-Bit Applications Modular Programming, Using the Keyboard and Video Display, Data Conversions, Example Programs

UNIT - 6                                7 Hours
Hardware Specifications, Memory Interface – 1: Pin-Outs and the Pin Functions, Clock Generator, Bus Buffering and Latching, Bus Timings, Ready and Wait State, Minimum versus Maximum Mode.
Memory Interfacing: Memory Devices

UNIT – 7                               6 Hours
Memory Interface – 2, I/O Interface – 1: Memory Interfacing (continued): Address Decoding, 8088 Memory Interface, 8086 Memory Interface. Basic I/O Interface: Introduction to I/O Interface, I/O Port Address Decoding.

UNIT 8                                7 Hours
I/O Interface – 2, Interrupts, and DMA: I/O Interface (continued): The Programmable Peripheral Interface 82C55, Programmable Interval Timer 8254. Interrupts: Basic Interrupt Processing, Hardware Interrupts: INTR and INTA/; Direct Memory Access: Basic DMA Operation and Definition.

-----------------------------------------------------------------------------------------------
Text Book:
1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2009.
(Listed topics only from the Chapters 1 to 13) Click to download

-----------------------------------------------------------------------------------------------

Solution manual: Click to download

-----------------------------------------------------------------------------------------------

Notes: