Vous êtes sur la page 1sur 214

NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY

(AN AUTONOMOUS INSTITUTION, AFFILIATED TO VTU, BELGAUM AND ACCREDITED BY NBA, NEW DELHI)

YELAHANKA, BANGALORE – 560064

Department of Computer Science and Engineering

SCHEME OF TEACHING AND EXAMINATION


FOR III TO VIII SEMESTER B.E PROGRAMME (AUTONOMOUS
SCHEME) & SYLLUBUS FOR III TO IV SEMESTER

2014 Batch

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 1
Vision and Mission of Department
Vision:

To be a center of excellence in the field of Computer Science and Engineering, imparting


sustainable quality education along with ethical values.

Mission:

The department of Computer Science and Engineering is dedicated to prepare its students for
excellent professional career and higher studies by providing fundamental knowledge of basic
sciences and principles of Computer Science and Engineering with conducive teaching-learning
and research environment, inculcating entrepreneurship and leadership skills, enabling them to
serve the engineering profession and society.

Programe Education Objectives (PEOs)


1. Excel in Professional career by acquiring knowledge in basic sciences and Computer
Science and Engineering principles.

2. Graduates are capable of pursuing higher education and research.

3. Adapt to technological advancements by engaging in lifelong learning with leadership


qualities, professional ethics and soft skills.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 2
Program Outcomes

A Graduates will be in a position to apply knowledge of mathematics, physics, and


chemistry and allied engineering subjects as applicable to Computer Science and
Engineering.

B Graduates will have the ability to identify, formulate and design solutions in the
areas of Computer Science and Engineering

C Graduates will demonstrate the abilities to design and develop algorithms and
implement them with analysis and interpretation of data

D Graduates are able to address the challenges of complex and computation


intensive problems

E Graduates will have the ability to visualize and work independently or in teams

F Graduates are able to adopt any modern engineering tool or software for
analyzing and solving various computer engineering problems.

G Graduates will have knowledge of professional and ethical responsibilities

H Graduates are able to communicate effectively.

I Graduates will be able to incorporate the understanding of impact of social,


cultural and global aspects in their professional practice

J In the fast changing scenario of technical and business eco system, the graduates
will understand the need for quality, timeliness, life-long learning and adopt
themselves accordingly

K Graduates will have the knowledge of contemporary issues and able to apply
various software engineering approaches for project management

L Graduates will understand the impact of professional engineering solutions in


environmental contexts and the need for sustainable development.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 3
SCHEME OF TEACHING & EXAMINATION

Sl. Semester I/II III IV V VI VII VIII Total


No.
1 Humanities 02 3 03 - 08
2 Basic Science Core 19 08 08 35
3 Basic Engineering Core 27 27
4 Engineering Core Subject 17 19 19 16 15 06 92
5 Core Electives 04 04 03 03 14
6 Open Electives 03 03 03 09
7 Project 15 15
TOTAL 48 25 27 26 26 24 24 200

III - Semester - Computer Science and Engineering


Scheme of Teaching & Examination
Sl. Subject Subject Name Teaching Teaching Examination Credits
No Code Dept./BOS Hours/Week
L T P S CIE SEE Total

1 14MAT31 Engineering Maths - III Maths 4 1 - - 50 50 100 4


Design of Analog and CSE
2 14CS32 4 - - - 50 50 100 4
Digital Circuits
3 14CS33 Data Structures CSE 3 1 - - 50 50 100 4
Discrete Mathematical
4 14CS34 CSE 4 1 - - 50 50 100 4
Structures
Introduction to Unix
5 14CS35 CSE 3 - 1 - 50 50 100 4
and Shell programming
6 14CSL36 Data Structures Lab CSE - - 4 - 50 50 100 1.5
Design of Analog and
7 14CS3L7 CSE - - 4 - 50 50 100 1.5
Digital Circuits Lab
8 14CS38 Miniproject CSE - - 3 - 50 50 100 2
Total 400 400 800 25

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 4
IV - Semester - Computer Science and Engineering
Scheme of Teaching & Examination

Sl Subject Subject Name Prereq Teach Teaching Examination Cre


.N Code uisite ing Hours/Week dits
o Dept./ L T P S CIE SE Tota
BOS E l
Engineering Maths - Maths - Maths/
1 14MAT41 4 1 - - 50 50 100 4
IV III Science
Object Oriented 14CS33
2 14CS41 Programming with CSE 4 - - - 50 50 100 4
C++
14CS33,
Design and Analysis 14CS34
3 14CS42 CSE 4 - - - 50 50 100 4
of Algorithms

Maths/
4 14CS43 Graph Theory 4 - - 50 50 100 4
CSE 1
Computer 14CS33
5 14CS44 Organization & CSE 4 - - - 50 50 100 4
Architecture
14CS32
6 14CS45 Microprocessors CSE 4 - - - 50 50 100 4

7 14CSL46 MP Laboratory CSE - - 4 - 50 50 100 1.5

8 14CSL47 OOP Laboratory CSE - - 4 - 50 50 100 1.5


Total 400 400 800 27

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 5
V - Semester - Computer Science and Engineering
Scheme of Teaching & Examination
Sl. Subject Subject Name Prereq Teachi Teaching Examination Credi
No Code uisite ng Hours/Week ts
Dept./B L T P S CIE SEE Tot
OS al
1 14CS51 Computer Networks-1 4 - - - 50 50 100 4
Automata Theory & 14CS3
2 14CS52 4 CSE 4 - - - 50 50 100 4
Compiler Design
14CSE
3 Program Elective – 1 CSE 3 - - - 50 50 100 4
5XX
14CSO
5 Open Elective – 1 CSE 4 1 - - 50 50 100 3
5XX
Database Management 14CS3
4 14CS54 CSE 4 - - - 50 50 100 4
Systems 3
14CS3
6 14CS55 Operating Systems 3,14CS CSE 4 1 - - 50 50 100 4
44
14CSL
7 DBMS Laboratory CSE - - 4 - 50 50 100 1.5
56
14CSL
8 OS Laboratory CSE - - 4 - 50 50 100 1.5
57
Total 400 400 800 26

Program Elective – 1 (V Semester)


Sl.No Subject code Subject Name L# T# P# S#

1 14CSE561 Cryptography and Network Security 3 - 1 -

2 14CSE562 Introduction to Web Technology 4 - - -

3 14CSE563 Introduction to Digital Image Processing 4 - - -

4 14CSE564 Unix System programming 4 - - -

5 14CSE565 Computer Architecture 4 - - -

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 6
Open Elective – 1 ( V Semester )
Sl. Subject Subject Name L# T# P# S#
No code

1 14CSO561 Robotics 1 - 3 -

2 14CSO562 Embedded Systems and Applications 3 1 - -

3 14CSO563 Control Systems 3 1 - -

4 14CSO564 Systems Analysis and Design 3 - 1 -

VI - Semester - Computer Science and Engineering


Scheme of Teaching & Examination
Sl. Subject Subject Name Prereq Teach Teaching Examination Cred
No Code uisite ing Hours/Week its
Dept./ L T P S CI SE Tot
BOS E E al
1 14CS61 Core Java 14CS31 CSE 4 - - - 50 50 100 4
14CS31
2 14CS62 Software Engineering CSE 3 1 - - 50 50 100 4

14CSE6 --
3 Program Elective-2 CSE 3 - - - 50 50 100 4
XX
4 14CS63 Computer Network-2 14CS52 CSE 4 - - - 50 50 100 4
14CSO6 --
5 Open Elective– 2 CSE 3 - - - 50 50 100 3
XX
Computer Graphics 14CS41
6 14CS64 CSE 3 1 - - 50 50 100 4
with OpenGL
7 14CSL65 CN Laboratory CSE - - 4 - 50 50 100 1.5
8 14CSL66 CG Laboratory CSE - - 4 - 50 50 100 1.5
400 400 800 26
Total

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 7
Program Elective – 2 ( VI Semester )
Sl. Sub Subject Name L T P S
No Code # # # #

1 14CSE651 Python Programming


4 - - -
2 14CSE652 Advanced DBMS 3 1 - -

3 14CSE653 Data warehousing and Data Mining 3 - 1 -

4 14CSE654 Advanced Digital Image Processing 3 1 - -

5 14CSE655 Advanced Computer Architecture


4 - - -
6 14CSE656 Internet of Things
4 - - -
7 14CSE657 Introduction to ASP.net
4 - - -

Open Elective – 2 ( VI Semester )


Sl. Subject Subject Name L# T# P# S#
No code

1 14CSO661 Operations Research


3 1 - -
2 14CSO662 Decision Support System
3 1 - -
Business Intelligence and Its
3 14CSO663
Applications 3 - 1 -

Software Architecture and Project


4 14CSO664
Management 3 1 - -

Algorithms for Image & Video


5 14CSO665
Processing 3 - 1 -

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 8
VII - Semester - Computer Science and Engineering
Scheme of Teaching & Examination
Sl. Subject Subject Name Prereq Teachin Teaching Examination Cre
No Code uisite g Hours/Week dits
Dept./B L T P S CIE SEE Total
OS
1 14CS71 Android Programming CSE 4 1 - - 50 50 100 4
2 14CS72 Distributed Computing CSE 3 1 - - 50 50 100 3
14CSE5
3 Program Elective – 3 CSE 3 - - - 50 50 100 4
XX
4 14CS73 Open Elective -3 CSE 3 - - - 50 50 100 3
Entrepreneurship and
5 14CS74 CSE 3 - - - 50 50 100 3
Management
Programming in
6 14CS75 Visual C# for CSE 4 1 - - 50 50 100 4
.NET Technology
Android programming
7 14CSL76 CSE - - 4 - 50 50 100 1.5
Laboratory
Distributed Computing
8 14CSL77 CSE - - 4 - 50 50 100 1.5
Laboratory
Project
9 10CSP78 Preliminary/Technical - - 4 - 50 - - -
Seminar
Total 450 400 850 24

Program Elective -3 (VII sem)


Sl. Sub Subject Name(Pre-Requisite) L T P S
No Code # # # #

1 14CSE751 Information Security (10CSE651) 4 - - -

2 14CSE752 Advanced Computer Networks 4 - - -

4 14CSE754 Information retrieval 4 - - -

5 14CSE755 Mobile Computing 4 - - -

6 14CSE756 Soft Computing 4 - - -

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 9
Open Elective – 3 ( VII Semester )
Sl.No Subject Subject Name L# T P S#
code # #

1 14CSO761 Building Enterprise 4 - - -


Applications
2 14CSO762 Service Oriented
Architecture 4 - - -
3 14CSO763 Natural Language 4 - - -
Processing
4 14CSE764 Software Testing 4 - - -

VIII - Semester - Computer Science and Engineering


Scheme of Teaching & Examination
Sl. Subject Subject Name Prere Teachi Teaching Examination Credi
No Code quisit ng Hours/Week ts
e Dept./ L T P S CIE SE Tot
BOS E al
1 10CS81 Cloud Computing CSE 3 - 1 - 50 50 100 4
10CSE82
2 Program Elective – 4 CSE 3 - - 1 50 50 100 3
X
3 10CSP83 Project work CSE - - 30 - 50 50 100 15
Internship/ Minor
4 10CSP84 Project/ Self study CSE - - - 8 50 50 100 2
Course
Total 200 200 400 24

Program Elective – 4 ( VIII Semester)

Sub Code Subject Name(Pre-Requisite) L# T# P# S#

1 10CSE821 Computer and Cyber Security (10CSE751) 4 - - -

2 10CSE823 Storage Area Networks 4 - - -

3 10CSE824 Wireless Ad Hoc & Sensor Networks 4 - - -

4 10CSE825 Analysis of Computer Networks 4 - - -

5 10CSE826 BigData & Analytics 4 - - -

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 10
III Semester Subjects
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Engineering Mathematics - III Course Code: 14MAT31
L-T-P: 4-1-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Objectives: To understand the periodic and harmonic phenomena and to be able to model them
using Fourier series To understand integral transforms such as Laplace and Fourier transforms,
To understand the advantages, limitations and applications of different numerical techniques.

Expected outcomes:
 Students understand that any periodic function can be converted to harmonic using
trigonometric series and also learn to trace different periodic functions.
 Students learn the importance of numerical methods, advantage and disadvantages of the
same and also the limitations of various methods
 Basic concepts of Integral transforms and applications

Unit-I 10 hours
Laplace Transforms: Definition, Transforms of standard functions, Transforms of e at f t  ,
f t 
t n f t  , , Laplace transforms of derivatives and integrals, Laplace transforms of periodic
t
functions, unit step function, Dirac delta function . Inverse Laplace transforms, convolution
theorem, solutions of 1st and 2nd order ODE using Laplace transforms

Unit-II 10 hours
Fourier series: Euler‘s formulae, Dirichlet‘s conditions for Fourier series expansion, change
of interval, Even and odd function, half range series, Practical harmonic analysis.

Fourier Transforms: Definition, Complex Fourier transforms, Cosine and Sine transforms,
Properties, Inverse Fourier transforms.
.
Unit – III 10 hours
Errors, absolute, relative and percentage errors.
Solution of transcendental equation – iteration method, Aitken‘s 2 process, Secant method,
Newton Raphson method
Finite differences – forward, backward, central,
Interpolation, Newton‘s forward and backward formulae, Newton‘s divided difference formulae
and Lagrange‘s formula for unequal intervals and inverse interpolation by Lagrange‘s formula,
Stirling‘s formula
Evaluation of derivatives using Newton‘s forward and backward difference interpolation
formulae

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 11
Unit – IV 10 hours
Numerical Integration by Trapezoidal, Simpson‘s 3 and 8 rule, Weddle‘s rule, Gaussian
1 3

Quadrature.
Numerical solution of ordinary differential equations: Taylor‘s series method, Runge-Kutta 4th
order method, Milne‘s predictor corrector method, shooting method.

Unit – V 8 hours
Linear algebra: Solution of system of equations by Gauss Siedel method, LU decomposition,
Solution of Tridiagonal system using Thomas algorithm, Eigen values of symmetric matrix by
Jacobi method, Reduction to tridiagonal system by Given‘s method, Largest eigen value by
Power method

Text Book:
1. Higher Engg. mathematics by Dr. B S Grewal, 42nd Edition
2. Advanced Engg. Mathematics by Erwin E Kreyszig, 10th edition, Wiley.
3. Introductory methods of numerical analysis, by S S Sastry, PHI India

CO Description
CO 1: Students will be able to apply the concepts, analyze the importance and applications
of Fourier analysis
CO 2: Students will be able to solve problems using numerical techniques and apply them for
different situations
CO 3: Students will be able to solve problems using combinatorial techniques.

IV. Mapping of Course outcomes (COs) to Program outcomes (POs)

Engineering Mathematics-III course maps majorly to A to C program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S S M

CO2 S M M

CO3 S M M

Fig 1: Mapping of Course outcomes to Program outcomes

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 12
 Assignment Test- 10 Mark
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type:Programme Core


Course Title: Design of Analog and Digital Course Code: 14CS32
Circuits
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of basic concepts of electronics, Binary System.

UNIT – I
12 Hrs
Boolean laws, theorems and Combinational Circuits : Boolean laws and theorems, logic
functions, minimization of Boolean functions using theorems. SOP methods and POS method
and simplifications. Truth table to Karnaugh map. K-map simplifications, Don‘t care conditions.
Data Processing Circuits : Multiplexers, Demultiplexers, BCD to decimal decoders, seven
segment decoders , Encoders, Exclusive or gates, Parity generator. Magnitude Comparator, Read
– only memory, programmable array logic, Programmable logic array. Data processing Circuit.
Arithmetic Circuits : Binary Adder – Half Adder, Full Adder, Binary subtractors – Half
Subtractor, Full Subtractor,

UNIT – II 12 Hrs
Flip-flops : RS flip flop, Gated Flip-flops, Edge triggered RS- flipflop, Edge triggered JKflip-
flop. JK Master Slave Flip-flop, Registers: types of registers, Serial In Serial Out, SIPO, PISO,
PIPO.
Counters: Asynchronous Counters, Decoding gates, Synchronous Counters, Changing the
counter Modulus Decade counters, Counter design as synthesis Problem. Model selection,
Design of sequential Circuits. State Transistion Diagram, State Synthesis Table, Design
Equation and Circuit Diagram, Implementation using Read Only Memeory, Algorithmic State
Machine. state reduction techniques, Analysis and design of Asynchronous sequential circuits

UNIT – III 08 Hrs


D/A conversion and A/D conversion : Variable, Resistor Networks, Binary Ladders, D/A
Converters, D/A Accuracy and Resolution, A/D Converter-Simultaneous Conversion, A/D
Converter-Counter Method, Continuous A/D Conversion, A/D Techniques, Dual-Slope A/D
Conversion, A/D Accuracy and Resolution.

UNIT – IV 8 Hrs

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 13
Diode Theory: Basic idea, Ideal Diode, the second approximation, the third approximation.
Diode Circuits : Half-wave Rectifier, The transformer, Full-wave Rectifier, Clippers, The Bridge
Rectifier, Clipper and limiters, Clampers, voltage multiplier. Zener diode.

UNIT – V 08 Hrs
Operational Amplifier: Introduction to Op amps, The 741 op amp, The Inverting Amplifier, The
non inverting amplifier. Two op amp applications. Comparators with zero reference, non zero
references, Comparators with hysteresis. Window comparators The integrators. Waveform
Conversion, Waveform generation, the differentiator.

TEXT BOOK
1. Digital Principles and Applications, Donald P Leach, Albert Paul Malvino & GoutamSaha,
6th Edition, TMH, 2006.(Unit 1,2,3 )
2. Electronic Principles, Albert Malvino& David J Bates, 7th Edition, TMH, 2007.(Unit 4, 5)

REFERENCE BOOKS
1, Digital logic and computer design, M Morris Mano, Prentice-Hall of India.(Unit 1,2,3).
2. Fundamentals of Logic Design, Charles H. Roth, Jr., 5th Edition, Thomson, 2004.
3. Digital Systems Principles and Applications, Ronald J. Tocci Neal S. Widmer, Gregory L.
Moss, 10th Edition, PHI/Pearson Education, 2007.

Course outcomes

CO Description
CO 1: The Students will be able to gain knowledge on Boolean laws a, combinational
circuits, sequential circuits and basics of electronic circuits.
CO 2: Students will be able to design various synchronous and asynchronous circuits using
flip flop and ROM.

CO 3: Students are able to design clipper, clamper and operational amplifiers.

CO 4: Students will be able to analyze concept of analog to digital and digital to analog
convertors.

CO 5: Students are able to apply knowledge of k map simplification for designing


combinational circuits and sequential circuits.

Mapping of Course outcomes (COs) to Program outcomes (POs)

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 14
Design of Analog and Digital Circuits course maps majorly to A,B,D and F program
outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S

CO2 S S M S

CO3 S M S

CO4 S s S

CO5 S S M S M

Fig 1: Mapping of Course outcomes to Program outcomes

Assessment Method
Midterm Test (Avg. of 2 Tests) – 30 Marks
Surprise Test – 10 Marks
Assignment Test - 10 Marks

-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Data Structures Course Code: 14CS33
L-T-P: 3-1-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Student should have knowledge of programming in C

UNIT – I 10 Hrs

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 15
Structures and Unions: Introduction, Defining a Structure, Declaring Structure Variables, Accessing Structure
Members, Structure Initialization, Copying and Comparing Structure Variables, Operations and Individual
Members, Array of Structures, Arrays within Structures, Structures within Structures, Structures and Functions,
Unions, Size of Structures

Pointers; Introduction ,Understanding Pointers, Accessing the Address of a Variable, Declaring Pointer
Variables, Initialization of Pointer Variables, Accessing a Variable through the Pointer, Chain of Pointers,
Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and Character Strings,
Array of Pointers, Pointer as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers
and Structures

Dynamic Memory Allocation; Introduction, Dynamic Memory Allocation, Allocating a Block of Memory:
Malloc, Allocating a Multiple Blocks of Memory: Calloc, Releasing the Used Space: Free, Altering the size of
Block: Realloc

Command line arguments; File management with command line arguments

10 Hrs
The Stack: Definition and Examples— Primitive operations, examples
Representing Stacks in C – Implementing the POP operation, testing for exceptional conditions,
implementing the PUSH operation An Example: Infix, Postfix, and Prefix – Basic definitions and examples,
evaluating a postfix expression, program to evaluate a postfix expression, converting an expression from infix
to postfix, program to convert an expression from infix to postfix

Recursion: Recursive Definition and Processes— factorial function, multiplication of natural numbers.
Fibonacci sequence, binary search

Recursion in C – factorial, Fibonacci numbers, binary search, recursive chains ,Writing Recursive Programs –
Towers of Hanoi, Binary Search

UNIT – III 10 Hrs


Queues:
The Queue and its Sequential Representation : C Implementation of Queues, Insert Operation, Priority
Queue, Array Implementation of a Priority Queue.

Lists:

Linked Lists :Inserting and Removing Nodes from a List, Linked Implementation of Stacks, getnode and
freenode Operations, Linked Implementation of Queues, Linked List as a Data Structure, Examples of List
Operations, List Implementation of Priority Queues, Header Nodes

Lists in C ; Array Implementation of Lists, Limitations of the Array Implementation, Allocating and Freeing
of Dynamic variables, Linked Lists using Dynamic Variables, Queues as List in C, Examples of List
Operations in C, Noninteger and Nonhomogeneous Lists, Comparing the Dynamic and Array Implementations
of Lists, Implementing Header Nodes

UNIT – IV 9 Hrs

Other List Structures : Circular Lists, Stack as a Circular List, Queue as a Circular List, Primitive Operations
on Circular Lists, Header nodes, Addition of Long Positive Integers Using Circular Lists, Doubly Linked Lists,
Addition of Long Integer Using Doubly Linked Lists

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 16
Binary Trees: operations on Binary Trees, Applications of Binary Trees

UNIT – V 9 Hrs

Binary Tree Representations : Node Representation of Binary Trees, Internal and External Nodes, Implicit
Array Representation of Binary Trees, Choosing a Binary Tree Representation, Binary Tree Traversal in C,
Threaded Binary Trees.

Representing Lists as Binary Trees: Finding the kth Element, Deleting an Element, Implementing Tree-
Represented Lists in C, Constructing a Tree-represented List

Trees and Their Applications: C Representations of Trees, Tree Traversals, General Expressions as Trees,
evaluating an expression tree, constructing a Tree.

Text Books

1. Programming in ANSI C: E Balagurusamy,Third edition,TATA McGraw HILL

2. Data Structure using C, Aaron M. Tanenbaum, Yedidyah Langsam &Moshe J. Augenstein, Pearson Education/PHI, 2006

Reference Books
1. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall Software Series, 2 nd
Edition.
2. Data Structures A Pseudo code approach with C, Richard F. Gilberg and Behrouz A. Forouzan, Thomson, 2005.
3. Data Structures & Program Design in C, Robert Kruse & Bruce Leung, Pearson Education, 2007.
4. Fundamentals of Data Structures in C, Horowitz, Sahani, Anderson, Freed, Second edition, 2008.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 17
II. Course outcomes (COs)
Having successfully completed the course, student will:

File File management:


management:

CO 1: Define, understand and describe C programming concepts like Structures,


Pointers, Dynamic Memory Allocation, Command line arguments and data
structures like stack, queues, linked lists and binary trees.
CO 2: Design and trace the algorithms for simple problems and for various operations on
different data structures studied.
CO 3: Write programs in C for simple known problems and to simulate operations and
applications of data structures learnt.

IV. Mapping of Course outcomes (COs) to Program outcomes (POs)


Fig 1: Mapping of Course outcomes to Program outcomes

Data Structures course maps majorly to B,C,D,E program outcomes


A B C D E F G H I J K L
POs

COs
CO1 S
CO2 S S
CO3 S S S

Delivery Methods:
 Blackboard teaching/Power Point presentations (if needed)
 Regular review of students by asking questions based on topics covered in the class
 On the spot problem solving
Assessment Methods
 Surprise Tests: Two Surprise tests out of 10 marks will be conducted and best of two will be taken.
 MSE; Three MSEs will be conducted and average of best two will be taken
 Programming Assignments for 10 marks
 Final examination, of 100 Marks will be conducted and will be evaluated for 50Marks.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 18
Department: Computer Science and Engineering Course Type:Programme Core
Course Title: Discrete Mathematical Structures Course Code: 14CS34
L-T-P:4-1-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Course outcomes:
1. Students analyze basics knowledge gained by mathematical logic, functions and relation
and apply them
2. Students are able to apply concepts of coding theory and model different situations
3. Students will be able to understand the importance of combinatorics
Course Content:

Unit – I (10 hours)

Logics and Proofs – Propositional Logic, Equivalence, Predicates and Quantifiers, Nested
Quantifiers, Rules of Inference, ntroduction to proofs. Topics (Text Book 1): 1.1 to 1.6

Unit – II (10 hours)

Combinatorics - The Pigeonhole Principle – Simple form, Strong form. The Inclusion –
Exclusion Principle, Combination with repetition, Derangements. Recurrence Relations and
Generating Functions – Some number sequences, Linear homogeneous recurrence relations,
Generating functions, Recurrences and generating functions and Exponential generating
functions. Topics (Text Book 3): 2.1, 2.2, 6.1 to 6.3, 7.1 to 7.5 and 7.6.

Unit – III (10 hours)

Relations and Digraphs - Properties of Relations, Equivalence Relations, Computer


Representation of Relations and Digraphs, Operations on Relations, Warshall‘s algorithm,
Partially ordered Sets, Extremal elements of Posets , Lattices. Topics (Text Book 2): 4.2 to 4.7
and 6.1 to 6.3

Unit – IV (10 hours)

Functions – Functions, Functions for Computer Science, Permutation Functions, Finite


Boolean Algebra, Functions on Boolean Algebra, Circuit Designs. Topics (Text Book 2): 5.1,
5.2, 5.3, 6.4, 6.5 and 6.6

Unit – V (8 hours)

Groups and Coding Theory – semi groups, Products and Quotients of Semi groups, Groups
Producs and Quotients of Groups, Coding of Binary Information and error detection, Decoding
and Error Detection.
Topics (Text Book 2): 10.1 to 10.4 and 11.1 to 11.2

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 19
Text Books:

1. Discrete Mathematics & its Applications, Keneth H Rosen, 6th Edition, McGraw-Hill.
2. Discete Mathematical Structures, Kolman, Busby and Ross, 4th Edition, Pearson Education
Asia.
3. Introductory Combinatorics, Richard A. Brualdi, 4th Edition , Pearson.

References : 1. Treatise on Discrete Mathematical Structures, Jayan Ganguly, Revised Edtion


2012, Pearson.
2. Discrete Mathematics with Proof, Eric Gossett, 2nd Edition, Wiley.

Course outcomes

CO Description
CO 1 Students will be able to analyze and apply the knowledge gained by mathematical
logic, functions and relation.
CO 2: Students are able to apply concepts of coding theory and model different situations

CO 3: Students will be able to apply the concepts acquired for different purposes

Mapping of Course outcomes (COs) to Program outcomes (POs)

Discrete Mathematical Structures course maps majorly to A, B & C program outcomes

Pos A B C D E F G H I J
K L
Cos

CO1 S S S

CO2 S S S

CO3 S S S

Fig 1: Mapping of Course outcomes to Program outcomes

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 20
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Introduction to Unix and Shell Course Code: 14CS35
Programming
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:

 Students should have basic programming knowledge of C.

Course Educational Objectives:

The main object of this subject is to teach the students

 The usage of various commands according to the requirement.


 To write their own Shell scripts and programs to perform the given task.
 To enhance their knowledge in Unix Shell Programming

UNIT – I 10 Hrs

Introduction: The operating System, UNIX Operating System, Features of UNIX,


Architecture of UNIX, Locating Commands, Internal and External Commands, Command
Structure, Flexibility of Command Usage, Getting Help. General-Purpose Utilities: cal, date,
echo, printf, bc, script, passwd, who, uname, tty, stty. File System: The File, File name,
Parent-child Relationship, The HOME Variable, pwd, cd, mkdir, rmdir, Absolute Pathnames,
Relative Pathnames, ls, UNIX file system

UNIT – II 9 Hrs

Handling Ordinary File: cat, cp, rm, mv, more, lp, file, wc, od, cmp, comm, diff, Converting
between DOS and UNIX, Compressing and Archiving Files. Basic File Attributes: Listing file
attributes, Listing Directory attributes, File Ownership, File Permission, Changing File
Permissions, Directory Permissions, Changing File Ownership. More File Attributes: File
Systems and Inodes, Hard Links, Symbolic Links, The Directory, Default file and Directory
Permissions, Modifications and Access Times, Locating Files.

UNIT – III 9 Hrs


CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 21
The Shell: Shell offerings, Pattern matching, Escaping and Quoting, Redirection, Pipes, tee
command, Command Substitution, Shell variable.Customizing Environmental Variables: The
Shells, Environmental Variables, aliases.Regular Expressions: Searching for pattern, Basic
Regular Expression, Extended Regular Expression, Interval Regular Expression, The Stream
editor.Essential Shell Programming

UNIT – IV 10 Hrs

The Process: Process Basics, Process Status, System Processes, Mechanism for process
creation, Internal and External Commands, Process states and Zombies, Running jobs in
background, Reducing the job priority, Killing processes.Simple Filters, awk – An Advanced
Filter

UNIT – V 10 Hrs

Perl: The master manipulator, Perl preliminaries, chop function, variables & operators, String
handling functions, lists & arrays, foreach: looping through a list, split: splitting into a list or
array, join, grep, associative arrays, subroutines.Essential System Administration: The System
Administer Login, Administrator‘s Privileges, Maintaining Security, User Management,
Startup and Shutdown.

Text Books

1. UNIX – Concepts and Applications, Sumitabha Das, 4th Edition, Tata McGraw Hill,
2006.

Reference Books
1. UNIX and Shell Programming, Behrouz A. Forouzan and Richard F.Gilberg,
Thomson, 2005.
2. UNIX & Shell Programming, M.G. Venkateshmurthy, Pearson Education, 2005.
3. Meeta Gandhi, Tilak Shetty, Rajiv Shah, ―The ‗C‘ Odyssey Unix – the open boundless
C‖, BPB.
4. Mike Joy, Stephen Jarvis, Michael Luck, ―Introducing Unix and Linux‖, Palgrave
Macmillan.

Course Outcomes (COs)


Students will be able to

CO Description

CO 1: Understand the fundamental knowledge and concepts of UNIX Operating System.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 22
CO 2: Describe and interpret the working of commands available in UNIX.

CO 3: Acquire the concepts of UNIX shell as a beginner user

CO 4: Apply scripting languages, such as Awk or Perl to write simple programs.

Mapping of Course outcomes (COs) to Program outcomes (POs)

Introduction to Unix and Shell Programming course maps majorly to B and E


Program Outcomes

A B C D E F G H I J K L
Pos

Cos

CO1 S S

CO2 S S

CO3 S M M

CO4 S M S

Assessment Method

 Midterm Test (Avg. of 2 Tests) – 30 Marks


 Lab Component – 10 Marks
 Course Project - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Data Structures Laboratory Course Code: 14CSL36
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 23
Prerequisites:

 Students should have basic knowledge of C programming constructs and should be able
to write basic C programs
Design and Implement programs for the following Data Structure Concepts.
Pointer applications, dynamic memory allocation Stack simulation and its applications, Simple
queue, Circular queue, Singly linked list, Circular list, Doubly linked list and Binary Search
Trees .
CO Description
CO 1: Students will be able to write C programs using structures, unions, dynamic memory
allocation functions and command line arguments

CO 2: Students will be able to implement various linear data structures like stacks, queues,
linked lists using static and dynamic allocation and their applications

CO 3: Students will be able to implement nonlinear data structure binary search tree

Data structures Laboratory course maps majorly to B,C,D and E program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 M S

CO2 M S S M

CO3 S M S

Assessment Method
 Experiment Write-up + Execution + Viva - 15 Marks
 Lab Record Writing - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Design of Analog and Digital Circuits LAB Course Code: 14CSL37
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 24
Prerequisites:
 Should have basic knowledge about the basics of electronics and basic concepts in logic
design
Part A
1. Design a circuit for Full Adder.
2. Design a circuit for Conversion of BCD to Excess – 3 codes.
3. Application of MUX/DEMUX.
4. Parity generator.
5. Design of Asynchronous Counter.
6. Design of Ring Counter/Johnson Counter.
7. Design of Sequence generator.
8. BCD to Seven Segment display.

Part B
1. Design a circuit for Full Adder using HDL.
2. Design a circuit for Conversion of BCD to Excess – 3 codes using HDL.
3. Application of MUX/DEMUX using HDL.
4. Application of Decoder using HDL.
5. Design of 3 bit Synchronous Counter using HDL.
6. Design of Asynchronous Counter using HDL.
7. Design of Ring Counter/Johnson Counter using HDL

Note: In SEE, student has to pick a lot for question that contains subsections from Part-A and
Part-B and has to execute both the subsections compulsorily

CO Description
CO 1: Implement BCD to excess 3 convertor , synchronous counter , asynchronous counter
and ring counter

CO 2: Design and implement multiplexer , demultiplexer and decoder

CO 3: Design and implement circuits using HDL

Assessment Method
 Experiment Write-up + Execution + Viva - 15 Marks
 Lab Record Writing - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 25
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: MiniProject Course Code: 14CSL38
L-T-P: 0-0-3 Credits: 2
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have basic knowledge of C programming constructs and should be able to write basic C programs

Students are expected to take up mini project in a group of size not exceeding four. A mini project objective is to solve a real-
world problem using Files, arrays, structures of C Programming. The title, synopsis and implementation should be approved by
the faculty coordinator.

The mini project is evaluated for 50 CIE and 50 SEE marks, strictly as per the Rubrics Evaluation given
below.

Performance Low Medium High


Indicators

Relating No or very little use of Data Some of the C / Any other Effective C/other Language
Theoretical structures, C /Any other Language constructs used constructs used in implementation
concept with language/concepts like Files, effectively in implementation
practical (10) Structures, arrays, functions for
implementation

Professional Unable to design and implement Some of the design and Original and creative
Ethics(10) the project effectively on own effort implantation is original implementation

Effective Has no coherent strategies for Has some strategies for problem- Formulates strategies for solving
Formulation of problem solving solving, but applying the strategies problems
strategies (10) planned, is inconsistent

Visualization of Result not presented in readable Some aspects of results are Result presented in readable
the results(10) form, not user friendly appreciable form, user friendly

Present and Disorganized and ineffective Organized, but ineffective Effective and organized
communicate presentation presentation presentation
effectively (10)

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 26
IV Semester Subjects
Department: Computer Science and Engineering Course Type:Programme Core
Course Title: Engineering Mathematics - IV Course Code: 10MAT41
L-T-P: 4-1-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Course Content

Unit – I 10 hours
Probability – Random experiments, sample paces, event, axioms, addition and multiplication,
conditional probability, independent events, Baye‘s theorem. Random variable, discrete
probability distribution, continuous random variables, continuous probability distribution,
graphical interpretation

Unit – II 8 hours
Joint distribution, expectation, variance, standard deviation, covariance Binomial, Poisson,
Normal, hyper geometric relations, gamma distribution

Unit – III 10 hours


Population and sample, sampling with and without replacement, sampling distribution of means,
sample variance. Unbiased estimate, reliability, confidence intervals for mean statistical
hypothesis, testing of hypothesis, Type I and II errors, one tailed, two tailed tests, t - distribution,
2 – test, and test for goodness of fit.

Unit – IV 10 hours
Curve fitting by least square method (straight line, parabolic), correlation, regression, multiple
regression Stochastic process, n – step transitional probabilities, regular, ergodic matrices,
stationery distribution, classification of states, and Markov chain with absorbing states.

Unit - V 10 hours
Pure birth process, death process, birth and death process, Markovian queuing model,
M/M/1:/FIFO and M/M/c:/FIFO model. Open queuing networks, closed queuing networking.
Games, strategies, Games with and without saddle point, Principal of dominance, graphical
method.

TEXT BOOKS:
1. Probability and statistics, by Murray R Spiegel, J Schiller, R Alu Srinivasan, Schaum‘s outline
series, second edition
2. Operations research by Richard Bronson & Govindasami Nadimuthu, Schaum‘s outline
series, second edition
3. Higher engg. mathematicsby B V Ramana, Tata Macgrawhill, 2007

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 27
Department: Computer Science and Engineering Course Type: Programme Core

CO Description
CO 1: Students will be able to apply concepts of probability ,distributions and sampling to
different problems

CO 2: Students will be able to solve problems and model situations using techniques of
Markov process, queuing and game theory

CO 3: Students will be able model using statistical tools like curve fitting, hypothesis testing
and stochastic process

Mapping of Course outcomes (COs) to Program outcomes (POs)

Engineering Mathematics-IV course maps majorly to A to C program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S S M

CO2 S M M

CO3 S M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 28
Course Title: Object Oriented Programming Course Code: 14CS41
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Procedure Oriented Programming skill in ‗C‘ language, especially in structure and union constructs is strongly
recommended. Basic knowledge of file handling and command line arguments is required.
Course Content:

UNIT – I 10 Hrs
An Overview of C++ : object –Oriented Programming Principles,The origins of C++, C++
Fundamentals- Introducing C++ Classes, Function Overloading, Operator Overloading ,
Inheritance, Constructors and Destructors.
Classes and Objects : C++ Classes and Structures, Class and object declarations ,Friend
Functions, Friend Classes, Inline Functions, Static Class Members, The Scope Resolution
Operator, Functions and Objects.
Arrays, Pointers, References, and the Dynamic Allocation Operators: Arrays of Objects, this
Pointer, References, C++‘ s Dynamic Allocation Operators.

UNIT – II 10 Hrs
Function Overloading and Default Arguments: Function Overloading, Constructor types ,
Overloading Constructor Functions , Default Function Arguments, Function Overloading and
Ambiguity, The Three Steps of Overload Resolution.
Operator Overloading: Creating a Member Operator Function, Operator Overloading Using a
Friend Function, Overloading Some Special Operators, Overloading the Comma Operator

UNIT – III 10 Hrs


Inheritance :Base-Class Access Control, Inheritance and Protected Members, Inheriting
Multiple Base Classes, Constructors, Destructors and Inheritance, Granting Access, Virtual Base
Classes
Virtual Functions and Polymorphism: Virtual Functions, The Virtual Attribute Is Inherited,
Virtual Functions Are Hierarchical, Pure Virtual Functions, Using Virtual Functions, Early vs
Late Binding.

UNIT – IV 10 Hrs
Templates: Generic Functions, Applying Generic Functions, Generic Classes
Exception Handling: Exception Handling Fundamentals, Handling Derived-Class Exceptions,
Exception Handling Options, Applying Exception Handling

UNIT – V 8 Hrs
The C++ I/O System Basics: C++ Streams, The C++ Stream Classes, Formatted I/O,
Overloading << and >>.
C++ File I/O: <fstream> and File Classes, Opening and Closing a File, Reading and Writing
Text Files ,Unformatted and Binary I/O, More get() Functions, getline(),Detecting EOF, The
ignore() Function, Peek() and putback(),flush(),Random Access ,I/O Status, Customized I/O and
Files
CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 29
TEXT BOOK
1. The Complete Reference C++, Herbert Schildt, 4th Edition, TMH, 2005.

REFERENCE BOOKS
1. C++ Primer, Stanley B. Lippman, JoseeLajoie, Barbara E. Moo,4th Edition, AddisonWesley,
2005.
2. Object-Oriented Programming with C++, SouravSahay, Oxford University Press, 2006.
Course outcomes (COs)
Having successfully completed the course, student will be able to:

CO Description
CO 1: Define and explain with examples OOP concepts such as Inheritance, function
overloading, operator overloading, virtual functions, inline functions, classes,
objects, default arguments, static members, templates, exceptions and files.

CO 2: Use C++ and associated libraries to develop simple object oriented programs.

CO 3: Apply object-oriented programming principles in solving real-world problems.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Object Oriented Programming course maps majorly to A,B, D , E and H program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S M

CO2 S S

CO3 S S S S S

Fig 1: Mapping of Course outcomes to Program outcomes

Assessment Method:
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Course project – 20 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 30
Department : Computer Science and Engineering Course Type : Programme Core
Course Title: Design and Analysis of Algorithms Course Code: 14CS42
L-T-P: 4-0-0 Credits:04
Total Contact Hours:48 Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of C or C++ language
 Students should know the usage of summation formulae, recurrences in mathematics

UNIT I 10 Hrs
Introduction
What Is an Algorithm?
Fundamentals of Algorithmic Problem Solving
Fundamental Data Structures
Fundamentals of the Analysis of Algorithm Efficiency
The Analysis Framework
Asymptotic Notations and Basic Efficiency Classes
Mathematical Analysis of Nonrecursive Algorithms
Mathematical Analysis of Recursive Algorithms
Example: Computing the nth Fibonacci Number
Brute Force and Exhaustive Search
Selection Sort and Bubble Sort
Sequential Search and Brute-Force String Matching
Exhaustive Search
Depth-First Search and Breadth-First Search

UNIT II 8 Hrs
Decrease-and-Conquer
Insertion Sort
Topological Sorting
Decrease-by-a-Constant-Factor Algorithms - Binary Search
Variable-Size-Decrease Algorithms - Interpolation Search
Divide-and-Conquer
Mergesort
Quicksort
Binary Tree Traversals and Related Properties
Multiplication of Large Integers and Strassen‘s Matrix Multiplication

UNIT III 10 Hrs


Transform-and-Conquer
Gaussian Elimination
Balanced Search Trees
Heaps and Heapsort

Space and Time Trade-Offs


Sorting by Counting

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 31
Input Enhancement in String Matching
Horspool‘s Algorithm
Hashing
B-Trees
UNIT IV 10 Hrs
Dynamic Programming
Three Basic Examples
The Knapsack Problem and Memory Functions
Optimal Binary Search Trees
Warshall‘s and Floyd‘s Algorithms
Greedy Technique
Prim‘s Algorithm
Kruskal‘s Algorithm
Disjoint Subsets and Union-Find Algorithms
Dijkstra‘s Algorithm
Huffman Trees and Codes
UNIT V 10 Hrs
Iterative Improvement
The Maximum-Flow Problem
The Stable Marriage Problem
Limitations of Algorithm Power
Decision Trees
P,NP, and NP-Complete Problems
Coping with the Limitations of Algorithm Power
Backtracking - n-Queens Problem ,Subset-Sum Problem
Branch-and-Bound -Knapsack Problem

Text Book:
1. Introduction to the Design & Analysis of Algorithms, Anany Levitin, 3rd Edition, Pearson
education, 2011

Reference Books
1. Computer Algorithms by Horowitz E., Sahni S.,Rajasekaran S., Galgotia Publications, 2001
2. Introduction to Algorithms, Thomas H., Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 2nd Edition, PHI ,2006

Course Delivery: The course will be delivered through lectures, class room interaction,
numerical and programming exercises and self-study components.

Course outcomes (COs)

Having successfully completed the course, student will be able to:

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 32
CO Description
CO 1: Understand and use asymptotic notations to analyze the performance of algorithms
CO 2: Understand and analyze the design of algorithms using Brute force, Divide & Conquer,
Decrease & Conquer ,Transform & conquer, Dynamic Programming, Greedy
technique, Backtracking, Branch & Bound techniques.
CO 3: Apply the various algorithms to solve problems and analyze their efficiency.

Mapping of Course outcomes (COs) to Program outcomes (POs)

DAA course maps majorly to A,B,C,D program outcomes


Pos A B C D E F G H I J K L

Cos

CO1 S

CO2 S S S S M

CO3 S S S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) 30 Marks
 Problem Based Test 10 Marks
 Surprise Test (Objective Type) 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type:Programme Core


Course Title: Graph Theory Course Code: 10CS43
L-T-P: 4-1-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Course outcomes:
1. Students understand basic concepts of graph theory through definitions, examples and
problem solving
2. Students are able to prove and verify the results stated by theorems.
3. Students will be able to apply the techniques applied for modeling different situations
Course Content

Unit – I (8 hours)
Graphs and Graph Models, Connected Graphs, Common classes of Graphs, Multigraphs and
Digraphs, the Degree of a vertex, Regular Graphs, Degree sequences, Graphs and Matrices.
Proofs for the Theorems – 1.6, 1.7, 1.8, 1.11, 1.12
CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 33
Topics (Text Book 1): 1.1 to 1.4 and 2.1 to 2.4

Unit – II (8 hours)
Isomorphism, Graphs and Groups, Automorphism,.
Bridges, Trees, The minimum spanning Tree problem, The number of spanning Trees.
Proofs for the Theorems 3.6, 4.1, 4.2, 4.3, 4,4
Topics (Text Book 1): 3.1 to 3.3 and 4.1 to 4,4

Unit – III (8 hours)


Cut-vertices, Blocks, Connectivity, Eulerian Graphs, Hamiltonian Graphs
Digraphs - Strong Digraphs, Tournaments, Decision making.
Proofs only for the Theorems 6.1, 6.2, 6.6, 6.8,7.1
Topics (Text Book 1): 5.1 to 5.3 and 6.1, 6.2,7.1-7.3

Unit – IV (8 hours)
Matching, Planar Graphs.
Coloring - The Four Color Problem, Vertex Coloring, Edge Coloring, Ramsey Number of
Graphs.
Proof of 9.1
Topics (Text Book 1): 8.1, 9.1, 10.1 to 10.3 and 11.1

Unit – V (8 hours)
Distances – The Center of a Graph, Distant Vertices, Channel Assignment .
Domination- The Domination number of a Graph, Problems of Lights out.
Topics (Text Book 1): 12.1, 12.2, 12.5, 13.1 and 13.3

Text Book: 1. Introduction to Graph Theory, Grary Chartrand and Ping Zhang, Tata McGraw-
Hill Edition 2006.
References: 1. Graph Theory (Graduate Texts in Mathematics), Reinhard Diestel, 3rd Edition
(2006), Springer.

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Computer Organization Course Code: 14CS44
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 34
Prerequisites:
 Student should have prior knowledge of Logic Design, Electronic Circuits
 Student should have prior knowledge of Computer Concepts

UNIT – I 10 Hrs
Basic Structure of Computers: Computer Types, Functional Units, Basic Operational Concepts,
Bus Structures, Performance – Processor Clock, Basic Performance Equation, Pipelining and
Superscalar Operation, Clock Rate, Instruction set: CISC and RISC, Compiler, Performance
Measurement, multiprocessors and multi computers, Historical Perspective, Machine
Instructions and Programs: Basic Input/Output Operations, Input/Output Organization:
Accessing I/O Devices, Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts,
Handling Multiple Devices, Controlling Device Requests, Exceptions.

UNIT – II 10 Hrs
Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces, and The Memory
System: speed-size and cost, cache memories, Performance consideration.
UNIT – III 10 Hrs
Virtual Memories, Arithmetic: Addition and Subtraction of signed numbers, Design of Fast
Adders, Multiplication of positive Numbers, Signed Operand Multiplication, Fast Multiplication,
Integer Division, Floating-point Numbers and Operations

UNIT – IV 10 Hrs
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction,
Multiple Bus Organization, Hard-wired Control, Microprogrammed Control ,Pipelining: Basic
Concepts, Data Hazards, Instruction Hazards.

UNIT – V 8 Hrs
Embedded System: Examples of Embedded Systems, Processor Chips for embedded
Applications, A simple Microcontroller, Programming considerations, I/O device timing
Constraints, Reaction Timer- An example.

TEXT BOOKS
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 5th Edition, TMH
2. Computer Architecture and Organization, John P. Hayes, 3rd Edition, McGraw-Hill Series

REFERENCE BOOKS
1. Computer Organization & Architecture, William Stallings, 7th Edition, PHI, 2006
2. Computer Systems Design and Architecture, Vincent P. Heuring & Harry F. Jordan, 2nd
Edition, Pearson Education, 2004
3. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/PHI
4. Computer Organization & Embedded Systems – Car Hamacher, Zvonks Vranesic, Safea
Zaky, 6th Edition, McGraw Hill.
Course outcomes (COs)
Having successfully completed the course, student will be able to:
CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 35
CO Description
CO 1: Understand the major components of a computer including CPU, memory, I/O and
storage.
CO 2: Understand the uses for Cache memory and arithmetic and logical operations of
computers.

CO 3: Understand the concept of pipeline techniques, Basic processing unit, Embedded


system applications.

Mapping of Course outcomes (COs) to Program outcomes (POs)

Computer Organization course maps majorly to B,C,D and E program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S M S

CO2 S M S S M

CO3 S S M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type:Programme Core


Course Title: Microprocessors Course Code: 14CS45
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of basics of electronics.
 Students should have knowledge of basic concepts in logic design.

UNIT – I 12 Hours
Introduction Evolution of Microprocessors, 8086 microprocessor family, 8086 Internal
Architecture, 8086 Signal Descriptions, Physical memory organizations of 8086, General Bus

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 36
operations in 8086, Special processor activities in 8086, Maximum mode 8086 system &
timings, Minimum mode 8086 system & timings.
Instruction Set & Assembler Directives Machine language Instruction and formats, addressing
modes of 8086, Instruction Set & Assembler directives of 8086.

UNIT – II 08 Hours
Data Transfer Operations: External data moves, code memory read PUSH and POP opcodes,
data exchanges.
Logical operations: Byte-level logical operations, bit-level logical operations, rotate operations.
Arithmetic operations: Flags, incrementing and decrementing, addition, subtraction,
multiplication and division, decimal arithmetic.
Jump and call instructions: Jump and call program range, jumps, calls and subroutines, interrupts
and returns. Simple 8086 Programs

UNIT – III 08 Hours


Structure of Assembly language programs, Programming with assemblers,. Programs on Strings,
Procedures & macros String Instructions, Subroutine and Macros, Writing & using procedures,
Writing & using assembler macros
Stacks and Interrupts Introduction to Stack, Stack structure in 8086, Simple programs using stack

UNIT – IV 10 Hours
Interrupts & Interrupt service routines, Hardware & software interrupts, Vectored & non
vectored interrupts, 8259 priority interrupt controller, Timings & delays routines,Interface and
Case Studies Semi Conductor memory interfacing, Dynamic RAM interfacing, Interfacing
input/output ports, Internal Architecture of 8255, Modes of operations, Analog/Digital &
Digital/Analog Converters interfacing ,architecure of 8259 interrupt controller

UNIT – V 10 Hours
ARM Introduction: Processor Design Tradeoffs, The Reduced Instruction set Computer,The
ARM Architecture : The Acorn RISC Machine, Architectural Inheritance, The ARM
Programmer‘s Model, ARM Development Tools, Example and Exercise. ARM Assembly
Language Programming Data Processing Instructions, Data Transfer Instructions, Control Flow
Instructions, Writing simple Assembly Language Programs, Example and Exercises

TEXT BOOKS:
1 Microprocessor Interfacing by Douglas V Hall revised 2nd Edition [Tata McGraw Hill]
2 Advanced Microprocessors and Peripherals by A K Ray and K M Bhurchandi [Tata McGraw
Hill]
3 ARM System on Chip Architecture 2nd Ed, Published 2000 : Steve Furber, Addison Wesley.
(Chap 1: 1.5,1.6, Chap 2: 2.1-2.5, Chap: 3.1-3.5)

REFERENCE BOOKS:
1. Advanced Microprocessors & IBM-PC assembly Language Programming, K. Udaya Kumar
& B.S. Umashankar, TMH 2003.
2. Microprocessor Architecture, Programming, and Applications with the 8085, Publisher:
Prentice Hall Author: Ramesh S Gaonkar, Edition: 5

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 37
Course outcomes (COs)

COs Description

CO 1: Students will be able to understand the architecture of 8086 microprocessor and learn the
instruction set

CO 2: Students will be able to design software and hardware programs using assembly
language programming

CO 3: Students will be able to analyze the working of special purpose processors like 8255,
8259 and understand interfacing external devices like memory

CO 4: Students will be able to design simple programs using ARM assembly level
programming

Mapping of Course outcomes (COs) to Program outcomes (POs)

Microprocessor course maps majorly to A,B,F, I,J,K & L program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 M

CO2 S S M M M

CO3 M M M

CO4 S S M M S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 38
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Microprocessor Laboratory Course Code: 14CSL46
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Should have basic knowledge about the basics of electronics and basic concepts in logic
design

Part A
1. Program on searching and sorting,
2. Macros and Procedures(subroutines)
3. Data conversions
4. Strings
5. Recursion
6. Number generation (8-bit, 16-bit)
7. File(Read and write)

Part B (Using Interfacing concepts)

i) Programs on logic controller, 7-segment display, stepper motor interface,


8X3 Keypad, DAC interface
ii) Programs on ARM interface.

Note: Out of the exercises executed in the regular laboratory classes, each students will be
allotted one question from Part A and one question from Part B, by taking lots in the SEE ,
which he has to execute individually.

Course outcomes (COs)

Having successfully completed the course, student will be able to:

COs Description

CO 1: Students will be able to implement programs related to Searching , sorting and strings

CO 2: Students will be able to implement programs using Macro, procedure and files

CO 3: Students will be able to implement Data conversion , number generation, parity


checking

CO 4: Students will be able to interface hardware device to 8086 processor

Mapping of Course outcomes (COs) to Program outcomes (POs)


CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 39
Microprocessor Laboratory maps majorly to A,B,F,I,J,K program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S M S M S

CO2 S M

CO3 S M M M M

CO4 S M S

Assessment Method
 Experiment Write-up + Execution + Viva - 15 Marks
 Lab Record Writing - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Object Oriented Programming Laboratory Course Code: 14CSL47
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Procedure Oriented Programming skill in ‗C‘ language, especially in structure and union
constructs is strongly recommended. Basic knowledge of file handling and command line
arguments are required.

PART A

Design and Implement programs using the following OOP concepts


Function Overloading, operator overloading, inheritance, Constructors & destructors, friend
functions, friend classes, arrays, Pointers, references & the dynamic allocation operators,
function overloading, Copy constructors & default arguments, operator overloading, Inheritance,
virtual functions & Polymorphism, Templates, exception handling, C++ I/O System basics, file
I/O.

PART B
Implement a mini project individually which includes at least five of the OOP features
mentioned above.

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 40
Note: Each student will be allotted one question by lots in the SEE, which he has to execute
individually. Mini project will be assessed for 10 marks in CIE.

Course outcomes (COs)

Having successfully completed the course, student will be able to:

COs Description

CO 1: Students will be able to apply and implement major object oriented concepts like
message passing, function overloading, operator overloading and inheritance to solve
real-world problems.

CO 2: Students will be able to use major C++ features such as Templates for data type
independent designs and File I/O (Sequential and random file) to deal with large data
set

CO 3: Students will be able to analyze, design and develop solutions to real-world problems
applying OOP Concepts of C++ (mini project)

Mapping of Course outcomes (COs) to Program outcomes (POs)

Object Oriented Programming laboratory maps majorly to B, D, E program outcomes

Pos A B C D E F G H I J K L

Cos

CO1 S M S

CO2 S M S

CO3 S M S

Assessment Method
 Experiment Write-up + Execution + Viva - 15 Marks
 Lab Record Writing - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

CSE 2014 Batch Scheme and Syllabus for 3 and 4 Sem Page 41
NITTE MEENAKSHI INSTITUTE OF TECHNOLOGY
(AN AUTONOMOUS INSTITUTION, AFFILIATED TO VTU, BELGAUM AND ACCREDITED BY NBA, NEW DELHI)

YELAHANKA, BANGALORE – 560064

Department of Computer Science and Engineering


SCHEME OF TEACHING AND EXAMINATION
FOR III TO VIII SEMESTER B.E PROGRAMME (AUTONOMOUS SCHEME) & SYLLUBUS
FOR III TO VIII SEMESTER

2012 Batch
Vision and Mission of Department
Vision:
To be a center of excellence in the field of Computer Science and Engineering, imparting sustainable quality education along with
ethical values.
Mission:
The department of Computer Science and Engineering is dedicated to prepare its students for excellent professional career and higher
studies by providing fundamental knowledge of basic sciences and principles of Computer Science and Engineering with conducive
teaching-learning and research environment, inculcating entrepreneurship and leadership skills, enabling them to serve the engineering
profession and society.

Programe Education Objectives (PEOs)


1. Excel in Professional career by acquiring knowledge in basic sciences and Computer Science and Engineering principles.

2. Graduates are capable of pursuing higher education and research.

3. Adapt to technological advancements by engaging in lifelong learning with leadership qualities, professional ethics and soft skills.
Programe Outcomes

A Graduates will be in a position to apply knowledge of mathematics, physics, and


chemistry and allied engineering subjects as applicable to Computer Science and
Engineering.
B Graduates will have the ability to identify, formulate and design solutions in the
areas of Computer Science and Engineering
C Graduates will demonstrate the abilities to design and develop algorithms and
implement them with analysis and interpretation of data
D Graduates are able to address the challenges of complex and computation
intensive problems
E Graduates will have the ability to visualize and work independently or in teams
F Graduates are able to adopt any modern engineering tool or software for
analyzing and solving various computer engineering problems.
G Graduates will have knowledge of professional and ethical responsibilities
H Graduates are able to communicate effectively.
I Graduates will be able to incorporate the understanding of impact of social,
cultural and global aspects in their professional practice
J In the fast changing scenario of technical and business eco system, the graduates
will understand the need for quality, timeliness, life-long learning and adopt
themselves accordingly
K Graduates will have the knowledge of contemporary issues and able to apply
various software engineering approaches for project management
L Graduates will understand the impact of professional engineering solutions in
environmental contexts and the need for sustainable development.
SCHEME OF TEACHING & EXAMINATION

Sl. Semester I/II III IV V VI VII VIII Total


No.
1 Humanities 02 3 3 - 08
2 Basic Science Core 19 08 08 35
3 Basic Engineering Core 27 27
4 Engineering Core Subject 18 18 23 16 15 06 96
5 Core Electives 03 04 04 04 15
6 Open Electives 03 03 06
7 Project 13 13
TOTAL 48 26 26 26 26 25 23 200

SEMESTER: III

Sl.N Subject code Subject Name Teaching Teaching Hours/Week Examination Credits
o Dept. L# T# P# S# CIE *
SEE** Total
1 10MAT31 Engineering Mathematics-III Maths 4 - - - 50 50 100 4
2 10CS/IS32 Electronic Circuits ECE/CSE 3 - - - 50 50 100 3
3 10CS/IS 33 Logic Design ECE /CSE 4 - - - 50 50 100 4
4 10CS/IS 34 Discrete Mathematical Maths/CSE 4 - - - 50 50 100 4
Structures
5 10CS/IS 35 Data Structures CSE 4 - - - 50 50 100 4
6 10CS/IS 36 Introduction to Unix and Shell CSE 4 - - - 50 50 100 4
Programming
7 10CSL/ISL37 Data Structures Lab CSE 0 0 3 - 50 50 100 1.5
8 10CSL/ISL38 Electronic Circuits & Logic ECE/CSE 0 0 3 - 50 50 100 1.5
Design Lab
TOTAL 400 400 800 26
SEMESTER: IV
Sl.N Subject code Subject Name Teaching Teaching Hours/Week Examination Credits
o Dept. L# T# P# S# CIE* SEE* Total
1 10MAT41 Engineering Mathematics –IV Maths 4 - - - 50 50 100 4
2 10CS/IS42 Graph Theory Maths/CSE 3 - - - 50 50 100 3
3 10CS/IS43 Analysis and Design CSE 4 - - - 50 50 100 4
of Algorithms
4 10CS/IS44 Object Oriented Programming CSE 4 - - - 50 50 100 4
5 10CS/IS45 Microprocessor CSE 4 - - - 50 50 100 4
6 10CS/IS46 Computer CSE 4 - - - 50 50 100 4
Organization and Architecture
7 10CSL/ISL47 Microprocessor Lab CSE 0 0 3 - 50 50 100 1.5
8 10CSL/ISL48 Object Oriented Programming Lab CSE 0 0 3 - 50 50 100 1.5
TOTAL 400 400 800 26

SEMESTER: V

Sl.No Subject code Subject Name Teaching Teaching Hours/Week Examination Credits
Dept. L# T# P# S# CIE SEE Total
1 10CS/IS51 Computer Networks – I CSE 4 - - - 50 50 100 4
2 10CS52 Computer Graphics with OpenGL CSE 3 - - - 50 50 100 3
3 10CS/IS53 Operating Systems CSE 4 - - - 50 50 100 4
4 10CS/IS54 Data Base Management Systems CSE 4 - - - 50 50 100 4
5 10CS/IS55 Formal Languages and Automata CSE 4 - - - 50 50 100 4
Theory
6 10CS56X Program Elective – A CSE 4 - - - 50 50 100 4
7 10CSL57 Computer Graphics Laboratory CSE 0 0 3 - 50 50 100 1.5
8 10CSL58 DBMS Lab 0 0 3 - 50 50 100 1.5
TOTAL 400 400 800 26
Group-A(Program Elective) V sem
Subject Subject Name L# T# P# S#
code
1 10CSE561 Internetworking with TCP/IP 4 - - -
2 10CSE562 Fundamentals of digital image processing 4 - - -
3 10CSE563 Introduction to Embedded Systems 4 - - -
4 10CSE564 Unix System Programming 4 - - -

SEMESTER: VI

Sl.N Subject Subject Name Teaching Teaching Hours/Week Examination Credits


o code Dept. L# T# P# S# CIE SEE Total
1 10CS/IS61 Software Engineering CSE 4 - - - 50 50 100 4
2 10CS62 Java & J2EE CSE 4 - - - 50 50 100 4
3 10CS/IS63 Computer Networks – II CSE 4 - - - 50 50 100 4
4 10CSH64 Operations Research CSE 4 - - - 50 50 100 4
5 10CS65X Program Elective – B CSE 4 - - - 50 50 100 4
6 10CSO66X Open Elective– C CSE 3 - - - 50 50 100 3
7 10CSL67 Java and J2EE Lab CSE 0 0 3 - 50 50 100 1.5
8 10CSL68 Computer Networks Laboratory CSE 0 0 3 - 50 50 100 1.5
TOTAL 400 400 800 26

Group-B(Program Elective) VI sem


Sub Code Subject Name(Pre-Requisite) L# T# P# S Group-C(Open Elective) VI sem
# L T P S
Subject Subject Name
1 10CSE651 Cryptography and Network Security 4 - - - # # # #
code
(10CSE561)
1 10CSO661 E-Commerce 3 - - -
2 10CSE652 Digital image processing – algorithms 4 - - -
and applications – 1 (10CSE562) 2 10CSO662 Decision Support System 3 - - -
3 10CSE653 Microcontroller based Systems 4 - - - 3 10CSO663 Business Intelligence and 3 - - -
(10CSE563) Its Applications
4 10CSE654 Advanced Database Management System 4 - - - 4 10CSO664 Digital Image and Video 3 - - -
Processing
SEMESTER: VII

Sl.N Subject Subject Name Teaching Teaching Hours/Week Examination Credits


o code Dept. L# T# P# S# CIE *
SEE** Total
1 10CS71 Compiler Design CSE 4 - - - 50 50 100 4
2 10CS72 Cloud Computing CSE 4 - - - 50 50 100 4
3 10CS73 Object Oriented Modeling and Design CSE 4 - - - 50 50 100 4
4 10CSH74 Entrepreneurship Development, CSE 3 - - - 50 50 100 3
Management and IPR
5 10CSE75X Program Elective – D CSE 4 - - - 50 50 100 4
6 10CSO76X Open Elective – E CSE 3 - - - 50 50 100 3
7 10CSL77 System Software Lab CSE 0 0 3 - 50 50 100 1.5
8 10CSL78 Object Oriented Modeling & Design CSE 0 0 3 - 50 50 100 1.5
Lab
9 10CSP79 Project Preliminary/Technical CSE - - 4 - 50 -- 50 -
Seminar
TOTAL 450 400 850 25

Group-D(Program Elective) VII sem


Sub Code Subject Name(Pre-Requisite) L# T# P# S# Group-E(Open Elective) VII sem
1 10CSE751 Information Security (10CSE651) 4 - - - Subject Subject Name L T P S
2 10CSE752 DIP – algorithms and applications – II 4 - - - code # # # #
(10CSE652) 1 10CSO761 Building Enterprise 3 - - -
3 10CSE753 Real-time Systems (10CSE653) 4 - - - Applications
4 10CSE754 Data Warehousing and Data Mining 4 - - - 2 10CSO762 Neural Networks and Fuzzy 3 - - -
Logic Systems
5 10CSE755 Mobile Computing 4 - - -
3 10CSO763 Software Project Management 3 - - -
6 10CSE756 Adhoc Wireless and Sensor Networks 4 - - -
4 10CSO764 Genetic Algorithms 3 - - -
7 10CSE757 Service oriented Computing 4 - - -
8 10CSE758 Python Programming 4 - - -
SEMESTER: VIII

Sl.N Subject Subject Name Teaching Teaching Examination Credits


o code Dept. Hours/Week
L# T# P# S# CIE SEE Total
1 10CS81 Parallel Programming Principles CSE 3 - 2 - 50 50 100 4
2 10CSE82X Program Elective – F CSE 4 - - - 50 50 100 4
3 10CSP83 Internship/ Minor Project/ Self study - - - - 8 50 50 100 2
Course
4 10CSP84 Project CSE 0 0 30 - 50 50 100 13
TOTAL 200 200 400 23

*
Continuous Internal Evaluation, ** Semester End Examination, #L-Lecture, T-Tutorial, P-Practical, S-Self Study

Group-F (Program Elective) VIII sem


Sub Code Subject Name(Pre-Requisite) L# T# P# S#
1 10CSE821 Computer and Cyber Security (10CSE751) 4 - - -
2 10CSE822 Advanced image and video processing (10CSE752) 4 - - -
3 10CSE823 Embedded Networking and Security (10CSE753) 4 - - -
4 10CSE824 Distributed Systems and Transaction Processing 4 - - -
5 10CSE825 Storage Area Networks 4 - - -
6 10CSE826 C# and .Net 4 - - -
7 10CSE827 Mobile Application Development using Android 4 - - -
III Semester Subjects
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Engineering Mathematics - III Course Code: 10MAT31
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Objectives: To understand the periodic and harmonic phenomena and to be able to model them using Fourier series To understand
integral transforms such as Laplace and Fourier transforms, To understand the advantages, limitations and applications of different
numerical techniques.

Course Contents:
Unit-I 10 hours
Combinatorics: The Sum and Product Rules, Permutations and Combinations, Generalized permutations and Combinations, The
Inclusion-exclusion Principle, Generalized Inclusion-Exclusion Principle, ordinary Generating Functions, Partitions of Integers and
Their Generating Functions, exponential Generating Functions.
Unit-II 10 hours
Fourier series: Euler‘s formulae, Dirichlet‘s conditions for Fourier series expansion, change of interval, Even and odd function, half
range series, Practical harmonic analysis.
Fourier Transforms: Definition, Complex Fourier transforms, Cosine and Sine transforms, Properties, Inverse Fourier transforms.

Unit – III 10 hours


Errors, absolute, relative and percentage errors.
Solution of transcendental equation – iteration method, Aitken‘s 2 process, Secant method, Newton Raphson method
Finite differences – forward, backward, central,
Interpolation, Newton‘s forward and backward formulae, Newton‘s divided difference formulae and Lagrange‘s formula for unequal
intervals and inverse interpolation by Lagrange‘s formula
Unit – IV 10 hours
Evaluation of derivatives using Newton‘s forward and backward difference interpolation formulae Numerical Integration by
Trapezoidal, Simpson‘s 13 and 83 rule, .
Numerical solution of ordinary differential equations: Taylor‘s series method, Modified Euler‘s method, Runge-Kutta 4th order
method
Unit – V 8 hours
Linear algebra: Rank of a matrix, Consistency of linear system of equation, Gauss elimination, Gauss Siedel methods, LU
decomposition, Solution of Tridiagonal system, Eigen values and Eigen vectors, Largest Eigen value by Power method.

TEXT BOOKS:
1. Higher engg. mathematics by B V Ramana, Tata Macgrawhill, 2007
2. Advanced Engg. Mathematics by Erwin E Kreyszig, 8th edition, Wiley.
3. Introductory methods of numerical analysis, by S S Sastry, PHI India
4. Combinatorics, by V.K.Balakrishnan, Schaum’s Outlines, Tata McGraw-Hill.

CO Description

CO 1: Students will be able to apply the concepts, analyze the importance and applications
of Fourier analysis
CO 2: Students solve problems using numerical techniques and are able to apply them for
different situations
CO 3: Students are able to solve problems using combinatorial techniques.

IV. Mapping of Course outcomes (COs) to Program outcomes (POs)


Engineering Mathematics-III course maps majorly to A to C program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S M

CO2 S M M

CO3 S M M
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Electronic circuits Course Code: 10CS32
L-T-P: 3-0-0 Credits: 03
Total Contact Hours: 36 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Should have knowledge about the basic concepts of electronics

Course Contents:
UNIT – I 8 Hrs
Diode Applications and BJT: Load Line Analysis, Sinusoidal Inputs; Half-wave Rectification, Full-wave Rectification, Clippers,
Clampers, BJT-Introduction, Transistor Construction, Transistor Operation, Common-Base Configuration, Transistor Amplifying
Action, Common-Emitter Configuration, Common-Collector Configuration.

UNIT – II 7 Hrs
Transistor Biasing and AC Models: Voltage Divider Bias, Accurate VDB Analysis, VDB Load Line & Q Point, Two-Supply Emitter
Bias, Other Type of Bias, Base-Biased Amplifier, Emitter Biased Amplifier, Small Signal Operation, AC beta, AC Resistance of The
Emitter Diode, Two Transistor Models, Analyzing an Amplifier.

UNIT – III 7 Hrs


Voltage Amplifiers, CC and CB Amplifiers: Voltage Gain, The Loading Effect of Input Impedance, Multistage Amplifiers, Swamped
Amplifier, Two-Stage Feedback, CC Amplifier, Output impedance, Cascading CE & CC, Darlington Connections, Voltage
Regulation, The common-Base Amplifier.

UNIT – IV 7 Hrs
Field Effect Transistors and MOSFET: Introduction, Construction and Characteristics of JFETs, Transfer Characteristics, Depletion-
Type MOSFET, Enhancement-Type MOSFET, CMOS.

UNIT – V 7 Hrs
Non Linear Op-Amp Circuits: Comparators with Zero Reference, Comparators with Nonzero References, Comparators with
Hysteresis, Window Comparator, The Integrator, Waveform Conversion, Waveform Generation, Triangular Generator, The 555
Timer, Astable Operation of the 555 Timer.
TEXT BOOKS
1. Electronic Principles, Albert Malvino & David J Bates, 7th Edition, TMH, 2007.
2. Electronic Devices and Circuit Theory, Robert L. Boylestad, Louis Nashelsky, 9th Edition, PHI/Pearson Education, 2006.

REFERENCE BOOKS
1. Electronic Devices and Circuit Theory, Robert L. Boylestad, Louis Nashelsky, 9th Edition, PHI/Pearson Education, 2006.
2. Electronic Devices and Circuits, David A. Bell, 4th Edition, PHI, 2006.

Course outcomes (COs)


CO Description
CO 1: Understand the applications of various electronic components like diodes and
transistors
CO 2: Evaluate the important parameters related to transistor biasing and various AC models
CO 3: Analyze types of voltage amplifiers and MOSFET
CO 4: Illustrate the working of non linear op amp circuits

Mapping of Course outcomes (COs) to Program outcomes (POs)


Electronic circuits course maps majorly to A ,B ,D ,E,J,K,L program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S
CO2 S M S M
CO3 M S S
CO4
S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Logic Design Course Code: 10CS33
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of basic concepts of electronics.

Self study: Binary System: Digital computer and Digital systems, Binary numbers, numbers based conversion, Octal and
Hexadecimal numbers, complements, binary codes, binary storage and registers, Binary logic, integrated circuits.
Course Contents:

UNIT – I 12 Hrs
Boolean algebra and logic gates: Basic definition Axiomatic definition of Boolean algebra, Basic theorem and properties of
Boolean algebra, Boolean Functions, Canonical and standard forms, other logic operations, Digital logic gates, IC digital logic
families.Introduction to HDL( from digital principles and applications, Donald P Leach, Albert Paul Malvino & Gautham saha, 6th
edition-2.5)
Simplifications of Boolean functions: The map method, 2, 3 and 4 variable map, product of sum implications, NAND and NOR
implementation, Don‘t care conditions, determination and selection of prime implicates, Simplification by Quine Mc Clusky Method.
HDL implementation models ( from digital principles and applications, Donald P Leach, Albert Paul Malvino & Gautham saha, 6th
edition-3.11)

UNIT – II 8 Hrs
Combinational logic: Introduction design procedure, Adders, Subtractions, code conversion analysis procedure, multilevel NOR
circuits, Multilevel NAND circuits, Exclusive OR and Equivalence. (Text book -2) Combinational Logic, MSI and LSI:
Introduction, Binary parallel Adder, Decimal Adder, Magnititude comperators, Decoders, Multiplexers, Read only memories,
programmable logic Array.

UNIT – III 9 Hrs


Sequential Logic: Introduction, Flip Flops, Triggering of FlipFlops, Flip flop excitation tables Registers: Types of registers
SISO,SIPO,PISO,PIPO, Applications of shift registers Counters: Asynchronous Counters, Decoding Gates, synchronous Counter,
Changing the counter modulus, Decade and resettable counters, Counter design as a synthesis problem, a digital clock.

UNIT – IV 9 Hrs
Design of Sequential circuits: Model selection, state transition diagram, state synthesis table, design equations and circuit diagrams,
Implementation using ROM, Algorithmic state machines, state reduction techniques, Analysis and design of Asynchronous sequential
circuits.

UNIT – V 10 Hrs
D/A Conversion and A/D Conversion: Variable, Resistor Networks, Binary Ladders, D/A Converters, D/A Accuracy and
Resolution, A/D Converter-Simultaneous Conversion, A/D Converter-Counter Method, Continuous A/D Conversion, A/D
Techniques, Dual-Slope A/D Conversion, A/D Accuracy and Resolution. Digital Integrated Circuits: Switching Circuits, 7400 TTL,
TTL Parameters, TTL Overview, Open-collector Gates, Three-state TTL Devices, External Drive for TTL Loads, TTL Driving
External Loads, 74C00 CMOS, CMOS Characteristics, TTL-to-CMOS Interface, CMOS-to TTL Interface.

TEXT BOOK
1.Digital Principles and Applications, Donald P Leach, Albert Paul Malvino & Goutam Saha, 6th Edition, TMH, 2006.
2.Digital logic and computer design, M Morris Mano, Prentice-Hall of India.

REFERENCE BOOKS
1. Fundamentals of Digital Logic with Verilog Design, Stephen Brown, Zvonko Vranesic, TMH, 2006.
2. Fundamentals of Logic Design, Charles H. Roth, Jr., 5th Edition, Thomson, 2004.
3. Digital Systems Principles and Applications, Ronald J. Tocci Neal S. Widmer, Gregory L. Moss, 10th Edition, PHI/Pearson
Education, 2007.

NOTE : Assignment test to be conducted for the self study syllabus.

Course outcomes (COs)

CO Description
CO 1: Understand binary number system, logic gates, Boolean laws
CO 2: Simplify the Boolean equations using k-map and tabulation method and design
different combinational circuits
CO 3: Design and implement different sequential circuits with flip flops,registers and counters
CO 4: Design and implement analog to digital and digital to analog convertors
Mapping of Course outcomes (COs) to Program outcomes (POs)
LOGIC DESIGN course maps majorly to a,b,f, i and j program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S S
CO2 S S M S M

CO3 S M S M M

CO4 S S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Discrete Mathematical Structures Course Code: 10CS34
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Course Contents:

UNIT I : Fundamentals of Logic 10 Hours


Basic Connectivity and Truth Tables, Logical Equivalence: The laws of Logic, Logical Implication: Rules of Inference, The use of
Quantifiers, Rule of universal Specification and Generalization.

UNIT II : Relations 10 Hours


Cartesian Products and Relations, properties of Relations Computer Recognition: Zero-One matrices and Directed Graphs, Partial
Orders: Hasse Diagrams, Equivalence Relations and Partitions, Lattices.

UNIT III : Functions 10 Hours


Functions: Plain and One-to-one, Onto Functions: Stirling Numbers of the Second kind, Special Functions, The Pigeonhole Principle,
function composition and Inverse functions.

UNIT IV : Groups and Rings 10 Hours


Algebraic Structures, Semigroups and Monoids, definition, examples and Elementary Properties, Homomorphism, Isomorphisms and
cyclic Groups, cosets and Lagrange‘s theorem, The Ring Structure: Definition and Examples , Ring Properties and Substructures.

UNIT V : Rings and coding theory 8 Hours


Ring Homomorphism and Isomorphism, Integers Modulo n,.
Elements of Coding Theory, The Hamming Metric, The Parity-Check and Generator Matrices, Group Codes: Decoding with Coset
Leaders Hamming matrices.

TEXT BOOK: Discrete and Combinatorial Mathematics by Ralph P.Grimaldi and B.V.Ramana, 5th Edition, Pearson Education.
Chapters: Unit I: 2.1 to 2.5, Unit II: 5.1, 7.1 to 7.4 , 7.6, Unit III: 5.2 to 5.6, Unit IV: 15.1 to 15.5, 13.1, 13.2, Unit V: 13.3, 13.4,
15.7 to 15.11

REFERENCES:
1. Discrete Mathematical Strucures by Kolman, Busby and Ross, 4th edition, P.H.I.
2. Discrete Mathematical Structures by Trembly and Manohar.

CO Description

CO 1 Students analyze basics knowledge gained by mathematical logic, functions and


relation and apply them
CO 2: Students are able to apply concepts of coding theory and model different situations
CO 3: Students will be able to apply the concepts acquired for different purposes

Mapping of Course outcomes (COs) to Program outcomes (POs)


Discrete Mathematical Structures course maps majorly to A, B to C program outcomes
Pos A B C D E F G H I J
K L
Cos

CO1 S S S

CO2 S S S

CO3 S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Data Structures Course Code: 10CS35
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have basic knowledge of C programming constructs and should be able to write basic C programs
Course Contents:
UNIT – I 10 Hrs
Structures and Unions: Introduction, Defining a Structure, Declaring Structure Variables, Accessing Structure Members, Structure
Initialization, Copying and Comparing Structure Variables, Operations and Individual Members, Array of Structures, Arrays within
Structures, Structures within Structures, Structures and Functions, Unions, Size of Structures. Pointers -- Introduction ,Understanding
Pointers, Accessing the Address of a Variable, Declaring Pointer Variables, Initialization of Pointer Variables, Accessing a Variable
through the Pointer, Chain of Pointers, Pointer Expressions, Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and
Character Strings, Array of Pointers, Pointer as Function Arguments, Functions Returning Pointers, Pointers to Functions, Pointers
and Structures . Dynamic Memory Allocation –Introduction, Dynamic Memory Allocation, Allocating a Block of Memory: Malloc,
Allocating a Multiple Blocks of Memory: Calloc, Releasing the Used Space: Free, Altering a size of Block: Realloc. File
management: Command line arguments

UNIT – II 10 Hrs
The Stack: Definition and Examples— Primitive operations, example
Representing Stacks in C – Implementing the POP operation, testing for exceptional conditions, implementing the PUSH operation An
Example: Infix, Postfix, and Prefix – Basic definitions and examples, evaluating a postfix expression, program to evaluate a postfix
expression, converting an expression from infix to postfix, program to convert an expression from infix to postfix.
Recursion: Recursive Definition and Processes— factorial function, multiplication of natural numbers. Fibonacci sequenc, binary
search. Recursion in C – factorial, Fibonacci numbers, binary search, recursive chains Writing Recursive Programs – Towers of Hanoi

UNIT – III 10 Hrs


Queues: The Queue and its Sequential Representation – C Implementation of Queues, Insert Operation, Priority Queue, Array
Implementation of a Priority Queue. Lists: Linked Lists –Inserting and Removing Nodes from a List, Linked Implementation of
Stacks, get node and free node Operations, Linked Implementation of Queues, Linked List as a Data Structure, Examples of List
Operations, List Implementation of Priority Queues, Header Nodes. Lists in C – Array Implementation of Lists, Limitations of the
Array Implementation, Allocating and Freeing of Dynamic variables, Linked Lists using Dynamic Variables, Queues as List in C,
Examples of List Operations in C, Noninteger and Nonhomogeneous Lists, Comparing the Dynamic and Array Implementations of
Lists, Implementing Header Nodes

UNIT – IV 9 Hrs
Lists contd.: Other List Structures -- Circular Lists, Stack as a Circular List, Queue as a Circular List, Primitive Operations on Circular
Lists, Header nodes, Addition of Long Positive Integers Using Circular Lists, Doubly Linked Lists, Addition of Long Integer Using
Doubly Linked Lists. Binary Trees—Operations on Binary Trees, Applications of Binary Trees

UNIT – V 9 Hrs
Trees contd.: Binary Tree Representations – Node Representation of Binary Trees, Internal and External Nodes, Implicit Array
Representation of Binary Trees, Choosing a Binary Tree Representation, Binary Tree Traversal in C, Threaded Binary Trees.
Representing Lists as Binary Trees– Finding the kth Element, Deleting an Element, Implementing Tree-Represented Lists in C,
Constructing a Tree-represented List
Trees and Their Applications — C Representations of Trees, Tree Traversals, General Expressions as Trees, evaluating an expression
tree, Constructing a Tree.

Text Books
1. Programming in ANSI C:E Balagurusamy, Third edition, TATA McGraw HILL
2. Data Structure using C, Aaron M. Tenenbaum, Yedidyah Langsam &Moshe J. Augenstein, Pearson Education/PHI, 2006

Reference Books
1. Data Structures A Pseudo code approach with C, Richard F. Gilberg and Behrouz A. Forouzan, Thomson, 2005.
2. Data Structures & Program Design in C, Robert Kruse & Bruce Leung, Pearson Education, 2007.
Course outcomes (COs)
CO Description

CO 1: Understand Structures, Pointers, Dynamic Memory Allocation and Command Line


arguments and use them in writing C programs
CO 2: Describe Stack and Recursion, Simulate Stack using array implementation, Analyze the
Use of stack in expression conversion and evaluation, Analyze Recursive Definitions
and application of stack in recursion and write recursive programs in C
CO 3: Describe and Simulate Sequential Queue, Circular Queue and Priority Queue using
Array Implementation
CO 4: Simulate Singly linked list, circular list ,doubly linked list and circular doubly linked
list and use them to solve problems
CO 5: Describe and Simulate nonlinear data structures like binary search tree and threaded
binary trees and use them in designing applications like sorting, expression trees

Mapping of Course outcomes (COs) to Program outcomes (POs)


Data structures course maps majorly to B,C and D program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M S M

CO2 M S S M

CO3 M S S M

CO4 S S S M

CO5 S S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Introduction to Unix and Shell Course Code: 10CS36
Programming
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of C And C++.

Course Contents:

UNIT – I 10 Hrs
Introduction The operating System, UNIX Operating System, Features of UNIX, Architecture of UNIX, Accessing UNIX, Common
Commands, Command Structure, Flexibility of Command Usage, Getting Help.General Purpose Utilities cal, date, echo, printf, bc,
script, passwd, who, uname, tty, sty.File System The File, File name, Parent-child Relationship, Pathnames, UNIX file system

UNIT – II 9 Hrs
Handling Ordinary File cat, cp, rm, mv, more, lp, file, wc, od, cmp, comm, diff, Converting between DOS and UNIX, Compressing
and Archiving Files.Basic File Attributes Listing file attributes, Listing Directory attributes, File Ownership, File Permission,
Changing file permission, Directory Permissions, Changing File Ownership.More File Attributes File systems and Inodes, Hard Links,
Symbolic Links, The Directory, Default file and Directory Permissions, Modifications and Access time, Locating files.

UNIT – III 9 Hrs


The Shell: Shell offerings, Pattern matching, Escaping and Quoting, Redirection, Pipes, tee command, Command Substitution, Shell
variable.Customizing Environmental Variables: The Shells, Environmental Variables, aliases.Regular Expressions: Searching for
pattern, Basic Regular Expression, Extended Regular Expression, Interval Regular Expression, The Stream editor.Essential Shell
Programming

UNIT – IV 10 Hrs
The Process: Process Basics, Process Status, System Processes, Mechanism for process creation, Internal and External Commands,
Process states and Zombies, Running jobs in background, Reducing the job priority, Killing processes.Simple Filters, awk – An
Advanced Filter

UNIT – V 10 Hrs
Perl: The master manipulator, Perl preliminaries, chop function, variables & operators, String handling functions, lists & arrays,
foreach: looping through a list, split: splitting into a list or array, join, grep, associative arrays, subroutines.Essential System
Administration: The System Administer Login, Administrator‘s Privileges, Maintaining Security, User Management, Startup and
Shutdown.

Text Books
1. UNIX – Concepts and Applications, Sumitabha Das, 4th Edition, Tata McGraw Hill, 2006.

Reference Books
1. UNIX and Shell Programming, Behrouz A. Forouzan and Richard F.Gilberg, Thomson, 2005.
2. UNIX & Shell Programming, M.G. Venkateshmurthy, Pearson Education, 2005.

Course outcomes (COs)


CO Description
CO 1: Ability to understand the Unix Operating System and the working of the built in
commands available in unix.
CO 2: Analyze the working of the user defined commands and will be able change the
permissions associated with files.
CO 3: Understanding the concept of Shell and the different usage of the commands in shell.
CO 4: Ability to program in AWK language
CO 5: Identify and analyze various perl programs and administrator priveleges

Introduction to Unix and Shell Programming course maps majorly to B, C, D, E and K


program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 S
CO3 S M

CO4 S M

CO5 S M

Mapping of Course outcomes to Program outcomes


Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Data Structures Laboratory Course Code: 10CSL37
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:

 Students should have basic knowledge of C programming constructs and should be able to write basic C programs
Design and Implement programs for the following Data Structure Concepts.
Pointer applications, dynamic memory allocation Stack simulation and its applications, Simple queue, Circular queue, Singly linked
list, Circular list, Doubly linked list and Binary Search Trees .
CO Description

CO 1: Write C programs using structures, unions, dynamic memory allocation functions and
command line arguments
CO 2: Implement various linear data structures like stacks, queues, linked lists using static
and dynamic allocation and their applications
CO 3: Implement nonlinear data structure binary search tree

Data structures Laboratory course maps majorly to B,C,D and E program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M S

CO2 M S S M

CO3 S M S

Assessment Method
 Experiment Writeup + Execution + Viva - 15 Marks
 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Electronic Circuits And Logic Design Course Code: 10CSL38
Laboratory
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Should have basic knowledge about the basics of electronics and basic concepts in logic design
Part A
1. Design a circuit for Full Adder.
2. Design a circuit for Conversion of BCD to Excess – 3 codes.
3. Application of MUX/DEMUX.
4. Application of Decoder.
5. Design of 3 bit Synchronous Counter.
6. Design of Asynchronous Counter.
7. Design of Ring Counter/Johnson Counter.
8. Design of Sequence generator.

Part B
1. Half Wave Rectifier with and without capacitor filter. Determine Ripple factor.
2. Full Wave Rectifier with and without capacitor filter. Determine Ripple factor.
3. OPAMP Application as Inverting Amplifier.
4. OPAMP Application as Non Inverting Amplifier
5. OPAMP Application has clamper circuit.
6. Schmitt trigger.
7. R – 2R ladder.
8. Analog to digital converter.

Note: In SEE, student has to pick a lot for question that contains subsections from Part-A and part-B and has to execute both the
subsections compulsorily.
Course outcomes (COs)
CO Description
CO 1 Implement BCD to excess 3 convertor , synchronous counter , asynchronous counter
and ring counter
CO 2 Design and implement multiplexer , demultiplexer and decoder

CO 3 Determine ripple factor for half wave and full wave Rectifier , Design and implement an
op-amp as inverting , non-inverting and clamper circuit

CO 4 Design and implement D\A converter

Mapping of Course outcomes to Program outcomes


Electronic Circuits And Logic Design Laboratory maps majorly to A,C,E,H,I,J,K program
outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M M M

CO2 S M S S

CO3 S S S M

CO4 M S

Assessment Method

 Experiment Writeup + Execution + Viva - 15 Marks


 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks
IV Semester Subjects
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Engineering Mathematics - IV Course Code: 10MAT41
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Course Content:
Unit – I 10 hours
Probability – Random experiments, sample paces, event, axioms, addition and multiplication, conditional probability, independent
events, Baye‘s theorem.
Random variable, discrete probability distribution, continuous random variables, continuous probability distribution, graphical
interpretation

Unit – II 8 hours
Joint distribution, expectation, variance, standard deviation, covariance
Binomial, Poisson, Normal, hyper geometric relations, gamma distribution

Unit – III 10 hours


Population and sample, sampling with and without replacement, sampling distribution of means, sample variance. Unbiased estimate,
reliability, confidence intervals for mean statistical hypothesis, testing of hypothesis, Type I and II errors, one tailed, two tailed tests, t
- distribution, 2 – test, and test for goodness of fit.

Unit – IV 10 hours
Curve fitting by least square method (straight line, parabolic), correlation, regression, multiple regression
Stochastic process, n – step transitional probabilities, regular, ergodic matrices, stationery distribution, classification of states, and
Markov chain with absorbing states.

Unit - V 10 hours
Pure birth process, death process, birth and death process, Markovian queuing model, M/M/1:/FIFO and M/M/c:/FIFO model.
Open queuing networks, closed queuing networking.
Games, strategies, Games with and without saddle point, Principal of dominance, graphical method.
TEXT BOOKS:
1. Probability and statistics, by Murray R Spiegel, J Schiller, R Alu Srinivasan, Schaum‘s outline series, second edition
2. Operations research by Richard Bronson & Govindasami Nadimuthu, Schaum‘s outline series, second edition
3. Higher engg. mathematics by B V Ramana, Tata Macgrawhill, 2007

CO Description

CO 1: Students are able to apply concepts of probability ,distributions and sampling to


different problems
CO 2: Students will be able to solve problems and model situations using techniques of
Markov process, queueing and game theory
CO 3: Students will be able model using statistical tools like curve fitting, hypothesis testing
and stochastic process

Mapping of Course outcomes (COs) to Program outcomes (POs)


Engineering Mathematics-IV course maps majorly to A to C program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S M

CO2 S M M

CO3 S M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Graph Theory Course Code: 10CS42
L-T-P: 3-0-0 Credits: 03
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Course Contents:

UNIT – I 8 Hrs
Introduction to Graph Theory: Graphs and Graph Models, Connected Graphs, Common Classes of Graphs(no proof for the
theorems), Multigraphs and Digraphs, The Degree of a Vertex, Regular graphs, Degree Sequences and Matrices for graphs(no proof
for the theorems), Problems on Isomorphic graphs.
UNIT – II 8 Hrs
Trees: Bridges, Trees, The minimum Spanning Tree problem and the number of spanning trees (no proof for the theorems), Cut-
vertices, Problems on fundamental circuits.
UNIT – III 6 Hrs
Traversability and Matching: Eularian Graphs, Hamiltonian Graphs, Problems on Matching.
UNIT – IV 6 Hrs
Planarity and Coloring: Planar Graphs, The four Color Problem, Vertex coloring and Edge coloring(no proof for the theorems).

UNIT – IV 8 Hrs
Distances and Domination: The centre of a Graph, Channel assignment Problems, Problems on Domination Number of a graph(no
theorems).
TEXT BOOK: Introduction to Graph Theory by Gary Chartrand and Ping Zhang, Tata McGraw-hill Edition 2006.
Chapters: Unit I: 1.1 to 1.4, 2.1 to 2.4, 3.1, Unit II: 4.1 to 4.4, 5.1 and 5.3, Unit III: 6.1, 6.2(only theorems 6.6, 6.7, 6.8, 6.11), 8.1,
Unit IV: 9.1, 10.1 to 10.3, Unit V: 12.1 (no proof for the theorem 12.5), 12.5, 13.1
REFERENCE:
1. A Text Book of Graph Theory and its Applications by B.Sooryanarayana and G.K.Ranganath, S.Chand Publications
2. A Text book of Graph Theory by R.Balakrishnan and K. Ranganathan, Springer.

CO Description
CO 1: Students understand basic concepts of graph theory through definitions, examples and
problem solving
CO 2: Students are able to prove and verify the results available
CO 3: Students will be able to apply the techniques applied for modeling different situations

Mapping of Course outcomes (COs) to Program outcomes (POs)


Graph Theory course maps majorly to A to C program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M S

CO2 S M S

CO3 S M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department : Computer Science and Engineering Course Type : Programme Core
Course Title: Analysis and Design of Algorithms Course Code: 10CS43
L-T-P: 4-0-0 Credits:04
Total Contact Hours:48 Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of C or C++ language
 Students should know the usage of summation formulae, recurrences in maths

Course Contents:

UNIT I 08 Hrs
Introduction: What is an Algorithm? Fundamentals of Algorithmic problem solving, Important Problem Types, Fundamentals Data
Structures. Fundamentals of Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic Efficiency
Classes, Mathematical Analysis of Non recursive and Recursive Algorithms, Example-Fibonacci Numbers..

UNIT II 10 Hrs
Brute Force: Selection Sort and Bubble sort, Sequential Search and Brute-Force String Matching, Exhaustive Search.
Divide and Conquer : Merge sort, Quick Sort, Binary Search, Binary tree traversals and related properties, Multiplication of Large
integers and Strassen‘ Matrix Multiplication.

UNIT III 10 Hrs


Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting. Transform and Conquer:
Gaussian Elimination, Balanced Search Trees, Heaps and Heap sort.

UNIT IV 10 Hrs
Space and Time Tradeoffs: Sorting by counting, Input Enhancement in String Matching (Horspools Algorithm), Hashing, B-Trees.
Dynamic Programming: Computing a Binomial Coefficient, Warshall‘s and Floyd‘s Algorithms, the Knapsack Problem and
Memory functions.
UNIT V 10 Hrs
Greedy Technique: Prim‘s Algorithm, Kruskal‘s Algorithm, Djikstra‘s Algorithm, Huffman Trees. Limitations of Algorithm
Power: P, NP and NP- Complete Problems Coping with the Limitations of Algorithm Power: Backtracking: n-Queens Problem,
Subset-Sum Problem Branch and Bound: Knapsack Problem

Text Book:
1. Introduction to the Design & Analysis of Algorithms, Anany Levitin, 2nd Edition, Pearson education, 2007

Reference Books
1. Computer Algorithms by Horowitz E., Sahini S.,Rajasekaran S., Galgotia Publications, 2001
2. Introduction to Algorithms, Thomas H., Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 2nd Edition, PHI ,2006

Note:
i) For SEE, students should answer five questions, selecting at least one question from each unit
ii) The Lab components will be provided as part of the assignment, students will have to execute them and evaluation will be done by the
teacher as a component of the CIE.

Course outcomes (COs)


Having successfully completed the course, student will be able to:
CO Description
CO 1: Understand and use asymptotic notations to analyze the performance of algorithms
CO 2: Identify and analyze various algorithm design techniques
CO 3: Understand and evaluate algorithms under various algorithm design techniques
CO 4: Solve problems by applying appropriate algorithm design techniques
CO 5: Analyze the efficiency of various algorithms.

Mapping of Course outcomes (COs) to Program outcomes (POs)


ADA course maps majorly to A,B,C,D program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S M
CO2 S S

CO3 S S S S

CO4 S S S S M M

CO5 S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Lab Conduction – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Object Oriented Programming Course Code: 10CS44
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Procedure Oriented Programming skill in ‗C‘ language, especially in structure and union constructs is strongly recommended.
Basic knowledge of file handling and command line arguments are required.

Course Contents:

UNIT – I 10 Hrs
An Overview of C++ : The origins of C++, What is object –Oriented Programming ?,Some C++ Fundamentals, Introducing C++
Classes, Function Overloading, Operator Overloading , Inheritance, Constructors and Destructors ,The C++ keywords ,The General
Form of a C++ Program.
Classes and Objects : Classes, Structures and Classes Are Related, Unions and Classes are Related, Friend Functions, Friend Classes,
Inline Functions, Parameterized Constructor , Static Class Members, When Constructors and Destructors Are Executed, The Scope
Resolution Operator, Nested Classes, Local Classes, Passing Objects to functions, Returning Objects, Object Assignment
Arrays, Pointers, References, and the Dynamic Allocation Operators: Arrays of Objects, Pointers to Objects ,Type Checking C++
Pointers ,The this Pointer, Pointers to Derived Types, Pointers to Class Members, References, C++‘ s Dynamic Allocation Operators
,The Placement Forms of new and deleteArrays, Pointers, References, and the Dynamic Allocation Operators: Arrays of Objects,
Pointers to Objects ,Type Checking C++ Pointers ,The this Pointer, Pointers to Derived Types, Pointers to Class Members,
References, C++‘ s Dynamic Allocation Operators ,The Placement Forms of new and delete

UNIT – II 10 Hrs
Function Overloading, Copy Constructors, and Default Arguments: Function Overloading, Overloading Constructor Functions
,Copy constructors, Finding the Address of an Overloaded Function ,The overloaded Anachronism, Default Function Arguments,
Function Overloading and Ambiguity, The Three Steps of Overload Resolution.
Operator Overloading: Creating a Member Operator Function, Operator Overloading Using a Friend Function, Overloading new and
delete, Overloading Some Special Operators, Overloading the Comma Operator

UNIT – III 10 Hrs


Inheritance : Base-Class Access Control, Inheritance and Protected Members, Inheriting Multiple Base Classes, Constructors,
Destructors, and Inheritance, Granting Access, Virtual Base Classes
Virtual Functions and Polymorphism: Virtual Functions, The Virtual Attribute Is Inherited, Virtual Functions Are Hierarchical,
Pure Virtual Functions, Using Virtual Functions, Early vs Late Binding.

UNIT – IV 10 Hrs
Templates: Generic Functions, Applying Generic Functions, Generic Classes, The typename and export Keywords, The Power of
Templates
Exception Handling: Exception Handling Fundamentals, Handling Derived-Class Exceptions, Exception Handling Options,
Understanding terminate() and unexpected(), the uncaught_ exception() Function, The exception and bad exception Classes, Applying
Exception Handling

UNIT – V 8 Hrs
The C++ I/O System Basics: Old vs. Modern C++ I/O,C++ Streams, The C++ Stream Classes, Formatted I/O, Overloading << and
>>,Creating Your Own Manipulator Functions
C++ File I/O: <fstream> and File Classes, Opening and Closing a File, Reading and Writing Text Files Unformatted and Binary I/O,
More get() Functions, getline(),Detecting EOF, The ignore() Function, Peek() and putback(),flush(),Random Access ,I/O Status,
Customized I/O and Files

TEXT BOOK
1. The Complete Reference C++, Herbert Schildt, 4th Edition, TMH, 2005.

REFERENCE BOOKS
1. C++ Primer, Stanley B. Lippman, Josee Lajoie, Barbara E. Moo,4th Edition, AddisonWesley, 2005.
2. Object-Oriented Programming with C++, Sourav Sahay, Oxford University Press, 2006.

Course outcomes (COs)


CO Description
CO 1: Distinguish between top-down and bottom-up programming approach and apply
bottom-up approach to solve real world problems
CO 2: Interpret the difference between static and dynamic binding. Apply both techniques to
solve problems
CO 3: Analyse generic data type for the data type independent programming which relate it to
reusability.
CO 4: Interpret and design the Exception Handling Techniques for resolving run-time errors
and handle large data set using file I/O

Mapping of Course outcomes (COs) to Program outcomes (POs)


Object Oriented Programming course maps majorly to B, D , E program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S S M

CO2 S S M

CO3 S S M

CO4 S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Microprocessor Course Code: 10CS45
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of basics of electronics.
 Students should have knowledge of basic concepts in logic design.

Course Contents:

UNIT – I 12 Hours
Introduction Evolution of Microprocessors, 8086 microprocessor family, 8086 Internal Architecture, 8086 Signal Descriptions,
Physical memory organizations of 8086, General Bus operations in 8086, Special processor activities in 8086, Maximum mode 8086
system & timings, Minimum mode 8086 system & timings.
Instruction Set & Assembler Directives Machine language Instruction and formats, addressing modes of 8086, Instruction Set &
Assembler directives of 8086.

UNIT – II 08 Hours
Data Transfer Operations: External data moves, code memory read PUSH and POP opcodes, data exchanges.
Logical operations: Byte-level logical operations, bit-level logical operations, rotate operations.
Arithmetic operations: Flags, incrementing and decrementing, addition, subtraction, multiplication and division, decimal arithmetic.
Jump and call instructions: Jump and call program range, jumps, calls and subroutines, interrupts and returns. Simple 8086 Programs

UNIT – III 08 Hours


Structure of Assembly language programs, Programming with assemblers,. Programs on Strings, Procedures & macros String
Instructions, Subroutine and Macros, Writing & using procedures, Writing & using assembler macros
Stacks and Interrupts Introduction to Stack, Stack structure in 8086, Simple programs using stack

UNIT – IV 10 Hours
Interrupts & Interrupt service routines, Hardware & software interrupts, Vectored & non vectored interrupts, 8259 priority interrupt
controller, Timings & delays routines, Interface and Case Studies Semi Conductor memory interfacing, Dynamic RAM interfacing,
Interfacing input/output ports, Internal Architecture of 8255, Modes of operations, Analog/Digital & Digital/Analog Converters
interfacing ,architecure of 8259 interrupt controller

UNIT – V 10 Hours
ARM Introduction: Processor Design Tradeoffs, The Reduced Instruction set Computer, The ARM Architecture : The Acorn RISC
Machine, Architectural Inheritance, The ARM Programmer‘s Model, ARM Development Tools, Example and Exercise. ARM
Assembly Language Programming Data Processing Instructions, Data Transfer Instructions, Control Flow Instructions, Writing simple
Assembly Language Programs, Example and Exercises

TEXT BOOKS:
1 Microprocessor Interfacing by Douglas V Hall revised 2nd Edition [Tata McGraw Hill]
2 Advanced Microprocessors and Peripherals by A K Ray and K M Bhurchandi [Tata McGraw Hill]
3 ARM System on Chip Architecture 2nd Ed, Published 2000 : Steve Furber, Addison Wesley. (Chap 1: 1.5,1.6, Chap 2: 2.1-2.5,
Chap: 3.1-3.5)

REFERENCE BOOKS:
1. Advanced Microprocessors & IBM-PC assembly Language Programming, K. Udaya Kumar & B.S. Umashankar, TMH 2003.
2. Microprocessor Architecture, Programming, and Applications with the 8085, Publisher: Prentice Hall Author: Ramesh S Gaonkar,
Edition: 5
Course outcomes (COs)
Cos Description

CO 1: Understand the architecture of 8086 microprocessor and learn the instruction set
CO 2: Design software and hardware programs using assembly language programming

CO 3: Analyze the working of special purpose processors like 8255, 8259 and understand
interfacing external devices like memory

CO 4: Design simple programs using ARM assembly level programming

Mapping of Course outcomes (COs) to Program outcomes (POs)


Microprocessor course maps majorly to a,b,f, i,j,k program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M

CO2 S S M M M

CO3 M M M

CO4 S S M M S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Computer Organization and Course Code: 10CS46
Architecture
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50
Prerequisites:
 Student should have prior knowledge of Logic Design, Electronic Circuits
 Student should have prior knowledge of Computer Concepts

Course Contents:

UNIT – I 10 Hrs
Basic Structure of Computers: Computer Types, Functional Units, Basic Operational Concepts, Bus Structures, Performance –
Processor Clock, Basic Performance Equation, Pipelining and Superscalar Operation,Clock Rate, Instruction set: CISC and
RISC,Compiler, Performance Measurement, multiprocessors and multi computers, Historical Perspective
Machine Instructions and Programs: Basic Input.Output Operations(2.7 Only), Input/Output Organization: Accessing I/O Devices,
Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests,
Exceptions.

UNIT – II 10 Hrs
Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces(Introduction) The Memory System: speed-size and cost,
cache memories(5.5.3 & 5.5.4 is not there), Performance consideration(5.6.4 is not there)

UNIT – III 10 Hrs


Virtual Memories ,Arithmetic: Addition and Substraction of signed numbers, Design of Fast Adders, Multiplication of positive
Numbers, Signed Operand Multiplication, Fast Multiplication, Integer Division, Floating-point Numbers and Operations

UNIT – IV 10 Hrs
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction, Multiple Bus Organization, Hard-wired
Control, Microprogrammed Control ,Pipelining:Basic Concepts,Data Hazards,Instruction Hazards.
UNIT – V 8 Hrs
Embedded System: Examples of Embedded Systems, Processor Chips for embedded Applications, A simple Microcontroller,
Programming considerations,I/O device timing Constraints, Reaction Timer- An example.

TEXT BOOKS
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 5th Edition, TMH
2. Computer Architecture and Organization, John P. Hayes, 3rd Edition, McGraw-Hill Series

REFERENCE BOOKS
1. Computer Organization & Architecture, William Stallings, 7th Edition, PHI, 2006
2. Computer Systems Design and Architecture, Vincent P. Heuring & Harry F. Jordan, 2nd Edition, Pearson Education, 2004
3. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/PHI
4. Computer Organization – Car Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition, McGrawHill.
5. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI
Course outcomes (COs)
Having successfully completed the course, student will be able to:
CO Description
CO 1: Identify Computer system components
CO 2: Analyze the Memory system, speed, size and cost
CO 3: Solve Virtual memories & Arithmetic
CO 4: Demonstrate the Instruction execution concept
CO5: Analyze Embedded systems, examples
Mapping of Course outcomes (COs) to Program outcomes (POs)
Computer Organization and Architecture course maps majorly to A to G program outcomes
POs/ A B C D E F G H I J K L
COs
CO1 M S

CO2 S M

CO3 M S S M S

CO4 M M S M

CO5 S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Microprocessor Laboratory Course Code: 10CSL47
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Should have basic knowledge about the basics of electronics and basic concepts in logic design

Part A
1. Program on searching and sorting,
2. Macros and Procedures(subroutines)
3. Data conversions
4. Strings
5. Recursion
6. Number generation (8-bit, 16-bit)
7. File(Read and write)

Part B (Using Interfacing concepts)

i) Programs on logic controller, 7-segment display, stepper motor interface,


8X3 Keypad, DAC interface
ii) Programs on ARM interface.

Note: Out of the exercises executed in the regular laboratory classes, each students will be allotted one question from Part A and one
question from Part B, by taking lots in the SEE , which he has to execute individually.
Course outcomes (COs)
Having successfully completed the course, student will be able to:
COs Description

CO 1: Implement programs related to Searching , sorting and strings


CO 2: Implement programs using Macro , procedure and files
CO 3: Implement Data conversion , number generation, parity checking
CO 4: Interface hardware device to 8086 processor

Mapping of Course outcomes (COs) to Program outcomes (POs)


Microprocessor Laboratory maps majorly to A,B,F,I,J,K program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M S M S

CO2 S M

CO3 S M M M M

CO4 S M S

Assessment Method
 Experiment Writeup + Execution + Viva - 15 Marks
 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Object Oriented Programming Laboratory Course Code: 10CSL48
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Procedure Oriented Programming skill in ‗C‘ language, especially in structure and union constructs is strongly recommended.
Basic knowledge of file handling and command line arguments are required.

PART A
Design and Implement programs using the following OOP concepts
Function Overloading, operator overloading, inheritance, Constructors & destructors, friend functions, friend classes, arrays, Pointers,
references & the dynamic allocation operators, function overloading, Copy constructors & default arguments, operator overloading,
Inheritance, virtual functions & Polymorphism, Templates, exception handling, C++ I/O System basics, file I/O.

PART B
Implement a mini project individually which includes at least five of the OOP features mentioned above.
Note: Each student will be allotted one question by lots in the SEE, which he has to execute individually. Mini project will be
assessed for 10 marks in CIE.
Course outcomes (COs)
Having successfully completed the course, student will be able to:
Cos Description
CO 1: Apply and implement major object oriented concepts like message passing, function
overloading, operator overloading and inheritance to solve real-world problems.
CO 2: Use major C++ features such as Templates for data type independent designs and File
I/O (Sequential and random file) to deal with large data set
CO 3: Analyze, design and develop solutions to real-world problems applying OOP
Concepts of C++ (mini project)
Mapping of Course outcomes (COs) to Program outcomes (POs)
Object Oriented Programming laboratory maps majorly to B, D, E program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M S

CO2 S M S

CO3 S M S

Assessment Method
 Experiment Writeup + Execution + Viva - 15 Marks
 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks
V Semester Subjects
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Computer Networks-I Course Code: 10CS51
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of basic Internet usage.


 Students should have knowledge of graph theory, set theory and probability.

Course Contents:

UNIT – I 9 Hrs
Data Communications and Fundamentals Introduction: Data Communications; Networks; The Internet; Protocols and Standards;
Network Models: Layered tasks; The OSI Model and the layers in the OSI model; TCP / IP Protocol Suite, addressing.

UNIT – II 10 Hrs
Physical Layer and Media Data and Signals: Analog and digital signals; Transmission impairment; Data rate limits; Performance;
Digital Transmission: Digital-to-Digital conversion; Analog-to-Digital conversion; Transmission modes. Bandwidth Utilization:
Multiplexing; Spread spectrum. Transmission Media: Twisted pair cable, Coaxial cable, Fiber-Optic cable, Radio waves, Microwaves,
Infrared.

UNIT – III 10 Hrs


Data Link Layer Error Detection and Correction: Introduction to error detection / correction; Block coding; Linear block codes;
Cyclic codes, Checksum. Data Link Control: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC;
Point-to-point Protocol - framing, transition phases.

UNIT – IV 10 Hrs
Data Link Layer Continued Multiple Access, Ethernet: Random Access; Controlled Access; Channelization. Wired LAN's:Ethernet:
IEEE standards; Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet. Wireless LANs: lEE 802.11;
Bluetooth. Connection of LANs: Connecting devices; Backbone Networks; Virtual LANs
UNIT – V 9 Hrs
Other Technologies Cellular telephony; SONET/SDH: Architecture, Layers, Frames;STS multiplexing, A TM

TEXT BOOK
1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw-Hill, 2006. (Chapters of the book:
1,2,3,4,6,7,10,11,12,13,14,15,16,17,18)

REFERENCE BOOKS
1. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.
2. Larry L. Peterson and Bruce S. David: Computer Networks - A Systems Approach, 4th Edition, Elsevier, 2007.
3. Andrew S. Tanenbaum: Computer Networks, 4th Edition, PHI.
4. Internetworking With TCP/IP, Douglas Comer, volume 1, Prentice-Hall Publisher, 2005
5. Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.
Note: Instructor shall assign group activity for developing team work and to test on self learning aspect.
Note: Instructor shall assign group activity for developing team work and to test on self learning aspect.
COs Description
CO 1: Able to differentiate between OSI and TCP/IP models and identify the responsibility of
each layer. Introduction to the Physical layer signal transmission along with
impairments and performance analysis will be discussed.
CO 2: Understand the concept of data and signal, data transmission and data conversion.
Concept of bandwidth utilization and transmission media will be conveyed.
CO 3: Describe block coding techniques for error detection and correction along with
different data link layer protocols.
CO 4: Understand multiple access techniques and working of Bluetooth, backbone networks.
The various IEEE standard format for both wired and wireless system will be dealt
here.
CO 5: Describe the architecture of cellular telephony, SONET/SDH and working principle of
ATM networks.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Computer Networks-1 course maps majorly to A, B, C and D program outcomes
POs A B C D E F G H I J K L
COs

CO1 S S

CO2 S S

CO3 S M

CO4 S S

CO5 S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: : Computer Graphics with OpenGL Course Code: 10CS52
L-T-P: 3-0-0 Credits: 03
Total Contact Hours: 36hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of C ,C++, visual Basic or Java language
 Should be able to write basic C or C++ programs
 Students should g have knowledge of geometry , graphs and matrix
Course Contents:

UNIT – I 6 Hrs
Overview: Computer Graphics & Open GL
Graphs and Charts, Computer-Aided Design, Virtual-Reality Environments, Data Visualizations, Education andTraining,Computer
Art. Entertainment, Image Processing, Graphics User Interfaces. Video Display Devices, Raster Scan Systems, Graphics Networks,
Graphics on the Internet, Graphics software, Introduction of Open GL; Coordinate Reference Frames, Specifying a tow-Dimensional
World-Coordinate Reference Frame in Open GL, OpenGL Point functions, OpenGL line function, Line –drawing Algorithm, Parallel
Line algorithms, Setting frame buffer values, OpenGL curve functions, Circle generating algorithms, Ellipse generating algorithms

UNIT – II 7 Hrs
Open GL Primitives & Attributes
Pixel addressing and object geometry, Fill-Area Primitives, Polygon Fill Areas, OpenGL Polygon Fill, Area functions, OpenGL
Vertex arrays, Pixel –Array Primitives, OpenGL Pixel array functions, Character Primitives, OpenGL Character Functions, OpenGL
Display Lists, Open GL Display-Window Reshape Functions; OpenGL state variables, Color and gray scale, OpenGL color
functions, Point Attributes, Line Attributes,General Scan Line Polygon-Fill Algorithm

UNIT – III 8 Hrs


Geometric Transformations
Basic Two-dimensional Geometric Transformations, Matrix Representation and Homogeneous Coordinates, Inverse
Transformations, Two Dimensional Composite Transformations, Other Two Dimensional transformations, Raster Methods for
Geometric transformations, OpenGL Rater Transformations, Transformations Between Two dimensional coordinate Systems,
Geometric transformations in Three dimensional Space, Three dimensional Translation, Three dimensional Rotation, Three
dimensional Scaling, Composite Three dimensional Translation, Other Three dimensional Translation, Transformations

UNIT – IV 8 Hrs
Viewing
The Two-Dimensional Viewing Pipeline, The clipping window, Normalization and view port transformation., OpenGL Two-
Dimensional Viewing functions, Clipping algorithms, Two-Dimensional point clipping., Two-Dimensional line clipping; Over view
of Three-dimensional Viewing concepts, The Three-dimensional Viewing pipeline, Three-dimensional Viewing – coordinate
parameters, Transformation from word to viewing coordinates, Projections transformation, Orthogonal projections, Oblique parallel
projections, Perspective Projections, Open GL Three-dimensional viewing functions.

UNIT – V 7 Hrs
Lighting and Interaction
Light sources, Surface lighting effects, Basic illuminations models; Graphical input data, Logical classifications of input Devices,
Input functions for Graphical data, Interactive picture –constructions techniques, Virtual –reality environments, Open GL interactive
input –device functions, Open GL menu functions, Designing a graphical user interface. Properties of light, Color models;

TEXT BOOK
1. Computer Graphics with OpenGL, 3/E Donald D Hearn & M. Pauline Baker, Publisher: Prentice Hall.
REFERENCE BOOKS
1. OpenGL Programming Guide, VI edition, Jackie Neider, Tom Davis, Mason Woo. Shreiner, Addison-Wesley Publishing
Company
2. Interactive Computer Graphics A Top-Down Approach with OpenGL -Edward Angel, 5th Edition, Addison-Wesley, 2008.
3. Computer Graphics Using OpenGL – F.S. Hill,Jr. 2nd Edition, Pearson Education, 2001.
4. Computer Graphics – James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, Addison-wesley 1997.

Course outcomes (COs)

CO Description

CO 1: Explain applications, principles ,commonly used and techniques of computer graphics,


e.g., the graphics pipeline, and Bresenham algorithm for speedy line and circle
generation.
CO 2: Gain proficiency with OpenGL, a standard specification defining a cross-language,
cross-platform API for writing applications that produce 2D and 3D computer graphics.
CO 3: Develop a facility with the relevant mathematics of computer graphics, e.g.2Dand3D
rotations using vector algebra, transformations and projections using homogeneous co
ordinations
CO 4: Analyze computer graphic algorithms for clippings, and viewing concepts on 2Dand3D
CO 5: Apply C and C++ OpenGL programming in modeling 2D and 3D objects., e.g., hidden
line and surface removal, shading, and rendering.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Computer Graphics with Open GL course maps majorly to A, B, D, F and K program
outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 S S

CO3 S S S M S

CO4 S S S M M

CO5 S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Operating Systems Course Code: 10CS53
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of C and C++


Course Contents:

UNIT – I 10 Hrs
Introduction: What operating systems do; Computer System organization; Computer, System architecture; Operating System
structure; Operating System operations; Process management; Memory management; Storage management; Protection and security;
Distributed system; Special purpose systems; Computing environments. Process Management: Basic concept; Process scheduling;
Operations on processes; Inter process Communication Multithreaded Programming: Overview; Multithreading models; Thread
Libraries; Threading issues.

UNIT – II 10 Hrs
Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling; Real time
scheduling, Algorithm evaluation. Process Synchronization: Synchronization, The Critical section problem; Peterson‘s solution;
Synchronization hardware; Semaphores; Classical problems of synchronization; Monitors.

UNIT – III 10 Hrs


Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Deadlock avoidance;
Deadlock detection and recovery from deadlock. Memory Management Strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation. Virtual Memory Management: Background; Demand paging; Copy-
onwrite; Page replacement; Allocation of frames; Thrashing.

UNIT – IV 9 Hrs
File System: File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Implementing File
System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management.
Secondary Storage Structures, Protection: Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk
management; Swap space management.

UNIT – V 9 Hrs
System Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access
matrix, Access control, Revocation of access rights, Capability-Based systems. Case Study: The Linux Operating System: Linux
history; Design principles; Kernel modules; Process management; Scheduling; Memory management; File systems, Input and output;
Interprocess communication.

TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 7th edition, Wiley-India, 2006.
REFERENCE BOOKS
1. D.M Dhamdhere: Operating systems - A concept based Approach, 2nd Edition, Tata McGraw- Hill, 2002.
2. P.C.P. Bhatt: Operating Systems, 2nd Edition, PHI, 2006.
3. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley, 1990.

Course outcomes (COs)


CO Description
CO 1: Understand Process concept and Process scheduling
CO 2: Analyze Scheduling algorithms and formulate solutions for critical section problem
CO 3: Describe System model for deadlock, Methods for handling deadlocks and memory
management strategies
CO 4: Define File ,directory and learn various Access methods and implementation
CO 5: Learn Case Studies of Linux Operating System
Mapping of Course outcomes (COs) to Program outcomes (POs)
Operating Systems course maps majorly to C, D, H, J, K program outcomes
Pos/Cos A B C D E F G H I J K L

CO1 M

CO2 S S M M

CO3 S S M S S

CO4 S M

CO5 M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Database Management Systems Course Code: 10CS54
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Student should know data structuring concepts
 Students should know elementary programming
 Student should have the exposure to the concepts of computer organization

Course Contents:

UNIT – I 10 Hrs
Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers behind the scene; Advantages of
using DBMS approach; A brief history of database applications; when not to use a DBMS. Data models, schemas and instances;
Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Centralized
and client-server architectures; Classification of Database Management systems. Using High-Level Conceptual Data Models for
Database Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship
Sets, Roles and Structural Constraints; Weak Entity Types

UNIT – II 10 Hrs
ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two. Relational Model Concepts;
Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with constraint
violations; Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational
Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra;

UNIT – III 10 Hrs


SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change statements in SQL; Basic queries in SQL;
More complex SQL Queries. Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views
(Virtual Tables) in SQL; Additional features of SQL; Database programming issues and techniques; Embedded SQL, Dynamic SQL;
Database stored procedures and SQL / PSM.

UNIT – IV 9 Hrs
Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms Based on Primary Keys; General
Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form. Properties of Relational Decompositions; Algorithms for
Relational Database Schema Design; Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal
Form; Inclusion Dependencies; Other Dependencies and Normal Forms.

UNIT – V 9 Hrs
The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock- Based Concurrency Control;
Performance of locking; Transaction support in SQL; Introduction to crash recovery; 2PL, Serializability and Recoverability; Lock
Management; The write-ahead log protocol; Checkpointing; Recovering from a System Crash; Media Recovery; Other approaches
and interaction with concurrency control.

TEXT BOOKS
1. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Addison-Wesley, 2007
2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd Edition, McGraw-Hill, 2003.

REFERENCE BOOKS
1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 5th Edition, Mc-GrawHill, 2006.
2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8th Edition, Pearson education, 2006.
Course outcomes (COs)
COs Description
CO 1: Able to understand the concepts of fundamentals of database
CO 2: Able to learn E-R model,relational database system and relational algebra.
CO 3: Able to understand SQL and Develop database programming skills using SQL.
CO 4: Understand the concepts of Normalization and design of database
CO 5: Able to understand concepts of transaction management and the issues like
concurrency control, recovery.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Database Management System course maps majorly to B and D program outcomes
POs/COs A B C D E F G H I J K L

CO1 S M S

CO2 S S

CO3 S M M S

CO4 S S

CO5 S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Formal Languages and Automata Theory Course Code: 10CS55
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of set theory.


 Students should have knowledge of mathematical induction.

Course Contents:
UNIT – I 10 Hrs
Introduction to Finite Automata: Introduction to Finite Automata; The central concepts of Automata theory; Deterministic finite
automata; Nondeterministic finite automata An application of finite automata; Finite automata with Epsilon transitions; Regular
expressions;
UNIT – II 10 Hrs
Regular Expressions & Regular Languages: Finite Automata and Regular Expressions; Applications of Regular
Expressions.Regular languages; Proving languages not to be regular languages; Closure properties of regular languages; Decision
properties of regular languages; Equivalence and minimization of automata.
UNIT – III 10 Hrs
Context-Free Grammars And Languages, Push down Automata: Context –free grammars; Parse trees; Applications; Ambiguity in
grammars and Languages. Definition of the Pushdown automata; The languages of a PDA;
UNIT – IV 9 Hrs
Pushdown Automata , Properties of Context-Free Languages: Equivalence of PDA‘s and CFG‘s; Deterministic Pushdown
Automata., Normal forms for CFGs; The pumping lemma for CFGs; Closureproperties of CFLs.
UNIT – V 9 Hrs
Turing Machine & Undecidability: The Turing machine; Programming techniques for Turing Machines; Extensions to the basic
Turing Machines; A Language that is not recursively enumerable; An Undecidable problem that is RE; Post‘s Correspondence
problem;
TEXT BOOK
1.John E.. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages and Computation, 3rd Edition,
Pearson education, 2007.

REFERENCE BOOKS
1. Raymond Greenlaw, H.James Hoover: Fundamentals of the Theory of Computation, Principles and Practice, Morgan Kaufmann,
1998.
2. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw-Hill, 2007.
3. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons, 2004.
4. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science,Languages and Machines, 3rd Edition, Pearson
Education, 2006.
Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.
Course outcomes (COs)
CO Description
CO 1: Design Deterministic finite automata ,Nondeterministic finite automata, conversion of
NFA to DFA , design of E- NFA and regular expressions
CO 2: Obtain minimized DFA and convert automata to regular expressions and regular
expression to automata and proving languages are not regular
CO 3: Writing CFG‘s , Construction of parse trees, finding and removing ambiguity in
grammars, designing problems on Pushdown Automata,
CO 4: Conversion of grammar to Chomsky Normal Form ,Greibach normal form and
conversion of grammar to PDA.Prove that languages are not context free using
pumping lemma
CO 5: Designing turing machines, understanding the working of various types of turing
machines and solving post correspondence problems
Mapping of Course outcomes (COs) to Program outcomes (POs)
Formal Languages and Automata Theory course maps majorly to B, D program outcomes
POs/COs A B C D E F G H I J K L
CO1 M S S M M

CO2 M S M M

CO3 M S S M M

CO4 M S M M

CO5 M S S M M

Assessment Method (50 Marks)


 Midterm Test (2 Tests) – 30 Marks
 Surprise Test - 10 Marks
 Lab Test - 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: : Computer Graphics Laboratory Course Code: 10CSL57
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of C ,C++, visual Basic or Java language
 Should be able to write basic C or C++ programs
Lab Exercises : Exercises covering all the Units of theory syllabus making use of the concepts learnt in the modules [ Total 10
exercises ]

Lab Project : One 3D OpenGL Graphics Project involving not more than 3 students per batch using at least THREE features listed
below :

 Input and Interaction


 Transformations
 Camera Movement
 Hidden Surface Removal
 Coloring
 Texturing
 Lighing/ Shading
 Animation

Course outcomes (COs)

CO Description

CO 1: Understand and explain the mathematical and theoretical principles of computer


graphics eg: To draw basic objects like lines, triangles and polygons using opengl
built-in functions
CO 2: Use matrix algebra in computer graphics and implement fundamental algorithms and
transformations involved in viewing models.
CO 3: Write basic but complete graphics software systems projection models, illumination
models and handling of hidden surfaces and clipping in computer graphics
CO 4: Analyze and evaluate the use of computer graphics methods in practical applications
and describe effects such as texture mapping, bump mapping and antialiasing
CO 5: Apply computer graphics techniques to creating aesthetic effect

Mapping of Course outcomes (COs) to Program outcomes (POs)


Computer Graphics Laboratory maps majorly to A,B, C program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 S M

CO3 S M

CO4 M

CO5

Assessment Method

 Experiment Writeup + Execution + Viva - 15 Marks


 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: DBMS Laboratory Course Code: 10CSL58
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Should have basic knowledge about Database Management Systems, Relational Model, Sql

PART-A

I. Consider the Insurance database given below. The primary keys are underlined and the data types are specified.
PERSON (driver – id #: String, name: string, address: strong)
CAR (Regno: string, model: string, year: int)
ACCIDENT (report-number: int, date: date, location: string)
OWNS (driver-id #:string, Regno:string)
PARTICIPATED (driver-id: string, Regno:string, report- number:int,damageamount:int)

(i) Create the above tables by properly specifying the primary keys and the foreign keys.
(ii) Enter at least five tuples for each relation.
(iii) Demonstrate how you
a. Update the damage amount for the car with a specific Regno in the accident with report
number 12 to 25000.
b. Add a new accident to the database.
(iv) Find the total number of people who owned cars that were involved in accidents in 2008.
(v) Find the number of accidents in which cars belonging to a specific model were involved.
(vi) Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.

II. Consider the following relations for an order processing database application in a company.
CUSTOMER (cust #: int , cname: string, city: string)
ORDER (order #: int, odate: date, cust #: int, ord-Amt: int)
ORDER – ITEM (order #: int, Item #: int, qty: int)
ITEM (item # : int, unit price: int)
SHIPMENT (order #: int, warehouse#: int, ship-date: date)
WAREHOUSE (warehouse #: int, city: string)

(i) Create the above tables by properly specifying the primary keys and the foreign keys.
(ii) Enter at least five tuples for each relation.
(iii) Produce a listing: CUSTNAME, #oforders, AVG_ORDER_AMT, where the middle column is the total numbers of orders by the
customer and the last column is the average order
amount for that customer.
(iv) List the order# for orders that were shipped from all the warehouses that the company has
in a specific city.
(v) Demonstrate how you delete item# 10 from the ITEM table and make that field null in the
ORDER_ITEM table.
(vi) Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.

III. Consider the following database of student enrollment in courses & books adopted for each course.
STUDENT (regno: string, name: string, major: string, bdate:date)
COURSE (course #:int, cname:string, dept:string)
ENROLL ( regno:string, course#:int, sem:int, marks:int)
BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)
TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)

(i) Create the above tables by properly specifying the primary keys and the foreign keys.
(ii) Enter at least five tuples for each relation.
(iii) Demonstrate how you add a new text book to the database and make this book be adopted by some department.
(iv) Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical order for courses offered by the ‗CS‘
department that use more than two books.
(v) List any department that has all its adopted books published by a specific publisher.
(vi) Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.

IV. The following tables are maintained by a book dealer.


AUTHOR (author-id:int, name:string, city:string, country:string)
PUBLISHER (publisher-id:int, name:string, city:string, country:string)
CATALOG (book-id:int, title:string, author-id:int, publisher-id:int, category-id:int,year:int, price:int)
CATEGORY (category-id:int, description:string)
ORDER-DETAILS (order-no:int, book-id:int, quantity:int)
(i) Create the above tables by properly specifying the primary keys and the foreign keys.
(ii) Enter at least five tuples for each relation.
(iii) Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price
of the books in the catalog and the year of publication is after 2000.
(iv) Find the author of the book which has maximum sales.
(v) Demonstrate how you increase the price of books published by a specific publisher by 10%.
(vi) Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.

V.Consider the following database for a Banking Enterprise.


BRANCH (Br-name: String, Br-city: String, Assets: Real)
ACCOUNT (Acc-no: Int, Br-name: String, Bal: Real)
DEPOSITOR (Cust-name: String, Acc-no: Int)
CUSTOMER (Cust-name: String, Cust-street: String, City: String)
LOAN (Loan-no: Int, Br-name: String, amt: Real)
BORROWER (Cust-name: String, Loan-no: Int)

i). Create the above tables by properly specifying the primary keys and the foreign keys.
ii). Enter atleast five tuples for each relation.
iii). Find all customers who have atleast 2 accounts at the Main branch.
iv). Find all the customers who have an account at all the branches located in a specific city
v). Demonstrate how to delete all account tuples at every branch located in a specific city.
(vi) Generate suitable reports.
(vii) Create suitable front end for querying and displaying the results.
PART-B
1.Execution of Mini-Project for a Specific DB related project using any GUI‘s such as VB,.etc.
Note: Part-A carries 30 marks and Part-B carries 20 Marks for the SEE
Rubrics for Mini Project Evaluation-DBA Lab 10CSL57

Course outcomes (COs)


Performance Low Medium High
Indicators
Relating Improper mapping of Moderate mapping of Efficient mapping of
Theoretical theory concepts with theory concepts with theory concepts with
concept with practical problem solving practical problem solving practical problem solving
practical approaches approaches approaches

Creativity Is unable to predict Approximately predicts and Can predict and defend
problem outcomes for the defends problem outcomes problem outcomes
given input data set

Effective Has no coherent Has some strategies for Formulates strategies for
Formulation strategies for problem problem-solving, but does solving problems
of strategies solving not apply them consistently

Visualization Result not presented in Some aspects of result Result presented in


of the results readable form/Front end presentation/Front end are readable form/Front end
not user friendly appreciable not user friendly

Present and Disorganized and Organized, but ineffective Effective organized


communicate ineffective presentation presentation presentation
effectively
Cos Description

CO 1: Able to learn DDL Statements,For a Specified Database create the tables by properly
specifying the primary keys and the foreign keys.
CO 2: Able to learn DML Statements, Enter at least five tuples for each relation, perform
update, alter operations and Create suitable front end for querying and displaying the
results.
CO 3: Able to learn DRL Statements, To solve Query for a given Database.

CO 4: To understand concept of generating suitable reports and Front End using VB


Mapping of Course outcomes (COs) to Program outcomes (POs)
DBMS Laboratory maps majorly to B,E, program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S

CO2 S S S

CO3 S S S

CO4 S S

Assessment Method

 Experiment Write up + Execution + Viva -15 Marks


 Lab Record Writing - 05 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 05 Marks
 Mini Project - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title Internetworking With TCP/IP Course Code: 10CSE561
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of Computer Networks.

Course Contents:

UNIT – I 9 Hrs
Introduction and overview: Review of underlying network technologies, Inter-networking concepts and architectural model, Socket
programming.
UNIT – II 9 Hrs
Internet addresses, mapping Internet addresses to physical addresses (ARP), determining an internet addresses at startup (RARP),
address recovery and binding software implementation.
UNIT – III 10 Hrs
Internet Protocol: Connectionless datagram delivery, Internet protocol: routing IP datagram, fragmentation and reassembly.

UNIT – IV 10 Hrs
Protocol Layering, User datagram Protocol (UDP).
UNIT – V 10 Hrs
Reliable Stream Transport Service (TCP), Firewall
TEXT BOOKS:
1. Internetworking with TCP/IP, Principles ,Protocols and Architecture.Volume I, Douglas Comer , Prentice Hall India, 3rd Edition, 2000.Chapter
Nos: 1-8, 11,12
2. Unix Network Programming, Richard Stevens, Chapter 6 (Unit-I)
3. Internetworking with TCP/IP, Design and Implementation and Internals, Vol II, Douglas Comer, David L Stevens, 3rd Edition, Chapter 4 (Unit-
II)

REFERENCE BOOKS:
1. TCP/IP protocol Suite, Behrouz A Forouzan, 2nd edition, Tata Mc Graw Hill
2. TCP/IP Illustrated, The Protocols, Volume I, W.Richard Stevens
Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.
Course outcomes (COs)
COs Description
CO 1: To understand types of network technologies.

CO 2: Demonstrate uses of datagram delivery.

CO 3: Mapping of internet address to physical address.

CO 4: Discussion on protocol layering and reliable stream transport service

CO 5: Concept of User Datagram Protocol

Mapping of Course outcomes (COs) to Program outcomes (POs)


Internetworking with TCP/IP course maps majorly to A,B,C,D,J program outcomes
POs A B C D E F G H I J K L
COs

CO1 S M

CO2 S M S

CO3 M S M

CO4 S S M

CO5 M S
Assessment Method (50 Marks)
Midterm Test (2 Tests) – 30 Marks
 Surprise Test - 10 Marks
 Seminar IEEE Papers - 10 Marks
-----------------------
Total = 50 Marks

Department : Computer Science and Engineering Course Type : Programme Elective


Course Title: Fundamentals of Digital Image Course Code: 10CSE562
Processing
L-T-P: 4-0-0 Credits:04
Total Contact Hours:48 Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50

Course Contents:
UNIT – I 8 Hrs
1. What is a Digital Image. Digital Image Representation; Image Processing, Image Analysis and Image Interpretation
2. Basic Elements of a Digital Image Processing System; Fundamentals Steps in Digital Image Processing
3. Image Sensing and Acquisition; Single Sensor; Line Sensor and Array Sensor
4. Image Formation; Sampling and Quantization
5. Digital Image Resolution and Storage; Convolution
10 Hrs
UNIT – II
1. Types of Image Processing algorithms
2. Monadic and Dyadic Operators
3. Basic Relationship between pixels; Pixel Adjacency, Connectivity, Connected Components, Region Boundary; Distance Measure
4. Histogram, Properties of the Histogram , Histogram Operations
5. Characteristics Properties derived from Histogram

UNIT – III 10 Hrs


1. Fundamentals of Image Enhancement – Definition, Characteristics, Applications
2. Point Processing, Mask or Neighborhood Processing; Contrast Stretching, Grey Level Slicing, Bit Plane Slicing
3. Histogram Based Image Enhancement: Histogram Equalization, Histogram Hyperboilization
4. Local Enhancement Methods
5. Enhancement using Arithmetic/Logic Operations

UNIT – IV 10 Hrs
1. Mathematical Foundation: First Order and Second order Derivative;
2. Definition of Few Terms, Edge Models: Step, Ramp and Roof Edge;
3. Algorithms - Robert, Sobel, Prewitt, Laplacian;
4. Compass Gradient Mask – Prewitt, Sobel, Kirsch, Robinson
5. Edge Sharpening

UNIT – V 10 Hrs
1. Color Image Fundamentals: Light and Color, Chromatic and Achromatic
2. Color Models: RGB, HSI, CMY, CMYK, YIQ, YUV, Color Conversions
3. Pseudo Color Image Processing
4. Basics of Full Color Image Processing
5. Color Enhancement, Color Edge Detection

TEXT BOOK
1. Rafel C Gonzalez and Richard E Woods, ―Digital Image Processing‘‘, Pearson Education, 3rd Edition, 2009.
2. B. Chanda, D Dutta Majumder, ―Digital Image Processing and Analysis‘‘, Prentice-Hall, India, 2002

REFERENCE BOOKS
* Notes to be provided
Note: The Internal Assessment marks of 50 for the core subjects will have 30 marks for theory and 20 marks for surprise test and
assignments.
Course outcomes (COs)
CO Description
CO 1: Understand the basics of formation and representation of images.
CO 2: Perform Monadic and Dyadic operations of an image.
CO 3: Know the effect of different image enhancement techniques.
CO 4: Learn Edge detection algorithms and its importance in image processing.
CO 5: Learn color formats, their representation, conversion from one color model to another
and processing of color images.
Mapping of Course outcomes (COs) to Program outcomes (POs)
Fundamentals of Digital Image Processing course maps majorly to C, E and F POs
A B C D E F G H I J K L
Pos
Cos
CO1 M S

CO2 M

CO3 S M

CO4 S S

CO5 S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department : Computer Science and Engineering Course Type : Programme Elective


Course Title: Introduction to Embedded Systems Course Code: 10CSE563
L-T-P: 4-0-0 Credits:04
Total Contact Hours:48 Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
Should have knowledge about the basics of microprocessor and microcontroller

Course Contents:

UNIT – I 10 Hrs
Introduction & Architecture Of Embedded Systems: Overview of microprocessors and microcontrollers, Categories, design
challenges, IC Technology, Process Technology, Design Technology. Hardware & Software Architecture, Application Software,
Communication Software, Process Of Generation & Testing.
UNIT – II 10 Hrs
Custom Single Purpose Processor: Combinational logic, sequential logic, custom single processor design, optimization, memory
design
UNIT – III 10 Hrs
Interfacing: Communication basics, Microprocessor Interfacing, arbitration, different protocols.
UNIT – IV 9 Hrs
State Machine And Process Models: Models, FSM, FSMD, HCFSM, PSM, Concurrent Models- Communication, Synchronization,
Implementation
UNIT – V 9 Hrs
Embedded software; embedded hardware; Embedded System design; design issues; case studies (from internet and other sources)
TEXT BOOKS
1.Embedded System Design : A Unified Hardware / Software Introduction, Frank Wahid, Tony Givargis, Wiley India
2.Embedded / Real Time Systems: Concepts, Design & Programming, Dr. K V K K Prasad, Dreamtech Press.

REFERENCE BOOK
1.Embedded Systems : Architecture, Programming & Design, Raj Kamal, TMH

Course outcomes (COs)


CO Description
CO 1: Explain the purpose of embedded systems and compare microprocessors with
microcontrollers
CO 2: Design with microcontrollers and explain the design of a processor for specific purpose

CO 3: Model processes and their interactions using state machine approach

CO 4: Design and implement embedded software and hardware, also illustrate the working

Mapping of Course outcomes (COs) to Program outcomes (POs)


Introduction to Embedded Systems course maps majorly to B program outcome
A B C D E F G H I J K L
CO1 M

CO2 S

CO3 M

CO4 S

Assessment Method
 Midterm Test (Avg. of 2 Tests) 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title Unix System Programming Course Code: 10CSE564
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of operating system and unix shell programming
Course Contents:

UNIT – I 10 Hrs
INTRODUCTION: UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C
and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs,
The UNIX and POSIX Development Environment, API Common Characteristics. UNIX FILES: File Types, The UNIX and POSIX
File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel
Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.

UNIT – II 10 Hrs
UNIX File APIs: General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link
File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class,
Symbolic Link File Class, File Listing program.
UNIT – III 10 Hrs
UNIX PROCESSES: The Environment of a UNIX Process: Introduction, main function, Process Termination, Command-Line
Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp
and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.
UNIT – IV 9 Hrs
PROCESS CONTROL: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions, Race
Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User
Identification, Process Times. Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions,
Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned Process
Groups.
UNIT – V 9 Hrs
SIGNALS AND DAEMON PROCESSES: Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The
SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers.
Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single-instance daemons; Daemon
conventions; Client-Server Model.
TEXT BOOKS
1. Unix System Programming Using C++ – Terrence Chan – Prentice Hall India, 1999.
2. Stephen A. Rago: Advanced Programming in the UNIX Environment – W.Richard Stevens, 2nd Edition, Pearson Education / PHI,
2005.
REFERENCE BOOKS
1. Advanced Unix Programming – Marc J. Rochkind:, 2nd Edition, Pearson Education, 2005.
2. The Design of the UNIX Operating System – Maurice.J.Bach:, Pearson Education / PHI, 1987.
3. Unix Internals – Uresh Vahalia:, Pearson Education, 2001.
Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.

Course outcomes (COs)


COs Description
CO 1: Comparison between ANSI C AND C++ AND POSIX standards
CO 2: Mapping the relationship between UNIX Kernel support for files
CO 3: Understand Kernel support for process creation and termination and memory allocation
CO 4: Learn about Process Accounting process UID ,Terminal logins, network logins
CO 5: Analyze process control,Deamon characteristics, coding rules and error logging

Mapping of Course outcomes (COs) to Program outcomes (POs)


Unix System Programming course maps majorly to B, C, D and E program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M S

CO2 S M

CO3 S
CO4 S S

CO5 S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

VI Semester Subjects

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Software Engineering Course Code: 10CS61
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Student should have prior basic knowledge on Software attributes, Process models
 Student should have some basic knowledge on Testing, Maintenance.
Course Content:

UNIT – I 10 Hrs
Overview: Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical systems:
Emergent system properties; Systems engineering; Critical Systems, Software Processes: Critical Systems: A simple safety-critical
system; System dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The
Rational Unified Process; Computer Aided Software Engineering.
UNIT – II 10 Hrs
Requirements: Software Requirements: Functional and Non-functional requirements; User requirements; System requirements;
Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements
elicitation and analysis; Requirements validation; Requirements management.
UNIT – III 10 Hrs
System models, Project Management: System Models: Context models; Behavioral models; Data models; Object models; Structured
methods. Project Management: Management activities; Project planning; Project scheduling; Risk management.
UNIT – IV 9 Hrs
Software Design : Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control
styles. Object-Oriented design: Objects and Object Classes; An Object-Oriented design process; Design evolution. Development:
Rapid Software Development: Agile methods; Extreme programming; Rapid application development.
UNIT – V 9 Hrs
Verification and Validation: Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and
formal methods. Software testing: System testing; Component testing; Test case design; Test automation. The People Capability
Maturity Model.

TEXT BOOKS:
1. Ian Sommerville: Software Engineering, 8th Edition, Pearson Education, 2007.
REFERENCE BOOKS:
1. Roger.S.Pressman: Software Engineering-A Practitioners approach,7th Edition, McGraw Hill, 2007.
2. Pankaj Jalote: An Integrated Approach to Software Engineering, Wiley India, 2009.

Course outcomes (COs)


CO Description
CO 1: Learn various software development process models and their suitability
CO 2: Able to apply the methods of requirement elicitation

CO 3: Learn to design software and apply strategies of project management

CO 4: Apply rapid software development methods and decide on appropriate software


architecture.
Mapping of Course outcomes (COs) to Program outcomes (POs)
Software Engineering course maps majorly to A, B, C, D, E, F, J and K program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S S S

CO2 S S

CO3 S S S

CO4 S S S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) - 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Java and J2EE Course Code: 10CS62
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Student should have prior basic knowledge on C++ and OOP Concepts
 Student should have some basic knowledge on Database and Graphics.

Course Content:

UNIT – I 10 Hrs
Introduction To Java: How java changed the internet; Java Buzz words, Byte Code; Object oriented programming; First Simple
Java program, Introducing Classes :Classes Fundamentals; Declaring Objects, Assigning Object Reference Variable; Introducing
Methods; Inheritance Basics- using Super; Creating Multilevel Hierarchy, When constructors are called, method Overriding,
Dynamic Method Dispatch,Abstract classes,final with inheritance Interfaces and Exception handling in java And MultiThreaded
Programming ; The java tread model,The main thread, Creating thread, creating multiple threads, Using isAlive() and join()Thread
priorities; Synchronization; Suspending , resuming and stopping threads ;
UNIT – II 10 Hrs
Applets , Event Handling The Applet Class: Two types of Applets; Appletbasics; Applet Architecture; An Applet skeleton; Simple
Applet displaymethods; Requesting repainting; Using the Status Window; The HTMLAPPLET tag; Passing parameters to Applets;
getDocumentbase() andgetCodebase(); ApletContext and showDocument() ; The AudioClipInterface ; The AppletStub Interface;
Output to the Console.producer-consumer problems. Event Handling: Two event handling mechanisms; The delegation event model;
Event classes; Sources of events; Event listener interfaces; Using the delegation event model; Adapter classes; Inner classes;
UNIT – III 10 Hrs
Swings and Java 2 Enterprise Edition Overview : Swings: The origins of Swing; Two key Swing features; Components and
Containers; The Swing Packages; A simple Swing Application; Create a Swing Applet; Jlabel and ImageIcon; JTextField;The Swing
Buttons; JTabbedpane; JScrollPane ; JList; JComboBox; JTable. :Overview of J2EE and J2SE.
UNIT – IV 9 Hrs
Database Access, Servlets : The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the JDBC process;
Database Connection; Associating the JDBC/ODBC Bridge with the Database; Statement Objects; ResultSet; Transaction Processing;
Metadata, Data type ,Exceptions s,; Servlets: Background; The Life Cycle of a Servlet; Using Tomcat for Servlet Development; A
simple Servlet ; The Servlet API; The Javax. Servlet Package; Reading Servlet Parameter; The Javax.servlet.http package;Handling
HTTP Requests and Responses; Using Cookies; Session Tracking;
UNIT – V 9 Hrs
JSP and RMI
Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies, Session Objects. Java Remote Method
Invocation.

TEXT BOOKS
1. Java - The Complete Reference – Herbert Schildt, 7th Edition, Tata McGraw Hill, 2007.
2. J2EE - The Complete Reference – Jim Keogh, Tata McGraw Hill, 2007.
REFERENCE BOOKS
1. Introduction to JAVA Programming – Y. Daniel Liang , 6thEdition, Pearson Education, 2007.
2. The J2EE Tutorial – Stephanie Bodoff et al, 2nd Edition, Pearson Education, 2004.
3. ―Head First Java‖ – O‘Reilly Publication
Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.

Course outcomes (COs)


CO Description

CO 1: Apply object oriented programming, exception handling and multithreading concepts in


problem solving.
CO 2: Design and implement Applets, Parameterized Applets incorporating multithreading
and event handling mechanisms.
CO 3: Use swings aspects in graphical interactive application development and JDBC for
database transactions, Handling HTTP requests and responses.
CO 4: Develop applications using RMI and JSP
CO 5: Apply object oriented programming, exception handling and multithreading concepts in
problem solving.
Mapping of Course outcomes (COs) to Program outcomes (POs)
Java and J2EE course maps majorly to B, D, F & J program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S M S S

CO2 M S M M

CO3 M S S

CO4 S S S M

CO5 S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Computer Networks-II Course Code: 10CS63
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of basic Internet usage.


 Students should have knowledge of graph theory, set theory and probability.

Course Content:

UNIT – I 10 Hrs
The Network Layer Network Layer Design Issues, Routing Algorithms, Congestion Control Algorithms, Quality of Service,
Internetworking - the Network Layer in the Internet: The IP Protocol, IP Addresses: subnets, subnetmask.

UNIT – II 10 Hrs
The Transport Layer The transport service, Elements of transport protocols, The Internet transport protocol: UDP, the Internet
transport protocol: TCP.

UNIT – III 10 Hrs


DNS, Electronic Mail, The World Wide Web: Architectural Overview, Static Web Documents, Dynamic Web Documents, HTTP,
Multimedia: Introduction to digital Audio, Audio Compression, Voice over IP.

UNIT – IV 9 Hrs
Network Security, Principles of Cryptography, Authentication, Integrity, Access Control.

UNIT – V 9 Hrs
Network Security continued and Network Management:Attacks and countermeasures. Introduction to network management,
Infrastructure of Network Management; The Internet Standard Management Frame work: Structure of Management Information
(SMI), Management Information Base (MIB), SNMP Protocol Operation and Transport Mappings, Security and Administration,
ASN.l

TEXT BOOKS
1. Andrew S. Tanenbaum Computer Networks, 4th Edition, PHI.( chapters of the book: 5,6,7)
2. Computer Networking, Kurose and Ross, Pearson Education, 2002.(chapters of the book:7,8)

REFERENCE BOOKS
1. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.
2. Larry L. Peterson and Bruce S. David Computer Networks - A Systems Approach, 4th Edition, Elsevier, 2007.
3. Behrouz A. Forouzan Data Communications and Networking, 4th Edition, Tata McGraw- Hill, 2006.
4. Wayne Tomasi Introduction to Data Communications and Networking, Pearson Education, 2005.
5. Nader F. Mir Computer and Communication Networks, Pearson Education, 2007.
Note: Instructor shall be assigned self study component to evaluate self study mechanism of students.
Course outcomes (COs)

CO Description

CO 1: Understand network layer routing algorithms and the congestion control algorithms.
Implementation of the routing protocols is also taken care.
CO 2: The state transition model for Transport layer is understood along with the connection
establishment, recovery, release, multiplexing and flow control design is facilitated.
CO 3: WWW, DNS, email, multimedia services are discussed as the application layer services
are explained
CO 4: Caesar method, symmetric key, public key system, data integrity, KDC and firewall
working concept is delivered with RSA implementation
CO 5: Attack and countermeasures with network management aspect are guided with
examples

Mapping of Course outcomes (COs) to Program outcomes (POs)


Computer Networks-II course maps majorly to A, B, C and D program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S S S M M

CO2 S S M S

CO3 S S

CO4 M S M

CO5 M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Humanities Course


Course Title: Operations Research Course Code: 10CSH64
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of basic mathematics


 Students should have some knowledge of probability and queuing theory

Course Content:

UNIT – I 9 Hrs
Introduction: Introduction: Evolution of OR, definition of OR, scope of OR, application areas of OR, steps (phases) in OR study,
characteristics and limitations of OR, models used in OR, linear programming (LP) problem-formulation and solution by graphical
method.
UNIT – II 9 Hrs
The simplex method: Introduction, Definitions, Artificial Variable Technique, Two phase method. Big-M-method (Charne‘s penalty
method). Degeneracy-Methods to resolve degeneracy. Special cases- Alternative, unbounded & non-existing solution, Concept of
duality, primal & dual correspondence, Dual simplex method.
UNIT – III 10 Hrs
Transportation Problem: Mathematical Formulation, Matrix form, Definitions, Initial basic feasible solution using different methods.
Optimality methods. Minimization problem, unbalanced transportation problem, degeneracy in transportation problems. Assignment
Problem: Mathematical Formulation, Hungarian method, Minimal, Maximal & unbalanced assignment problem, traveling salesman
(Routing) problem.
UNIT – IV 10 Hrs
Sequencing: Terminology & notations, Johnson‘s algorithm, processing of : n-jobs to 2 machines, n jobs 3 machines, n jobs m
machines without passing sequence. 2 jobs n machines with passing. Graphical solution. Game Theory: Formulation of games, types,
solution of games with saddle point, graphical method of solving mixed strategy games, dominance rule for solving mixed strategy
games.
UNIT – V 10 Hrs
PERT-CPM Techniques: Definitions, difference between CPM & PERT. Applications. Network construction, labeling using
Fulkerson‘s ‗1-J‘ Rule. Time Estimates and Critical path – Forward & Backward pass computation. Determination of Floats, Slack
times & critical path. PERT-critical path, scheduling by project duration, variance under probabilistic models, prediction of date of
completion, crashing of simple networks- Optimum duration & Minimum duration cost. Queuing Theory: Queuing system and their
characteristics. The M/M/1 queuing system, steady state performance and analysis of M/M/1 & M/M/C queuing model.
\
Course outcomes (COs)

CO Description

CO 1: Understand the evolution and applications of operations in various fields,


mathematically formulate linear programming problems and solve them using different
techniques
CO 2: Solve transportation problems to minimize cost or maximize profit and understand the
principles of assignment of jobs and find optimal assignment

CO 3: Construct a project network and apply program evaluation review technique and
critical path method to find date of completion of project and other project related
metrics
CO 4: Solve problems of sequencing of production runs , use Game theory to identify the
optimal strategies for players and solve problems on queuing theory

Mapping of Course outcomes (COs) to Program outcomes (POs)


Operations Research course maps majorly to A and B program outcomes
Pos A B C D E F G H I J K L

Cos

CO1 S M M M

CO2 S M M M

CO3 S S M M
CO4 S S M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Java and J2EE Laboratory Course Code: 10CSL67
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Student should have prior basic knowledge on execution of C++ and OOP Concepts
 Student should have some basic knowledge on installation of JDK1.5, Eclipse IDE and Tomcat5.
Course Content
1. a) Design and implement a JAVA Program to demonstrate Constructor Overloading and . Method overloading.
b) Implement Inner class and demonstrate its Access protections IN JAVA.
2. a) Demonstrate reusability in JAVA using Inheritance.
b) Handle run-time errors using Exception Handling (Using Nested try catch and finally)
mechanism of JAVA.
3. a) Create an Interface and implement it in a class in JAVA .
b) Design a class (extending Thread) and use methods Thread class to change name,
priority, ---- of the current Thread and display the same.
4. a) Create a Scrolling Text using JAVA Applets.
b) Pass parameters to Applets and display the same.
5. Create a frame window that responds to mouse c;icks and keystrokes using an applet
6. Create a Student DATA BASE and retrieve info base on particular queries (Using JDBC
Design Front end using Swings).
7. Design and implement Client Server communication using socket programming(Client requests a file, Server responds to client
with contents of that file which is then display on the screen by Client).
8. Design and implement a simple Client Server Application using RMI.
9. Implement a JAVA Servlet Program to implement a dynamic HTML using Servlet (user name and password should be
accepted using HTML and displayed using a Servlet).
10. Design a JAVA Servlet Program to Download a file and display it on the screen (A link has to be provided in HTML, when the
link is clicked corresponding file has to be displayed on Screen)
11. a) Design a JAVA Servlet Program to implement RequestDispatcher object using
include() and forward() methods.
b)Write a JAVA Servlet Program to implement and demonstrate get() and Post methods
Using HTTP Servlet Class.

12. Design a JAVA Servlet Program to implement sendRedirect() method using HTTP Servlet Class.
13. Implement a JAVA Servlet Program to implement sessions using HTTP Session
Interface.
14. a) Implement a JAVA JSP Program to print 10 even and 10 odd number.
b) Design a JAVA JSP Program to implement verification of a particular user login and
display a welcome page
15. Design and implement a JAVA JSP Program to get student information through a HTML and create a JAVA Bean Class,
populate Bean and display the same information through another JSP.
Course outcomes (COs)

CO Description

CO 1: Design and implement Programs to demonstrate classes, objects, principles of


inheritance and polymorphism, encapsulation, method overloading and to show Thread
Priority, Exception Handling.
CO 2: Implement and demonstrate Simple Applet, Applet Communication.
CO 3: Write Programs for Client Server Communication, Distributed applications using Java
RMI , Swings for Windows GUI-Applications and JDBC for database transactions.
CO 4: Write web programs using Servlets and JSPs in tomcat environment.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Java and J2EE Laboratory maps majorly to B, D and F program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M M S M

CO2 S S

CO3 S M M S M

CO4 S S M S M

Assessment Method

 Experiment Writeup + Execution + Viva - 15 Marks


 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Computer Networks Laboratory Course Code: 10CSL68
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours:36 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
Students should have basic knowledge of C programming constructs and should be able to write basic C programs
Design and Implement programs for the following Computer Networks lab.
Tcl scripts for node, link creation, implementing NAM file, extracting trace file, plotting Xgraph, wireless LAN and wiredLAN along
with ping program. Coding in C includes CRC-16, routing algorithm, security implementation and TCP/IP socket programming.
Congestion control algorithm to be implemented.

Course outcomes (COs)


CO Description
CO 1: Learn to write TCL script, Understand linking of nodes, agents, and to connect
application protocol on them
CO 2: Develop wired and wireless topology along with featured of NS2 like using Xgraph,
NAM
CO 3: Grep command of unix is used to extract features from the trace file
CO 4: Algorithms at data link layer is developed, Algorithms at network link layer is
developed
CO 5: Socket programming is understood along with IPC communication setup, Encryption
algorithm is understood
Mapping of Course outcomes (COs) to Program outcomes (POs)
Computer Networks Laboratory maps majorly to B, C and E program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M S S S

CO2 M S S S

CO3 M S S S

CO4 M S S S

CO5 M S S S

Assessment Method
 Experiment Writeup + Execution + Viva - 15 Marks
 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Cryptography and Network Security Course Code: 10CSE651
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of Computer Networks., TCP/IP

Course Content:

UNIT – I 9 Hrs
Introduction: Service mechanisms and attacks, The OSI security architecture, A Model for Network Security. Symmetric Ciphers:
Symmetric cipher model, substitution techniques.
UNIT – II 9 Hrs
Symmetric Ciphers: Transposition techniques, Rotor machines, steganography. Block Ciphers and DES: Simplified DES

UNIT – III 10 Hrs


Block Cipher and DES: Block cipher principles, DES, Strength of DES, Block cipher design principles, Block cipher modes of
operation.
UNIT – IV 10 Hrs
Public key cryptography and RSA: Principles of public key cryptosystems, RSA algorithm.Other public key cryptosystems and key
management: key management, Diffie-Hellman key exchange.
UNIT – V 10Hrs
Network Security Applications: Authentication Applications: Kerberos, X.509 Authentication Service. Electronic Mail Security: PGP,
S/MIME

TEXT BOOKS:
1. Cryptography and Network Security: William Stallings, Pearson Education, 2003
2. Network Security Essentials-Applications and Standards, 3rd edition, William Stallings, Pearson Education, 2007 (For UNIT-V)

REFERENCE BOOKS:
1. Cryptography and Network Security, Atul Kahate, TMH, 2003

Course outcomes (COs)

COs Description

Analyze the basic concepts of cryptography and network security and classify attacks
CO 1: on a network.
Analyze the different process for hiding the information with conventional
CO 2: cryptographic algorithms.
CO 3: Understand the working of various block cipher cryptosystems.
Analyze public cryptosystems and disseminate from conventional systems for the
CO 4: security.
CO 5: Apply authentication techniques to provide secure communication.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Cryptography and Network Security course maps majorly to A, B and C programme
outcomes
Pos L
Cos
A B C D E F G H I J K

CO1 M

CO2 S S S M
CO3 S S S M

CO4 S S

CO5 S S

Assessment Method

 Experiment Writeup + Execution + Viva - 15 Marks


 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Digital Image Processing- Algorithms Course Code: 10CSE652
and Applications-I
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of basic of image processing
 Students should have knowledge of coding.

Course Content:

UNIT – I 08 Hrs
Digital Image Fundamentals Origins of Digital Image Processing, Application Areas, Elements of Visual Perception; Mathematical
Tools used in DIP: Linear and Non Linear Operators, Arithmetic Operators, Spatial Operators, Transformations: Rigid Body
Transformation, Affine Transformation, and Projective Transformation.
UNIT – II 10 Hrs
Image Enhancement in Spatial Domain Review of Image Enhancement Methods – Contrast based and Histogram Based, Histogram
Specification Adaptive Enhancement, Need for Adaptive Enhancement, Algorithms for Adaptive Enhancement
UNIT – III 10 Hrs
Basics of Spatial Filtering: Low pass, High Pass and Median Filters Max-Min Filter, Min-Max Filter, Mean Filter, Ordered
Statistics Filter; Smoothing Spatial Domain Filters; Sharpening Spatial Domain Filters.* Digital Image File Types

UNIT – IV 10 Hrs
Image Enhancement in the Frequency Domain Introduction to Fourier Transform, Properties of Fourier Transform, Smoothing
Frequency-Domain Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering.

UNIT – V 10 Hrs
Image Segmentation Detection of Discontinuities: Point, Line and Edge Detection, Global and Local Thresholding, Optimum
Thresholding, Manual and Automatic Thresholding: Single and Multi Thresholding, Algorithms for Automatic
Thresholding;Performance of thresholding algorithms. Region Based Segmentation, Mean Shift and Graph Cut Method
TEXT BOOK
1. Rafel C Gonzalez and Richard E Woods, ―Digital Image Processing‘‘, Pearson Education, 3rd Edition, 2009.
2. B. Chanda, D Dutta Majumder, ―Digital Image Processing and Analysis‘‘, Prentice-Hall, India, 2002
REFERENCE BOOKS
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, ―Image Processing, analysis and Machine Vision‘‘, Thomson Brooks/Cole, 2nd
Edition .

Course outcomes (COs)


CO
Description
CO 1:
Learn the Mathematical Tools used in DIP
CO 2: Learn Histogram Specification Method and the concept of Adaptive Processing with
example of Adaptive Enhancement.
CO 3:
Understand the concept of Spatial Filters and the Formats of Image and Video.
CO 4: Learn Image Enhancement in Frequency Domain using Fourier Transformation,
Smoothing and Sharpening of Frequency Domain Filters.
CO 5: Understand the concept of Image Thresholding, Algorithms of Image Segmentation
and the Quality Metric Parameters to measure the performance of Thresholding.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Digital Image Processing- Algorithms and Applications-I -course maps majorly to A and C
programme outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 S

CO3 S

CO4 S

CO5 M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Elective
Course Title: Micro-Controller Based Systems Course Code: 10CSE653
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Prerequisites:
Should have knowledge about the basics of microprocessor and microcontroller, basic electronics and programming
Course Content:

UNIT – I 10 Hrs
Introduction: Microcontrollers and embedded processors; Overview of the 8051 family. 8051 Assembly Language Programming
(ALP): Inside the 8051; Introduction to 8051 ALP; Assembling and running an 8051 program; The PC and ROM space in 8051; Data
types, directives, flag bits, PSW register, register banks, and the stack, Jump and loop instructions; Call instructions; Time delay for
various 8051 family members; I/O programming; I/O bit manipulation programming. Immediate and register addressing modes;
Accessing memory using various addressing modes. Bit addresses for I/O and RAM; Arithmetic instructions; Signed numbers and
arithmetic operations; Logic and compare instructions; rotate instruction and serialization; BCD, ASCII, and other application
programs.
UNIT – II 9 Hrs
Programming in C: Data types and time delays; I/O programming; Logic operations; Data conversion programs; Accessing code ROM
space; Data serialization.
UNIT – III 9 Hrs
Pin Description, Timer Programming: Pin description of 8051; Intel Hex file; Programming the 8051 timers; Counter programming;
Programming Timers 0 and 1 in C.
UNIT – IV 10 Hrs
Serial Port Programming, Interrupt Programming, Interfacing: basics of serial communications; 8051 connections to RS232; Serial
port programming in assembly and in C. 8051 interrupts; Programming timer interrupts; Programming external hardware interrupts;
Programming the serial communications interrupt; Interrupt priority in 8051 / 8052; Interrupt programming in C.
Interfacing LCD, Keyboard; Parallel and serial ADC; DAC interfacing; Sensor interfacing and signal conditioning.
UNIT – V 10 Hrs
Advanced microcontrollers and Embedded systems: ARM processors, Freescale 68HC11,PIC (8-bit PIC16, PIC18, 16-bit dsPIC33
/ PIC24) , Atmel AVR (8-bit), AVR32 (32-bit), and AT91SAM (32-bit) , Infineon Microcontroller: 8, 16, 32 Bit microcontrollers for
automotive and industrial applications, Texas Instruments Microcontrollers MSP430 (16-bit), C2000 (32-bit), and Stellaris (32-bit);
Embedded system development
TEXT BOOK
1.Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller and Embedded Systems using
Assembly and C, 2nd Edition, Pearson Education, 2008.

REFERENCE BOOKS
1. Raj Kamal: Microcontrollers Architecture, Programming, Interfacing and System Design, Pearson Education, 2007.
2. Ayala, The 8051 Microcontroller, Cengage Learning, 3rd Edition
3. Charles Greg Osborn, Embedded Microcontrollers & Processor Design, Prentice Hall publishers, 2010
Course outcomes (COs)

CO Description

CO 1: Explain the design features of 8051 family of microcontrollers, its peripherals and
associated programs.
CO 2: Develop embedded programming in C language and Construct any system based on
8051
CO 3: Explain and implement peripheral interfacing using interrupt mechanism
CO 4: Compare various commercially available popular embedded systems such as ARM,
Freescale, PIC, Atmel etc.
Mapping of Course outcomes (COs) to Program outcomes (POs)
Microcontroller based Systems course maps majorly to B programme outcome
Pos A B C D E F G H I J K L
Cos

CO1 S M

CO2 S M

CO3 S M

CO4 S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Elective
Course Title: Advanced Data Base Management Systems Course Code: 10CSE654
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should have knowledge of database.
 Students should have knowledge of sql queries.

Course Content:
UNIT – I 10 Hrs
Overview of Storage and Indexing, Disks and files: Data on external storage; File organizations and Indexing, Index data
structures; Comparison of file organizations; Indexes and performance tuning. Memory hierarchy: RAID; Disk space management;
Buffer manager: Files of records; Page formats and record format.

UNIT – II 10 Hrs
Tree Structured Indexing: Intuition for tree indexes; Indexed sequential access method; B+ trees, Search, Insert, Delete, Duplicates,
B+ trees in practice

UNIT – III 10 Hrs


Hash-Based Indexing: Static hashing; Extendible hashing, Linear hashing, Comparisons.

UNIT – IV 9 Hrs
Overview of Query Evaluation, External Sorting: The system catalog; Introduction to operator evaluation; Algorithms for
relational operations; Introduction to query optimization; Alternative plans: A motivating example; what a typical optimizer does.
When does a DBMS sort data? A simple two-way merge sort; External merge sort.

UNIT – V 9 Hrs
Evaluating Relational Operators: The Selection operation; General selection conditions; The Projection operation; The Set
operations; Aggregate operations; the impact of buffering.
TEXT BOOK:
1. Raghu Ramakrishnan and Johannes Gehrke; Database Management Systems.3rd Edition McGraw-Hill, 2003 (Chapters 8,9,10,11,12,13.1to
13.3,14)
REFERENCE BOOKS:
1. Elmasri and Navathe: Fundamentals of Database Systems 5th Edition, Pearson Education, 2007.
2. Connolly and begg: Database Systems, 4th Edition Pearson Education 2002.

Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.
Course outcomes (COs)

CO Description

CO 1: Identify the storage & Indexing of data and also the disks and files data storage

CO 2: Analyze the tree structured indexing and hash based indexing

CO 3: Illustration of different RAID levels and page formats

CO 4: Analyze and understand the query evaluation ,external sorting techniques.

CO 5: Understand evaluating relational operations.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Advanced DBMS course maps majorly to A,B,C,D,E,H and I program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S M

CO2 S S
CO3 M S S

CO4 S S S

CO5
S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department : Computer Science and Engineering Course Type : Open Elective


Course Title: E-Commerce Course Code: 10CSO661
L-T-P: 3-0-0 Credits:03
Total Contact Hours:36 Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge on the current business trends and technology.
 Students should know the benefits of using e-cash in their daily life.

Course Content:

UNIT I 08 Hrs
Electronic Commerce-Frame work, anatomy of E-Commerce applications, E-Commerce Consumer applications, E-Commerce
organization applications. Consumer Oriented Electronic commerce - Mercantile Process models.

UNIT II 07Hrs
Electronic payment systems - Digital Token-Based, Smart Cards, Credit Cards, Risks in Electronic Payment systems. Inter
Organizational Commerce - EDI, EDI Implementation, Value added networks.
UNIT III 07 Hrs
Intra Organizational Commerce - work Flow, Automation Customization and internal Commerce, Supply chain Management.

UNIT IV 07 Hrs
Corporate Digital Library - Document Library, digital Document types, corporate Data Warehouses. Advertising and Marketing -
Information based marketing, Advertising on Internet, on-line marketing process, market research.

UNIT V 07 Hrs
Consumer Search and Resource Discovery - Information search and Retrieval, Commerce Catalogues, Information Filtering.

TEXT BOOK
1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.

REFERENCE BOOKS
1. E-Commerce fundamentals and applications Hendry Chan, Raymond Lee, Tharam Dillon, Ellizabeth Chang, John Wiley.
2. E-Commerce, S.Jaiswal – Galgotia.
3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang.
4. Electronic Commerce – Gary P.Schneider – Thomson.
5. E-Commerce – Business, Technology, Society, Kenneth C.Taudon, Carol Guyerico Traver.

Course outcomes (COs)

COs Description

CO 1:
Illustrate the major categories and trends of e-commerce applications.
CO 2:
Examine the essential processes of an e-commerce system.
CO 3:
Discuss several factors and web store requirements needed to succeed in e-commerce.
CO 4:
Describe the various marketing strategies for an online business.
CO 5: Define various electronic payment types and associated security risks and the ways to
protect against them.

Mapping of Course outcomes (COs) to Program outcomes (POs)


E-Commerce course maps majorly to F,I and J program outcomes
POs A B C D E F G H I J K L
COs

CO1 M S M
CO2 M M
CO3 M M S M
CO4 M M S M S M M
CO5 M
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Open Elective


Course Title: Decision Support System Course Code: 10CSO662
L-T-P:3-0-0 Credits: 03
Total Contact Hours: 36 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Course Content:
UNIT-I 8Hrs
Decision Making and Computerized Support
Managers and Decision Making, Managerial-Decision Making and Information Systems, Managers and Computer Support,
Computerized Decision Support and the Supporting technologies, A frame work for decision support, The concept of Decision
Support systems, Group Decision Support Systems, Enterprise Information Systems, Knowledge Management systems, Expert
Systems, Artificial Neural Networks, Hybrid Support Systems. Decision-Making Systems, Modeling, and Support: Introduction and
Definitions, Systems, Models. Phases of Decision-Making Process, Decision-Making: The Intelligence Phase, Decision Making: The
Design Phase, Decision Making: The Choice Phase, Decision Making: Implementation Phase.

UNIT – II 7 Hrs
Decision Making and Computerized Support
How decisions are supported, Personality types, gender, human cognition, and decision styles; The Decision –Makers. Decision
Support Systems: An Overview DSS Configuration, What is DSS? Characteristics and Capabilities of DSS, Components of DSS, The
Data Management Subsystem, The Model Management Subsystem, The User Interface Subsystem, The Knowledge-Based
Management Subsystem, The User, DSS Hardware, DSS Classification.

UNIT – III 7 Hrs


Decision Support Systems Development
Introduction to DSS development, The Traditional System Development Life cycle, Alternate Development Methodologies,
Prototyping: The DSS Development Methodology, DSS Technology Levels and Tools, DSS Development Platforms, DSS
Development Tool Selection, Team-Developed DSS, End User-Developed DSS, Putting the System Together.

UNIT –IV 7 Hrs


Group Support Systems
Group Decision Making, Communication and Collaboration, Communication Support, Collaboration Support: Computer- Supported
Cooperative work, Group Support Systems, Group Support Systems Technologies, Group Systems Meeting Room and Online, The
GSS Meeting Process, Distance Learning, Creativity and Idea Generation.

UNIT – V 7 Hrs
Enterprise Information Systems
Concepts and definitions, Evolution of Executive and Enterprise Information Systems, Executive‘s roles and information needs,
Characteristics and capabilities of Executive Support Systems, Comparing and integrating EIS and DSS, Supply and Value Chains and
Decision Support, Supply Chain problems and solutions, MRP, ERP / ERM, SCM, CRM, PLM, BPM, and BAM.
TEXT BOOK
1.Efraim Turban. Jay E. Aronson, Ting-Peng Liang: Decision Support Systems and Intelligent Systems, 7th Edition, Prentice-Hall of
India, 2006.
REFERENCE BOOK
1.Sprague R.H. Jr and H.J. Watson: Decision Support Systems , 4th Edition, Prentice Hall, 1996.
Course outcomes (COs)

CO Description

CO 1: Illustrate different types of Decision Making strategies, frame work for decision
support.
CO 2: Examine DSS Development Methodology, DSS Technology Levels and Tools.

CO 3: Analyze Group Decision Making, Communication and Collaboration, Communication


Support.
CO 4: Describe the evolution of Executive and Enterprise Information Systems, Executive‘s
roles and information needs, Characteristics and capabilities of Executive Support
Systems
Mapping of Course outcomes (COs) to Program outcomes (POs)
Decision Support System course maps table
Pos/Cos A B C D E F G H I J K L

CO1 M

CO2 M

CO3 M

CO4 M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Open Elective


Course Title: Business Intelligence and Its Applications Course Code: 10CSO663
L-T-P: 3-0-0 Credits: 3
Total Contact Hours: 38 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50
Prerequisites:

 Student should have prior knowledge of DBMS


 Student should have queried some database using SQL
Course Content:

UNIT – I 7 Hrs
Introduction to Business Intelligence Types of digital data; Introduction to OLTP, OLAP and Data Mining; BI Definitions &
Concepts; Business Applications of BI; BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components – BI Process,
BI Technology, BI Roles & Responsibilities
UNIT – II 8 Hrs
Basics of Data Integration Basics of Data Integration (Extraction Transformation Loading); Concepts of data integration; Need and
advantages of using data integration; Introduction to common data integration approaches; Introduction to data quality, data profiling
concepts and applications
UNIT – III 7 Hrs
Introduction to Data Integration Introduction to SSIS Architecture, Introduction to ETL using SSIS; Integration Services objects; Data
flow components – Sources, Transformations and Destinations; Working with transformations, containers, tasks, precedence
constraints and event handlers.
UNIT – IV 7 Hrs
Introduction to Multi-Dimensional Data Modeling Introduction to data and dimension modeling, multidimensional data model, ER
Modeling vs. multi dimensional modeling; Concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema;
Introduction to business metrics and KPIs; Creating cubes using SSAS
UNIT – V 7 Hrs
Basics of Enterprise Reporting Introduction to enterprise reporting; Concepts of dashboards, balanced scorecards; Project: Data
warehouse creation and designing reports; Introduction to SSRS Architecture, Enterprise reporting using SSRS; Use of Business
Intelligence Development Studio (BIDS)
TEXT BOOK
―Business Analytics & its Applications‖ by seema acharya & R N Prasad.

REFERENCE BOOKS:
1. “Business Intelligence” by David Loshin
2. “Business Intelligence for the Enterprise” by Mike Biere
3. “Business Intelligence Roadmap” by Larissa Terpeluk Moss, Shaku Atre
4. “Successful Business Intelligence: Secrets to making Killer BI Applications” by Cindi Howson
Note: Teachers will provide Lab components as part of the assignment, students will have to execute them and evaluation be
the teachers as a component of the CIE.
Course outcomes (COs)

CO Description

CO 1: Learn BI concepts, methodologies & BI framework


CO 2: Building Data Warehouse by understanding complete ETL process
CO 3: Understand SQL Server Integration Services (SSIS) & SSRS Architectures
CO 4: Understand various Data modeling & Dimensional modeling techniques.
CO 5: Illustrate Enterprise reporting, Concepts of dashboards & Balanced scorecards

Mapping of Course outcomes (COs) to Program outcomes (POs)


Business Intelligence & Its Applications course maps majorly to A,B,C,D, E,F,H,J,K and L
program outcomes
POs A B C D E F G H I J K L
COs

CO1 S S S
CO2 S M S S S

CO3 S S S M S S S S

CO4 M S

CO 5 M S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Open Elective


Course Title: Digital Image and Video Processing Course Code: 10CSO664
L-T-P: 3-0-0 Credits: 3
Total Contact Hours: 40 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Course Content:
8Hrs
UNIT – I
Introduction: Digital Image and its representation; Fundamental steps in Digital Image Processing, Components of Image Processing
System; Image Processing Analysis and Interpretation; Resolution, storage and convolution. Histogram and its properties;
Characteristics Properties derives from histogram. Mathematical Tools in DIP; Linear and Non Linear Operators; Rigid Body
Transformation Affine and Projective Transformation.
UNIT – II 8 Hrs
Image Enhancement in spatial domain Definition and characteristics; contrast stretching; Histogram Processing –Histogram
Equalization, Histogram Hyperbolization. Image Enhancement in Frequency domain Introduction and properties of Fourier
Transforms; Smoothing Frequency Domain Filters; Sharpening Frequency Domain Filters.
UNIT – III 8 Hrs
Edge Detection Definition; step, Ramp and Roof Edge; Robert, Sobel, Prewitt and Laplacian Edge Detectors; Detection of
Discontinuities – Point, Line and Edge Detection.
Segmentation Threshholding and Segmentation; Region Based Segmentation: Region Growing, Region Splitting and Region
Merging; Means Shift and Graph cut Segmentation.
UNIT – IV 8 Hrs
Color Image Fundamentals Light and color, chromatic and Achromatic; Color Models: RGB, HIS, CMY, YIQ Conversions; Color
Edge Detection. Quality Metrics Introduction to Quality Metric; Need for the quality Parameters; Subjective and Objective
Measurement; Quality Metric parameters for Image processing Algorithms- Example.
UNIT – V 8 Hrs
Video Basics: Video and Picture basics; Resolution; Image and Video formats.Video Editing: Types of Video Editing; Linear and
Non Linear Editing.Video Short Detection: Shot Transition in video; Classification of shot Transitions; Adaptiv Threshholding;
Performance Evaluation; Importance and Application Areas. Video Shot Detection Methods – Pixel Difference, Histogram
Difference.
Text Book
1. Rafael C Gonzalez and Richard E Woods, “Digital Image Processing”, Pearson Education, 3rd Edition , 2009.
2. B. Chanda, D Dutta Manjumdar, “Digital Image Processing and Analysis”, Prentic-Hall, India, 2002.
Reference Books
Notes will be provided during lecture session
Note: The Internal Assessment marks of 50 for the core subjects will have 30 marks for theory and 20 marks for surprise test and
assignment.

VII Semester Subjects


Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Compiler Design Course Code: 10CS71
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:

 Students should have knowledge of basic assembly level language instructions


 Students should have studied the subject Formal Languages and Automata Theory
 Students should have some knowledge of concepts in graph theory like DAG, graph colouring

Course Content:

UNIT – I 9 Hrs
Introduction to compilers: Compilers and translators, why do we need translators?, the structure of a compiler, Lexical Analysis,
Syntax analysis, Intermediate Code generation, Optimization, Code generation, Bookkeeping, Error handling, Compiler-writing tools,
Bootstrapping Lexical Analysis: - The role of lexical analyzer, A simple approach to the design of lexical analyzer, Lex tool, Syntax
Analysis-I: Shift reduce parsing, Computation of FIRST and FOLLOW sets.
UNIT – II 10 Hrs
Basic Parsing Techniques: Top – down parsing. Automatic Construction of efficient parsers: LR parsers, The canonical collection of
LR(0) items, Constructing SLR parsing tables, Constructing canonical LR parsing tables, Constructing LALR parsing tables, Using
ambiguous grammars, An automatic parser generator, Implementation of LR parsing tables, Constructing LALR sets of items.
UNIT – III 10 Hrs
Syntax – Directed Translation: Syntax – directed translation schemes, Implementation of Syntax-directed translators, Intermediate
code, Postfix notation, Parse trees and syntax trees, Translation of assignment statements, Boolean expressions, Statements that alter
the flow of control, Postfix translations, Translation with a top-down parser. More about Translation: Procedure calls & Record
Structures, Symbol Tables: The contents of a symbol table, Data structures for symbol tables, Representing scope information.

UNIT – IV 10 Hrs
Run – time Storage Administration: – Implementation of simple stack allocation scheme, Implementation of block – structured
languages;Error Detection and Recovery: Errors, Lexical-phase errors, Syntactic-phase errors, Semantic errors.Intermediate code
generation Intermediate languages, Graphical representation, Three-address code, Implementation of three address statements
(Quadruples, Triples, Indirect triples).
UNIT – V 9 Hrs
Code optimization: Introduction, Basic blocks & flow graphs, Transformation of basic blocks, Dag representation of basic blocks,
The principle sources of optimization, Loops in flow graph, Peephole optimization. Code generations Issues in the design of code
generator, a simple code generator, Register allocation & assignment.
TEXT BOOKS
1. ‗Principles of Compiler Design‘ Alfred V. Aho, Jeffrey D. Ullman, Narosa Publishing
2. ‗Compilers Principles, Techniques and Tools‘, Aho, Ravi Sethi, JD Ullman, Pearson Education/Prentice Hall of India

REFERENCE BOOKS
1.‗Allen I.Holub, ‗Compiler Design in C‘, PHI.
2. ‗The Theory and Practical of Compiler Writing‘, Jean-Paul Trembly, Paul G. Sorenson, BSPublications
3. ‗Compiler Construction : Principle and Practice ‗ by Louden ,Cengage Publications.
Note: Students have to self study the following topics on linkers and loaders. The teacher should give the assignments and
evaluate the assignments as a part of the CIE Component.
Loaders And Linkers Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent
Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Macro Processor Basic Macro
Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures

TEXT BOOK
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
Course outcomes (COs)
CO Description
CO 1: Understand basics of Compilers and its phases and will be able to solve problems
related to Shift reduce parsing, compute FIRST and FOLLOW sets, LR(0), LR(1) and
LALR sets of items and parse table for a given grammar
CO 2: Demonstrate the ability to write syntax directed translations of simple statements and
understand the working of procedure calls
CO 3: Demonstrate the ability to write intermediate code for a given high level programming
language (preferably C or FORTRAN) and be able to represent the intermediate code
as Quadruples, Triples and Indirect Triples
CO 4: Write 3 address code and identify the basic blocks , draw flow graphs and represent
directed Acyclic graphs for the identified basic blocks. They will also be able to write
the target optimized code (assembly code) for the given three address code.
Mapping of Course outcomes (COs) to Program outcomes (POs)
Compiler Design course maps majorly to A, B, D, E and F program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S

CO2 M S

CO3 S S S S S

CO4 S S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Cloud Computing Course Code: 10CS72
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
Students should have knowledge of Computer Network, Engineering Management and Entrepreneurship.
Course Content:

UNIT – I 10Hrs
Introduction
Business and IT perspective, Evolution of Cloud Computing, Cloud and virtualization, Cloud services requirements, cloud and
dynamic infrastructure, cloud computing characteristics, cloud adoption.
Cloud models: Cloud characteristics, Measured Service, Cloud models, security in a public cloud, public verses private clouds, cloud
infrastructure self service.
Cloud at a service: Gamut of cloud solutions, principal technologies, cloud strategy, cloud design and implementation using SOA,
Conceptual cloud model, cloud service demand.

UNIT – II 9Hrs
Cloud solutions: Cloud ecosystem, cloud business process management, cloud service management, cloud stack, computing on
demand, cloud sourcing.
Cloud offerings: Cloud analytics, Testing under cloud, information security, virtual desktop infrastructure, Storage cloud

UNIT –III 10Hrs


Cloud management: Resiliency, Provisioning, Asset management, cloud governance, high availability and disaster recovery,
charging models, usage reporting, billing and metering.
Cloud virtualization technology
Virtualization defined, virtualization benefits, server virtualization, virtualization for x86 architecture, Hypervisor management
software, Logical partitioning, VIO server, Virtual infrastructure requirements. Storage virtualization, storage area networks, network
attached storage, cloud server virtualization, virtualized data center.

UNIT –IV 10Hrs


Cloud Programming and Software Environments:
Features of cloud and grid platforms,Parallel and distributed programming paradigms, programming Support for Google App Engine,
Programming on Amazon AWS and Microsoft Azure

UNIT –V 9Hrs
Emerging Cloud software Environments.
Ubiquitous Clouds and the Internet of Things:
Cloud Trends in supporting Ubiquitous Computing, Enabling Technologies for the Internet of Things, Innovative Applications of the
Internet of Things
TEXT BOOKS:
1. “Cloud Computing” by Dr.Kumar Saurabh, 2nd Edition
2. Distributed and cloud computing” by Kai Hwang, Geoffrey C Fox and Jack J Dongarra.

Course outcomes (COs)


CO Description

CO 1: Understand the basic principles of cloud computing

CO 2: Ability to understand the cloud offerings and storage.

CO 3: Analyze the demonstration of virtualization technology

CO 4: Identify the various distributed programming paradigms

CO 5: learn and describe Ubiquitous computing and Internet of Things

Mapping of Course outcomes (COs) to Program outcomes (POs)


Cloud Computing course maps majorly to B, C, D and J program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M

CO2 S S

CO3 S M M

CO4 M S
CO5 S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Seminars - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course title: Object Oriented Modeling and Design Course Code: 10CS73
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50
Prerequisites:
 Student should have prior knowledge of OOP‘s
 Student should have prior knowledge of Computer Concepts

Course Content:

UNIT – I 10 Hrs
Introduction, Modeling Concepts, What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO
development; OO modeling history.
Modeling as Design Technique: Modeling; abstraction; The three models Class Modeling
Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model;
Navigation of class models. Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes;
Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages.
UNIT – II 10 Hrs
State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Practical tips.Advanced State
Modeling: Nested state diagrams; Nested states; Signal generalization; Concurrency; A sample state model; Relation of class andstate
models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models; Use case relationships; Procedural
sequence models; Special constructs for activity models.
UNIT – III 10 Hrs
Process Overview, System Conception, Process Overview: Development stages; Development life cycle.System Conception: Devising
a system concept; Elaborating a concept;Preparing a problem statement. Domain Analysis, Application Analysis Domain Analysis:
Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. Application
Analysis: Application interaction model; Application class model; Application state model; Adding operations.
UNIT – IV 9 Hrs
Overview of system design; Estimating performance; Making a reuse plan; Breaking a system in to sub-systems; Identifying
concurrency; Allocation of sub-systems; Management of data storage; Handling global resources; Choosing a software control
strategy; Handling boundary conditions; Setting the trade-off priorities; Common architectural styles; Architecture of the ATM system
as the example. Class Design, Implementation Modeling:- Class Design: Overview of class design; Bridging the gap; Realizing use
cases; Designing algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior; Adjustment of
inheritance;Organizing a class design; ATM example.
UNIT – V 9 Hrs
Implementation Modeling: Overview of implementation; Fine-tuning classes; Fine-tuning generalizations; Realizing associations.
Design Patterns What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description.
Structural Decomposition: Whole-Part; Organization of Work: Master-Slave; Management :Command processor; View handler;
Communication: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber.
TEXT BOOKS
1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, 2nd Edition, Pearson Education, 2005.
2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal: Pattern-Oriented Software Architecture, A
System of Patterns, Volume 1, John Wiley and Sons, 2006.

REFERENCE BOOKS
1. Grady Booch et al: Object-Oriented Analysis and Design with Applications, 3rd Edition, Pearson, 2007.
2. Mark Priestley: Practical Object-Oriented Design with UML, 2nd Edition, Tata McGraw-Hill, 2003.
3. K. Barclay, J. Savage: Object-Oriented Design with UML and JAVA, Elsevier, 2008.
4. Booch, G., Rumbaugh, J., and Jacobson, I.: The Unified Modeling Language User Guide, 2nd Edition, Pearson, 2005.
Course outcomes (COs)

CO Description

CO 1: Design Models using UML


CO 2: Development stages of OOMD

CO 3: Estimating System performance

CO 4: Implementation of patterns

Mapping of Course outcomes (COs) to Program outcomes (POs)


Object Oriented Modeling and Design course maps majorly to A,B,C,D,F and G program outcomes
POs A B C D E F G H I J K L
COs
CO1 S

CO2 M M S S

CO3 S S S M S

CO4 M S M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Tutorials Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Humanities Course


Course Title: Entrepreneurship Development Course Code: 10CSH74
,Management and IPR
L-T-P:3-0-0 Credits: 03
Total Contact Hours: 36 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge on the current business trends and technology.
Course Content:

UNIT I 6 Hrs
Introduction-meaning and importance of entrepreneurship, entrepreneur, types, characteristics, entrepreneur process, role of
entrepreneurs in economic development, problems faced by entrepreneurs, scope in India
UNIT II 7Hrs
Micro, Small and medium enterprises, Definition of MSMEs as per MSME act, characteristics of small enterprises, need and
advantages of small enterprises, Steps in setting up of small enterprises, Institutional support to MSMEs-State supporting agencies-
TECSOK, KIADB, KSSIDC, KSFC, National Schemes-MSME-DI, NSIC, SIDBI
UNIT III 7 Hrs
Preparation of Project reports, control variables in project, project lifecycle, project report, need, project identification, project
selection, components of project report, formulation of report, planning commission guidelines, project appraisal, feasibility study-
market, financial, technical and economic, PERT and CPM, errors in report
UNIT IV 8Hrs
Introduction to IP, What is Intellectual Property (IP)?, Historical background of IP, Economic value of IP, Motivation to IP
development, IP system strategy, Emerging issues, IPR governance, Institutions for administering the IP system, IP rights and
marketing regulations, IPR protection, protecting consumers and protecting competition,
IP management framework, Drivers of IP management, IP value chain, IP management framework, IP strategies, Strategic
considerations, managing trademarks,

UNIT V 8Hrs
Intellectual Property Rights-What are IPRs?, Types of IPRs, Indian IPR scenario, Legal use of IP, Global Vs Indian IPR landscape,
TRIPS and its implications.
Patents-What is a patent, history of patent, Criteria for patent, types of patents, Indian patent act, patents for computer software,
business models, incremental innovation, patent infringement
Trademarks-role, as a marketing tool, trademark rights, types, use of trademarks, trademark act, trademark registration in India

Copyrights-meaning, copyright protection in India, enforcement measures, copyright


TEXT BOOK
1. Dynamics of Entrepreneurial Development and Management-Vasanth Desai, Himalaya Publishing
2. Entrepreneurship and Management, S Nagendra and Manjunath VS, Pearson Publications
3. Managing Intellectual Property, Vinod V. Sople, PHI, 3rd Edition, 2012
4. Intellectual Property-Copyrights, trademarks and patents, Richard Stim, Cengage learning, 2011
Course outcomes (COs)

CO Description

CO 1: Build confidence to become good managers by making students understand the


entrepreneurship activities.
CO 2: Motivate the students to start their own enterprise after understanding various steps
involved in starting an industry.
CO 3: Enhance the knowledge of students in preparing the Project Report

CO4: Analyze and Understand the importance and details of IPR in the field of engineering.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Entrepreneurship Management and Development IPR course maps majorly to A, C, D, E,
F, G, H, I, J and K program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S S M S M S S M M

CO2 S S M S M M

CO3 S M M M S S S M

CO4 M S S S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Case Study – 10 Marks
 Seminar - 10 Marks
-----------------------
Total = 50 Marks
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: System Software Laboratory Course Code: 10CSL77
L-T-P:0-0-3 Credits: 1.5
Total Contact Hours: 24 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Student should have knowledge about compiler, assembler,etc.


 Student should have knowledge of Regular Expressions and context free grammars.
Lab Exercises :
Should do at least 10 lex and 10 yacc programs.
MiniProject
a. Text editor Tiny Assembler Lexical Analyzer

Note: Students should self study the following concepts of Assembler to carry out mini project in assembler.
Assemblers Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent
Assembler Features - Instruction Formats & Addressing Modes, Program Relocation. Machine Independent Assembler Features –
Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design
Operations - One-Pass Assembler, Multi-Pass Assembler.
TEXT BOOK
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
Course outcomes (COs)
CO Description
CO 1: understand how the compiler tools LEX C works and will be able to observe the use of
regular expressions to match patterns and tokenize the input..
CO 2: understand theSyntax analysis phase through programming and the use of Context free
grammars for syntax checking.
CO 3: Implement any of one of three(text editor, assembler and lexical analyzer) system
software as part of course project

Mapping of Course outcomes (COs) to Program outcomes (POs)


System Software Laboratory course maps majorly to B , C, E, G and K program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 S M M

CO2 S M M

CO3 S S S S S

Assessment Method
 Experiment Writeup + Execution + Viva - 15 Marks
 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course title: Object Oriented Modeling and Design Course Code: 10CSL78
Laboratory
L-T-P: 0-0-3 Credits: 1.5
Total Contact Hours:3 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50
Prerequisites:
 Student should have prior knowledge of OOP‘s
 Student should have prior knowledge of Computer Concepts
Course outcomes (COs)
CO Description

CO 1: Design Models using UML


CO 2: Development stages of OOMD
CO 3: Estimating System performance
CO 4: Implementation of patterns

Mapping of Course outcomes (COs) to Program outcomes (POs)


Object Oriented Modeling and Design Laboratory course maps majorly to A,B,D,E,F,G
program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M S S

CO2 S M S

CO3 S S S M S

CO4 M S

Assessment Method

 Experiment Writeup + Execution + Viva - 15 Marks


 Lab Record Wirting - 10 Marks
 Lab Internals Test - 15 Marks
 Surprise Test - 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Project Preliminary/Technical Seminar Course Code: 10CSP79
L-T-P: 0-0-4 Credits: 00
Total Contact Hours: 48 hrs Duration of SEE: NA
SEE Marks: 0 CIE Marks: 50

Prerequisites:
 Students should have basic programming experience
 Students should have been in a position to understand design and development of experimental procedures
 Students should be reasonably capable of understanding and analyzing technical documents

Course Content:

Seminar topic shall be selected from the emerging technical areas only and presented before internal review committee.

The topic will be selected in consultation with a Guide.

Study and presentation should be done by individual student and not in a team.

Rubrics:
Performance Low Medium Strong
Indicators
Literature Survey Literature Survey not Incomplete literature Extensive literature
and problem relevant survey and improper survey with clear state
understanding understanding of of the art problem
problem understanding
Creativity Is unable to predict or Approximately Can predict and
defend problem outcomes predicts and defends defend problem
problem outcomes outcomes very well
Presentation and Disorganized and Organized, but Effective organized
communication ineffective presentation ineffective presentation
presentation
Course outcomes (COs)
CO Description

CO 1: Student will be experts in technical paper presentation

Students will be able to appreciate the significance of learning new topics in related
CO 2: engineering discipline

Project Preliminary/Technical Seminar Mapping of Course outcomes (COs) to Program outcomes (POs)
Project Preliminary/Technical Seminar course maps majorly to H program outcomes
Pos A B C D E F G H I J K L
Cos
CO1 M S

CO2 L L

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Information Security Course Code: 10CSE751
L-T-P 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites: Internetworking with TCP/IP

Course Content:
Cryptography and Network Security

UNIT – I 10 Hrs
Introduction to Information Security: Introduction, The history of Information Security, what is security? Critical characteristics of
Information, NSTISSC security model. Information security terminology. The need for security: Threats, Attacks

UNIT – II 10 Hrs
Planning for security: Introduction, Information Security policy, standards and practices, The information security blueprint, security
education, training and awareness program, contingency strategies.
UNIT – III 9 Hrs
Security Technology: Firewalls and VPNs: Introduction, Physical design, Firewalls, Protecting remote connections.

UNIT – IV 9 Hrs
Security Technology: Intrusion Detection, Access control and other security tools: Introduction Detection Systems, Honey Pots,
Honey nets and padded cell systems, scanning and analysis tools, Access control devices.

UNIT – V 10 Hrs
Implementing Information Security: Introduction, Project Management for information security, Technical topics of implementation.
Information Security Maintainance: Introduction, security management models, the maintaenance model.

TEXT BOOKS:
1. Principles of Information Security, 2nd edition, Michael E Whittman, Herbert J Mattord, CENGAGE Learning, 2005

REFERENCE BOOK:
1. Cryptography and Network security: Behrouz A forouzan, TMH, 2007

Course outcomes (COs)


CO Description
CO 1: Understanding the critical characteristics of Information Security
CO 2: Able to plan security and contingency strategies
CO 3: Analyze the various security technologies like firewalls and VPNs
Analyze the various security technologies like Intrusion detection, honey pots, honey
CO 4: nets, padded cell systems, etc
CO 5: Implementing and maintaining Information security
Mapping of Course outcomes (COs) to Program outcomes (POs)
Information Security course maps majorly to A, B, C,D, I and K program outcomes

Pos/Cos A B C D E F G H I J K L

CO1 S M S S

CO2 S S M

CO3 S M S

CO4 S M S

CO5 S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Seminars on network tools - 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Digital Image Processing- Algorithms Course Code: 10CSE752
and Applications-II
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of basic of image processing


 Students should have knowledge of coding.
Course Content:

UNIT – I 8 Hrs
Mathematical Foundation
Linear and Non Linear Operation; Orthogonal Transforms: Fourier Transform, Discrete Cosine and Sine Transform, Hartley
Transform, Walsh-Hadamard Transform, Haar Transform, Slant Transform, Karhunen-Loeve Transform, Singular Value
Decomposition
UNIT – II 10 Hrs
Shape Representation: Boundary Descriptors, Regional Descriptors, Invariant Moments
* Quality Metric Introduction to Quality Metric, Need for the Quality Parameters, Subjective and Objective Measurement, Quality
Metric Parameters for Image Processing Algorithms:
Image Enhancement, Thresholding, Filter, Edge Detection.

UNIT – III 10 Hrs


* Image Registration and Application Areas Image Registration: Introduction and Application areas; Mathematical Foundation:
Affine, Projective and Perspective Transformation; Approaches to Image Registration: Global and Local Registration; Area Based
methods, Correlation Based Methods, Finding Matching Points; Feature based methods, Calculation of Image Features, Feature
Reduction and Selection of Dominant Feature Points; Matching: Matching Scores, Accuracy of Matching; Application of Image
Registration in Target Tracking.
UNIT – IV 10 Hrs
Image Restoration A Model of the Image degradation/Restoration process, Noise Models, Restoration in the Presence of Noise
Only–Spatial Filtering, Periodic Noise Reduction by Frequency Domain Filtering, Linear, Position-Invariant Degradations ,
Estimating the Degradation Function, Inverse Filtering , Minimum Mean Square Error (Wiener) Filtering.
UNIT – V 10 Hrs
Image Compression
Fundamentals, Basic Image Compression Methods: Lossless and Lossy Compression, Run-Length Coding, Block Truncation Coding,
Bit Plane Coding, Huffman Coding, Binary Arithmetic Coding, , Vector Quantization, JPEG and MPEG Compression.

TEXT BOOKS
1. Rafael C Gonzalez and Richard E Woods, ―Digital Image Processing‘‘, Pearson Education, 3rd Edition, 2009.
REFERENCE BOOKS
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, ―Image Processing, analysis and Machine Vision‘‘, Thomson Brooks/Cole, 2nd
Edition
Course outcomes (COs)
CO Description

CO 1: Learn the Advanced Mathematical tools used in DIP.

CO 2: Learn the Shape Representation of Objects and study Quality Metric for different
Image Processing techniques

CO 3: Learn Image Registration and its application for Target Tracking.

CO 4: Identify various Noise Models and Study methods of their Removal.

CO 5: Learn Image Compression techniques

Mapping of Course outcomes (COs) to Program outcomes (POs)


Digital Image Processing- Algorithms and Applications-II course maps majorly to A, E
program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 M

CO3 S

CO4

CO5 M S
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Real Time Systems Course Code: 10CSE753
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Prerequisites:

 Should have knowledge about basics of embedded system and operating system

Course Content:

UNIT – I 10 Hrs
Introduction: An Embedded System; Characteristics of Embedded Systems; Software embedded into a system; Real Time Definitions,
Events and Determinism, Synchronous & Asynchronous Events, Determinism, Time-Loading, Real-Time Design Issues, Example
Real Time Systems.
UNIT – II 10 Hrs
Real Time Kernels: Real Time and Embedded Operating Systems; Interrupt Routines in RTOS environment; co routines, Interrupt
driven systems, Foreground/background systems, Full-featured Real Time Operating Systems. Process scheduling, round robin, cyclic
executives, fixed and dynamic scheduling Multiple processes in an application; Problem of sharing data by multiple tasks and
routines; Inter Process Communication, Mailboxes, Critical Regions, Semaphores, Deadlock. Memory Management
UNIT – III 9 Hrs
Real Time specifications and design technique: Mathemetical specifications, flow charts, structure charts, Finite state automata, data
flow diagrams, Petri Nets, Warnier Orr Notation, State charts.
UNIT – IV 10 Hrs
Language Features: Parameter passing, Recursion, Dynamic allocation, Typing, exception handling, abstract data typing.
Programming Languages and Tools: Desired language characteristics; Data typing; Control Structures; Packages; Exception Handling;
Overloading; Multitasking; Task Scheduling; Timing specification; Programming environments; Runtime support.
UNIT – V 9 Hrs
System Performance Analysis and Optimization: Performance Analysis, Optimization, Fault & Fault Tolerance.
TEXT BOOK
1. Phillip A. Laplante .;: ― Real –Time Systems Design and Analysis‖ – 3rd Edition, Apr 2004. Wiley-IEEE Press

REFERENCE
Suitable material from internet, whitepapers etc. on Realtime systems need to be referred; and latest books on design and performance
of RTOS and other real time systems have to be collected and referred.
Course outcomes (COs)

CO Description

CO 1: Explain a real time system and relate it to embedded systems

CO 2: Describe the kernel construction, real time operating system, real time system model
using state machine and petrinet
CO 3: Design and implement application programs on real time systems

CO 4: Analyse and compare performance of various realtime systems

Mapping of Course outcomes (COs) to Program outcomes (POs)


Real Time Systems course maps majorly to B &C program outcome
Pos A B C D E F G H I J K L
Cos

CO1 M S M
CO2 S M

CO3 S S

CO4 S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Data Warehousing and Data Mining Course Code: 10CSE754
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Student should have knowledge of DBMS


 Student should know statistics

UNIT- I
Data Warehousing: 10 Hrs
Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data Warehouses. Design Issues, Guidelines
for Data Warehouse Implementation, Data Warehouse Metadata; Online Analytical Processing (OLAP): Introduction, Characteristics
of OLAP systems, Multidimensional view and Data cube

UNIT II 10 Hrs
Data Cube Implementations, Data Cube operations, Implementation of OLAP and overview on OLAP Softwares; Data Mining:
Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity

UNIT III 10 Hrs


Data Mining Applications; Association Analysis: Basic Concepts and Algorithms: Frequent Itemset Generation, Rule Generation,
Compact Representation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP Growth Algorithm,
Evaluation of Association Patterns

UNIT IV 9 Hrs
Classification -1 : Basics, General approach to solve classification problem, Decision Trees, Rule Based Classifiers, Nearest
Neighbor Classifiers.
UNIT V 9 Hrs
Clustering Techniques: Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis
Methods, Partitional Methods, Hierarchical Methods, Density Based Methods, Quality and Validity of Cluster Analysis

TEXT BOOKS:
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Addison-Wesley, 2005.
2. G. K. Gupta: Introduction to Data Mining with Case Studies, 3rd Edition, PHI, New Delhi, 2009.

REFERENCE BOOKS:
1. Arun K Pujari: Data Mining Techniques University Press, 2nd Edition, 2009.
2. Jiawei Han and Micheline Kamber: Data Mining - Concepts and Techniques, 2nd Edition, Morgan Kaufmann Publisher, 2006.
3. Alex Berson and Stephen J. Smith: Data Warehousing, Data Mining, and OLAP Computing, Mc GrawHill Publisher, 1997.

Note :
i) For SEE, students should answer five questions, selecting at least one question from each unit
ii) Laboratory component will be part of CIE(20 marks). It is a combination of case studies and implementation of selected algorithms from
the above curriculum.

I. List of Lab exercises


1. Implement frequent itemset generation using Apriori algorithm
2. Implement rule generation in Apriori algorithm
3. Implement FP growth algorithm
4. Implement a decision tree
5. Implement nearest neighbor classification algorithm
6. Implement k-means clustering algorithm
7. Implement centroid algorithm

II .Case Studies
1. Discovering Web Access Patterns and Trends by Applying OLAP and Data Mining Technology on Web Logs.
2. Efficient Clustering of Very large Document Collections
3. Crime Data mining

Course outcomes (COs)


CO Description

CO 1: Understand ODS, ETL, Data Warehousing and its Implementation, OLAP and its
characteristics and Data Cube.
CO 2: Understand the Implementation of Data Cube and OLAP, Data Mining and its
challenges, Types of Data Processing and Measures of Data
CO 3: Learn association analysis and algorithms ,Generate and Evaluate Association patterns
CO 4: Learn, Apply and Compare Classification Techniques
CO 5: Learn, Apply and Compare Clustering Techniques

Mapping of Course outcomes (COs) to Program outcomes (POs)


Data Warehousing and Data Mining course maps majorly to A,B program outcomes
A B C D E F G H I J K L
POs
COs

CO1 M M

CO2 M
CO3 S S M M

CO4 S S M M M

CO5 S S M M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Mobile Computing Course Code: 10CSE755
L-T-P:4-0-0 Credits: 03
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have prior knowledge of Computer Networks.

Course Content:

UNIT – I 11 Hrs
Mobile Devices And Systems, Architectures: Mobile phones, Digital Music Players, Handheld Pocket Computers, Handheld Devices,
Operating Systems, Smart Systems, Limitations of Mobile Devices, Automotive Systems. GSM – Services and System Architectures,
Radio Interfaces, Protocols, Localization, Calling, Handover, General Packet Radio Service.
UNIT – II 9 Hrs
Wireless Medium Access Control And Cdma – Based Communication: Medium Access Control, Introduction to CDMA – based
Systems, OFDM, Mobile Ip Network Layer, Mobile Transport Layer: IP and Mobile IP Network Layers Packet Delivery and
Handover Management.
UNIT – III 9 Hrs
Location Management, Registration, Tunneling and Encapsulation, Route Optimization, Dynamic Host Configuration Protocol.
Indirect TCP, Snooping TCP, Mobile TCP, Other Methods of TCP – layer Transmission for Mobile Networks. Databases: Database
Hoarding Techniques, Data Caching, Client –Server Computing and Adaptation.
UNIT – IV 9 Hrs
Transactional Models, Query Processing, Data Recovery Process, Issues relating to Quality of Service. Data Dissemination And
Broadcasting Systems: Communication Asymmetry, Classification of Data – Delivery Mechanisms, Data Dissemination Broadcast
Models, Selective Tuning and Indexing Techniques.
UNIT – V 10 Hrs
Digital Audio Broadcasting, Digital video Broadcasting. Data Synchronization In Mobile Computing Systems: Synchronization,
Synchronization Protocols, SyncML – Synchronization Language for Mobile Computing, Synchronized Multimedia Markup
Language (SMIL).
TEXT BOOK
1. Mobile Computing – Raj Kamal, Oxford University Press, 2007.

REFERENCE BOOKS
1. Mobile Computing: Technology, Applications and Service Creation, Asoke K. Talkukder, Roopa R Yavaga, Tata McGraw Hill,
2005.
2. Mobile Computing Principles: Designing and Developing Mobile Applications with UML and XML, Reza B‘Far, 5th Edition,
Cambridge University press, 2006.
3. Principles of Mobile Computing – Uwe Hansmann, Lothat Merk, Martin S Nicklous and Thomas Stober, 2nd Edition, Springer
International Edition, 2003.
4. Mobile Communication – Schiller, Pearson Education, 2004.

Assessment Method (50 Marks)


 Midterm Test (2 Tests) – 30 Marks
 Surprise Test - 10 Marks
 Assignment test - 10 Marks
-----------------------
Total = 50 Marks

Course outcomes (COs)


CO Description

CO 1: Learn the principles of mobile computing technologies

CO 2: List different applications that mobile computing offers to people, employees, and
businesses
CO 3: Describe the possible future of mobile computing technologies and applications

CO 4: Learn about traditional and modern network technologies and mobile computing
protocols.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Mobile Computing course maps majorly to B , D, J program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S

CO2 S M M

CO3 S M

CO4 S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Adhoc Wireless and Sensor Networks Course Code: 10CSE756
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of Computer networks.
 Students should have knowledge of probability theory.

Course Contents:

UNIT – I 10 Hrs
Adhoc Networks: Introduction and Definitions, Adhoc Network Applications, Design Challenges. Evaluating Adhoc Network
Protocols -the Case for a Test bed. Routing in Mobile Adhoc Networks: Introduction, Flooding. Proactive Routing. On Demand
Routing. Proactive Versus on demand Debate. Location based Routing.

UNIT – II 10 Hrs
Transport layer Protocols in Adhoc Networks: Introduction, TCP and Adhoc Networks, Transport Layer for Adhoc Networks:
Overview, Modified TCP, TCP-aware Cross-layered Solutions. Adhoc Transport Protocol

UNIT – III 10 Hrs


QoS Issue in Adhoc Networks: Introduction, Definition of QoS, Medium Access Layer, Q0S Routing, Inter- Layer Design
Approaches.

UNIT – IV 9 Hrs
Introduction and Overview of Wireless Sensor Networks: Introduction: Basic Overview of the Technology.
Applications of wireless Sensor Networks: Introduction, Background, Range of Applications, Examples of Category 2 WSN
Applications, Examples of Category I WSN applications. Basic Wireless Sensor Technology:Introduction. Sensor Node Technology,
Sensor Taxonomy.
UNIT – V 9 Hrs
Wireless Transmission Technology and Systems: Introduction, Radio technology Primer, Available Wireless
Technologies. Performance and Traffic Management Introduction, WSN Design Issues, Performance modeling of WSNs.

TEXT BOOKS
1. Prasant Mohapatra and Srihanamurthy, ―Ad Hoc Networks Technologies and Protocols‖, Springer, Springer International Edition,
2009.

2. Kazem Sohraby, Daniel Minoli, Taieb Znati, ―Wireless Sensor Networks‖, A John Wiley & Sons, Inc., Pub!ication-2007.

Course outcomes (COs)

CO Description

CO 1: Investigated the wireless network basic concept with cell structure, Modulation
techniques, Coding techniques and Application
CO 2: Conceptualized MAC layer protocols and guided on the protocols developed

CO 3: Demonstrated Routing protocols for wireless network

CO 4: Guided through in the study of Transport layer and security aspects of AWN

CO 5: QoS of Adhoc wireless Network are analyzed.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Adhoc Wireless & Sensor Network maps majorly to A, B, D program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S
CO2 S M

CO3 S S M

CO4 S M

CO5 S S M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Service Oriented Computing Course Code: 10CSE757
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48hrs Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Prerequisites:
 Student should have knowledge of Client- Server Computing.
 Student should have basic knowledge on Distributed Systems and XML

Course Content:

UNIT – I 10 Hrs
Introduction To SOA, Evolution Of SOA: Fundamental SOA; Common Characteristics of contemporary SOA; Common tangible
benefits of SOA; An SOA timeline (from XML to Web services to SOA); The continuing evolution of SOA (Standards organizations
and Contributing vendors); The roots of SOA (comparing SOA to Past architectures).
UNIT – II 10 Hrs
Web Services And Primitive SOA: The Web services framework; Services (as Web services); Service descriptions (with WSDL);
Messaging (with SOAP).
UNIT – III 10 Hrs
Web Services And Contemporary SOA – 1: Message exchange patterns; Service activity; Coordination; Atomic Transactions;
Business activities; Orchestration; Choreography.
UNIT – IV 9 Hrs
Web Services And Contemporary SOA – 2: Addressing; Reliable messaging; Correlation; Polices; Metadata exchange; Security;
Notification and eventing.
UNIT – V 9 Hrs
Principles Of Service – Orientation: Services-orientation and the enterprise; Anatomy of a service-oriented architecture; Common
Principles of Service-orientation; How service orientation principles interrelate; Service-orientation and object-orientation; Native
Web service support for service-orientation principles.
TEXT BOOKS
1. Service-Oriented Architecture – Concepts, Technology, and Design -Thomas Erl, Pearson Education, 2005.

REFERENCE BOOKS
1. Understanding SOA with Web Services – Eric Newcomer, Greg Lomow, Pearson Education, 2005.
Course outcomes (COs)
CO Description
CO 1: SOA characteristics, standards, benefits comparisons
CO 2: Web Service framework with WSDL and SOAP.
CO 3: Message exchange patterns , automatic transactions.
CO 4: Corelation policies , metadata exchange ,security on web services and SOA.

Mapping of Course outcomes (COs) to Program outcomes (POs)


Service Oriented Computing maps majorly to A,B, C, D,F,J and K program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S S S
CO2 S S S

CO3 S S S S M

CO4 S S S S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science & Engineering Course Type: Programme Elective
Course Title: Python Programming Course Code: 10CSE758
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Prerequisites:
 Students should have some basic knowledge of object oriented programming.

Course Content:

UNIT –1 10 Hours
Introduction – program structure – output function – variables, constants, data types, type ,operators and expressions - control
structures – input function . Data structures – str, list, tuple, dict, set.
UNIT -2 10 Hours
List, dict, set and generator-comprehensions. User defined functions - variable number of arguments, default parameters, key value
pairs as arguments, Data Storage, Data formatting
UNIT -3 10 Hours
Modules, packages and programs, systems, Regular expressions, File Handling, Errors and Exception handling
UNIT -4 09 Hours
Classes , objects, inheritance, Testing and debugging, GUI Programming

UNIT -5 09 Hours
Relational databases, Web Untangled, Concurrency and Networks
Text Book:
1.Introducing Python- Modern Computing in Simple Packages – Bill Lubanovic, O‘Reilly Publication
References:
2. ―How to Think Like a Scientist –Learning with Python “,Allen Downey, Jeffrey Elkner, Chris Meyers,Green Tea Press, 2002, First
Edition.
3. Introduction to Computer Science Using Python- Charles Dierbach, Wiley Publication
Learning with Python “, Green Tea Press, 2002, First Edition.
4.. Beginning Python –From Novice to Professional, - Magnus Lie Hetland, Second Edition, APress Publication
5. Think Python-How to think loke a computer scientist, allen B. Downey, first Edition, O‘Reilly Publication
6. Python Essential Reference(4th Edition),David M. Beazley, Addison-Wesley-2009
Class Attendance: Class attendance is mandatory.
Course Outcomes
CO Description

CO 1: Students will be able to demonstrate the understanding and usage of core python
scripting elements python constructs, data structures, functions, modules, packages
and regular expressions
CO 2: Students will be able to demonstrate usage of object oriented features, file and
exception handling

CO 3: Students will be able apply the knowledge of python and use the language scripting
elements and constructs, data structures, and repository of standard library, to develop
real world applications

Mapping of Course outcomes (COs) to Program outcomes (POs)

Python Programming course maps majorly to A,B,,D,E,F and H program outcomes


Pos A B C D E F G H I J K L
Cos

CO1 S S M

CO2 M S M

CO3 S S S S M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Course Project – 20 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Open Elecctive
Course Title: Building Enterprise Applications Course Code: 10CSO761
L-T-P: 3-0-0 Credits: 3
Total Contact Hours: 36 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50

Prerequisites:

 Students should have prior knowledge of Objecrt Oriented Concepts and E-Commerce
 Students should have the understanding of how SDLC works.

Course Content:

UNIT – I 7 Hrs
Introduction and Incepting to Building Enterprise applications : Enterprise Applications, Software Engineering Methodologies, Life
Cycle of Raising Enterprise Applications, Three Key Determinants of Successful Enterprise Applications, Measuring the Success of
Enterprise Applications, Enterprise Analysis, Business Modeling,Case Study of EM Bank. Chapter 1, 2.1-2.3
UNIT – II 7 Hrs
Requirement Analysis and Architecting and Designing Enterprise Applications Case Study, Requirement Elicitation and
Analysis,Requirements Validation, Planning and Estimation, Architecture, Views and Viewpoints, Enterprise Application- An
Enterprise Architecture Perspective, Logical Architecture. Chapters 2.4- 2.6,3.1-3.3

UNIT – III 7 Hrs


Technical, Data and Infrastructure Architecture Case Study, Technical Architecture and Design, Data Architecture and Design,
Infrastructure Architecture and Design, Architecture Design and Documentation. Chapter 3.4-3.7
8 Hrs
UNIT – IV
Constructing Enterprise Applications Case Study, Construction Readiness, Introduction to Software Construction Map, Constructing
the Solution Layers, Code Review, Static Code Analysis, Build Process and Unit Testing, Dynamic Code Analysis. Chapter 4
7 Hrs
UNIT – V
Testing and Rolling Out Enterprise Applications Case Study, Testing Enterprise Applications, Enterprise Application Environments,
Integration Testing, System Testing, User Acceptance Testing, Rolling Out Enterprise Applications. Chapter 5

TEXT BOOK
1. Anubhav Pradhan, Satheesha B. Nanjappa, Senthil K.Nallasamy and Veerakumar Esakimuthu ―Raising Enterprise Applications‖.
REFERENCE BOOK
1. Inderjeet Singh, Beth Stearns, Mark Johnson the Enterprise Team ―Designing Enterprise Applications with the J2EE Platform,
Second Edition‖.
Course Outcomes
CO Description
CO 1: Understand Enterprise Applications, Methodologies, Life Cycle, Enterprise Analysis.
CO 2: understand Requirement Elicitation and Analysis, Validation, Planning and Estimation,
Architecture.
CO 3: learn Technical Architecture, Data Architecture, Infrastructure Architecture,
Architecture Design and Documentation.
CO 4: Understand Construction Readiness, Static Code Analysis, Build Process and Unit
Testing, Dynamic Code Analysis.
CO 5: Know Testing Enterprise Applications, Integration Testing, System Testing, User
Acceptance Testing.

Building Enterprise Application Course outcomes to programme outcome mapping

Building Enterprise Applications course maps majorly to B, D, J, K program outcomes


POs A B C D E F G H I J K L
COs
CO1 S S S M S
CO2 M S S

CO3 M S M S M

CO4 M M

CO5 M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Open Elective


Course Title: Neural Networks and Fuzzy Logic Course Code: 10CSO762
Systems
L-T-P: 3-0-0 Credits: 03
Total Contact Hours: 36hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:
 Students should be have knowledge of basic mathematics, probability and related computation methods.

Course Content:
UNIT – I 8 Hrs
Introduction to Neural Networks Introduction, Humans and Computers, Organization of the Brain, Biological Neuron, Biological and
Artificial Neuron Models, Characteristics of ANN, McCulloch-Pitts Model, Historical Developments, Potential Applications of ANN.
UNIT – II 7 Hrs
Essentials of Artificial Neural Networks Artificial Neuron Model, Operations of Artificial Neuron, Types of Neuron Activation
Function, ANN Architectures, Classification Taxonomy of ANN – Connectivity, Learning Strategy (Supervised, Unsupervised,
Reinforcement), Learning Rules.
UNIT – III 7 Hrs
Single Layer Feed Forward Neural Networks Introduction, Perceptron Models: Discrete, Continuous and Multi-Category, Training
Algorithms: Discrete and Continuous Perceptron Networks, Limitations of the Perceptron Model.
UNIT – IV 7 Hrs
Multilayer Feed forward Neural Networks Credit Assignment Problem, Generalized Delta Rule, Derivation of Backpropagation (BP)
Training, Summary of Backpropagation Algorithm, Kolmogorov Theorem, Learning Difficulties and Improvements.
UNIT – V 7 Hrs
Associative Memories Paradigms of Associative Memory, Pattern Mathematics, Hebbian Learning, General Concepts of Associative
Memory, Bidirectional Associative Memory (BAM) Architecture, BAM Training Algorithms: Storage and Recall Algorithm, BAM
Energy Function. Architecture of Hopfield Network: Discrete and Continuous versions, Storage and Recall Algorithm, Stability
Analysis.
TEXT BOOKS
1. S. Rajasekharan and G. A. Vijayalakshmi pai, ―Neural Networks, Fuzzy logic, Genetic algorithms: synthesis and applications‖, PHI
Publication, 2004.
2. John Yen and Reza Langan, ―Fuzzy Logic: Intelligence, Control and Information‖, Pearson Education, 2004.

REFERENCE BOOKS
1. Simon Haykin, ―Neural Networks- A comprehensive foundation‖, Pearson Education, 2001.
2. S.N.Sivanandam, S.Sumathi,S. N. Deepa ―Introduction to Neural Networks using MATLAB 6.0‖, TMH, 2006.
3. James A Freeman and Davis Skapura, Neural Networks Pearson Education, 2002.
4. Timothy J. Ross, ―Fuzzy Logic with Engineering Applications‖, McGraw-Hill Inc. 1997
Note: Teachers will provide design exercises as part of the assignment, students will have to work on them and evaluation will
be done by the teachers as a component of the CIE.
Course outcomes (COs)

CO Description

CO 1: Describe models of the brain and neuron function with mathematical methods.

CO 2: Design and develop artificial neural networks in software.


CO 3: Describe more complex neural networks and the training methods for the same.

CO 4: Compare and analyse various associative memory architectures.

Neural Networks and Fuzzy Logic Systems Mapping of COs to POs


Neural Networks and Fuzzy Logic Systems course maps majorly to A program outcomes
PO A B C D E F G H I J K L
CO
CO1 S S M

CO2 M

CO3 M S M

CO4 M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department : Computer Science and Engineering Course Type : Open Elective
Course Title: Software Project Management Course Code: 10CSO763
L-T-P: 3-0-0 Credits:04
Total Contact Hours: 36Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of C or C++ language
 Students should know the usage of summation formulae, recurrences in maths

Course Content:
UNIT - I 8 Hrs
Conventional Software Management: The waterfall model, conventional software Management performance. Evolution of Software
Economics : Software Economics, pragmatic software cost estimation. Improving Software Economics : Reducing Software product
size, improving software processes, improving team effectiveness, improving automation, Achieving required quality, peer
inspections.

UNIT – II 7 Hrs
The old way and the new : The principles of conventional software engineering, principles of modern software management,
transitioning to an iterative process. Life cycle phases: Engineering and production stages, inception, Elaboration, construction,
transition phases.

UNIT-III 7 Hrs
Artifacts of the process: The artifact sets, Management artifacts, Engineering artifacts, programmatic artifacts. Model based software
architectures : A Management perspective and technical perspective.

UNIT – IV 7 Hrs
Flows of the process: Software process workflows, Inter trans workflows.Checkpoints of the Process : Major Mile Stones, Minor
Milestones, Periodic status assessments. Interactive Process Planning : Work breakdown structures, planning guidelines, cost and
schedule estimating, Interaction planning process, Pragmatic planning.

UNIT – V 7Hrs
Project Organizations and Responsibilities : Line-of-Business Organizations, Project Organizations, evolution of Organizations.
Process Automation : Automation Building Blocks, The Project Environment.

TEXT BOOK:
1. Walker Rayce : Software Project Management, Pearson Education, 2005.

REFERENCE BOOKS:
1. Richard H.Thayer : Software Engineering Project Management, IEEE Computer Society, 1997.
2. Shere K.D. : Software Engineering and Management, Prentice Hall, 1988.
Course outcomes (COs)
CO Description
CO 1: Lean Conventional Software Management and Evolution of Software Economics
CO 2: Summarize Transitioning to an iterative process and Life cycle phases:
CO 3: Understand Artifacts of the process
CO 4: Understand Software process flow, Project Organizations and Responsibilities

Mapping of Course outcomes (COs) to Program outcomes (POs)


Software Project Management course maps majorly to A,B,C program outcomes
PO A B C D E F G H I J K L
CO
CO1 S S M

CO2 S

CO3 S S M

CO4 S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Programme Elective
Course Title: Genetic Algorithms Course Code: 10CSO764
L-T-P:3-0-0 Credits: 03
Total Contact Hours: 36 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites: any programming concepts. (C/C++)

Course Content:
UNIT-I 8 Hrs
A gentle Introduction to Genetic Algorithm:What are Genetic Algorithms?, Robustness of traditional optimization and search
methods, The goals of optimization, how are genetic algorithms different from traditional methods?, A simple genetic algorithm,
Genetic algorithms at work-a simulation by hand, grist for the search-important similarities, similarity templates (schemata), learning
the lingo.

UNIT-II 7 hrs
Genetic algorithms revisited: Mathematical foundations:who shall live and who shall die? The fundamental Theorem.Schema
processing at work: An example by hand revisited. How many schemata are processed usefully? The building block hypothesis, The
minimal deceptive problem, schemata revisited: similarity templates as Hyperplanes.

UNIT-III 7Hrs
Genetic Modeling:Encoding, Fitness Function, Reproduction Techniques, Inheritance operators, crossover, mutation operator, bit-wise
operators, bit-wise operators used in GA, generational cycle, convergence of Genetic algorithm.

UNIT-IV 7 Hrs
Computer Implementation of a Genetic Algorithm: Data Structures, Reproduction, Crossover, Mutation, A time to reproduce, a time
to cross, get with the main program, How well does it work?, mapping objective functions to fitness form, fitness scaling, coding a
multi parameter, mapped, fixed point coding, discretization, constraints.

UNIT-V 7 Hrs
Advanced operators and techniques in Genetic search: Dominance, Diploidy and abeyance, Inversion and other reordering operators,
other micro operators, niche and speciation, multiobjective optimization, knowledge based techniques, genetic algorithms and parallel
processors.
TEXT BOOKS:
1. David-E-Golberg- ‘Genetic algorithms in search- optimization and machine learning‘-
Addision-Wesley-1999
2. S-Rajasekaran and G-A Vijayalakshmi Pai-‘Neural Networks- Fuzzy logic and
Genetic Algorithms- Synthesis and Applications‘- Prentice Hall of India- New Delhi-2003
Assessment Method (50 Marks)
 Midterm Test (2 Tests) – 30 Marks
 Software Implementation of GA - 10 Marks
 IEEE / Standard Research papers Seminar - 10 Marks
Total = 50 Marks
Course outcomes (COs)

CO Description
CO 1: Understanding the fundamental concepts of Genetic Algorithms and differences
between GA and Traditional Methods
CO 2: Apply the knowledge of mathematical foundations to know how schema are processed
in GA
CO 3: Learning the various ingredients of genetic modeling

CO 4: Implementing the genetic algorithm on a computer

CO 5: Understanding the advanced operators and techniques in genetic search

Mapping of Course outcomes (COs) to Program outcomes (POs)


Genetic Algorithms course maps majorly to A,B,C program outcomes
Pos
Cos A B C D E F G H I J K L

CO1 S M

CO2 S S S
CO3 S S

CO4 S S

CO5 M M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
VIII Semester Subjects
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Parallel Programming Principles Course Code: 10CS81
L-T-P:3-0-2 Credits: 04
Total Contact Hours: 36hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of C, C++, Computer Network and Operating Systems

Course Content:
UNIT – I 7 Hrs
Introduction: Motivating Parallelism, Scope of Parallel Computing, Implicit Parallelism, Limitations of Memory System
Performance, Dichotomy of Parallel Computing Platforms, Physical Organization of Parallel Platforms, Communication Costs in
Parallel Machines.

UNIT – II 7 Hrs
Principles of Parallel Algorithm Design: Preliminaries, Decomposition Techniques, Characteristics of Tasks and Interactions,
Mapping Techniques for Load Balancing, Methods for Containing Interaction Overheads, Parallel Algorithm Models.

UNIT – III 8 Hrs


Basic Communication Operations: One-to-All Broadcast, All-to-One Reduction, All-to All Broadcast and Reduction, All-Reduce,
Scatter and Gather,

UNIT – IV 7 Hrs
Analytical Modeling: Sources of Overhead in Parallel Computing, Performance Metrics for Parallel Systems, Effect of Granularity on
Performance, Scalability of Parallel Systems. Programming Using the Message-Passing Paradigm : Principles of Message-Passing
Programming, Building Blocks, MPI, Topologies and Embedding, Overlapping Communication with Computation , collective
Communication and Computation Operations, Groups and Communicator

UNIT – V 7 Hrs
Programming Shared Address Space Platforms: Thread Basics, Why Threads, The POSIX Thread API, Creation & Termination,
Synchronization Primitives in Pthreads, Controlling Thread and Synchronization Attributes, Thread Cancellation, OpenMP
TEXT BOOKS
1. Anantha Grama, Anshul Gupta, George, Vipin, Introduction to Parallel Computing , Pearson

Note: All the Exercises are to be carried out using C or C++


1. For any task graphs given, Determine the following
a. Maximun degree of concurrency
b. Critical path length.
2. Implement the algorithm for One-to –All –Broadcast of a message X from Node 0 to d-Dimension using bitwise logical AND and Exclusive
OR operations
3. Implement the algorithm for All-to-One–Broadcast of a message X from Node 0 to d-Dimension using bitwise logical AND and Exclusive
OR operations
4. Determine the Speedup, execution time taken for Standard Depth First Search (DFS) algorithm.
5. Write a Program for Dijikstra’s Single Source Shortest Path using MPI routine

Course outcomes (COs)


CO Description

CO 1: Analyze the different parallel programming platforms, communication cost, routing


mechanism of interconnection networks, and their mapping techniques.
CO 2: Ability to different decomposition techniques, mapping techniques, parallel algorithm
models of hypercube, square mesh.
CO 3: Learn basic communication operations like One to All Broadcast and All to One
Reduction, All to All Broadcast and Reduction, All Reduce and prefix sum operations.
CO 4: Examine the performance metrics, effect of granularity, scalability cost optimization
for parallel programs
CO 5: Analyze the creation and termination of threads, synchronization methods and
cancellation
Mapping of Course outcomes (COs) to Program outcomes (POs)
Parallel Programming Principles course maps majorly to C, D, F, H, J program outcomes

A B C D E F G H I J K L
Pos/Cos
CO1 M M

CO2 S M S S

CO3 S S M

CO4 S M S

CO5 M S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Core


Course Title: Internship/ Minor Project/ Self study Course Course Code: 10CSP83
L-T-P: 0-0-8 Credits: 02
SEE Marks: 50 CIE Marks: 50
Department: Computer Science and Engineering Course Type: Programme Core
Course Title: Project Course Code: 10CSP84
L-T-P: 0-0-4 Credits: 13
Total Contact Hours: 48 hrs Duration of SEE: 3Hrs.
SEE Marks:100 CIE Marks: 50+50
Prerequisites:
 Students should have basic programming experience
 Students should have been in a position to understand design and development of experimental procedures
 Students should be reasonably capable of understanding and analyzing technical documents
Course Outcomes:
1. Ability to present technical papers

2. Ability to learn and implement new concepts in multidisciplinary area.

Assessment: Review of the oral presentation, report document, demonstration of the working model, by the internal examiners
COURSE OUTCOME TO PROGRAMME OUTCOME MAPPING
PO A B C D E F G H I J K L

CO1 S
CO2 M S M S S S S S M S

Course content
The topic will be selected in consultation with a Guide.
Study, implementation and presentation should be done by project team.

Rubrics:
Performance Indicators Low Medium High
Literature Survey and Literature Survey not Incomplete literature Extensive literature
Problem Definition pertaining to the title survey and improper survey with clear state
of the project. problem definition of the art problem
definition
Creativity Is unable to predict or Approximately Can predict and
defend problem predicts and defends defend problem
outcomes problem outcomes outcomes
Effective Formulation of Has no coherent Has some strategies Formulates strategies
strategies strategies for problem for problem-solving, for solving problems
solving but does not apply
them consistently
Verification/Visualization No attempt at The solution is The solution is correct
of the results checking the correct, but not and visualized in an
obviously incorrect visualized efficient way
solution. Improper inefficiently
visualization of the
results
Presentation/ and Disorganized and Organized, but Effective organized
communication ineffective ineffective presentation
presentation presentation

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Computer and Cyber Security Course Code: 10CSE821
L-T-P 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50

Prerequisites:

 Internetworking with TCP/IP


 Cryptography and Network Security
 Information Security

Course Content:
UNIT – I 10 Hrs
Facing the cybercrime problems head-on: Introduction, defining cybercrime, categorizing cybercrime, reasons for cybercrime.
Understanding the people on the scene: Introduction, Understanding cyber criminals, understanding cyber victims, understanding
cyber investigators.

UNIT – II 10 Hrs
The Computer Investigation process: Introduction, defining computer/cyber crime, investigating computer crime, investigating
company policy violations, conducting a computer forensic investigation.
UNIT – III 10 Hrs
Acquiring data, duplicating data and recovering deleted files: Introduction, recovering deleted files and deleted partitions, data
acquisition and duplication.
UNIT – IV 9 Hrs
Understanind E-mail and Internet crimes: Introdsuction, undersanding E-mail and E-mail forensics, tracing a Domain Name or IP
addresses,
Understanding Network Intrusion and attacks: Introduction, understanding network intrusion and attacks, recognizing
preintrusion/attack activites, understainding technical exploits, attacking with Trojans, viruses and worms.

UNIT – V 9 Hrs
Collecting and preserving digital Evidence: Introduction, understanding the role of evidence in a criminal case, collecting digital
evidence, preserving digital evidence, recovering digital evidence, documenting evidence, computer forensic resources, understanding
legal issues.
TEXT BOOKS:
1. Scene of the cybercrime, Debra Little John Shinder and Michael Cross, 2nd edition, Syngress publishing Inc, Elsevier Inc, 2008

REFERENCE BOOKS:
1. Computer Forensics, Kruse and Henser, Addision Wesley, ISBN: 0201707195
2. Digital Evidence and computer crime, 2nd edition, Casey, ISBN: 0121631044
3. A guide to Computer Forensics and Investigation: Nelson, Phillips, Enfinger and Stuart, Thomson publisher, Boston.

Course outcomes (COs)


CO Description

CO 1: Understanding various actors in Cyber Crime

CO 2: Investigating Computer/Cyber Crime/Computer Forensic

CO 3: Acquiring, duplicating and recovering files

CO 4: Understanding e-mail and Internet crimes

CO 5: Analyzing various ways of network intrusion and attacks

Mapping of Course outcomes (COs) to Program outcomes (POs)


Computer and Cyber Security course maps majorly to B, C,D program outcomes
Pos L
Cos A B C D E F G H I J K

CO1 S

CO2 S S

CO3 S S

CO4 M

CO5 M
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department: Computer Science and Engineering Course Type: Open Elective
Course Title: Advanced Image And Video Processing Course Code: 10CSE822
L-T-P: 4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of basic of image processing


 Students should have knowledge of coding.

Course Content:

UNIT – I 8 Hrs
* Understanding Few Terms
Computer Graphics and Image Processing; Medical and Satellite Image Processing, Image Processing for Defence Application, Image
Exploitation, Imagery Intelligence; Pyramids in Image Processing: Gaussian, Laplacian, Ratio Pyramids, Application of Image
Pyramids.

UNIT – II 10 Hrs
*Textures and Its Applications
Fundamental Concepts of Texture, Texture Primitives, Structural Models of Texel Placement, Grammatical Models, Shape, Tree and
Array grammars; Texture Feature Extraction Methods, Grey Level co-occurrence Matrix Method, Tamura Texture Features, Texture
Spectrum, Run Length Method, Statistical method, Law‘s Method; Application areas: Texture based Image Classification, Target
Identification using Texture.

UNIT – III 10 Hrs


* Image Fusion and Application Areas
Introduction; Basic Understanding of Image Fusion; Levels of Fusion – Low Level, Intermediate Level and High Level Fusion; Pixel
and Window level Fusion Methods; Image Pyramids, Texture based Fusion using Pyramid and Non Pyramid; Wavelet Based Fusion;
Quality Metric
for Image Fusion; Applications of Image Fusion in Medical and Aerial Image Fusion..
UNIT – IV 10 Hrs
* Video Processing - 1
Video Basics, Picture Basics, Resolution: Visual versus Format, Formats and Interfaces; Video Editing, Types of Video Editing,
Linear and Non -Linear Editing, Video Capture Board, Video Editing Appliance; Video Encoding,
10 Hrs
UNIT – V
* Video Processing - 2
Video Shot Detection, Importance and Applications, Classification of Shot Transitions, Techniques of Video Shot Detection, Adaptive
Thresholding, Performance Evaluation; Video Summarization, Manual and Automatic Methods, Process of Video Summarization,
Application Areas.

TEXT BOOK
1. Rafel C Gonzalez and Richard E Woods, ―Digital Image Processing‘‘, Pearson Education, 3rd Edition, 2009.
2. B. Chanda, D Dutta Majumder, ―Digital Image Processing and Analysis‘‘, Prentice-Hall, India, 2002

REFERENCE BOOKS
1. Research Papers
2. Notes to be provided by the Lecturer
Course outcomes (COs)

CO Description

CO 1: Understands about high level image processing techniques.

CO 2: Identify the texture of an image based on its feature and its application area.

CO 3: Perform image fusion based on selected criteria (or same feature of the selected input
images).
CO 4: Read and display the video.

CO 5: Implement algorithms using videos.


Mapping of Course outcomes (COs) to Program outcomes (POs)
Advanced Image And Video Processing -course maps majorly to C,D,E program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M
CO2 M
CO3 S S
CO4
S S
CO5
S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Open Elective


Course Title: Embedded Networking and Security Course Code: 10CSE823
L-T-P: 4-0-0 Credits: 4
Total Contact Hours: 48 Duration of SEE: 3 hrs
SEE Marks:50 CIE Marks: 50
Prerequisites:
Should have knowledge about embedded systems and computer networks

Course content:
UNIT – I 10 Hrs
Introduction: Introduction to embedded networking, Socket programming, TCP, DHCP, UDP, Real time transport. protocol, Basic
working of the protocols in the system, case studies

UNIT – II 10 Hrs
Real time protocols: Programming with UDP, Real time transport protocol (RTP), Implementation and case studies

UNIT – III 9 Hrs


Application layer protocols: SPI, I2C (InterIC bus) ; working, design and implementation; case studies

UNIT – IV 9 Hrs
Special protocols: Controller Area networks CAN; Local Interconnect Network (LIN); Universal Serial Bus (USB)

UNIT – V 10Hrs
Embedded Network security: Introduction to Embedded Security; Software security issues in embedded systems; Specialized
components for authentication, key storage and key generation, Internet security for embedded systems; IPSEC; Trust models for
secure embedded hardware and software

TEXT BOOK:
1. Embedded Systems: Architecture, Programming & Design, Raj Kamal, TMH, 2008
Additional materials – online materials and manuals

REFERENCES:
Olaf Pfeiffer, Andrew Ayre and Christian Keydel, ―Embedded Networking with CAN and CANopen‖, RTC Books, 2003
Research papers and Internet links for IPSEC, Embedded System Security topics.
http://palms.ee.princeton.edu/PALMSopen/dissertations/Nachiketh_Potlapally_phdthesis.pdf
http://www.unixwiz.net/techtips/iguide-ipsec.html
Cryptography and Network Security: William Stallings, Pearson Education, 2003
Network Security Essentials-Applications and Standards, 3rd edition, William Stallings, Pearson Education, 2007

Course outcomes (COs)


CO Description

CO 1: Explain networking of embedded systems


CO 2: Design and implement transport layer real time network protocols and application layer
real time network protocols
CO 3: Design and implement special protocols such as USB, CAN and LIN
CO 4: Analyse and design security modules and related protocols for embedded system
networks
Mapping of Course outcomes (COs) to Program outcomes (POs)
Embedded Networking and Security course maps majorly to B & C program outcome
Pos A B C D E F G H I J K L
Cos

CO1 S S

CO2 S S

CO3 S S

CO4 M S S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Distributed Systems and Transaction Course Code: 10CSE824
Processing
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:
 Students should have knowledge of operating system, analysis and design of algorithms
 Students should g have knowledge of database management systems

Course content:

UNIT – I 10 Hrs
Functions of an operating system, Design approaches, Issues in distributed operating systems, Message passing model and remote
procedure calls.
Lamport‘s logical clocks, vector clocks, Causal ordering of messages, Global state, Termination Detection, Distributed Mutual
Exclusion, Non-Token-based Algorithms, Lamport‘s Algorithm, The Ricart-Agrawala Algorithm, Maekawa‘s algorithm
UNIT – II 10 Hrs
Token-based Algorithms, Suzuki-Kasami‘s Broadcast Algorithm, and Raymond‘s Tree-Based Algorithm.Deadlock Handling
Strategies in Distributed systems, Issues in Deadlock Detection and Resolution, Control Organizations for Distributed Deadlock
Detection, Centralized Deadlock Detection Algorithms, HO Ramamurthy Algorithms,
UNIT – III 10 Hrs
Distributed-Deadlock Detection Algorithms, A Path Pushing Algorithm, an Edge-Chasing Algorithm, Hierarchical Deadlock
Detection Algorithms. A Classification of Agreement Problems, Solutions to the Byzantine Agreement Problems, Applications of
Agreement Algorithms. Components of a Load Distributing Algorithm, Stability, Load Distributing Algorithms.
UNIT – IV 9 Hrs
Atomic Actions and Committing, Commit Protocols, Non-Blocking Commit Protocols, Voting Protocols, Dynamic Voting Protocols
and The Majority Based Dynamic Voting Protocols.
UNIT – V 9 Hrs
Requirement of a Database Operating System, Database Systems, A Concurrency Control Model of Database Systems, The Problem
of Concurrency Control, Serializability Theory, Distributed Databases. Lock-Based Algorithms, Timestamp Based Algorithms,
Optimistic Algorithms, Concurrency Control Algorithms: Data Replication
TEXT BOOK
1. Advanced Concepts in Operating Systems: Mukesh Shingal and Niranjan G. Shivaratri. Tata McGraw-Hill 1997
REFERENCE BOOKS
1. Concurrency Control and Recovery in Database Systems: Bernstein P.A.Hazallacos and Goodmani M. Addison Wesley Co 1987.
2. Distributed Database: Ceri S. and Pelagatti S. McGraw-Hill 1984
Course outcomes (COs)

CO Description

CO 1: Analyze the tradeoffs inherent of modern operating systems and design of distributed
mutual exclusion
CO 2: Describe how computing resources are used by application software and managed by
system software and various deadlock handling strategies
CO 3: Analyse different Agreement protocols and commit protocols
CO 4: Analyse various load distributing algorithms
CO 5: Analyse database operating system design and related algorithms
Mapping of Course outcomes (COs) to Program outcomes (POs)
Distributed systems and Transaction Processing course maps majorly to B, C program
outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S

CO2 S

CO3 M S

CO4 M M S

CO5 S

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Department: Computer Science and Engineering Course Type: Programme Elective


Course Title: Storage Area Networks Course Code: 10CSE825
L-T-P:4-0-0 Credits: 04
Total Contact Hours: 48 hrs Duration of SEE: 3 hrs
SEE Marks: 50 CIE Marks: 50
Prerequisites:

 Students should have knowledge of DBMS and Computer Network


Course Content:

UNIT – I 10 Hrs
INTRODUCTION: Server Centric IT Architecture and its Limitations; Storage - Centric IT Architecture and its advantages; Case
study: Replacing a server with Storage Networks; The Data Storage and Data Access problem; The Battle for size and access.
INTELLIGENT DISK SUBSYSTEMS - 1: Architecture of Intelligent Disk Subsystems;
UNIT – II 10 Hrs
Hard disks and Internal VO Channels, JBOD, Storage virtualization using RAID and different RAID levels; INTELLIGENT DISK
SUBSYSTEMS - 1, I/O TECHNIQUES - 1: Caching: Acceleration of Hard Disk Access; Intelligent disk subsystems; A vailability of
disk subsystems. The Physical VO path from the CPU to the Storage System; SCSI.
UNIT – III 9 Hrs
I/O TECHNIQUES - 2, NETWORK ATTACHED STORAGE: Fibre Channel Protocol Stack; Fibre Channel SAN; IP Storage. The
NAS Architecture The NAS hardware Architecture, The NAS Software Architecture, Netwotk connectivity, NAS as a storage system.
UNIT – IV 10 Hrs
FILE SYSTEM AND NAS: Local File Systems; Network file Systems and file servers; Shared Disk file systems; Comparison of fibre
Channel and NAS.
UNIT – V 9 Hrs
STORAGE VIRTUALIZA TION: Definition of Storage virtualization; Implementation Considerations; Storage virtualization on
Block or file level; Storage virtualization on various levels of the storage Network; Symmetric and Asymmetric storage virtualization
in the Network.
TEXT BOOKS
1. Storage Networks Explained - Ulf Troppens, Rainer Erkcns and Wolfgang Muller, John Wiley & Sons, 2003.
2. Storage Networks: The Complete Reference - Robert Spalding, Tata McGraw Hill, 2003.
Course outcomes (COs)

CO Description

CO 1: Examine the purpose of Server Centric & Storage Centric and also the Data Storage,
Size and Access Problem
CO 2: Understand what Intelligent Disk Subsystems,JBOD,Storage Virtualization using
RAID & RAID Levels
CO 3: Describe the Working of NAS.
CO 4: Analyze between File System and Network Attached Storage Systems
CO 5: Understand the working of Storage Virtualization on Various levels of Storage
Network
Mapping of Course outcomes (COs) to Program outcomes (POs)
Storage Area Network course maps majorly to B, I, J, K program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 M M

CO2 S S S

CO3 S M

CO4 S S

CO5 M S S
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks
Department : Computer Science and Engineering Course Type : Progamme Elective
Course Title: C# and .NET Course Code: 10CSE826
L-T-P: 4-0-0 Credits:04
Total Contact Hours: 48Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50

Course Description: This course is intended to provide students with the skills required to create Windows Forms applications in C# by using
the .NET Framework. The course will cover the major topics for Windows client application programming on the .NET Framework.

Course content:
Unit – I 10Hours

Introduction to .Net & C# Language Fundamentals: Microsoft‘s .Net, .Net Framework, C#, Simple Application in C#, Literals,
Variables and Data Types, Formatting Text, Console.write, Console.writeline, Operators and Expressions, decision making &
Branching, Strings, Control Statements, Arrays, Structures and Enumerations

Unit – II 10Hours
Object Oriented Programming with C#: Base classes and derived classes, Inheritance, Polymorphism, operator overloading, Interfaces, and
examples, Delegates and Exceptions handling.

Unit – III 10Hours


Graphical User Interface with Windows Forms: Windows forms, event handling, Control properties and layout, labels, textboxes,
buttons, checkbuttons, radiobuttons, picture boxes, mouse event handling, Keyboard event handling, examples.

Unit – IV 8Hours

Menus, Monthcalendar control, Datetimepicker control, linklabel, listbox, Combox, Checkedlistbox, Treview, listview and Tabcontrol
control, Multiple Document Interface (MDI), examples.

Unit – V 10Hours
Data access with ADO.NET: Introduction, LINQ to Entities and the ADO.NET Entity Framework , Querying a Database with LINQ
, Creating the ADO.NET Entity Data Model Class Library, Creating a Windows Forms Project and Configuring It to Use the Entity
Data Model, Data Bindings Between Controls and the Entity Data Model, Dynamically Binding Query Results, Creating the
Display Query Results GUI,Coding the Display Query Results App, Retrieving Data from Multiple Tables with LINQ, Creating a
Master/Detail View App and Creating the Master/Detail GUI.

TEXT BOOKS:
1. P. Deitel, H. Deitel, Visual C# 2012 How to Program, 5/e, Pearson, 2012
2. E. Balagurusamy: Programming in C#, 2nd Edition, TataMcGraw Hill, 2008.
3. Herbert Schildt: C# The Complete Reference, Tata McGraw Hill, 2004.

Course outcomes (COs)


At the completion of this course, the student will be able to:
Cos Description
CO 1: Understand the fundamentals of C# and .Net framework.

CO 2: Understand object inheritance and its use in C#.

CO 3: Develop the Windows Forms and apply user controls in Windows Forms applications.

Design menus in a Windows Forms application and create Multiple Document Interface (MDI)
CO 4:
applications.
CO 5: Bind Windows Forms applications to various data sources by using Microsoft ADO.NET.

Mapping of Course outcomes (COs) to Program outcomes (POs)


C# and .Net course maps majorly to A,B,C,D program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S S
CO2 S S
CO3 S M
CO4 S S M
CO5 S S M

Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Course Project – 10 Marks
 Assignment Test- 10 Marks
-----------------------
Total = 50 Marks

Course Project: Each student will form a group with 1, but no more than 2, other classmates. Each group will create a different C#
Windows application to be completed at the end of the Semester. Specific details on the deliverable will be explained during the term.

Department : Computer Science and Engineering Course Type : Progamme Elective


Course Title: Mobile Application Development using Course Code: 10CSE827
Android
L-T-P: 4-0-0 Credits:04
Total Contact Hours: 48Hrs Duration of SEE : 3 hrs
SEE Marks: 50 CIE Marks: 50

Course content:

Unit – I 10H

Getting started with Mobility: Architecture of Android, Mobility landscape, Mobile platforms, Mobile apps development, Overview
of Android platform, setting up the mobile app development environment along with an emulator, a case study on Mobile app
development
Unit – II 10H

App user interface designing – mobile UI resources (Layout, UI elements, Draw-able, Menu), Activity- states and life cycle,
interaction amongst activities.
App functionality beyond user interface - Threads, Async task, Services – states and life cycle
Unit – III 10H

App functionality beyond user interface - Notifications, Broadcast receivers, Telephony and SMS APIs
Native data handling – on-device file I/O, shared preferences, mobile databases such as SQLite, and enterprise data access (via
Internet/Intranet)

Unit – IV 10H

Sprucing up mobile apps: Graphics and animation – custom views, canvas, animation APIs, multimedia – audio playback and
record, location awareness, and native hardware access (sensors such as accelerometer and gyroscope)
Unit – V 8H

Taking apps to Market: Versioning, signing and packaging mobile apps, distributing apps on mobile market place

TEXT BOOKS:
1. “Beginning Android Application development”, Wei-Meng Lee, Wiley Publishing,

REFERENCE BOOKS:
1. Android 4.2 App Development Essentials, by Neil Smyth - Techotopia , 2013
2. The Busy Coder's Guide to Android Development, by Mark L. Murphy - CommonsWare , 2009
Course outcomes (COs)
Cos Description
CO 1: Students will able to Appreciate the Mobility landscape
Students will able to design and develop mobile apps, using Android as development
CO 2:
platform, with key focus on user experience design,
Students will able to deal with native data handling and background tasks and
CO 3:
notifications.
Students will able to Appreciation of nuances such as native hardware play, location
CO 4:
awareness, graphics, and multimedia.
CO 5: Students will able to Perform testing, signing, packaging and distribution of mobile apps
Mapping of Course outcomes (COs) to Program outcomes (POs)
C# and .Net course maps majorly to A,B,C,D program outcomes
Pos A B C D E F G H I J K L
Cos

CO1 S
CO2 S S M M
CO3 S S
CO4 S
CO5 S S
Assessment Method
 Midterm Test (Avg. of 2 Tests) – 30 Marks
 Surprise Test – 10 Marks
 Lab Test - 10 Marks
-----------------------
Total = 50 Marks

Vous aimerez peut-être aussi