Kadi Sarva Vishwavidyalaya

Faculty of Engineering & Technology

Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Subject Code: CE502-N Subject Title: Microprocessor Architecture and Programming

Pre-requisite

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme

Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:

The objective of the course is to

 Make students aware about various heritage & evolution of modern microprocessors
 Expose to the students to the architecture and programming aspects with typical
microprocessor
 Get familiarized with modern day microprocessors

Outline of the Course:

Sr. Title of the Unit Minimum

No Hours
1 Introduction of 8085/80x86/8088 6
2 Programming of 8085/8086 10
3 Interrupts and Interrupt processing 7
4 Memories 4
5 Interfacing peripherals and applications 7
6 Intel microprocessors 10
7 ARM Processor 4

Total hours (Theory): 48

Total hours (Lab): 32
Total hours: 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Detailed Syllabus

Sr. Topic Lecture Weight

No Hours age(%)
Introduction: Introduction to microprocessors and
1 microcontrollers, system bus organization, 8085 architecture 6 14

Assembly Language Programming: Introduction to 8085

instructions, addressing modes, stacks and subroutines.
2 Introduction to 16-bit and 32-bit microprocessors – 80x86 10 20
families. Assembly language programming for 8086/8088.
Interrupts and interrupt processing: Hardware and software
3 7 16
Interrupts in 8085, 8086/8088.
Interfacing memory: DMA, SRAM/DRAM, cache memory.
4 4 7
Memory layout for 8086/8088. Virtual mode operation.
Interfacing peripherals and applications: 8254-Programmable
Interval timer/counter, 8255-Programmable Peripheral
5 Interface, 8259-Programmable/Priority Interrupt controller. 7 16
Digital interfacing – keyboards, displays, Analog interfacing –
sensors, transducers
32-bit Intel microprocessors: The Intel 80286, 80386, 80486,
6 Pentium and RISC based Intel MMX architecture. Real mode of 10 20
80386, Protected mode of 80386, Virtual 8086 mode.
ARM family of processors: Overview of ARM architecture,
7 4 7
Android-ARM hardware- software interface
T ot al 48 100

Instructional Method and Pedagogy:

 At the start of course, significance of the course, content delivery pattern, and other required
details regarding subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, smart boards
etc.
 Attendance is compulsory in lecture and laboratory which will be reflected in Continuous
Internal Assessment (CIA) component in the examination scheme of the course.
 Internal / Mid-semester examinations shall be conducted for theoretical evaluation.
 Assignments based on the course content will be given to the students and will be evaluated
at regular interval evaluation.
 The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures. Experiments shall be performed in the
laboratory related to course contents.
 The course includes a laboratory, where students have an opportunity to build and
appreciation for the concepts being taught in lectures. Experiments shall be performed in
the laboratory related to course contents.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Learning Outcome:
After completion of the course students are expected to be able to:
 Understand and communicate the architectural aspect of microprocessors along with primitive
functionalities of various components in the same.
 Interact with microprocessor with the code written in assembly language programming
 Identify and analyze primitive hardware aspects and the instruction sets for various
microprocessors

e-Resources:
 https://nptel.ac.in/courses/108107029/

Reference Books:
1. Microprocessor & Interfacing – Dauglas Hall, THM
2. Microprocessor Architecture, Programming, and Applications With the 8085, Ramesh
Gaonkar, Prentice Hall.
3. Advanced 80386 Programming Techniques: James Turley.
4. Advance Microprocessor - Deniel Tabak.
5. The Intel Microprocessors (Eight Editions): Barry B. Brey.
6. The 8086 Microprocessor, Kenneth Ayala, Cengage Learning.
7. The 8088 and 8086 Microprocessors, Triebel & Singh, Pearson Education.
8. Computer Architecture & Organization, Subrata Ghoshal, Pearson Publication
9. ARM System Developer's Guide: Designing and Optimizing System Software
Morgan Kauffman Publisher.
10 IBM PC Assembly Language & Programming, Peter Abel, PHI.

List of experiments

Sr. No
Name of Experiment
1 Architecture of 8086 Microprocessor and Addressing modes of 8086 Microprocessor.
2 To perform Assembly language program for Data transfer operations.
3 To perform Assembly language program for Arithmetic operations.
4 To perform Assembly language program for Logical operations.
5 To perform Assembly language program for Bit Manipulation operations.
6 To perform Assembly language program for String Manipulation operations.
7 To perform Assembly language program for Iteration Control operations.
8 To perform Assembly language program for Conditional Branch operations.
9 To perform Assembly language program for Unconditional Branch operations.
10 Assignment 1: Advanced Program/Code
11 Assignment 2: Demonstrating the Interfacing various Components with
Microprocessors
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Subject Code: CE503-N Subject Title: Theory of Computation

Pre-requisite

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 00 03 03 03 70 30 20 - 120

Course Objective:
 The purpose of this course is to acquaint the student with an overview of the theoretical
foundations of computer science from the perspective of formal languages.
 Classify machines by their power to recognize languages.
 Employ Finite state machines to solve problems in computing.
 To understand deterministic and non-deterministic machines.
 To identify proper machine to implement any problem.
 To understand Chomsky Hierarchies

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hours
1 Introduction 6
2 Regular Languages 3
3 Finite Automata 12
4 Context-Free Languages 8
5 Pushdown Automata 9
6 Pumping Lemma 2
7 Context-Sensitive Languages 2
8 Turing Machines 6

Total hours (Theory): 48

Total hours (Lab): NA
Total hours: 48
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Detailed Syllabus

Sr. Topic
No Lecture Weight
Hours age (%)

1 Introduction: Set Theory, Logic, PMI, Proof methods, Strings, Alphabet,

Languages, Production, derivation and Chomsky hierarchy of Languages. 6 10

2 Regular Languages: Regular Languages and Regular Expressions, Memory

Required to Recognize A Language, Distinguishable and Indistinguishable 3 15
Strings.
3 Finite Automata: Deterministic finite automata (DFA), Finding Regular
Expression of a FA, Constructing Finite Automata for a given regular
expressions, Union, Intersection, Difference and Complements of a FA,
Nondeterministic finite automata (NFA), NFA-ᶺ, Theorem and example of 12 20
NFA-ᶺ to NFA and NFA to DFA conversion, Kleene’s Theorem Part 1 and Part
2, Minimization of DFA, Decision Problems.
4 Context Free Languages: Context Free Grammar and Context Free
Languages with example, Derivation Tree and Ambiguity, Unambiguous
CFG, An unambiguous CFG for Algebraic Expressions, Simplified forms and 8 15
Normal Forms.
5 Pushdown Automata: Definition of PDA, Deterministic PDA and Non
Deterministic PDA, PDA for given CFG and CFG for given PDA, Intersections 9 15
and Complements of CFG.
6 Pumping Lemma: Non Regular Languages and Non Context Free Languages,
Pumping Lemma for RL and CFG. 2 05

7 Context Sensitive Languages: Definition of Context Sensitive languages,

2 05
Linear Bounded Automata.
8 Turing Machines: Definition and Examples of TM, Variation of Turing
Machines, Combining TM, Nondeterministic Turing Machines, Universal
Turing Machines, Church Turing Thesis, Recursive Enumerable and 6 15
Recursive Languages.
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

 The course needs more focus on numerical examples based on exercises at the end of each chapter to
aware of algorithm and theorem more precisely.

Learning Outcome:
On successful completion of this course, the student should be able to:
 Graduate should be able to understand the concept of abstract machines and their power to
recognize the languages.
 Attains the knowledge of language classes & grammars relationship among them with the help of
Chomsky hierarchy.
 Graduate will be able to understanding the pre-requisites to the course compiler or advanced
compiler design.
 Able to employ finite state machines for modeling and solving computing problems.
 Able to design context free grammars for formal languages.
 Able to understand the concepts of Turing machine.
 Able to gain proficiency with mathematical tools and formal methods.

e-Resources:
 https://nptel.ac.in/courses/106106049/
 https://nptel.ac.in/courses/106103070/
 https://nptel.ac.in/courses/111103016/
 https://nptel.ac.in/courses/106104148/

Reference Books:
1. John Martin, Introduction to Languages and The Theory of Computation, Tata McGraw Hill.
2. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory,
Languages, and Computation, Pearson Education Asia.
3. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation, Pearson
Education Asia.
4. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science, Springer.
5. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.
6. Mishra and Chandrashekaran, Theory of Computer Science – Automata languages and computation,
PHI.
7. Daniel I.A. Cohen, Introduction to Computer Theory, John Wiley.
8. P. K. Srimani, Nasir S. F. B, A Text book on Automata Theory, Cambridge University Press.
9. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan Rama R.
10. Theory of Computation: A Problem - Solving Approach, Kavi Mahesh, Wiley India Pvt. Ltd.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Subject Code: CE504-N Subject Title: Design & Analysis of Algorithms

Pre-requisite Programming (C or C++), Data and file structure

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:
 To understand fundamentals of computer algorithms and algorithmic design paradigms
 To demonstrate a familiarity with major algorithms and data structures.
 To make the students be able to perform analysis of algorithms using asymptotic and empirical
approaches
 To Introduce various designing techniques and methods for algorithms
 To develop ability to analyse the algorithms using time and space complexities

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hour
1 Basics of Algorithms & Mathematics s3
2 Analysis of Algorithms 8
3 Divide and conquer algorithms 8
4 Greedy algorithms 7
5 Dynamic programming 8
6 Graph Algorithms 6
7 Backtracking and Branch and Bound 5
8 Introduction to Complexity Theory 3

Total hours (Theory):48

Total hours (Lab):32
Total hours : 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Detailed Syllabus

Sr. Topic Lecture Weight

No Hours age(%)
Basics of Algorithms and mathematics
1  Algorithm definitions and examples
 Mathematics for algorithmic sets
 Functions and relations 3 6
 Combinations
 Vectors and matrices
 Linear inequalities and linear equations
2 Analysis of Algorithms
 Orders of Magnitude (Asymptotic notations)
 Growth rates, some common bounds (constant, logarithmic,
linear, polynomial, exponential)
 Time and space complexity 8 17
 Average and worst case analysis
 Analysing control statements
 Sorting Algorithms and analysis: Insertion sort, Radix sort

3 Divide and conquer algorithms

 Introduction
 Recurrence Relations and methods to solve recurrence(substitution,
change of variables, master’s method, Recurrence tree)
 Sorting (Quick sort) 8 17
 Matrix multiplication
 Binary search

4 Greedy algorithms
 General Characteristics of greedy algorithms
 Problem solving using Greedy Algorithm- Graphs: Minimum 7 14
Spanning trees (Kruskal’s algorithm, Prim’s algorithm), 0-1
Knapsack problem, Activity selection problem, Making Change
Problem
5 Dynamic programming
 Introduction
 The Principle of Optimality
 Problem Solving using Dynamic Programming- Assembly Line 8
17
Scheduling, Fractional Knapsack problem, Matrix chain
multiplication, shortest path, Longest Common Subsequence


 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

6 Graph Algorithms:
 An introduction using graphs and games
 Traversing Trees– Preconditioning, Depth First Search (DFS),
6 13
Undirected Graph, Directed Graph, Breath First Search (BFS),
Applications of BFS and DFS

7 Backtracking and Branch and Bound

 Backtracking –The Knapsack Problem; The Eight queens problem,
General Template 5 10
 Branch and Bound –The Assignment Problem; The Knapsack Problem,
The min-max principle

8 Introduction to Complexity Theory

 The class P and NP
 Polynomial reduction
 NP- Complete Problems 3 6
 NP-Hard Problems
 Travelling Salesman problem
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for
the concepts being taught in lectures.
 Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
On successful completion of the course, the student will:

 Be able to check the correctness of algorithms using inductive proofs and loop invariants.
 Be able to compare functions using asymptotic analysis and describe the relative merits of worst-,
average-, and best-case analysis.
 Be able to solve recurrences using the master, the iteration, and the substitution method.
 Become familiar with a variety of sorting algorithms and their performance characteristics (eg,
running time, stability, space usage) and be able to choose the best one under a variety of
requirements.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

 Be able to understand and identify the performance characteristics of fundamental algorithms and
data structures and be able to trace their operations for problems such as sorting, searching,
selection, operations on numbers, polynomials and matrices, and graphs.
 Be able to use the design techniques introduced i.e. dynamic programming, greedy algorithm etc.
to design algorithms for more complex problems and analyze their performance.
 Find optimal solution by applying various methods.
 Become familiar with the major graph algorithms and their analyses. Employ graphs to model
engineering problems, when appropriate.
 Differentiate polynomial and non polynomial problems.

Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E .Leiserson, Ronald L. Rivestand Clifford
Stein, PHI
2. Fundamental of Algorithms by Gills Brassard, Paul Bratley, PHI.
3. Design and Analysis of Computer Algorithms by Aho, Hopcroft and Ullman, Pearson
4. The Algorithm Design Manual By Steve s. Skiena

E-Resource : https://nptel.ac.in/courses/106106131/
https://onlinecourses.nptel.ac.in/noc18_cs37

List of experiments

No Name of Experiment

1 Basics: Find out Big - Oh and Big–Omega of the function. Take necessary data like degree of the
function, coefficients, etc.
2 Revision of Data Structures:
Write a program to implement:
a. A Queue
b. A Stack
c. A Queue using two Stacks
d. A Stack using two Queues
3 Some Basic Algorithms:
Write an algorithm and find the efficiency of the same for following problems:
a. Finding Factorial – Iterative Approach
b. Finding Factorial – Recursive Approach
c. Printing Fibonacci Series – Iterative Approach
d. Printing Fibonacci Series – Recursive Approach
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

4 Basic Sorting and Searching Techniques:

Design an algorithm and implement a program for:
a. Insertion Sort
b. Selection Sort
c. Linear Search
d. Radix Sort

5 Divide and Conquer Approach:

Design an algorithm and implement a program for:
a. Quick Sort
b. Binary Search

6 Greedy Approach:
Design an algorithm and implement a program to solve:
a. Making Change Problem
b. Knapsack Problem
7 Dynamic Programming:
Design an algorithm and implement a program to solve:
a. Knapsack Problem
b. Longest Common Subsequence Problem
c. Finding Optimal Matrix Chain Order Problem
8 Graph Algorithms:
Design an algorithm and write a program to implement:
a. Depth First Search of a graph
b. Breadth First Search of a graph
9 Graph Algorithms:
Design an algorithm and implement a program for:
a. Kruskal’s method of finding Minimum Spanning Tree
b. Prim’s method of finding Minimum Spanning Tree
10 Design an algorithm and implement a program for The Assignment Problem in Branch and
Bound
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Subject Code: CE505-N Subject Title: Computer Networks

Pre-requisite

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
04 00 02 06 05 03 70 30 20 30 150

Course Objective: This course aims

 To understand the basics of Networks, its significance and its usage.
 To understand the services being offered at each layer of network protocol stack.
 To have understanding of different network protocols, network metrics and different
applications of Internet.

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hours
1 Overview of Networks and Data
Communications 9
2 Physical layer 8
3 Data Link layer 8
4 Medium Access control sub layer 12
5 Network layer 16
6 Transport layer 8
7 Application layer 3

Totalhours (Theory):64
Totalhours(Lab):32
Totalhours:96
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Detailed Syllabus
Lecture Weightage
No Topic
(Hrs) (%)
Overview of Networks and Data communication
Introduction to Data Communications, Computer Networking,
Protocols and Standards; Types of Network, Network Topology,
Protocol hierarchies, and Design issues of layers, Interfaces and
1 9 14
services; Reference Model: The OSI reference model, TCP/IP reference
model, Comparison between OSI model and TCP/IP model; Network
standards and policies, Uses of computer network, Network hardware,
Network software.
Physical Layer
Data and transmission techniques, Multiplexing, Transmission media,
2 8 13
Asynchronous Communication, Wireless transmission, ISDN, ATM,
Cellular Radio, Switching techniques issues
Data link Layer
Data Link layer Design Issues, Link layer services, Framing, error
3 8 13
control and Flow control, DLL protocols: Elementary Data Link
Protocols, Sliding Window protocols: Protocols Verification models
Medium Access Control Sub layer
The channel allocation problem, Multiple Access protocols: ALOHA,
CSMA, Collision free protocols, Limited contention protocols,
4 Wavelength Division Multiple Access Protocols; Wireless LAN 12 18
protocols; Ethernet: Traditional Ethernet ,Types of Ethernet , IEEE
802.2: LLC Data link layer switching Ethernet(CSMA/CD); Token Ring,
DQDB, FDDI, Bridges and recent developments.
Network Layer
Design Issues, Connection Oriented and Connectionless networks,
Interconnecting Devices, IP Protocol and Subnetting ,Routing
Algorithms: Shortest Path Routing: RIP, OSPF; Flooding, Distance
5 16 24
Vector Routing, Link State Routing, Broadcast, multicast, anycast
routing; Congestion Control and its Algorithms, Quality of Service,
Internetworking, Addressing, N/W Layer Protocols: IPv4 and IPv6and
recent developments.
Transport Layer
The transport layer protocols and its services, Transport service
6 primitives: Connection establishment, Connection release; Flow 8 13
control: Multiplexing and Demultiplexing; TCP, UDP, Congestion
control, QOS and its improvement.
Application layer
The Domain Name System, DHCP, Electronic Mail, World Wide Web,
7 3 5
Content delivery, Principles of Network applications, HTTP, Client
Server Model and recent development.
Total 64 100
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Instructional Method and Pedagogy:

 At the start of course, significance of the course, content delivery pattern, and other required details
regarding subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which will be reflected in Continuous Internal
Assessment (CIA) component in the examination scheme of the course.
 Assignments based on the course content will be given to the students and will be evaluated at regular
interval evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures. Experiments shall be performed in the laboratory related to course
contents.

Learning Outcome:
On successful completion of this course, the student should be able to:

 Understand the gravity and concepts of computer networks.

 Conceptualize and appreciate the layered model for computer networking.
 Identify basic protocols and design issues for layered model.
 Explain various topological and routing strategies for IP based networks.

E-Resources:
1. http://vlssit.iitkgp.ernet.in/ant/ant/
2. https://www.netacad.com/about-networking-academy/packet-tracer/
3. http://www.networkworld.com/blogs
4. https://www.tutorialspoint.com/ipv6/

Reference Books:

1. Computer networks, Andrew S. Tanenbaum, Pearson.

2. Introduction to Data communication and Networking, Behrouz Forouzan, TMH Publication.
3. Data and computer communication, William Stallings, Pearson
4. TCP/IP Protocol suit ,Behrouz Forouzan, TMH Publication
5. Computer Network, Natalia Olifer, Victor Olifer, Wiley-India edition.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

List of experiments:

No Name of Experiment

1 Study of different Network devices.

2 Study of various networking commands.
3 Introduction to Cisco packet tracer and perform IP exercises, sharing and map network drive.
4 To perform static routing using packet tracer.
5 Introduction to Network address translation.
6 Create a network having 4 subnets. Each workstation is having ip address of class B.
7 To perform routing using RIP in packet tracer.
8 To perform routing using IGRP packet tracer.
9 To perform routing using OSPF packet tracer.
10 To configure DHCP server in packet tracer.
11 To configure DNS in packet tracer.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Subject Code: CE506E-N Subject Title: Computer Graphics

Pre-requisite

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:
 This course prepares students for activities involving the design, development, and testing of
modeling, rendering, and animation solutions to a broad variety of problems found in
entertainment, sciences, and engineering.
 To study and develop interactive programs that uses effectively the graphics functionalities
available in contemporary personal computers.
 To study the fundamental principles and technologies upon which these functionalities, and
possibly their future evolutions are applicable.
 The skills for designing and implementing practical graphic solutions to challenging problems in
different application domains

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hours
1 Introductory concepts 06
2 Graphics Output Primitives 10
3 2D Viewing 08
4 3D Viewing and Projections 07
5 2D-3D Transformations 09
6 Advanced Topics 08

Total hours (Theory):48

Total hours(Lab):32
Total hours:80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

DetailedSyllabus

Sr. Lecture Weight

Topic Detail
No Hours age(%)
Introductory Concepts:
1 Introduction of Computer Graphics, Applications of Computer Graphics,
Coordinate representation and Pixel Graphics, Raster Scan & Random Scan 06 10
systems, video controller and raster scan display processor, Color monitors,
Graphics software.
2 Graphics Output Primitives:
Point, and Lines, Line Drawing Algorithms- simple, DDA, Bresenham's Line
Drawing algorithm, Circle and Ellipse drawing algorithm,
10 20
Polygon drawing: Representation of polygon; Conventional methods for
drawing polygons; Real time Scan Conversion and Run length encoding; Filled
area primitives, character generation, Antialiasing
3 2D Viewing:
Viewing pipeline, Window-to-viewport transformation, 2-D Clipping, Chen-
Sutherland Line Clipping, Mid-point subdivision algorithm, Liang-Barsky
clipping, Cyrus-Beck line clipping; 08 20
Polygon Clipping: Sutherland-Hodgeman and Weiler-Atherton polygon
clipping; Character Clipping
4 3D Viewing and Projections:
Viewing pipeline, 3-D concepts and representation, viewing coordinates,
Projections: Perspective, Orthographic, Axonometric, Oblique projections, 07 15
Curves and surfaces: Spline representations, Bezier curves and surfaces, B-
spline curves and surfaces.
5 2D-3D Transformations:
Scaling, Rotation, Translation, Shearing, Reflection; Homogeneous
09 20
coordinates, Composite Transformations, Affine transformation, Solid Body
transformations.
6 Illumination and Colour Models:
Visible surface detection methods: Techniques for efficient Visible-Surface
Algorithms, Categories of algorithms, Back face removal, The z-Buffer
Algorithm, Scan-line method, Painter’s algorithms (depth sorting), Area sub-
division method, BSP trees, Visible-Surface Ray Tracing, comparison of the
methods. 08 15
Illumination models and surface rendering: Illumination and Shading Models
for Polygons, Reflectance properties of surfaces, Ambient, Specular and
Diffuse reflections, Atmospheric attenuation, Phong’s model, Gouraud
shading, some examples..
Total 48 100
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures.
 Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:

1. Know and be able to discuss hardware system architecture for computer graphics. This includes, but
is not limited to: graphics pipeline, frame buffers, and graphic accelerators/co-processors.
2. Know and be able to design and implement model and viewing transformations, the graphics
pipeline and an interactive render loop with a 3D graphics API.
3. Know and be able to use the underlying algorithms, mathematical concepts, supporting computer
graphics. These include but are not limited to:
 Composite 3D homogeneous matrices for translation, rotation, and scaling transformations.
 Plane, surface normal, cross and dot products.
 Hidden surface detection / removal.
 Scene graphs, display lists.
4. Know and be able to select and use among models for lighting/shading
5. Know and be able to use and select among current models for surfaces (e.g., geometric; polygonal;
hierarchical; mesh; curves, splines).
6. Be able to discuss the application of computer graphics concepts in the development of computer
games, information visualization, and business applications.
7. Be able to discuss future trends in computer graphics and quickly learn future computer graphics
concepts and APIs.

E-Resources:

 https://nptel.ac.in/courses/106106090/
 https://nptel.ac.in/courses/106102065/

Reference Books:
1. Computer Graphics C Version, D. Hearn And P. Baker, Pearson Education
2. Computer Graphics, Foley and van Dam, Person Education
3. Computer Graphics with OpenGL, Hearn and Baker, Pearson
4. Computer Graphics, A. P. Godse, Technical Publication
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

List of experiments

No NameofExperiment

1 To Study and hands on practice of various C Graphics Function

2 Implementation and Using mouse in DOS
3 Implement DDA line algorithm
4 Implement Bresenham’s Line algorithm
5 Implement Midpoint Line algorithm
6 Implement Bresenham’s Circle Algorithm
7 Implement Mid-point Ellipse algorithm
8 Implement Polygon Filling using Scan Fill, Flood Fill and Boundary Fill Algorithm
9 Implement algorithm of 2D Transformation of an Object
10 Implement Line Clipping using Cohen- Sutherland Algorithm
11 Implement Line Clipping using Liang-Barky algorithm
12 Implement Polygon Clipping using Sutherland-Hodgeman Algorithm
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Subject Code: CT501-N Subject Title: Software Engineering

Pre-requisite Basics of Object Oriented Concepts

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course objective:
 To learn and understand the Concepts of Software Engineering
 To Learn and understand Software Development Life Cycle
 To apply the project management and analysis principles to software project development.
 To apply the design & testing principles to software project development.

Outline of the Course:

Sr. No. Minimum

Title of the Unit
Hours

1 Software and Software Engineering 4

2 Software Process Model 5
3 Software Requirement Analysis and Specification 5
4 Software Design 5
5 Coding 3
6 Software Testing Strategies 5
7 Estimation 5
8 Risk Management 6
9 Quality Management 4
10 Current trends in Software Engineering 6

Total hours (Theory):48

Total hours(Lab):32
Total hours:80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Detailed Syllabus
Sr.No. Topic Lecture Weight
Hours age(%)
1 Software and Software Engineering
Nature of software, Unique Nature of WebApps, Software Engineering 4 9
and its importance, software process, Software Engineering
practice,Software Myths.
2 Software Process Model
A Generic Process Model, Process Assessment and Improvement,
Prescriptive Process Model: Waterfall Model, Incremental Process
Models-Incremental Model, RAD Model,Evolutionary Process Models-
Prototyping, Spiral Model, Concurrent Development Models, Component-
Based Development Model
5 10
AgileDevelopment: What is Agility, What is an Agile Process,Agile
methods Process Models- Extreme programming, Adaptive Software
Development (ASD),Dynamic System Development
Method(DSDM),Scrum.
Computer Aided Software Engineering (CASE) :Overview of CASE
approach, Classification of CASE tools
3 Software Requirement Analysis and Specification
System and software requirements
Types of software requirements: Functional and non-functional
requirements, Domain requirements, User requirements 5 10
Requirements Engineering Tasks,Initiating the Requirement engineering
Process,Eliciting the requirements,Developing Use-cases, Negotiating
Requirements, Validating Requirements.
4 Software Design
Design concepts: Abstraction, Architecture, Patterns, Modularity,
Cohesion, Coupling, Information hiding, Functional independence,
Refinement, Refactoring, Design Classes.
Design Model: Data design Elements, Architectural Design Elements, 5 10
Interface Design Elements, Component Level Design elements,
Deployment-Level Design Elements.
Pattern-Based Software Design: Describing a Design Pattern,Using
Patterns in Design,Frameworks.
5 Coding
Programming languages and development tools ,Selecting languages and 3 6
tools, Good programming practices, Coding Standards
6 Software Testing Strategies
A Strategic Approach to Software Testing,
Techniques of testing: Black-box testing, and White-box testing
Test Strategies: Unit testing, Integration Testing, Interface testing, System 5 10
testing, Alpha and beta testing, Regression testing.
Design of test cases.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

7 Estimation
Software Scope and Feasibility, Software Project Estimation, 5 10
Decomposition Techniques, Empirical Estimation Model.
8 Risk Management
Reactive vs proactive Risk Strategies, Software Risks, Risk Identification,
6 13
Risk projection, Risk refinement, Risk mitigation, monitoring
&management, The RMMM Plan
9 Quality Management
Quality Concepts, Software Quality Assurance, Formal Approaches to 4 9
SQA, Software Reliability, The ISO 9000 Quality Standards.
10 Current trends in Software Engineering
Technology Evolution, Identifying “Soft Trends”, Technology Directions, 6 13
Tools-Related Trends.
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures.
 Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
On successful completion of this course, the student should be able to:

Software engineering is a subject that emerged recently as a result of the need to manage software
projects that are rising in demand day by day. Software is developed in diverse areas and the fact that a
systematic approach is required to manage their development spawns this interesting subject of study.
After successfully completing this module the student will be able to explain the software engineering
principles and techniques that are used in developing quality software products.

e-Resources:
 NPTEL: https://onlinecourses.nptel.ac.in/noc18_cs43/preview
https://nptel.ac.in/courses/106101061/
 Udacity: https://eu.udacity.com/course/software-development-process--ud805
 Guru99: https://www.guru99.com/software-engineering-tutorial.html
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (Computer Engineering)
(In Effect From Academic Year 2019-20)

Reference Books:
1. Software Engineering: A practitioner's approach by Roger S. Pressman, 7th edition,
McGraw-Hill International edition
2. Software Engineering by Ian Sommerville, 7th edition, Addison-Wesley.
3. Fundamentals of Software Engineering by Rajib Mall
4. Software Engineering by K K Agrawal and Yogesh Singh, 3rd edition, New Age International
Publishers

List of experiments

No Name of Experiment

1 Sleeting and defining project definition

2 Identifying Domain Classes from the Problem Statements and modeling Class Diagram
3 Modeling UML Use Case Diagrams and Capturing Use Case Scenarios
4 Modeling Data Flow Diagrams
5 E‐R Modeling
6 Designing Data Dictionary
7 Sequence diagrams
8 Activity Modeling
9 Estimation of Project Metrics
10 and Structural
Designing Test Complexity
Suites
11 Preparing Final Project Report / SRS
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Subject Code: CT506A-N Subject Title: Advanced Java Programming

Pre-requisite Object Oriented Programming with Java

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme

Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

This course introduces the students to the advanced topics of Java Programming technology, which helps
students to prepare themselves for the industry standards and develop various business enterprise
applications as well as client-server and web applications.

Course Objective:
This course aims to
 Teach the Students for developing interactive user-friendly interfaces using the Java Swing class and
appropriate layout managers.
 Teach the database connectivity with Java programming
 Explain the enterprise architectures.
 Simulate the networking in java.
 Educate the students for developing web-based applications using Advanced Java Technologies.

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hours
1 Swing 6
2 JDBC 6
3 Java Networking and J2EE 7
4 Servlets, Event Listeners and Filters 8
5 Java Server Pages and JSTL 7
6 Hibernet 4.0 7
7 Spring MVC 7

Total hours (Theory): 48

Total hours (Lab): 32
Total hours: 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE / IT)
(In Effect From Academic Year 2019-20)

Detailed Syllabus
Lecture Weightage
No Topic
(Hrs) (%)
Swing : JFC, MVC Architecture; difference between AWT and Swing,
Components from javax.swing package – Jcomponent, JFrame,
1 6 12
JWindow, JLabel, JButton, JTextComponent, JToggleButton,
JradioButton, JCheckbox ; Pluggable Look and Feel
JDBC: Components of JDBC; JDBC Architecture; JDBC Drivers, CURD
operation Using JDBC and java.sql package, DriverManager Class,
2 6 12
Driver, Connection, Statement and Resultset Interfaces, difference
between java.sql and javax.sql
Java Networking and J2EE : Network Programming in Java using the
java.net package; Establishing two-way communication between
3 7 15
Server and Client using TCP and UDP; Features of Java Enterprise
Edition; Architecture of Java EE; Working with EJB
Servlets : Exploring javax. servlet and javax.servlet.http packages;
Servlet Life cycle; Creating a servlet; ServletConfig and Servlet
Context objects; HttpServletRequest and HttpServletResponse
4 8 16
Interfaces; Session Tracking Mechanisms; Event Handling; Creating
and Configuring filters; Parameter initialization in Filters;
Manipulating Responses using Filter.
Java Server Pages: Introduction to JSP Technology; Architecture of
JSP (Model – I and Model - II); Life Cycle of JSP Page; Working with
basic JSP Basic Tags; Action Tags and Implicit objects in JSP; JSP
5 7 15
Unified EL; Elements of Tag extensions; Tag Extension API in Java;
Life Cycle of Simple Tag Handler; Introduction to JSTL; Core Tag
Library and XML Tag Library
Hibernate : Architecture of Hibernate; HQL; Setting up the
development environment; Creating Database Table; Writing
6 Hibernate Configuration file; JavaBean and Hibernate mapping file; 7 15
Implementing O/R mapping with Hibernate
Spring MVC : Spring Framework Architecture; Dependency Injection
8 and Inversion of Control; AOP with Spring; Managing Transactions 7 15
in Spring; Spring Form Tag Library; Spring’s Web MVC Framework
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, significance of the course, content delivery pattern, and other required details
regarding subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which will be reflected in Continuous Internal
Assessment (CIA) component in the examination scheme of the course.
 Assignments based on the course content will be given to the students and will be evaluated at regular
interval evaluation.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE / IT)
(In Effect From Academic Year 2019-20)

 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures. Experiments shall be performed in the laboratory related to course
contents.

Learning Outcome:
On successful completion of this course, the student should be able to:
 Implement the solution of a real time problem definition using Java Technology.
 Make them prepared with the current industry standards.

e-Resources:
 https://onlinecourses.nptel.ac.in/noc19_cs07/
 https://www.tutorialspoint.com/spring/
 https://www.tutorialspoint.com/hibernate/
 https://www.javatpoint.com/java-tutorial/
 https://www.edureka.co/blog/advanced-java-tutorial/

Reference Books:
1. Java Server Programming Java EE 7 (J2EE 1.7) Black book, Kogent Learning Solutions Inc.,
DreamTech Publication.
2. Java: The Complete Reference, 10th Edition, by Herbert Schildt, McGraw-Hill.
3. Advance Java Technology, by M.T. Savaliya, Kogent Learning Solutions Inc., DreamTech Publication.
4. Advanced Java Programming, by Uttam Kumar Roy, Oxford University Press.

List of experiments:
No Name of Experiment

1 Create a simple calculator application using Swing in Java

2 Implement Student information system using JDBC
a. Create chat application using TCP protocol.
3
b. Create chat application using UDP protocol.
4 Develop an EJB application to store and retrieve the student record.
a) Write a Servlet to display “Welcome to LDRP” on browser.
b) Write a Servlet that will fetch the header information and parameter values from the
5 header and print it on the webpage
c) Create a Servlet that implements ServletContextAttributeListener interface such that a
message dialog is displayed whenever an attribute is added or removed or replaced.
Write a servlet that counts the number of times that web page is visited and displays the
6 same information on that page.
Assume that the information regarding the salary and age for all employees of an
organization are available in a database. Develop a Servlet application which takes the
7 employee id of an employee as a request parameter and displays the marksheet for the
student.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE / IT)
(In Effect From Academic Year 2019-20)

Write a Servlet for an online shopping website, where the customer registers himself with his
name and email- id. The continue button will be available on that page and each subsequent
8 page, which displays the list of items. The customer will choose the items and the required
quantity. In last webpage the customer’s name, email id, the list of his purchased items and
the bill amount is shown. The students are advised to make the use of cookies.

9 Create a servlet filter that adds the request processing time in the response page.
Create a Login application using servlet and JSP, where the user will provide his login details
in a servlet page and if the login is successful then, a JSP page with “Welcome” message and
“Log Out” button should be shown. If the login is failed, then message of failure and link to
10
further login should be shown on a JSP page. If the failure count reaches to 3 then the
webpage should be closed. The students are advised to make use of session tracing
mechanisms.
a) Create a web page that prints 1 to 10 using JSTL 8.2
11 b) Create a custom JSP tag that prints current date and time. Use this tag into JSP page.
12 Create a hibernate application for employee payroll system.
13 Create a “Hello World” application using Spring MVC framework.
14 Create an online appointment booking application using Spring Web MVC framework
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Subject Code: CT506B-N Subject Title: Advanced Computer Architecture

Pre-requisite Computer Organization Architecture

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme

Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:
 After successful completion of the course, student will be able to :
 understand and relate the need of parallel computer architecture
 design the memory hierarchy for parallel architecture
 evaluate the parallel architecture models
 Understand The Micro-Architectural Design Of Processors
 Learn About The Various Techniques Used To Obtain Performance Improvement And
Power Savings In Current Processors

Outline of the Course:

Sr. No Title of the Unit Minimum
Hours
1 Introduction to Computer Design and Quantitative Principles of Architecture 10
2 Instruction set principles and examples 9
3 Instruction-Level Parallelism and Its Exploitation 8
4 Multiprocessors and Thread-Level Parallelism 7
5 Memory Hierarchy Design 7
6 Storage Systems 7

Total hours (Theory): 48

Total hours (Lab): 32
Total hours: 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Detailed Syllabus
Sr. Lecture Weight
No Topic Hours age(%)
Fundamental of Computer Design:
Classes of Computers, Defining Computer Architecture, Trends In Technology,
10 19
1 Power, Energy And Cost, Dependability, Measuring, Reporting, and Summarizing
Performance, Quantitative Principles of Computer Design.
Instruction set principles and examples:
2 Classifying instruction set, memory addressing, type and size of operands,
9 18
addressing modes for signal processing, operations in the instruction set,
instructions for control flow, encoding an instruction set ,the role of compiler
Instruction-Level Parallelism and Its Exploitation:
ILP Concepts, Pipelining Overview ,Compiler Techniques For Exposing ILP
3 ,Dynamic Branch Prediction ,Dynamic Scheduling , Multiple Instruction Issue 8 15
,Hardware Based Speculation ,Static Scheduling ,Multi-Threading ,Limitations Of
ILP , Case Studies.
Multiprocessors and Thread-Level Parallelism:
Symmetric shared memory architectures, Performance of Symmetric Shared-
4 Memory Multiprocessors, Distributed Shared Memory and Directory-Based 7 16
Coherence, Synchronization: The Basics, Models of Memory Consistency: An
Introduction, Case Studies: Intel I7 Processor, SMT & CMP Processors
Memory Hierarchy Design:
5 Cache performance, reducing cache misses penalty and miss rate, 7 16
virtual memory- protection and examples of VM.
Storage Systems:
Advanced Topics in Disk Storage, Definition and Examples of Real Faults and
6 Failures, I/O Performance, Reliability Measures, and Benchmarks, A Little 7 16
Queuing Theory, Designing and Evaluating an I/O System—The Internet Archive
Cluster
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures.
 Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
At The End Of The Course, The Student Should Be Able To:

 Evaluate Performance Of Different Architectures With Respect To Various Parameters

 Analyze Performance Of Different ILP Techniques
 Identify Cache And Memory Related Issues In Multi-Processors

Reference Books:
1. J.L. Hennessy, and D.A. Patterson, Computer Architecture: A quantitative approach, Fifth Edition,
Morgan Kaufman Publication, 2012
2. J.P. Shen and M.H. Lipasti, Modern Processor Design,MC Graw Hill, Crowfordsville, 2005
3. Current Literature (Papers from ISCA, Micro, HPCA, ICCD, and IEEE Trans. on Computers, IEEE
Architecture Letters)
4. K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGraw Hill.

List of experiments

No List of Experiments

1 Cache Simulation with Simics

2 Caches and the Memory System
3 Multiprocessors and Cache Consistency
4 Cache Coherence and Memory Ordering
5 Scalability of the Gauss-Seidel Algorithm
6 Multiprocessor Scalability
7 SIMD Instructions
8 CPU Architecture & SIMD
9 Project
10 Case Study
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Subject Code: CT506C-N Subject Title: Dot Net Technology

Pre-requisite

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:
 Programming using high-level abstractions such as classes, interfaces, namespaces, properties,
delegates, events, threads, attributes, generics, and iterators.
 Using the .NET platform to develop dynamic web pages with ASP.NET, Web Services, ADO .NET.
 It also covers the most important features of the class library (collections, IO, threading, sockets,
Windows Forms, reflection, Xml, generics).
 Students will learn about the CLR (assemblies, versioning, security, JIT compilation, configuration)
and about the most important .NET tools (VS.NET, ildasm, gacuti).
 Also covers the introduction about new features in Web development (WPF, WCF, WF, Silver light,
Ajax Controls).

Outline Of the Course:

Sr. Minimum
Title of the Unit
No Hour
1 Introduction s
04
2 Basic concepts of VB.NET and C# 12
3 ADO.NET 05
4 ASP.Net and Web Development 16
5 Advanced Concepts 11

Total hours (Theory): 48

Total hours (Lab): 32
Total hours: 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Detailed Syllabus

Sr. Lecture Weight

Topic Details
No Hours age(%)
Introduction
Fundamental terms in .NET
- Detailed .NET Framework architecture, Name spaces
- Assemblies, Exploring Assemblies and Namespaces
- Common Language Implementation , Metadata and
Intermediate Language
4 8
1 - Garbage Collection, Versioning and Side-by-Side Execution, The
Data Types and Base Class Libraries
- Understanding .NET Data Types
- Stream and String Manipulation, Files and I/O, Collections
- The Microsoft Visual Basic Namespace End to DLL Hell, Managed
Execution
Basic concepts of VB.NET and C#
Introduction to VB.NET and C#, Namespaces
- Creating Classes, Classes and Inheritance, Overloading,
Constructors and Destructors, Inheritance, Controlling scope and
visibility, Dispose and Finalization, Modifiers, Properties and
Indexers, Attributes, Reflection API ,Unsafe Code, Events and
Delegates
Windows Application:
- Language Features Creating .NET Projects, Namespaces,
2 Threads, Debugging and Error Handling, Structured Error Handling
12 25
- Windows Forms: Benefits, Windows Form Controls, Properties and
Events, .NET Events, MDI Form, Visual Inheritance, Apply
Inheritance techniques to Forms
- Dialogs, ToolTips, Resizing , Menus, Custom control creation, Using
ActiveX Controls, Printing, Handling Multiple Events, GDI+
Console Applications
- When to use Console Applications
- Generating Console o utput, p rocessing Console Input
ADO.NET
- Benefits of ADO.NET, ADO.NET compared to classic ADO, ADO
.NET Objects Working with Data Sets, Managed Providers, Data
3 Binding 5 11
- Data Sets and XML, Typed Data Sets, Working with Data Reader,
Reading and Write Data Using the SqlDataSource Control
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

ASP.Net and Web Development

- Introduction to ASP.NET, Difference between ASP
and ASP .Net, Controls, Rich Server Controls, Web Site
Administration Tool, Configuration Overview, Programming
Configuration Files, Encrypting Configuration Sections, Database
accessing, ListBound Controls- Repeater Control, DataList Control
- Server side: Cache, session, Application, Request, Response
- State Management: Preserving State in Web Applications,
4 Page-Level State, Using Cookies, ASP.NET Session State, Storing 16 33
Objects in Session State, Configuring Session State, Using Cookieless
Session IDs, Application State
- Themes and Master Pages: Consistent Web Site, CSS and Scene
files, Master Pages: Content place holder and Nested Master page.
- Web Services: XML Web Services, Creating and Designing an
XML Web Service, Creating Web Service Consumers
- ASP.net security
Advanced Concepts
- MVC: MVC Application development, ASP.NET MVC
- Introduction and developing simple applications
5 u s i n g WPF(Windows Presentation Foundation), WCF(Window
11 23
Communication Foundation), W F(Work flow), Silverlight Framework,
AJAX controls.
Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures.
 Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
 On successful completion of this course, the student should be able to:
 Apply the principles of object-oriented programming.
 Write clear and effective C# code.
 Create applications using Microsoft Windows® Forms
 Working with XML Documents
 Using Crystal Reports
 Access data using ADO.NET
 Develop web applications using ASP.NET Web Forms.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

 Develop and use ASP.NET Web Services.

 Create a rich GUI for web based applications using a rich set of controls
 Create secure (authentication and authorization) web applications
 Personalize a web page using Web Parts
 Create asynchronous web applications using ASP.NET AJAX
 Create and use web services
 Deploy web applications

e-Resources:
 https://dotnet.microsoft.com/learn
 http://www.tutorialspoint.com
 https://www.codeproject.com
 https://www.c-sharpcorner.com

Reference Books:
1. Advance .Net Technology, Chirag Patel, Dreamtech Publication.
2. Professional VB. NET, Wrox publication
3. C# 2012 programming, covers .net 4.5, black book, KOGENT learning solutions inc.,
Dreamtech Pub.
4. ASP .NET complete reference, TMH
5. ASP.NET 2.0, Black Book, Dreamtech
6. ASP.NET 4, Unleashed – Stephen Walther, Kevin Hoffman, Nate Dudek, Pearson
7. Professional C# .Net, Wrox publication

List of experiments:

No Name of Experiment

1 Write a program for Arithmetic Calculator using Windows Application.

2 Implement Windows Form based application using controls like menus, dialog
3 and tool tip,Master
Implement dropdown,
Formradio
with and selection
Windows button etc.
application.
4 Implement Overloading and Overriding, constructor and Destructor.
5 Write a program for events and Delegates.
6 Implement concepts of Inheritance, visual inheritance and Interface in windows
7 application.
Implement printing of GDI+ with windows application.
8 Use Dataset, Data Reader, XML Reader & Data Sources (SQL, Object & XML)
9 with Any Windows
Use Data Controls or
likeWeb Application.
Data List, Grid View, Detail View, Repeater and List
10 Bound Control
Implement web application using ASP.NET with web controls.
11 Write a code for web application to provide input validations using Input
12 Valuators.
Create a Web application that illustrates the use of themes and master pages with
Site-Map.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

13 Create a Web Application in ASP.NET using various CSS

14 Implement the concept of state management in a web application.
15 Implement code in ASP.NET that creates and consumes Web service by any
16 web application.
Create the simple application to demonstrate the WPF concept.
17 Create the simple application to demonstrate the WCF concept.
18 Create the simple application to demonstrate the WF concept.
19 Create the simple application to demonstrate the Silverlight architecture.
20 Create the simple application to demonstrate the AJAX concept using AJAX toolkit.
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Subject Code: CT506D-N Subject Title: Optimization Techniques

Pre-requisite Numerical Methods, Linear Algebra, Differential Calculus

Teaching Scheme (Credits and Hours)

Teaching scheme Evaluation Scheme
Total Mid Sem
L T P Total Theory CIA Pract. Total
Credit Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 00 02 05 04 03 70 30 20 30 150

Course Objective:
 Introduction to optimization techniques using both linear and non-linear programming. The focus of
the course is on convex optimization though some techniques will be covered for non-convex
function optimization too. After an adequate introduction to linear algebra and probability theory,
students will learn to frame engineering minima maxima problems in the framework of
optimization problems.
 Cast engineering minima/maxima problems into optimization framework.
 Learn efficient computational procedures to solve optimization problems.
 Use Matlab/Scilab to implement important optimization methods.

Outline of the Course:

Sr. Minimum
Title of the Unit
No Hours
1 Mathematical preliminaries 10
2 Linear programming 12
3 Non-linear programming 4
4 Unconstrained optimization 12
5 Constrained optimization 10

Total hours (Theory): 48

Total hours (Lab): 32
Total hours: 80
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Detailed Syllabus

Sr. Topic Weight

No Lecture
age
Hours
(%)
1 Mathematical preliminaries: Vector space and matrices, Transformations,
Concept of Geometry, Elements of calculus. 10 21

2 Linear programming: Introduction to Linear Programming, Simplex Method

(The Simplex Algorithm, Two Phase Method, Revised Simplex Method), 12 25
Duality, Karmarkar’s Method.
3 Non-linear programming: Basics of Set Constrained and Unconstrained
Optimization, FONC, SONC and SOSC Conditions for Local Minimizers. 4 8

4 Unconstrained optimization: One dimensional Search Methods, Gradient

Methods, Conjugate Direction Methods, Quasi-Newton Methods. 12 25

5 Constrained optimization: Problems with Equality Constraints, Problems

with Inequality constraints, Algorithms for Constrained Optimization. 10 21

Total 48 100

Instructional Method and Pedagogy:

 At the start of course, the course delivery pattern, prerequisite of the subject will be discussed.
 Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
 Attendance is compulsory in lecture and laboratory which carries 10 marks in overall evaluation.
 One internal exam will be conducted as a part of internal theory evaluation.
 Assignments based on the course content will be given to the students for each unit and will be
evaluated at regular interval evaluation.
 Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in the overall
internal evaluation.
 The course includes a laboratory, where students have an opportunity to build an appreciation for the
concepts being taught in lectures.
 The course needs more focus on numerical examples based on exercises at the end of each chapter to
aware of methods more precisely.
 Experiments shall be performed in the laboratory related to course contents.
Learning Outcome:
On successful completion of this course, the student should be able to:
 Be able to model engineering minima/maxima problems as optimization problems.
 Be able to use Matlab/Scilab to implement optimization algorithms.
e-Resources:
 https://nptel.ac.in/courses/105108127/
 https://nptel.ac.in/courses/111105039/
 https://nptel.ac.in/courses/111104071/
 https://nptel.ac.in/courses/106108056/
 https://nptel.ac.in/courses/112106064/
 Kadi Sarva Vishwavidyalaya
Faculty of Engineering & Technology
Third Year Bachelor of Engineering (CE/IT)
(In Effect From Academic Year 2019-20)

Reference Books:
1. An introduction to Optimization by Edwin P K Chong, Stainslaw Zak
2. Nonlinear Programming by Dimitri Bertsekas
3. David Luenberger and Yinyu Ye, Linear and Nonlinear Programming, 3rd Edition, Springer, 2008.
4. Fletcher R., Practical Methods of Optimization, John Wiley, 2000.
5. Optimization: Theory and applications By S. S. Rao
6. Nonlinear Multiobjective Optimization By Kaisa Miettinen
7. Optimization For Engineering Design: Algorithms and Examples By Kalyanmoy Deb

List of experiments:
Sr. Name of Experiment
No
1 Write a C and SCILAB program to find Rank of a Matrix.
2 Perform various SCILAB Basic Commands.
3 Write a program in SCILAB to plot functions in 2D and 3D. (With Output)
4 Write a function in SCILAB to find weather given matrix is singular or not.
5 Write a SCILAB program to demonstrate Level Sets with Rosenbrock’s
(Banana) function. (With Output)
6 Implement a SCILAB program to find out various norms of vector and Matrix.
7 Write a function to find solution of Linear function AX=b in SCILAB.
8 Solve LPP problems using Karmarkar Method in SCILAB.
9 Plot LPP problems using Contour and Plot2d function in Scilab.
10 Formulate LPP problem from given problem statement.
11 Solve and Plot Primal and Dual problem using Karmarkar Method in SCILAB.
12 Plot and Prove FONC, SONC and SOSC condition of a function in SCILAB.
13 Implement Secant Method in SCILAB.
14 Implement Newton Raphson Method in SCILAB.
15 Implement Golden Section Method in SCILAB.
16 Implement Fibonacci Series Method in SCILAB.
17 Solve Quadratic Programming Problem using qp_solve function in Scilab.
18 Solve Non Linear Programming Problem using optim in SCILAB.
19 Implement function for Steepest Descent Method in SCILAB.
20 Implement function for BFGS method in SCILAB.