Scheme and Syllabus of
B.E. (Computer Science and Engineering)
3

rd

th

TO 8 Semester 2014-2015

University Institute of Engineering and
Technology,
Panjab University, Chandigarh

DEPARTMENT: COMPUTER SCIENCE AND ENGINEERING
VISION:
To be recognized as an international leader in Computer Science and Engineering education and research to benefit society globally.
MISSION:
·
·
·
·

To move forward as frontiers of human knowledge to enrich the citizen, the nation, and the world.
To excel in research and innovation that discovers new knowledge and enables new technologies and systems.
To develop technocrats, entrepreneurs, and business leaders of future who will strive to improve the quality of human life.
To create world class computing infrastructure for the enhancement of technical knowledge in field of Computer
Science and Engineering.

PROGRAMME: B.E. CSE (UG PROGRAMME)
PROGRAMME EDUCATIONAL OBJECTIVES:
I. Graduates will work as software professional in industry of repute.
II. Graduates will pursue higher studies and research in engineering and management disciplines.
III. Graduates will work as entrepreneurs by establishing startups to take up projects for societal and environmental cause. PROGRAMME OUTCOMES:
A. Ability to effectively apply knowledge of computing, applied sciences and mathematics to computer science & engineering problems.
B. Identify, formulate, research literature, and analyze complex computer science & engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
C. Design solutions for computer science & engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations.
D. Conduct investigations of complex problems using research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions.
E. Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to different computer science & Engineering activities with an understanding of the limitations.
F. Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal, and cultural issues and the consequent responsibilities relevant to the professional engineering practice.
G. Understand the impact of the professional engineering solutions in societal and environmental contexts and demonstrate the knowledge of and need for the sustainable development.
H. Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.
I. Ability to function effectively as a member of a team assembled to undertake a common goal in multidisciplinary settings. J. Ability to communicate effectively to both technical and non-technical audiences.
K. Demonstrate knowledge and understanding of the engineering and management principles and apply these to one s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
L. Recognition of the need for and the ability to engage in life-long learning. The ability to successfully pursue professional development.
EXAMINATION NOTE:
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.

2.0
Credit System :
2.1 All B.E / integrated B.E-M.B.A programmes are organised around semester-based credit system of study. The credit system is based on continuous evaluation of a student s performance/progress and includes flexibility to allow a student to progress at an optimum pace suited to his/her ability or convenience, subject to fulfilling minimum requirements for continuation. 2.2 Performance/progress of a student is measured by the number of credits that he/she has earned (completed satisfactorily). Based on the course credits and grades obtained by the student, grade point average is calculated. A minimum grade point average is required to be maintained for satisfactory progress and continuation in the programme. Also a minimum number of earned credits and a minimum grade point average should be acquired in order to qualify for the degree.
2.3
Course Credit Assignment:
Each course has a certain number of credits assigned to it depending on the associated number of lecture, tutorials and laboratory contact hours in a week. A few courses are without credit and are referred to as non-credit (NC) courses.
Lectures and Tutorials: One lecture hour or one tutorial hour per week per semester is assigned one credit.
Practical / Laboratory Work: One laboratory hour per week per semester is assigned half credit.
The credits are rounded off to the nearest whole number
For each lecture or tutorial the self study component is 1 hour/week. 2.4
Earning Credits :
At the end of every course, a letter grade is awarded in each course for which a student had registered. On obtaining a pass grade (at least D grade), the student accumulates the course credits as earned credits. Performance of a student is measured by the number of credits that he/she has earned and by the weighted grade point average. A student has the option of auditing some courses. Grades obtained in these audit courses are not counted towards the calculation of grade point average.
However, a pass grade ( D grade) is essential for earning credits from an audit course.
3.0 Grading System :
3.1 Relative standing of the student in the class shall be clearly indicated by his/her grades. The process of awarding grades shall be based upon fitting performance of the class to a defined statistical model.
3.2 The grades and their respective description , along with grade points are listed in the table given below in Table-1
Table-1
Grade
Grade Point
Description
A+
10
Outstanding
A
9
Excellent
B+
8
Very Good
B
7
Good
C+
6
Average

2.0
Credit System :
2.1 All B.E / integrated B.E-M.B.A programmes are organised around semester-based credit system of study. The credit system is based on continuous evaluation of a student s performance/progress and includes flexibility to allow a student to progress at an optimum pace suited to his/her ability or convenience, subject to fulfilling minimum requirements for continuation.
2.2 Performance/progress of a student is measured by the number of credits that he/she has earned (completed satisfactorily). Based on the course credits and grades obtained by the student, grade point average is calculated, subject to his qualification of minimum grade in each subject.

2.3Course Credit Assignment:
Each course has a certain number of credits assigned to it depending on the associated number of lecture, tutorials and laboratory contact hours in a week. A few courses are without credit and are referred to as non-credit (NC) courses.
Lectures and Tutorials: One lecture hour or one tutorial hour per week per semester is assigned one credit.
Practical / Laboratory Work: One laboratory hour per week per semester is assigned half credit.
The credits are rounded off to the nearest whole number.
For each lecture or tutorial the self study component is 1 hour/week

2.4
Earning Credits :
At the end of every course, a letter grade is awarded in each course for which a student had registered. On obtaining a pass grade (at least D grade), the student accumulates the course credits as earned credits. Performance of a student is measured by the number of credits that he/she has earned and by the weighted grade point average. Grades obtained in audit courses are not counted towards the calculation of grade point average. However, a pass grade ( D grade) is essential for earning credits from an audit course.
3.0
Grading System :
3.1
The grades and their respective description , along with grade points are listed in the table given below in Table-1

Grade
A+
A
B+
B
C+
C
D
F
I
NP

Table-1
Grade Point
10
9
8
7
6
5
4
0
-

Description
Outstanding
Excellent
Very Good
Good
Average
Below average
Marginal
Very Poor
Incomplete
Audit Pass

C
D
E
F
I
NP
NF
W
X
S

5
4
2
0
-

Below average
Marginal
Poor
Very Poor
Incomplete
Audit Pass
Audit Fail
Withdrawal
Unsatisfactory
Satisfactory
Completion
Course continuation

Z
4.0 Evaluation System:
4.1 Continuous Assessment :
There shall be continuous evaluation of the student during the semester. For evaluation purpose, total marks assigned to each subject shall be distributed as :
Two Mid semester Examination (Minor-1 and Minor-2) with 30
% of total marks assigned to the subject.

Assignments/Class projects/ short class tests/MCQ based quizzes/projects/presentations/group discussions with 20 % of total marks assigned to the subject.
One End Semester Examination (Major Examination) with 50 % of total marks assigned to the subject.
Total score on a scale of 100 i.e. in % obtained by a student in a subject shall be hence forth referred as raw score in that subject.
Following the concept of relative grading, before assigning the letter grades, scientific normalization method shall be used to standardize the raw score.
4.2 Statistical Method for the Award of Grades:
For the award of grades in a course, all component wise evaluation shall be done in terms of marks. The components include: Midterm-1 and Midterm-2 examinations, Assignments/projects/class presentations/Attendance, and End semester examination as per regulation 4.1. After converting the marks obtained in percentage , the grades will be assigned as per the guidelines given below :
4.2.1
For less than 15 students in a course, the grades shall be awarded on the basis of cutoff in the absolute marks as shown in
Table-2.
Table-2
Absolute
Grade
Absolute marks in % marks in
%
91
< A+ <
100
82
< A <
90
73
< B+ <
81
64
< B <
72
55
< C+ <
63
46
< C <
54
40
< D <
45
35
< E <
39
F <
35
4.2.2
For more than 30 students in a course, the statistical method shall be used for the award of grades. After expressing

NF
W
X
S

-

Audit Fail
Withdrawal
Unsatisfactory
Satisfactory
Completion

4.0 Evaluation System:
4.1 Continuous Assessment :
There shall be continuous evaluation of the student during the semester. For evaluation purpose, total marks assigned to each subject shall be distributed as :
Two Mid semester Examination (Minor-1 and Minor-2) with 30 % of total marks assigned to the subject. Best Marks of one of these two will be considered for award of sessional.
Assignments/Class projects/ short class tests/MCQ based quizzes/projects/presentations/group discussions/ Attendance with
20 % of total marks assigned to the subject.
One End Semester Examination (Major Examination) with 50 % of total marks assigned to the subject. It is compulsory to appear in
End Semester Examination and secure at least 20% marks of total
End semester exam marks.
If a candidate secures less than 20% marks of total End semester exam marks, he/she will be awarded F grade.
4.2 Method for the Award of Grades:
For the award of grades in a course, all component wise evaluation shall be done in terms of marks. The components include: Midterm1 and Midterm-2 examinations, Assignments/projects/class presentations/Attendance, and End semester examination as per regulation 4.1. After converting the marks obtained in percentage , the grades will be assigned as per the guidelines given below :

Sr. No.
1.
2.
3.
4.
5.
6.
7.
8.

Table-2
Marks
90
80 & < 90
70 & < 80
60 & < 70
50 & < 60
45 & < 50
40 & < 45
<40

Grade
A+
A
B+
B
C+
C
D
F

Grade Point
10
9
8
7
6
5
4
0

4.2.2 NOT
REQUIRED

the score obtained by the students in a course in percentage (X), the class mean ( ) and class standard deviation ( S) of the marks shall be calculated and grades shall be awarded to a student as shown in Table-3
If X is the raw score in % ; is class mean in % and
S is class standard deviation in % (based on raw score) ,
N is the number of students in a course , then for the course :

4.2.3 NOT REQUIRED

Lower Range of
Marks(%)

Table-3
Grade Assigned

4.3 NOT REQUIRED
Upper Range of Marks (%)

A+
A <
B+ <
B <
C+ <
C <
D <
<

E <
F <

4.2.3
In case, class student strength in a course lies between
15 and 30, any of the above methods (given in 4.2.1 and 4.2.2) may be used for the award of grades.
4.3 Finalization of Grades:
Finalization of the grades shall be done by the Board of Control of the department/ institute or appropriate body/committee approved by the university for the purpose.
In order to maintain a normal distribution in grades, following recommendations of UGC shall be kept in view and considered as broad guidelines by the Board of Control of the department/ institute or appropriate body/committee approved by the university for the purpose.

Grade
A

% of Population
7

Remarks
Includes A+ and A

5.0
Evaluation of Performance :
5.1
The performance of a student shall be evaluated in terms of two indices, viz. Semester Grade Point Average (SGPA) and
Cumulative Grade Point Average (CGPA).
SGPA is the grade point average for the semester, and CGPA is the cumulative grade point average for all the completed semesters at any point in time.
The earned credits (E.C) are defined as the sum of course credits for course in which A+ to D grade has been obtained. For U.G students
(B.E), credits from courses in which NP or S grade has been obtained are also added.

B
24
Includes B+ and B
C
38
Includes C+ and C
D
24
F
7
*
Note: In case Board of Control of the department/ institute or appropriate body/committee approved by the university for the purpose, is convinced on broad variations in grade distribution in a class for a particular subject, B.O.C may make some minor variations in while maintaining the grade distribution as recommended by the UGC.
5.0
Evaluation of Performance :
5.1
The performance of a student shall be evaluated in terms of two indices, viz. Semester Grade Point Average (SGPA) and
Cumulative Grade Point Average (CGPA).
SGPA is the grade point average for the semester, and CGPA is the cumulative grade point average for all the completed semesters at any point in time.
The earned credits (E.C) are defined as the sum of course credits for course in which A+ to D grade has been obtained. For U.G students (B.E) , credits from courses in which NP or S grade has been obtained are also added.
Points earned in a semester =

The SGPA is calculated on the basis of grades obtained in all courses, except audit courses and courses in which S/Z grade is awarded, registered for the particular semester.

å(

)

Course Credits ´ Grade Po int s

for all coursesexcept audit and

Points earned in a semester =

The SGPA is calculated on the basis of grades obtained in all courses, except audit courses and courses in which S/Z grade is awarded, registered for the particular semester.

å(
SGPA

SGPA =

å(

Course Credits

)

except audit and S / Z grade Courses

Semester

The CGPA is calculated on the basis of all pass grades, except audit courses and courses in which S/Z grade is awarded, obtained in all completed semesters.

for all courses except audit and S / Z

=

å(

Course Credits

)

except audit and S / Z grade Courses

Semester

The CGPA is calculated as given below :

å(

CourseCredits´Grade Po int s

)

for all courses with pass grade except audit

All Semester

CGPA =

å(
All Semester

Semester

)

Course Credits ´ Grade Po int s

Semester

CourseCreditsearned

)

except audit and S / Z grade Courses

Scheme of Examination of B.E. in Computer Science & Engineering
Second Year - Third Semester
Sr.No

Paper
Code

Subject Title

Scheme of Teaching
L

Total

Credits
4

50

50

100

1. CSE311

Data Structures

3

1

0

Hrs s 4

2. CSE361

Data Structures (Practical)

0

0

3

3

2

-

50

50

3. CSE313

Peripheral Devices &
Interfaces
Hardware Lab (Practical)

3

1

0

4

4

50

50

100

0

0

2

2

1

-

50

50

Engineering Mathematics
III
Digital Electronics

3

1

0

4

4

50

50

100

3

1

0

4

4

50

50

100

Digital Electronics
(Practical)
Microprocessors

0

0

2

2

1

-

50

50

3

1

0

4

4

50

50

100

Microprocessors
(Practical)

0

0

2

2

1

-

50

50

15

5 09

29

25

250

450

700

Internal Total
Sessional
Marks
50
100

4. CSE363
5. AS301
6. EC316
7. EC366
8. EC317
9. EC367
Total

T P

University Internal
External
Sessional
Marks
Marks

Second Year -Fourth Semester
Sr.No Paper
Code
1. CSE411
2. CSE461
3. CSE412
4. CSE462
5. CSE414
6. CSE464
7. ASC405
8. CSE 415
Total

Subject Title

Analysis & Design of
Algorithms
Analysis & Design of
Algorithms (Practical)
Database Management
System
Database Management
System (Practical)
Object Oriented
Programming
Object Oriented
Programming
(Practical)
Cyber Law & IPR
Computer Architecture
& Organization

Scheme of Teaching
L
3

T
1

P Hrs
0 4

Credit
4

University
External
Marks
50

0

0

3 3

2

-

50

50

3

1

0 4

4

50

50

100

0

0

3 3

2

-

50

50

3

1

0 4

4

50

50

100

0

0

3 3

2

-

50

50

3

0

0 3

3

50

50

100

3

1

0 4

4

50

50

100

15

4

9 28

25

250

400

650

Scheme of Examination of B.E. in Computer Science & Engineering
Third Year - Fifth Semester
Sr.No Paper
Code

Subject Title

Scheme of Teaching
L

T

P

University Internal
External Sessional
Hrs Credit Marks
Total
Marks

1. CSE511

Operating System

3

1

0

4

4

2. CSE561

Operating System
(Practical)
Software Engineering
Software Engineering
(Practical)
Computer Network
Computer Network
(Practical)
Principle of
Programming
Languages
Discrete Structures and Computational
Logic
Industrial Training th (After 4 Sem)

0

0

3

3

2

-

3
0

1
0

0
3

4
3

4
2

-

3
0

1
0

0
3

4
3

4
2

-

3

1

0

4

3

1

0

4

3. CSE512
4. CSE562
5. CSE513
6. CSE563
7. CSE514
8. CSE517
9. CSE566
Total

15

50

100

50

50

50

50
50

100
50

50

50
50

100
50

4

50

50

100

4

-

50

50

100

50

50

2

5

9 29

28

50

250

450

700

Third Year - Sixth Semester
Sr.No Paper
Code

Subject Title

Scheme of Teaching
T P

L

Hrs

University
External
Credit Marks

Internal Total
Sessional
Marks

1. CSE611

Web Technologies

3

1

0

4

4

50

50

100

2. CSE661

Web Technologies
(Practical)
Distributed Systems
Computer Graphics

0

0

3

3

2

-

50

50

3
3

1
1

0
0

4
4

4
4

50
50

50
50

100
100

Computer Graphics
(Practical)
Artificial
Intelligence
Artificial
Intelligence
(Practical)
Modeling &
Simulation
Modeling &
Simulation
(Practical)

0

0

3

3

2

-

50

50

3

1

0

4

4

50

50

100

0

0

3

3

2

-

50

50

3

1

0

4

4

50

50

100

0

0

3

3

2

-

50

50

15

5

12 32

28

250

450

700

3. CSE612
4. CSE613
5. CSE663
6. CSE614
7. CSE664
8. CSE615
9. CSE665
Total

Scheme of Examination of B.E. in Computer Science & Engineering
Fourth Year - Seventh Semester
Sr.
No

Paper
Code

Subject Title

Scheme of Teaching

University
External
Marks

L

T

P

Hrs

Internal Total
Sessional
Marks

Credit

1. CSE711

Compiler Design

3

1

0

4

4

50

50

100

2. CSE761

Compiler Design
(Practical)

0

0

3

3

2

-

50

50

3. CSE712
4. CSE713

Multimedia System Design
Software Testing & Quality
Assurance
Software Testing & Quality
Assurance (Practical)

3
3

1
1

0
0

4
4

4
4

50
50

50
50

100
100

0

0

3

3

2

-

50

50

6.

Elective -I

3

1

0

4

4

50

50

100

7. CSE767

Project

0

0

6

6

3

-

100

100

8. CSE768

Seminar

0

0

2

2

1

-

50

50

9. CSE769

Industrial Training (After th 6 Semester)

2

-

100

100

26

200

550

750

5. CSE763

I

Total

12

Elective -I
CSE 714

Information Security

CSE 715

Business Intelligence

CSE 716

Mobile Computing

4

14 30

Fourth Year - Eighth Semester
Sr. Paper
No Code

Subject Title

Scheme of Teaching

L

1. CSE811

T

Hr

P

University

Credit External

Internal
Sessional
Marks

Total

Marks

Advanced Database
Systems
Digital
Image
Processing
Digital
Image
Processing (Practical)

3

1

0

4

4

50

50

100

3

1

0

4

4

50

50

100

0

0

3

3

2

-

50

50

4.

Elective II

3

1

0

4

4

50

50

5.

Elective II
(Practical)

0

0

3

3

2

-

50

50

6.

Elective III

3

0

0

3

3

50

50

100

7. CSE858

Project

0

0

6

6

3

-

100

100

12

3

12

27

22

200

400

600

-

-

-

-

22

200

400

600

-

-

-

-

22

200

400

600

2. CSE812

Option
1

3. CSE862

II

Total l Option
2

1. CSE860

Industrial Training

Tot al Elective II (Theory)

Elective II (Practical)

Elective III (Theory)

CSE 813

Network
Programming

CSE 863

Network
Programming
(Practical)

CSE
816

Soft Computing

CSE814

Visual Programming

CSE864

Visual Programming
(Practical)

CSE
817

Embedded Systems

CSE815

Java Technologies

CSE865

Java Technologies
(Practical)

CSE
818

Building Enterprise
Applications

100

Second Year - Third Semester
Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

DATA STRCTURES
CSE 311
External: - 50

rd

Semester: - 3
Internal: - 50

Credits
LTP
Elective

04
310
N

45
Contact
Hours
3 Hours
Time
1. To develop proficiency in the specification, representation, and implementation of
Objectives
data types and data structures.
2. To understand the basic concepts of the fundamentals of different types of data structures. 3. To demonstrate the ways of implementation of different types of data structures.
4. To learn the techniques to solve problems like sorting, searching, insertion and deletion of data etc. related to data structures.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
12
Linear Data Structures:
Sequential representations Arrays (one, two, multi dimensional) and Records, Binary
Search,
Stacks, Queues and Circular queues; Link Representation - Linear linked lists, circularly linked lists. Doubly linked lists, Garbage collection and Compaction.
3
Recursion:
Design of recursive algorithms, Tail Recursion, When not to use recursion, Removal of recursion. Sorting Algorithms:
7
Bubble sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap sort and Radix
Sort.
SECTION-B
Non-linear Data Structure: Trees - Binary Trees, Threaded Binary Trees, Binary Search 15
Trees, Insertion and Deletion algorithms, AVL trees, B-trees, Application of trees; Graphs
-Representations, Breadth-first and Depth-first Search.
2
Hashing:
Hashing Functions, collision Resolution Techniques.
6
File Structures:
Index Techniques: Hashed Indexing, Tree Indexing B Trees; File Organizations:
Sequential, Random, Linked Organizations, Inverted Files.
Suggested

Programming Fundamentals (CS101/201)

1. Y. Langsam, M. J. Augenstein, A. M. Tanenbaum: Data Structures using

Books

C and ++, 2ndEdition, Pearson Education
2. R. Kruse, C. L. Tondo, B. Leung, S. Mogalla: Data Structures & Program
Design n C. 2ndEdition, Pearson Education
References:
1. E. Horowitz, S. Sahni, D. Mehta :Fundamentals of Data Structures in
C++, 2ndEdition, Universities Press
2. Donald E. Knuth::Art of Computer Programming, Volume 1:
Fundamental algorithms, 3rd Edition, Addison-Wesley
Art of Computer Programming, Volume 3: Sorting and Searching,
2ndEdition, Addison-Wesley

Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
On completion of this course a student must be able to
Course
1. Understand common data structures (such as arrays, linked lists, stacks, queues,
Outcomes
priority queues, trees, heaps, hash tables, associative containers).
2. Understand the algorithms that build and manipulate different types of data structures including various sorting, searching, and hashing algorithms.
3. Ability to decide, apply and implement the appropriate data type and data structure for a given problem.
4. Make appropriate data structure and algorithm design decisions with respect to program size, execution speed, and storage efficiency.
Mapping
Course
POs
of Course
Outcomes A
B C D E F G H I J
K
L
Outcomes
I
*
*
*
* with POs
II
*
* * *
*
III
*
*
*
*
IV
*
*
*
*
*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

DATA STRCTURES (PRACTICAL)
CSE 361
Semester: - 3rd
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:

02
003
N
3 Hours

1. Implementation of array operations: Traversal, Insertion & Deletion at and from a given location
2. Stacks: Implementation of Push, Pop; Conversion of Infix expression to Postfix,
Evaluation of Postfix expressions.
3. Queues: Circular Queue: Adding & deleting elements.
4. Linked list: inserting, deleting, implementation of stacks & queues using linked lists; Polynomial addition.
5. Trees: Implementation of Binary & Binary Search Trees, Recursive and Nonrecursive traversal of Trees.
6. Implementation of Graphs
7. Implementation of sorting and searching algorithms
8. Hash tables implementation: searching, inserting and deleting

Branch: Computer Science and Engineering
Title

Peripheral Devices and Interface

Code
Max. Marks

CSE313
External: - 50

Prerequisites
Objectives

Credits

Digital Electronics (EC316)

Semester: - 3rd
Internal: 50

04

LTP
Elective

310
N

Time

3
Hours
The objective of this course is to provide knowledge about integrated circuit memories & the functional details of various peripheral devices.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions
Examiner
of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
The Memory Element: RAM, Linear Select Memory Organization, Decoders, 12
Dimensions of Memory access, connecting Memory chips to a computer bus, Static
RAM, Dynamic RAM, ROM, Digital recording techniques.
System Resources: Interrupt, DMA Channel, I/O Port Addresses and resolving and 10 resolving the conflict of resources. I/O buses- ISA, PCI, SCSI, EISA, Local bus, VESA
Local bus, PCI bus, PCI Express, Accelerated graphics port bus.
SECTION-B
12
Video Hardware :
Introduction to Multimedia Kit, Multimedia building blocks, Video display technologies,
DVI Digital signals for CRT Monitor, LCD Panels, Video adapter types, Integrated
Video/ Motherboard chipset, Video RAM, Video driver and multiple Monitor, Graphic accelerators, Advanced 3D Techniques.
11
Input/ Output Driver software aspects:
Role of device driver, DOS and UNIX/ LINUX device drivers.
Design & Integration of Peripheral devices to a computer system as a Case Study
Suggested
S. No. Authors
Title
Publishe Edition Other
Books
r
Detail
s
1.

2
Course
Outcomes

T.C.
Bartee

Scott
Muller

1.
2.
3.
4.

Digital
Computer
fundamentals,

Tata
McGraw
Hill.

6th
Edition

Upgrading and Que repairing PC
Publishin 16th g Edition
Illustrate the basic organization of a computer system.
Define the principles and the implementation of computer hardware.
Assemble computers and perform troubleshooting.
Define knowledge about the integrated circuit memories & the functional

Mapping of
Course
Outcomes with POs

details of various peripheral devices and system buses.
COs
PO
A
B C
D E F
G H I
1
X
X
2
X
3
X
X
X
4
X
X
X

J
X
X
X

K
X
X
X

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

PERIPHERAL DEVICE INTERFACE (Practical)
CSE363
Semester: - 3rd
50

Credits
LTP
Elective

02
003
N

3 Hours
Time
Practical should be covered based on the following directions:
1. Introduction to various hardware elements: Monitors, Printers, Keyboards, Mouse,
Different memory elements.
2. Different types of buses and their interfaces.
3. Assembly of PC
4. Introduction to Network elements: Routers, Bridges, hubs, Switches, hardware tools and management tools.

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

ENGINEERING MATHEMATICS-III
Semester: - 3rd
AS301
External: - 50
Internal: - 50

Credits
LTP
Elective

04
310
N

45
Contact
Hours
3 Hours
Time
1. To provide knowledge about engineering mathematics concepts.
Objectives
2. To use mathematics concepts in building mathematical models.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
8
Sequences and Series:
Sequences, Limits of sequences, Infinite series, series of positive terms, Integral test,
Comparison test, Ratio test, Root test. Alternating series, Absolute and Conditional
Convergence, Leibnitz test. Power series: radius of convergence of power series, Taylor's and Maclaurin s Series, Formulae for remainder term in Taylor and Maclaurin series, Error estimates. 7
Linear Algebra:
Concept of linear independence and dependence, Rank of a matrix: Row - Echelon form,
System of linear equations: Condition for consistency of system of linear equations,
Solution by Gauss elimination method. Inverse of a matrix: Gauss -Jordan elimination method. Eigen values, Eigen vectors, Cayley- Hamilton theorem (statement only). Similarity of matrices, Basis of eigenvectors, daigonalization.
SECTION B
Complex Functions:
Definition of a Complex Function, Concept of continuity and differentiability of a complex function, Cauchy-Riemann equations, necessary and sufficient conditions for differentiability (Statement only). Study of complex functions: Exponential function,
Trigonometric functions, Hyperbolic functions, real and imaginary part of trigonometric and hyperbolic functions, Logarithmic functions of a complex variable, complex exponents. Laurent' Series of function of complex variable, Singularities and Zeros, Residues at simple poles and Residue at a pole of any order, Residue Theorem (Statement only) and its simple applications. Conformal Mappings, Linear Fractional Transformations

7
8

7

8

Suggested books S. No.

Authors

Title

Publisher Edition

1.

E.
Kreyszig

Advanced
Engineering
Mathematics
Calculus

John
Wiley.

2

Course
Outcomes
Mapping of
Course
Outcomes with
POs

Other
Details

81h
Edition

G.B.
Pearson
91b
Thomas,
Education Edition
R.L.
Finney
1. To make students familiar with mathematical concepts
2. To make students understand the implementation of mathematical rules.
3. Students will be able to apply these rules in day to day life or in research filed also. D
*
*

E

PO
F

*

*

*

*

*

COs
1
2
3

A
*

B
*
*

C
*

G

H

I

J

K

L

*
*

*

*

*

*

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

DIGITAL ELECTRONICS
Semester: - 3rd
EC316
External: - 50
Internal: - 50
Engineering mathematics (ME101/201)

Credits
LTP
Elective

04
310
N

45
Contact
Hours
3 Hours
Time
1. To provide knowledge about digital electronics circuitry.
Objectives
2. To design flip-flops.
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of
Examiner equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
Introduction : Representation of Logic, Logic Variables, Boolean Algebra, Boolean 8
Expressions and minimization of Boolean expression using K-Map, Review of Logic
Gates and, Flip-flops, Design and, Implementation of Adder Subtractor, Multiplexer,
DeMultiplexer, Encoder, Decoder, ROM, Digital Comparators, Code Converters.
Number System and Code: Decimal Binary, Hexadecimal, Octal's complement, 2's 7 complement, addition and substraction, weighted binary codes, Error detecting codes,
Error correcting codes, Alphanumeric codes.
Counters and Shift Register: Ripple Counters, Design of Modulo-N ripple counter, 7
Up-Down counter, design of synchronous counters with-and without lockout conditions, design of shift registers with shift-left, shift-right and, parallel load .facilities, universal shift registers.
Data Converters: Sample and Hold switch, D/A converters: Weighted type, R-2R 8 ladder type; A/D Converters: Counter-Ramp' type, Dual Slope Type, Successive approximation type, flash type; Specifications of ADC and, DAC.
Hrs
SECTION B
Digital Logic Families : Characteristics of digital circuits: Fan in, fan out, power 7 dissipation, propagation delay, noise margin; Transistor-transistor Logic (TTL), TIL,
NAND Gate with active Pull Up, its input and output Characteristics, Types of TTL
Gates (Schottky, standard, low power, high speed). Emitter Coupled Logic (ECL), ECL gate, its transfer characteristics, level translation in ECL and, TTL, MOS Gates, MOS
Inverter, CMOS Inverter, Rise and Fait time of MOS and, CMOS gates, Interfacing TIL and, CMOS Circuits, Comparison of Characteristics of· TTL, ECL, MOS and, CMOS logic circuits, Tristate Logic and, its applications.
Semiconductor Memories and Programmable Logic : RQM, PROM, EPROM, 8
EEPROM; RAM : Static RAM, Typical Memory Celt, Memory Organization, Dynamic
RAM cell, Reading " Writing Operation in RAM, PLA, PAL " FPGA

Suggested books S. No.

Authors

1.

William H. Digital
Gothmann Electronics - An
Introduction to
Theory
and
Practice,
R.P. Jain
Modem Digital
Tata
Electronics,
McGraw
Hill

2

Course
Outcomes

Title

Publisher Edition

Other
Details

2nd
Edition

2'11I4
Edition

1997

1. To make students familiar with number system, electronic circuits and logical gates.
2. To make students understand these circuits and implement them practically.
3. Students will be able to apply these concepts in new emerging technologies.

Branch: Computer Science and Engineering
Title
DIGITAL ELECTRONICS (Practical)
Semester: - 3rd
Code
EC366
50
Max.
Marks
Note
List

Credits
LTP
Elective

01
002
N

3 Hours
Time
Practical should be covered based on the following directions:
1. To study truth tables of AND, OR, NOR, NAND, NOT and XOR Gates.
2. To verify the truth tables of RS, of JK and T Flip Flops.
3. To fabricate and test the truth table ofhalf7full adder.
4. To design and implement a Modulo-N Counter.
5. To design and implement a Universal shift register.
6. Design and fabrication of synchronous counter
7. Design" fabrication of combinational circuits using Multiplexers
8. To convert 8 bit Digital data to Analog value using DAC.
9. To convert Analog value into 8 bit Digital data using ADC

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

MICROPROCESSORS
EC317
External: - 50

rd

Semester: - 3
Internal: - 50

Digital Electronics (EC316) , Peripheral Devices (CSE313)

Credits
LTP
Elective

04
310
N

45
Contact
Hours
3 Hours
Time
Objectives Provide students with the opportunity to gain experience in microprocessor-based system design, assembly language programming, and I/O interfacing to microprocessors. This course is intended as a first level course for microcomputer and embedded system design.
Designer of an embedded system must have a thorough understanding of hardware, software and system integration. In view of this, various aspects of hardware design, such as interfacing of memory and different types of I/O devices, will be covered in details. As it is customary to write software in machine or assembly language for embedded system applications, laboratory assignments will be on assembly language programming of 8085.
1. This course contains fundamental principles of 8085 microprocessor, its hardware interfacing and programming.
2. After completion of this course the student must be able to use 8085 microprocessor and its peripherals in small applications.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
4
Microprocessor Architecture and Microcomputer Systems:
Microprocessor Architecture Memory, Input and Output Devices, the 8085 MPU, Example of an 808S-Based Microcomputer, Memory Interfacing, The SDK-85 Memory System.
4
Interfacing I/O Devices:
Basic Interfacing Concepts, Interfacing Output Displays, Interfacing Input Devices,
Memory7" Mapped I/O, Testing and Troubleshooting, I/O Interfacing Circuits.
7
Programming the 8085:
Introduction to 8085 Assembly Language Programming, The 8085 Programming Model,
Instruction Classification, Instruction format. Data Transfer (Copy) Operations, Arithmetic
Operations, Logic Operations Branch Operations, Writing Assembly Language Programs.
8
Programming Techniques with Additional Instructions:
Programming Techniques Looping, Counting and Indexing, Additional Data Transfer -'arid
16-Bit Arithmetic Instructions, Arithmetic Operations Related to Memory, Logic
Operations.
SECTION-B
4
Counters and Time Delays:
Counters and Time Delays, Hexadecimal Counter, Modulo: Ten Counter, Generating Pulse
Waveforms, Debugging Counter and Time-Delay Programs.

Stack and Subroutines:
Stack, Subroutine, Conditional Call and Return Instructions.
Interrupts:
The 8085 Interrupt 8085 Vectored interrupts.
Interfacing Data Converters:
Digital- to- Analog (01 A) Converters, Analog- to- Digital (A/D) Converters.
General -Purpose Programmable Peripheral Devices:
The 82S5A Programmable Peripheral Interface, Illustration: Interfacing Keyboard and
Seven- Segment Display, Illustration: Bi- directional-Data Transfer between Two
Microcomputers, The 8254 Programmable Interval Timer, The 8259 A Programmable
Interrupt Controllers, and Direct Memory. Access (DMA) and the 8257 DMA Controller, serial communication, Programmable communications interface 8251.
Suggested
Books

4
4
4

6

S.
Authors
Title
Publisher Edition Year
No.
Ramesh S. Microprocessor Pearson third 1.
Gaonkar
Programming edition and
Architecture,
Applications with the 8085
References:
Charles
Microprocessor Tata
1.
M.Gilmore Principles and McGraw
Applications,
Hill.
Douglas
Microprocessors Tata second 2.
V. Hall and Interfacing
McGraw edition programming Hill. and Hardware
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
At the completion of this course, students should be able to do the
Outcomes
following:
1. Identify the basic element and functions of microprocessor, describing the architecture of microprocessor and its peripheral devices, memory interfacing.
2. Demonstrate the fundamental understanding on the operation between the microprocessor and its interfacing devices, testing and troubleshooting, circuit diagrams along with description.
3. Apply the programming techniques in developing the assembly language program for microprocessor application, types of instructions and its uses, 8-bit as well as
16-bit programming, looping, counter delay executions, issues related to

debugging.
4. To understand the concepts of stack and subroutines, its need in microprocessors, various types of interrupts, interrupt handling, instructions related to interrupts and related programming, interfacing data convertors and brief introduction to various general purpose programmable peripheral devices and its interfacing with 8085 microprocessor. Mapping of Course
Outcomes
with POs

COs
1
2
3
4

A
X
X
X
X

B
X

C

D

E

X

X

PO
F

X
X

G

H

I

J

K

L

X
X
X

X
X

X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

MICROPROCESSORS (PRACTICAL)
CSE 367
Semester: - 3rd
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:

0
002
N
3 Hours

1. Familiarization of 8085 kits..Verification of arithmetic and logic operations using above kits.(At least 5 programs)
2. Development of interfacing circuits of various control applications based on 8085.
3. Application of assembly language using 8085 instructions set to develop various
Programs.
4. Applications of data movement instructions to develop relevant programs.

Second Year -Fourth Semester
Branch: Computer Science and Engineering
04
Title
Analysis and Design of Algorithms
Credits
th
Semester: - 4
313
Code
CSE 411
LTP
External: - 50
Internal: - 50
N
Max.
Elective
Marks
45
PreDiscrete Structures (CSE517), Data Structures (CSE311), Contact requisites Basic Mathematics
Hours
3 Hours
Time
Objectives To understand the different algorithms design techniques and to understand the algorithm analysis approach.
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of
Examiner equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
Introduction:- Role of Algorithms in Computing; Growth of functions: Asymptotic 12
Notation, Standard notation & common functions; Introduction to Recurrences: substitution method, recursion-tree method, master method; Randomizing Algorithms
Divide and Conquer:- Performance analysis of Binary Search, Merge sort, Quick sort,
10
Selection sort
Greedy Algorithms:- Elements of Greedy strategy, Activity Selection Problem,
Knapsack problem, Single source Shortcut paths problem, Minimum Spanning tree problem and analysis of these problems.
Hrs
SECTION-B
Dynamic Programming:- Elements of dynamic programming, Assembly-line
12
scheduling problem, Matrix-chain multiplication, Multistage Graph, All Pairs Shortest paths, Longest common subsequence, 0/1 Knap Sack.
Back Tracking: - General method, 8 queen's problem, Graph coloring, 0/1 Knap Sack
11
Problem
NP-Completeness:- Polynomial Time, polynomial-time verification, NP-completeness & reducibility, NP-complete problems
Suggested
Books
S.
Authors
Title
Publishe Edition Year
No.
r
Thomas
H. Introduction to 1.
Cormen,
Algorithms
Charles
E.
Leiserson,
Ronald
L.
Rivest
References:

1.

Ellis
Horowitz,
SartajSahni
Aho A.V.,
Hopcroft
J.E.,
Ullman
J.D.
Goodman
S.E.
&Hedetnie
mi

2.

3.

Course
Outcomes

Fundamentals
Computer
Algorithms
The Design and
Analysis of
Computer
Algorithms

of Galgotia

Pearson
Edu
cation

Introduction to the
Design and
Analysis of
Algorithms

McGrawHill

At the completion of this course, students should be able to do the following: 1. To understand different measures for time and space complexities.
2. To understand the different algorithm design approaches including Divide and
Conquer, Greedy, Dynamic Programming, Backtracking and Branch and
Bound.
3. To understand P and NP class of problems.

Mapping of
Course
Outcomes with POs

COs
1
2
3

A
X
X
X

B
X
X
X

C
X
X

D
X
X
X

PO
E F
X
X

X

G

H

I

J

K

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

ANALYSIS
&
(PRACTICAL)
CSE461
50

DESIGN

OF

ALGORITHMS Credits

Semester: - 4th

LTP
Elective

Time
Practical should be covered based on the following directions:
1. Divide & Conquer
2. Greedy Method
3. Dynamic Programming
4. Backtracking

02
003
N
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

DATABASE MANAGEMENT SYSTEM
CSE 412
Semester: - 4th
External: - 50
Internal: - 50

Credits
LTP
Elective

04
310
N

Programming Fundamentals (CS101/201)

45
Contact
Hours
3 Hours
Time
Objectives The main objective of this course is to provide students with the background to design, implement, and use database management systems. This course offers a good understanding of database systems concepts and prepares the student to be in a position to use and design databases for different applications. Behind the development and design of this course is to know.
· How to design, manipulate and manage databases.
· The course participants are exposed to the various forms, types and models of database systems to enable them make viable choices.
· Supportive and complimentary concepts of managing data and documents are thoroughly examined to give a wholesome view of data/information management. · The ultimate aim is to encourage the usage of database management systems for effective data management.
The Semester question paper of a subject will be of 50 marks having 7 questions of
Note for
Examiner equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
6
Introduction to Database Systems:
File Systems Versus a DBMS, Advantages of a DBMS, Describing and Storing Data in a
DBMS, Database System Architecture, DBMS Layers, Data independence.
Physical Data Organization:
File Organization and Indexing, Index Data Structures, Hashing, B-trees, Clustered
Index, Sparse Index, Dense Index, Fixed length and Variable Length Records.
Data Models:
Relational Model, Network Model, Hierarchical Model, ER Model: Entities, Attributes and Entity Sets, Relationships and Relationship Sets, Constraints, Weak Entities, Class
Hierarchies, Aggregation, Conceptual Database Design with the ER Model, Comparison of Models.
The Relational Model:
Introduction to the Relational Model, ER to Relational Model Conversion, Integrity
Constraints over Relations, Enforcing Integrity Constraints, Relational Algebra,
Relational Calculus, Querying Relational Data.
SECTION-B
Relational Query Languages:

6

5

5

7

SQL: Basic SQL Query, Creating Table and Views, SQL as DML, DDL and DCL, SQL
Algebraic Operations, Nested Queries, Aggregate Operations, Cursors, Dynamic SQL,
Integrity Constraints in SQL, Triggers and Active Database, Relational Completeness,
Basic Query Optimization Strategies, Algebraic Manipulation and Equivalences.
5
Database Design:
Functional Dependencies, Reasoning about Functional Dependencies, Normal Forms,
Schema Refinement, First, Second and Third Normal Forms, BCNF, Multi-valued
Dependency, Join Dependency, Fourth and Fifth Normal Forms, Domain Key Normal
Forms, Decompositions.
6
Transaction Management:
ACID Properties, Serializability, Two-phase Commit Protocol, Concurrency Control,
Lock Management, Lost Update Problem, Inconsistent Read Problem, Read-Write Locks,
Deadlocks Handling, 2PL protocol.
5
Database Protection:
Threats, Access Control Mechanisms, Discretionary Access Control, Grant and Revoke,
Mandatory Access Control, Bell LaPadula Model, Role Based Security, Firewalls,
Encryption and Digital Signatures.
Suggested
Books

Course
Assessment

S.
Authors
No.
RamezElmasri
1.
,
ShamkantNav athe References:
C.J. Date
1.

Title

Publishe r Fundamentals of Pearson
Database Systems
Educatio
n

Edition

Year

Fifth
Edition

2007

An Introduction to Pearson
Eighth
Database Systems
Educatio Edition n Alexis Leon,
Database
2.
Mathews Leon Management
Systems
S. K. Singh
Database Systems Pearson
3.
Concepts, Design Educatio and Applications n Raghu
Database
Tata
4.
Ramakrishnan, Management
McGrawJohannes
Systems
Hill
Gehrke
Abraham
System Concepts
Tata
5.
Silberschatz,
McGrawHenry F.
Hill
Korth, S.
Sudarshan
Assessment will consists of following components
1. Two Minors (30% Weightage )

Methods

Course
Outcomes

2.
3.
4.
5.

Quiz (7.5%)
Assignment (7.5%)
Attendance (5%)
Final Exam (50%)

At the completion of this course, students should be able to do the following: 1. Understand basic database concepts, its physical organization including the structure and operation of ER model, Relational data model along with normalizing relational data.
2. Construct simple and moderately advanced database queries using Structured
Query Language (SQL) and Procedural SQL (PL/SQL).
3. Understand the concept of a database transaction and related database facilities, including concurrency control through serializability and locking protocols.
4. Discuss various Protection issues for databases including introduction to existing integrity and security methods to databases.

Mapping of
Course
Outcomes with POs

COs
1
2
3
4

PEOs
I
II

X
X

A
X

B
X

C

D

E

X

X

III
X

X

PO
F

X
X

G

H

I

J

K
X

X
X

X

X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

DATABASE MANAGEMENT SYSTEM
(PRACTICAL)
CSE 462
Semester: - 4th
50

Credits

02

LTP
Elective

003
N

Time
Practical should be covered based on the following directions:

3 Hours

1. Introduction to SQL and installation of SQL Server / Oracle.
2. Data Types, Creating Tables, Retrieval of Rows using Select Statement,
Conditional Retrieval of Rows, Alter and Drop Statements.
3. Working with Null Values, Matching a Pattern from a Table, Ordering the Result of a Query, Aggregate Functions, Grouping the Result of a Query, Update and
Delete Statements.
4. Set Operators, Nested Queries, Joins, Sequences.
5. Views, Indexes, Database Security and Privileges: Grant and Revoke Commands,
Commit and Rollback Commands.
6. PL/SQL Architecture, Assignments and Expressions, Writing PL/SQL Code,
Referencing Non-SQL parameters.
7. Stored Procedures and Exception Handling.
8. Triggers and Cursor Management in PL/SQL.

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

OBJECT ORIENTED PROGRAMMING
CSE-414
Semester: - 4th
External: - 50
Internal: 50

Credits
LTP
Elective

04
310
N

Programming Fundamentals ( CS101/201)

Contact Hours

45

Time

Objectives
Note for
Examiner

3
Hours
To understand the basic concepts of object oriented programming languages and to learn the techniques of software development in C++.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
1. Principles of Object Oriented Programming
2
2. Tokens, Expressions and control structures, various data types, and data structures, 4
Variable declaration, Operators and scope of operators.
3. Pointers, Functions, Classes and Objects: Prototyping, referencing the variables in 8 functions, memory allocation for classes and objects, Array of objects, pointers to member functions. 4. Constructors and Destructors, Operator Overloading and type conversion.
4
5. Inheritance: Derived classes, types of inheritance, and various types of classes
5
SECTION-B
6. Virtual functions and Polymorphism.
5
7. I/O operations on files: Classes for files, Operations on a file, file pointers.
8
8. Exception Handling and Generic programming with templates: Introduction to templates, 9 overloading of template functions and Inheritance.
Assessment will consists of following components
1. Two Minors (30% Weightage )
Course
2. Quiz (7.5%)
Assessment
3. Assignment (7.5%)
Methods
4. Attendance (5%)
5. Final Exam (50%)
1. Understand the model of object oriented programming: program flow, abstract
Course
Outcomes data types and classes.
2. Demonstrate differences between traditional imperative design and object-oriented design. 3. Explain class structures as fundamental, modular building blocks and to understand the role of constructors, inheritance, polymorphism, dynamic binding and generic structures in building reusable code

4. Analysing the statement of a business problem and determining suitable logic for solving problem and coding that logic as a program in C++.
5. Designing object-oriented systems for small/medium scale problems.
Mapping
of Course
Outcomes
with POs

COs
1
2
3
4
5

A
X

B

C
X
X

X
X

X

Branch: Computer Science and Engineering

D

PO
E F
X

X

X

G

H

I

J

K L

X X
X X X X

Title
Code
Max.
Marks
Note
List

OBJECT ORIENTED PROGRAMMING
(PRACTICAL)
CSE 464
Semester: - 4th
50

Credits

02

LTP
Elective

003
N

Time
Practical should be covered based on the following directions:
1.
2.
3.
4.
5.
6.

Functions, Classes and Objects
Constructors and Destructors
Operator Overloading and Type Conversion
Inheritance and Virtual Functions
Files
Exception Handling and Generic Programming

3 Hours

Branch: Computer Science and Engineering
Title
CYBER LAWS & IPR
ASC 405
Semester: - 4th
Code
External: - 50
Internal: 50
Max.
Marks
Prerequisites

Credits
LTP
Elective

03
300
N

Contact Hours

45

Time

3
Hours

Objectives
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of
Examiner equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A
Basics of Computer & Internet Technology
Internet, ISP & domain name; Network Security; Encryption Techniques and Algorithms;
Digital Signatures.
Introduction to Cyber World
Introduction to Cyberspace and Cyber Law; Different Components of cyber Laws; Cyber
Law and Netizens.
E-Commerce
Introduction to E-Commerce; Different E-Commerce Models; E-Commerce Trends and
Prospects; E-Commerce and Taxation; Legal Aspects of E-Commerce.
SECTION-B
Intellectual Property Rights
IPR Regime in the Digital Society; Copyright and Patents; International Treaties and
Conventions; Business Software Patents; Domain Name Disputes and Resolution.
T Act, 2000
Aims and Objectives; Overview of the Act; Jurisdiction; Role of Certifying Authority;
Regulators under IT Act; Cyber Crimes-Offences and Contraventions; Grey Areas of IT Act.
Project Work
Candidates will be required to work on a project. At the end of the course students will make a presentation and submit the project report.
Suggested
Books

S.
Authors
Title
No.
NandanKamath A Guide to
1.
Cyber
Laws & IT
Act 2000 with Rules

Publisher
Galgotia
Publications

Edition Year Other
Details

Hrs
8

2

7

12

12

4

&
Notification
2

Keith Merill&
DeeptiChopra

Cyber
(IK Inter.)
Cops,
Cyber
Criminals&
Internet
Diane
Row Information TATA
3
Land
Technology McGraw
La
Hill
Vakul Sharma Handbook
(McMillian)
4 of Cyber
Law
Course Outcomes:
1. Discuss in depth origin, nature and current issues in cyber security and its related activities using précised terminology.
2. Apply a range of cyber security concepts to mitigate risk in cyber security operations.
3. Develop and apply decision framework using guidelines of cyber security ethics, laws and strategies.
4. Manage development of cyber security standards and capabilities.
5. Design strategies for development of an effective cyber security workforce. 6. Analyse technical and operational requirements for future cyber security system. 7. Analyse principle areas of national nd global regulations and governance of electronic commerce.
8. Demonstrate an understanding of logical issues for parties to ecommerce.

Branch: Computer Science and Engineering
Title
Computer Architecture & Organization
CS415
Semester: - 4th
Code
External: - -50
Internal: 50
Max.
Marks
PreStudy of Digital Logic & Circuits (EC316) requisites Objectives
Note for
Examiner

Credits
LTP
Elective

04
310
N

Contact
Hours
Time

45

3
Hours
This course offers a good understanding of the various functional units of a computer system and prepares the student to be in a position to design a basic computer system.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.

SECTION-A
Register Transfer Language and Micro-Operations:
Basic Concepts, Complements, Fixed and Floating Point Representation, Register
Transfer Language, Inter Register Transfer Arithmetic, Bus and Memory Transfers,
Arithmetic, Logic and Shift Micro-Operations, Arithmetic Logic Shift Unit.
Basic Computer Origination and Design:
Instruction Codes, Computer Instructions, Timing and Control, Execution of
Instructions, Input Output and Interrupt, Design of Basic Computer.
Programming the Basic Computer:
Machine Language, Assembly Language, The Assembler, Program Loops, Programming
Arithmetic and Logic Operations, Subroutines, Input-Output Programming.
Central Processing Unit:
General Register Organization, Stack Organization, Instruction Formats, Addressing
Modes, Data Transfer and Manipulation, Program Control.
SECTION-B
Microprogrammed Control and Pipelining:
Control Memory, Address Sequencing, Microinstruction Formats, Pipelining, Arithmetic and Instruction Pipelining.
Computer Arithmetic:
Addition and Subtraction of unsigned Binary Numbers, Addition, Subtraction,
Multiplication and Division Algorithm.

Hrs
6

6

5

6

6

5

6
Input-Output Organization:
Input-Output Interface, Asynchronous Data Transfer, DMA, Priority Interrupt, I/O
Processor, Serial Communication.
5
Memory Organization:
Memory Hierarchy, Associative Memory, Virtual Memory, Cache Memory, Memory
Management Hardware.

Suggested
Books

S.
N
o.

Authors

Title

1.

Publish er Edition

Othe r Detai ls M. Morris
Mano

Computer
Pearson Third
System
Edition
Architecture
2
J.P. Hays
Computer
Tata
Architecture
McGraw Third and -Hill
Edition
Organization
3
William
Computer
Pearson Seventh stallings Organization
Edition
and Archtecture
Assessment will consists of following components
1. Two Minors (30% Weightage )
Course
2. Quiz (7.5%)
Assessment
3. Assignment (7.5%)
Methods
4. Attendance (5%)
5. Final Exam (50%)
1. Understanding of principles and implementation of computer arithmetic.
Course
2. Development of assembly programs that accomplish basic computational
Outcomes
and I/O operations.
3. Understanding of working of modern CPUs including pipelining, memory systems and buses
4. Demonstration of wide variety of memory technologies and concepts of memory management.
5. Evaluation and design of a basic computer system
Mapping of CO
PEO
PO
Course
1 2
3 A
B C D E F G H I
J
K L
Outcomes
1
X
X
X X
X X with POs
2
X X
X X
X
3
4
5

X
X
X

X

X

X

X

X

X
X

Third Year - Fifth Semester
Branch: Computer Science and Engineering
Title

OPERATING SYSTEM

Code
Max.
Marks
Prerequisites

CSE 511
External: - 50

Objectives

Computer Fundamentals

Credits
Semester: - 5th
Internal: - -50

04

LTP
Elective

310
N

Contact
Hours
Time

45
3 Hours

·

To introduce design and implementation issues of various Operating
Systems: batch, multi-programmed, time sharing, real time, distributed, parallel Operating System structural Components, layered structure, functions · To understand concept of processes, CPU Scheduling Algorithms: FCFS,
SJF, RR and Priority, Inter Process Communication, Process
Synchronization, Critical Sections, Semaphores and Monitors.
· To introduce Deadlocks Detection , Recovery, Avoidance and Prevention
· To familiarize with Memory Management using contiguous memory allocation, paging, segmentation, segmentation with paging.
· To introduce Virtual Memory, demand paging and page replacement algorithms (FIFO, Optimal, LRU), Thrashing.
· To understand File Systems, directory structure, allocation methods
(contiguous, linked, indexed), free-space management (bit vector, linked list, grouping) and Protection mechanisms.
· To discuss Disk Structure, Disk Scheduling (FCFS, SSTF, SCAN, C-SCAN, and LOOK), Disk Management (Disk Formatting, Boot Blocks, and Bad
Blocks), Swap Space Management (Swap Space use, Swap Space Location,
Swap Space Management).
· To explore case Studies: Brief introduction of MS-DOS, Windows, UNIX and LINUX.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of
Examiner
conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
Introduction: What is an O.S., O.S. Functions; Different types of O.S.: batch, multiprogrammed, time sharing, real time, distributed, parallel; General structure of operating system, O/S services, system calls.
5
Process Management: Introduction to processes - Concept of processes, process 10 scheduling, operations on processes; Inter Process Communication, Critical Sections,
Mutual Exclusion with Busy Waiting, Sleep and Wakeup, Semaphores, Message passing; CPU scheduling- scheduling criteria, pre-emptive & non-pre-emptive scheduling, Scheduling Algorithms: FCFS, SJF, RR and priority. Circuit Switching &
Packet Switching.
Memory Management: background, logical vs. physical address space, memory

management without swapping; swapping; contiguous memory allocation, paging, segmentation, segmentation with paging; Virtual Memory, demand paging, performance, page replacement, page replacement algorithms (FIFO, Optimal ,LRU);
Thrashing.
SECTION-B
File Systems: Files - file concept, file structure, file types, access methods, File attributes, file operations; directory structure, allocation methods (contiguous, linked, indexed), free-space management (bit vector, linked list, grouping), Protection mechanisms. Secondary Storage : Disk Structure, Disk Scheduling ( FCFS, SSTF, SCAN, CSCAN, LOOK), Disk Management (Disk Formatting, Boot Blocks, Bad Blocks),
Swap Space Management (Swap Space use, Swap Space Location, Swap Space
Management)
Deadlocks: Introduction to deadlocks, Conditions for deadlock, Resource allocation graphs, Deadlock Detection and Recovery, Deadlock Avoidance, Deadlock Prevention
Case Studies: Brief introduction of MS-DOS, Windows, UNIX and LINUX.
Suggested
Books

S.
No.
1

Authors

Title

Publisher

Edition Year

6

6

6

6
6
Other
Details

Silbersehatz Operating
Addison
and Galvin System
Wesley Inc.
Concepts
2
Tanenbaum Operating
Pearson
A.S
System Design Education.
&
Implementation
3
Bhatt and An introduction Prentice
Chandra
to
Operating Hall of Systems
India
Concepts and Publication
Practice,
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Study of various types of operating systems along with detailed illustration of process management and handling of deadlocks for processes.
Course
2. Understand in depth memory management, Secondary storage management
Outcomes
and File system management.
3. Discuss various case studies like MS-DOS, Windows, UNIX and LINUX.
Mapping
COs
PO
of Course
A
B C
D E F
G H I
J
K L
Outcomes
1
X
X X with POs
2
X X X
3
X X X X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

OPERATING SYSTEM (PRACTICAL )
CSE 561
Semester: - 5th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:

02
003
N
3 Hours

1. Learning Basic Features and Operating Environment of UNIX and LINUX.
2. Introduction to Shell and Shell Commands.
3. Shell programming: creating a script, making a script executable, shell syntax
(variables, conditions, control structures, functions, commands.
4. Process: starting new process, replacing a process image, duplicating a process image, waiting for a process.
5. Programming with semaphores.

Branch: Computer Science and Engineering
Title
SOFTWARE ENGINEERING
CSE 512
Semester: -5th
Code
External: - 50
Internal: - 50
Max. Marks
PreProgramming Fundamentals (CS101/201) requisites Objectives

Note for
Examiner

4
Credits
310
LTP
N
Elective
45
Contact
Hours
3 Hours
Time
This course aims to give students a theoretical foundation in software engineering.
Students will learn about the principles and methods of software engineering, including current and emerging software engineering practices and support tools.
· To understand the concept and need of Software Engineering principles, SDLC, process models and tools.
· To understand project management as an umbrella activity for software development including schedule and cost estimations.
· To study the concept of software requirements and their changing nature
· To understand various software architectures and design principle in software
Engineering.
· Understanding good coding practices, including documentation, contracts, regression tests and daily builds.
· To understand various quality assurance and testing techniques, including unit testing, functional testing and automated testing.
· To study various CASE tools and understand the methodologies working behind these tools.
· To understand model based software development using UML.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.

SECTION-A
5
Introduction:
Introduction to Software Engineering, System Engineering Vs Software Engineering,
Software Evolution, Software Characteristics, Cost of Software Production, Software
Components, Crisis Problem and Causes, Challenges in Software Engineering.
6
Software Process Models:
SDLC, Waterfall Model, Incremental Model, Prototyping Model, Evolutionary Model,
Spiral Model, Rapid Application Development Model, Formal Methods, Open Source
Development, Object Oriented Life Cycle Model, Agile Methods.
6
Project Management Concepts:
Management Activities, Project Planning, Project Scheduling, Size Estimation LOC,
FP; Cost Estimation Models COCOMO, COCOMO-II.
5
Software Requirements Analysis and Specification Concepts:
Requirement Engineering, Requirement Elicitation Techniques, Requirements
Documentation, Characteristics and Organization of SRS, Analysis Principles,
Analysis Modeling Data Modeling, Functional Modeling and BehavioralModeling;
Structured vs. Object Oriented Analysis.
SECTION-B

Hrs

6
Software Design and Coding Concepts:
Design Principles, Data Design, Architectural design, Interface Design, Component
Level Design, Object Oriented Design Concepts, Cohesion and Coupling and their classification, top-down, bottom-up and middle-out design, Coding, Coding Standards,
Coding Conventions, Programming Style.
5
Testing:
Verification and Validation, Testing Process, Design of Test Cases, Software Testing
Strategies, Unit Testing, Integration Testing, Top Down and Bottom Up Integration
Testing, Alpha & Beta Testing, System Testing and Debugging.
6
Technical Metrics for Software:
Software Measurements: What and Why, A Framework for Technical Software
Metrics, Metrics for the Analysis Model, Metrics for Design Model, Metrics for Source
Code, Metrics for Testing, Metrics for Software Quality, Metrics for Maintenance.
6
CASE (Computer Aided Software Engineering) and Introduction to UML:
CASE and its Scope, Building blocks of CASE, CASE Tools, CASE Environment,
UML Concepts, Use Case Diagrams, Sequence Diagrams, Collaboration Diagrams,
Class Diagrams, State Transition Diagrams, Component and Deployment Diagrams.
Suggested
Books

Publisher

Software Engineering

Pearson
Education.

Edition Yea r Seventh
Edition,

Software Engineering: A
Practitioner's Approach
Software Engineering:
Theory and Practice, ,

McGraw
Hill.
Pearson
Education

Sixth
Edition
Second
Edition

3

Douglas
Bell

Software Engineering for
Students.

Pearson
Education

Fourth
Edition

4

PankajJalot e An Integrated Approach to
Software Engineering,

Narosa

Second
Edition

5

Course
Outcomes

Title

Ian
Sommervill
e
References
R.S.
1
Pressman
Pfleeger,
2
J.M. Atlee

Course
Assessment
Methods

S.
No.
1

Authors

K.K.Aggar Software Engineering wal, Yogesh
Singh

New Age Second
Internation Edition al. Assessment will consists of following components
1. Two Minors (30% Weightage )
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
After successful completion of course:1. Students will demonstrate an understanding of various process models and be able to select appropriate process model for a particular project.
2. Students will be able to use software cost estimation and scheduling techniques for small programs.

Mapping of
Course
Outcomes with POs

3. Students will be able to understand SRS and create architecture design for software systems using CASE tools.
4. Students will be able to devise test plan, test case and test suit using Black Box and
White Box Testing.
Course
POs
Outcomes
A B C
D
E
F
G
H
I
J
K
L
1
*
*
2

*

*

3

*

*

4

*

*

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

SOFTWARE ENGINEERING (PRACTICAL)
CSE 562
Semester: - 5th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:

02
003
N
3 Hours

1. Study the features of MS-Project.
2. Use MS-Project/OpenProj/similar tool to draft project plan for a particular project case study.
3. Use MS-Project/OpenProj/similar tool to generate various reports like Gantt chart,
Network diagram, Resource usage sheet.
4. Use MS-Project/OpenProj/similar tool to track the progress of a project.
5. Study the concepts of UML modeling.
6. Use Rational Rose/StarUML/similar tool to generate use case diagrams.
7. Use Rational Rose/StarUML/similar too to generate sequence diagrams.
8. Use Rational Rose/StarUML/similar too to generate class diagrams.
9. Use Rational Rose/StarUML/similar too to generate collaboration diagrams.
10. Study the features of a particular CASE tool for requirements specification, analysis, design and cost estimation.
11. Apply each of the above tools to a particular case study.

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

COMPUTER NETWORK
CSE 513
External: - 50

Semester: - 5th
Internal: - 50

Credits
LTP
Elective

04
310
N

Computer network (CSE513)

45
Contact
Hours
3 Hours
Time
Objectives · To introduce the data communication components, data flow and network categories and reference models.
· To introduce the concepts of analog and digital signals, multiplexing, transmission media and switching techniques
· To introduce different techniques for error detection and correction, media access and flow control protocols.
· To introduce concepts of logical addressing, routing algorithms and congestion control algorithms.
· To introduce the techniques for buffering, crash recovery, network security and application protocols.
The Semester question paper of a subject will be of 50 marks having 7 questions of
Note for equal marks. First question, covering the whole syllabus and having questions of
Examiner
conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
Introduction:
Data
Communication: Components, Data Flow; Network Categories: LAN, MAN,
WAN (Wireless / Wired); Network Software: Concept of layers, protocols, interfaces and 6 services; Reference Model: OSI, TCP/IP and their comparison.
Physical Layer :
Concept of Analog & Digital Signal; Bit rate, Bit Length; Transmission Impairments:
Attenuation, Distortion, Noise; Data rate limits: Nyquist formula, Shannon Formula;
8
Multiplexing: Frequency Division, Time Division, Wavelength Division; Transmission media: Twisted pair, coaxial cable, fiber optics, wireless transmission (radio, microwave, infrared); Circuit Switching & Packet Switching.
Data Link Layer:
Error correction & Detection; Flow & Error Control;
Sliding window protocols: Stop & Wait ARQ, Go back n ARQ, Selective repeat ARQ;
Examples of DLL Protocols-HDLC, PPP;
10
Medium Access Sub layer: Channel Allocation; Random Access: ALOHA, CSMA protocols; Controlled Access: Polling, Reservation, Token Passing;
Examples of IEEE 802.3, 802.11 standards.
SECTION--B
10
Network Layer:
Logical Addressing: IPv4 and IPv6; Packet Formats & their comparison: IPv4 and IPv6;
Routing algorithms: Distance vector, Link State Routing, Hierarchical Routing, Broadcast
& Multicast Routing.
Congestion Control: Principles of Congestion Control, Congestion prevention policies,
Leaky bucket & Token bucket algorithms.
8
Transport Layer:

Addressing, flow control & buffering, multiplexing & de-multiplexing, crash recovery;
Example transport protocols: TCP, SCTP and UDP.
3
Application Layer:
Network Security; Domain Name System; Simple Network Management Protocol;
Electronic Mail.
Suggested
Books
S.
Authors
Title
Publisher Edition Year Other Details
No.
1
Andrew S. Computer
Pearson
5th
2012 ISBN:
Tanenbaum Networks
Education Edition
9788131787571
2

3

4

5

Behrouz A
Forouzan

Data
Communications
and Networking
William
Data and
Stallings
Computer
Communications
Douglas e. Computer
Comer
Networks and
Internets with
Internet
Applications
James F.
Computer
Kurose and Networking: A
Keith W. top down
Ross
approach

Tata
Mcgraw
Hill
Pearson
Education

5th
2013 ISBN:
Edition
9781259064753
8th
2007 ISBN:
Edition
9788131715369

Pearson
4th
2008 ISBN:
Education Edition
9788177589276

Pearson
6th
2012 ISBN-10:
Education Edition
0132856204

Assessment will consists of following components
1. Two Minors (30% Weightage )
Course
2. Quiz (7.5%)
Assessment
3. Assignment (7.5%)
Methods
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1. Understand fundamental concepts of computer networks and apply them to solve different networking problems.
2. Ability to apply different concepts of physical layer, data link layer and network layer to solve different networking problems.
3. Understand different concepts of transport layer, session layer, presentation layer and application layer and apply them to networks.
COs
PO
A
B C
D E F
G H I
J
K L
1
X
X
2
X
X
X
3
X
X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

COMPUTER NETWORK (Practical)
CSE 563
Semester: - 5th
50

Credits
LTP
Elective

02
003
N

3 Hours
Time
Practical should be covered based on the following directions:
1. To familiarize with the various basic tools (crimping, krone etc.) used in establishing a
LAN.
2. To study various topologies for establishing computer networks.
3. To familiarize with switch , hub, connecters, cables (cabling standards) used in networks 4. To familiarize with routers & bridges
5. To use some basic commands like ping, trace-root, ipconfig for trouble shooting network related problems.
6. To use various utilities for logging in to remote computer and to transfer files from / to remote computer.
7. To develop a program to compute the Hamming Distance between any two code words.
8. To develop a program to compute checksum for an m bit frame using a generator polynomial. 9. To develop a program for implementing / simulating the sliding window protocol
10. To develop a program for implementing / simulating a routing algorithm
11 To study various IEEE standards (802.3, 802.11, 802.16)

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

PRINCIPLES OF PROGRAMMING LANGUAGES
CSE-504
Semester: - 5th
External: - 50
Internal: 50

Credits
LTP
Elective

04
310
N

Programming Fundamentals (CS101/201), Object Oriented
Programming (CSE414)

Contact Hours

45

Time

3
Hou
rs
Objectives This course should provide the students with a fairly good concept of fundamental concepts and design issues of programming languages and become familiar with major programming paradigms. Understand similarities and differences between models and know when to use them and also learn programming techniques appropriate for each model. The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
5
Introduction:
Study of principles and major concepts in various programming paradigms like imperative, functional, object-oriented and logic programming. Introduction to various phases of compilers,
Formal translation models: BNF Grammars.
7
Imperative programming:
Location, reference and expressions, assignment and control, data types, blocks, procedures and modules. Object Oriented Programming: Classes and objects, abstraction and encapsulation, inheritance,
Polymorphism, virtual functions and classes, abstract classes.
8
Logic Programming:
Unification, SLD-resolution, Backtracking, Cuts.
Concepts Of Concurrent Programming: Processes, synchronization primitives.
SECTION-B
10
Functional Programming:
Functions as first class objects, higher order functions, polymorphic data types, type checking and type inference
10
Introduction to storage management:
Static storage management, Heap storage management.
Illustration of the above concepts using representative languages: C++, Java, and Prolog etc. 5
Sugg S.
Authors
Title
Publisher
Edition Year Other este No.
Details
th d Prattt&Zelk Programming
Pearson
5
1.
Boo owrtz, Languages:
Education
ks
Design &
Implementation
Friedman,
Essentials of
MIT Press
Latest
2
Wand, and Programming
2001, ISBN
Haynes
Languages,
0262062178,
9780262062176

3

Bruce J.
Principles of
MacLennan Programming
Languages:
Design,
Evaluation, and
Implementation

Ot her Re co m me nd

Oxford
Latest
University
Press US, 1999,
ISBN
0195113063,
9780195113068

ed Text/Material
1. Programming in Standard ML 97: A Tutorial Introduction by Stephen Gilmore,
Laboratory for Foundations of Computer Science, The University of Edinburgh ,
September 1997 (Revised: July 1998, April 2000, Jan 2003) Available at : http://www.dcs.ed.ac.uk/home/stg Assessment will consists of following components
1. Two Minors (30% Weightage )
Cou
2. Quiz (7.5%) rse 3. Assignment (7.5%)
Asse
4. Attendance (5%) ssme 5. Final Exam (50%) nt Met hods 1. Understand different language concepts and how various operations and principles are
Cou
implemented by different programming languages. rse 2. Demonstrate use of syntax related concepts including context free grammars, parse
Outc
trees , recursive descent parsing, printing and interpretation. ome s
3. Analyze, design, implement and test various language paradigms and understanding importance of each for various applications
4. Analyzing semantic issues associated with function implementations, including variable bi nding, scoping rules, parameter passing, and exception handling.
5. Improve skills in programming techniques for development of new applications.
Map
ping of Cou rse Outc ome s with POs

1
2
3
4
5

A
X

B
X

C

D

E

X

X

X
X

X
X

PO
F
G

H

I

J

K

L

X

X

X

Branch: Computer Science and Engineering
Title
Code
Max. Marks
Prerequisites
Objectives

Note for
Examiner

DISCRETE STRUCTURES AND
COMPUTATIONAL LOGIC
CS 517
Semester: - 5th
External: 50
Internal: 50

Credits

4

310
LTP
N
Elective
45
Contact
Hours
3 Hours
Time
· To get familiar and understand the fundamental notions in discrete mathematics. · To introduce the knowledge of core mathematical foundation of computer science, · To introduce some basic foundation of Artificial Intelligence.
· To introduce the basic properties of graphs and trees and model simple applications. Examiner will set eight questions covering four questions from each section.
Candidates will be required to attempt five questions, selecting at least two from each section.

SECTION-A
Set Theory, Relations & Functions:
Set Theory, Relations & Functions: Sets, Algebra of Sets, Finite Sets, Power Sets,
Partitions, Counting Principles, Product sets , Relations, Type Of Relations, Closure
Properties, Equivalence Relations, Partial ordering Relations & Lattice, Functions,
Type of Functions, Recursive Functions.
Graph Theory & Trees:
Graph Theory & Trees: Introduction, Graphs Multigraph, Isomorphic Graph,
Homeomorphic Graphs, Paths & Circuits, Shortest Paths In waited Graphs,
Eulerian&Hamiltonial Paths & Circuits, Konigsberg Bridge, Complete , Regular,
Bipartite Graphs, Planner Graphs, Graph Coloring, Graph Traversal Techniques.Trees,
Binary Search Trees , Complete & Extended Binary Trees.
SECTION-B
Propositional Logic:
Introduction, propositions, compound propositions, basic logical operations, , propositions and truth tables, tautologies and contradiction, logical equivalence, algebra of propositions, conditional and biconditional statements, arguments, logical implications, functions, quantifiers.
Predicate logic:
Representing- simple facts, instance, and Isa relationship. Computable functions and predicates resolution: conversion to clause form, unification algorithm, resolution in proposition and predicate logic.
Computational Theory:
Finite Automata: NFA, DFA, NFA to DFA, state minimization, Moore and Mealy
Machines, Regular expressions, grammars, Pushdown automata, Turing Machines

10 hrs

10 hrs

8hrs

7 hrs

10 hrs

Suggested
Books

S.
Authors
No.
1.
C.L.Liu

Title

Publisher

Edition

Elements of
Discrete
Mathematics

Tata
McGraw
Hill

Latest
Edition

2.

Artificial
Intelligence
Introduction to automata theory, Languages and computation
Discrete
Mathematics,
McGraw
Hill,
Introduction
to languages and the theory of computation, Discrete
Mathematical
Structures ,

McGraw
Hill
Narosa,

Third
2010
Edition
First Edition 1979

McGraw
Hill,

Latest
Edition

McGrawHill,

international 1991
Editions,

3.

Elaine Rich,
Knight
Hopcroft.
J.E., Ullman
J.D.

4.

Lipschutz

5.

Martin. J.C.

6.

Course
Assessment
Methods

Course
Outcomes

Mapping of
Course
Outcomes with POs

Year Other
Details
2012

2012

B. Kolman,
PHI
latest
2004
R. C. Busby
Edition
and S. C.
Ross
Assesment will consists of following components
· Two Minors (30% Weightage )
· Quiz (7.5%)
· Assignment (7.5%)
· Attendance (10%)
· Final Exam (50%)
1. Students will understand fundamental discrete mathematical concepts used in computer science will apply them in problem solving and analysis.
2. Students will understand many aspects of graph theory and its applications. 3. Student will be familiar with formal mathematical reasoning, e.g. logic, proofs used in Artificial Intelligence.
4. Students will demonstrate and understand the theoretical foundations of computer science.
Learning
Outcome

POs
A

B

1.

*

2.
3.

C

D

E

*

*

*

*

*

*

*

*

*

*

*

F

G

H

I

J

K

*

L

4.

*

*

*

*

Third Year - Sixth Semester
Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites
Objectives

WEB TECHOLOGIES
CSE 611
External: 50

Semester: - 6th
Internal: 50

Credits
LTP
Elective

4
310
N

Computer Network (CSE513), Programming
Fundamentals (CS101/201)

45
Contact
Hours
Time
3 Hours
Aim of this course is to familiarize the students with current technologies used in Web development and maintenance
1. To introduce the concepts of Internet ,WWW and underlying technologies
2. To enable the student to use of HTML, DHTML, CSS for Static Webpage creation. 3. To introduce the concept of JavaScript for Client Side programming.
4. To introduce the concept of byte code and Java Programming to develop architecture (Platform) neutral application.
5. To study the concept of XML for data interchange across different platforms
6. To introduce the concept of PHP for various web servers
7. To demonstrate the concept of integrating AJAX and PHP with MySQL.

Note for
Examiner

The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
INTERNET AND WORLD WIDE WEB:
4
Introduction, Internet Addressing, ISP, types of Internet Connections, Introduction to
WWW, WEB Browsers, WEB Servers, URLS, http, WEB applications, Tools for WEB site creation.
HTML: Introduction to HTML, Lists, adding graphics to HTML page, creating tables, 6 linking documents, frames, DHTML and Style sheets.
Java Script: Introduction, programming constructs: variables, operators and 11 expressions, conditional checking, functions and dialog boxes, JavaScript DOM, creating forms, introduction to Cookies.
SECTION-B
JAVA: Introduction to java objects and classes, control statements, arrays, inheritance, polymorphism, Exception handling.
XML: Why XML, XML syntax rules, XML elements, XML attributes, XML DTD displaying XML with CSS.
AJAX: Introduction, HTTP request, XMHttpRequest, AJAX Server Script, AJAX
Database.
PHP: Introduction, syntax, statements, operators, sessions, E-mail, PHP and MySQL,
PHP and AJAX.
Suggested
Books
S.
Authors
Title
Publisher
Edition
No.
1
Deitel,Deitel,Nieto, XML How to
Pearson

6
6
6
6

Year

2

and Sandhu
Herbert Scheldt

3

Ivan Bayross
Commercial,

4

Program,
Java 2: The Complete
Reference
: Web Enabled
Development
Application

Schafer
Textbooks.

HTML,CSS,
JavaScript,Perl,
Python and PHP

Education.
TMH

Fifth
Edition

BPB

Wiley
India

Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1. Understand the core principle on which Internet and WWW operates and ability to create static web pages using HTML, CSS and DHTML.
2. Ability to create dynamic and interactive web contents using the concept of
JavaScript, Session and Cookies in Software development.
3. Understand the basic principle of Object Oriented Technology and ability to create powerful but robust standalone application using Java.
4. Understand the concept of add on technologies like AJAX, XML and ability to develop WebPages using PHP and AJAX and MySQL for server side scripting
PO

COs
A

I

J

K

L

*

*

*

*

*

2

*

*

*

*

*

3

*

4

*

*

*

1

*

B

C

D

*

E

F

G

H

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

WEB TECHNOLOGIES (Practical)
CSE 661
Semester: - 6th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:
1. Creation of Web pages using: HTML, DHTML
2. Creation of Web pages using JavaScript
3. Implementing basic concepts of Java
4. Creation of Web pages using AJAX
5. Database and AJAX
6. XML
7. PHP

02
003
N
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

DISTRIBUTED SYSTEMS
CSE612
External: 50

Objectives

1.

Semester: 6
Internal: 50

Credits
LTP
Elective

4
310
N

Operating System (CSE 511), Computer Networks
(CSE513)

2.
3.
4.
5.

45
Contact
Hours
3 Hours
Time
To introduce distributed systems, their architecture, types and enabling technologies To make them understand how communication takes place in a distributed environment To introduce issues related to process execution, naming and security in distributed systems To make them understand distributed systems by studying existing systems
To make them familiar with the design and implementation issues of distributed systems Note for
Examiner

The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
6
Introduction to Distributed Systems
Definition of distributed systems, their objectives, types, architecture, self management in distributed systems, introduction to XML, SOAP, service oriented architecture.
6
Communication
Interprocess communication, Remote Procedure Call (RPC), Remote Method
Invocation (RMI), Remote Object Invocation, Message Oriented Communication.
6
Processes
Introduction to threads, threads in distributed and non distributed systems, virtualization, client side software, design issues for servers, software agents.
5
Naming
General issues with respect to naming, flat naming structured naming, name resolution, implementation of a name space, domain name system, X.500 name space.
SECTION-B
6
Security
Introduction to security in distributed systems, general issues in authentication and access control, security management: key management, secure group management, authorization management; examples: kerberos, x.509 certificates.
6
Distributed Object-based Systems
Introduction to distributed object based systems, overview of CORBA and DCOM and their comparison.
5
Distributed File Systems
Introduction to distributed file systems, their examples: SUN network file system,
CODA file system, comparison of distributed file systems.
5
Document-based Systems
Introduction to document-based systems, their examples, World Wide Web (WWW),

LOTUS NOTES, comparison of WWW and LOTUS NOTES.
Suggested
Books

S. No.

Authors

Title

Publisher

Edition Year

1

Andrew S. Distributed Pearson
Second
Tanenbaum SystemsEducation Edition
Principles
and
Paradigms

2

George
Coulouris,
Jean
Dollimore,
Tim
Kindberg

3

William
Buchanan

Other
Details

Distributed Pearson
Fourth
Systems
Education Edition
Concepts
and
Design

Distributed McGrawSystems
Hill
and
Networks
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
After studying this course, students will be able to:
Course
Outcomes
1. Differentiate between a distributed and a network system and understand how communication takes place in a distributed environment.
2. Understand how process execution in distributed systems is different from process execution in non-distributed systems and design and implement of a Name-Space.
3. Identify Security Risks and their handling mechanisms in Distributed Environment.
4. Understand and design distributed object based systems, distributed file based systems and document based systems.
Mapping
Course
POs
of Course
Outcome
A B C D E F G H
I J K L
Outcomes
1
*
*
*
with POs
2
*
*
*
3
4

*

*

*
*

*

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites
Objectives

Note for
Examiner

Computer Graphics
CSE 613
External: - 50

Semester: - 6th
Internal: - 50

Credits
LTP
Elective

04
310
N

45
Contact
Hours
3 Hours
Time
This course offers a good understanding of computer graphics concepts and prepares the students to be in a position to understand the working principle of different Video display monitors. The detailed description of graphics based algorithms enables students to draw the various geometric shapes as well as to perform 2-D & 3-D transformations. This course further discusses the application of computer graphics concepts in the development of various applications. The detailed objectives of this course as follows:
· Application areas of Computer Graphics
· Working of CRT and LCD based monitors
· Drawing of geometric output primitives
· 2-D transformation and viewing system
· 3-D transformation and viewing system
· Splines curve, their types and representation
· Computer Animations, Classification of visible surface detection methods.
Object Oriented Programming (CSE414)

The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.

SECTION-A
7
Overview of Graphics Systems:
Video Display Devices, Direct View Storage Tubes, Flat Panel Displays: Emissive and
NonEmissive Displays; Plasma Panel, Thin Film Electroluminescent and Liquid Crystal
Displays, Color Display Techniques: Shadow Mask and Beam-penetration Methods, Three
Dimensional Viewing Devices, Raster Scan Systems, Display Processor, Random Scan
Systems, Co-ordinate Representations, Screen Coordinates. Language Basics
7
Output Primitives:
Points and Lines, Line Drawing Algorithms: DDA Algorithm, Bresenham s Line
Algorithm, Circle Generating Algorithm: Mid point circle algorithm, Ellipse Generating
Algorithms: mid point ellipse algorithm, Pixel Addressing and Object Geometry, Boundary
Fill Algorithms, Flood Fill Algorithms, Character Generation, Line, Area-Fill and Character
Attributes.
8
Two Dimensional Geometric Transformations and Viewing:
Basic Transformations: Translation, Rotation and Scaling, Matrix Representations,
Composite Transformations, Viewing Pipeline, Window to Viewport Coordinate
Transformation, Clipping Operations: Line, Polygon, Curve and Text Clipping.
SECTION-B
8
Three Dimensional Concepts, Transformations and Viewing:
Three Dimensional Display Methods, Three Dimensional Transformations; Three
Dimensional Viewing Pipeline; Viewing Coordinates; Specifying the View Plane,
Projections: Parallel Projections, Perspective Projections.

Hrs

8
Splines and Curves:
Curved Lines and Surfaces, Spline Representations, Cubic Splines, Bezier Curves and their properties, B-Spline Curves.
7
Visible Surface Detection Methods:
Classification of Visible Surface Detection Methods, Back Face Detection, Depth Buffer,
A-Buffer, Scan Line and Depth-Sorting Methods, Wireframe Methods, Concepts of
Computer Animation, Design of Animation Sequences.
Suggested
Books
1. Donald Hearn, M.P. Baker : Computer Graphics C Version, Second
Edition, Pearson Education.
References:
1. J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes : Computer Graphics: principles and practice, Second Edition, Pearson Education.
2. Z. Xiang, R.A. Plastock : Computer Graphics, Second Edition, Schaum s
Outlines, Tata McGraw-Hill.
3. N. Krishnamurthy: Introduction to Computer Graphics, Tata McGrawHill.
4. David F. Rogers, James Alan Adams : Mathematical Elements for
Computer Graphics,
Tata McGraw-Hill.
1. S. Harrington : Computer Graphics: A Programming Approach, Tata
McGraw-Hill.
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1. On successful completion of this course, the student should be able to: Understand the basic preliminaries and role of computer graphics in different areas.
2. Classify, Compare and demonstrate the working of video display monitors based on
CRT and Flat Panel displays.
3. Study the various geometric shapes (lines, curves, circle, polygon etc) and analysing the different algorithms to plot pixel points corresponding to each. Apply individual algorithm to a variety of numerical problems.
4. Define the simple and composite transformations in 2-D and 3-D system and then map the same to solve the transformations problems. Analysing the spline curves and their variants for visible surface detection methods.
COs
PO
A
B C
D E F
G H I
J
K L
1
X
X
X X
2
X
X
3
X
X
X
X X
4
X
X
X
X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

COMPUTER GRAPHICS (Practical)
CSE 663
Semester: - 6th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:
1. Introduction to graphics programming in C/C++.
2. Initializing graphics system. Basic graphics functions.
3. Drawing lines, circles, ellipses and other common objects.

02
003
N
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites
Objectives

Artificial Intelligence
CS 614
External: 50

Credits
LTP
Elective

4
310
N

Discrete Structures (CSE517)
·
·
·
·
·

Note for
Examiner

Semester: - 6th
Internal: 50

45
Contact
Hours
3 Hours
Time
To introduce the AI techniques to solve problems and search strategies to find optimal solution paths from start to goal state.
To introduces different knowledge representation methods in AI Programs.
To introduce different design techniques for Game Playing Programs.
To introduce the AI Agents their design, planning and learning techniques.
To introduce the natural language processing and expert systems.

The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. SECTION-A
Introduction:
Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria of success, Intelligent Agents, Nature and structure of Agents, Learning Agents
Problem solving techniques:
State space search, control strategies, heuristic search, problem characteristics, production system characteristics., Generate and test, Hill climbing, best first search, A* search,
Constraint satisfaction problem, Mean-end analysis, Min-Max Search, Alpha-Beta
Pruning, Additional refinements, Iterative Deepening
Knowledge representation:
Mapping between facts and representations, Approaches to knowledge representation, procedural vs declarative knowledge, Forward vs. Backward reasoning, Matching, conflict resolution, Non-monotonic reasoning, Default reasoning, statistical reasoning, fuzzy logic
Weak and Strong filler structures, semantic nets, frame, conceptual dependency, scripts.
SECTION-B
Planning:
The Planning problem, planning with state space search, partial order planning, planning graphs, planning with propositional logic, Analysis of planning approaches, Hierarchical planning, conditional planning, Continuous and Multi Agent planning.
Learning :
Forms of Learning, inductive learning, Decision trees, Computational learning theory,
Logical formulation, knowledge in learning, Explanation based and relevance based learning, statistical learning, Learning with complete data and hidden variables, instance based learning.
Introduction to Natural Language processing and Expert system:
Basic Tasks of Natural Language processing, Expert systems, Expert system examples,
Expert System Architectures, Rule base Expert systems, Non Monotonic Expert Systems,
Decision tree base Expert Systems.

Hrs
6

9

8

6

10

6

Suggested
Books

S. No.

Authors

Title

Publisher

Edition Year

1.

Stuart
J.Russel,
Peter Norvig

AI: A
Modern
Approach

Pearson
Education

Latest
Edition

2.

Other
Details

2012

Elaine Rich, Artificial
McGraw
Third
2010
Knight
Intelligence Hill
Edition
SarojKaushik Artificial
Cengage
First
2011
3.
Intelligence, Learning,
Edition
Partick
Artificial
Addison
Latest
2012
4.
Henry
Intelligence, Wesley
Edition
Winston
George
Artificial
Pearson
Latest
2010
5.
Luger
Intelligence Education
Edition
DAN, W.
Introduction PHI latest 2011
6.
Patterson to AI and
Edition
Expert
Systems, ,
A.J. Nillson
Principles
Narosa latest 2010
7.
of AI, publications, Edition
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Students will understand fundamental AI concepts and and identify a range of
Course
symbolic and non-symbolic AI techniques including search and planning
Outcomes
procedures.
2. Students will demonstrate an understanding of various searching algorithms such as adversarial search and game-playing commonly used in artificial intelligence software. 3. Student will be able to use different knowledge representation techniques used in
AI Applications.
4. Students will demonstrate an understanding of agent-based AI architectures and an understanding of Planning and logic-based agents.
Mapping
Learning
POs
of Course
Outcome
Outcomes
A B C D E F G H I J K L with POs
1.
*
*
2.

*

*

*

3.

*

*

*

4.

*

*

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

ARTIFICIAL INTELLIGENCE (Practical)
CSE 663
Semester: - 6th
50

Credits
LTP
Elective

02
003
N

3 Hours
Time
Practical should be covered based on the following directions:
1. Program Related to Problem Solving techniques of AI
Breadth First Search
Depth First Search
Heuristic Search
Best Search
Min-Max Search with alpha-beta pruning
Tic-Tac-Toe problem
N-Queens and N-Knight problem
Unification Algorithm
2. Introduction To AI Languages such as LISP, PROLOG
3. Representing Knowledge using RuleML
4. Using semantic Web
5. Knowledge of using Neural Networks, Fuzz logic, genetic algorithms
6. Other new AI Techniques

Branch: Computer Science and Engineering
Title

MODELING & SIMULATION

Code
Max.
Marks
Prerequisites

CSE 615
External: - 50

Credits
LTP
Elective

Semester: - 6th
Internal: - 50

Data Structures (CSE 311) and Discrete Structures and
Computational Logic (CSE 517)

04
310
N

Contact Hours

45

3 Hours
Time
To introduce the simulation techniques to solve real time problems where experimentation on the actual system is very risky.
· To introduce different discrete event and continuous simulation methods.
· To introduce different techniques for generating random numbers and random variates following various distributions.
· To introduce different queuing techniques for single server and multi server systems.
· To introduce the different simulation languages like MATLAB and GPSS.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks.
Note for
First question, covering the whole syllabus and having questions of conceptual nature, will be
Examiner
compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
Introduction:
What is modeling and simulation, application areas, definition and types of system, model and 5 simulation, introduction to discrete-event and continuous simulation.
Simulation Methods:
Discrete-event Simulation, Time advance Mechanisms, Components and organization of 10
Discrete-event simulation, Flowchart of next-event time advance approach, Continuous
Simulation, Monte Carlo Simulation.
Queuing Models:
Single server queuing system, introduction to arrival and departure time, flowcharts for arrival 10 and departure routine. Event graphs of queuing model. Determining the events and variables,
Event graphs for inventory model.
SECTION-B
Random Numbers:
Introduction to Random Numbers, Importance of Random Numbers in Simulation, Mid-Square 5 random number generator, Residue method, Arithmetic Congruential generator, Testing
Numbers for Randomness, Chi-Square Test.
Distribution Functions:
Stochastic activities, Discrete probability functions, Cumulative distribution function,
Continuous probability functions. Generation of random numbers following binomial 10 distribution, Poisson distribution, continuous distribution, normal distribution, exponential distribution, uniform distribution.
5
Simulation Languages:
Basic Introduction to Special Simulation Languages:-GPSS/ MATLAB/ Network Simulators.
Objectives

Suggested
Books

·

S. No.
1

Authors
Averill M.
Law

Title
Simulation
Modeling and Analysis

Publisher
Tata
Mcgraw
Hill

Edition Year
4th
2007
Edition

Other Details
ISBN: 9780070667334

2

Geoffery
Gordon

3

D.S. Hira

4

Stephen J.
Chapman

5

Jerry
Banks, John
S. Carson,
Barry L.
Nelson and
David M.
Nicol
RudraPratap Getting
Oxford
Started with
University
MATLAB: A Press.
Quick
Introduction for Scientists and Engineers

6

System
Simulation

PrenticeHall of
India
System
S. Chand
Simulation
Publication
MATLAB
Thomson
Programming Learning for Engineers
DiscretePrenticeEvent
Hall of
System
India
Simulation

2nd
2001
Edition

ISBN: 81-203-0140-4

1st
2001
Edition
3rd
2005
Edition

ISBN: 81-219-2059-0

5th
2009
Edition

ISBN-10: 0136062121

8th
2009
Edition

ISBN-0199731241

ISBN-981-254-893-9

Course
Assessment Assessment will consists of following components
1. Two Minors (30% Weightage )
Methods
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Understand the continuous and discrete event simulation techniques and apply them suitably
Course
to real time problems where experimentation on actual system is risky.
Outcomes
2. Analysing different procedures to generate random numbers and apply them for implementation of different simulation systems.
3. Understand different simulation languages like MATLAB and GPSS and apply them to simulate different systems.
Mapping
of Course
COs
PO
Outcomes
A
B C
D E F
G H I
J
K L with POs
1
X
X
2
X
3
X
X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

MODELING AND SIMULATION (Practical )
CSE 665
Semester: - 6th
50

Credits
LTP
Elective

02
003
N

3 Hours
Time
Practical should be covered based on the following directions:
1. Programming in MATLAB: Introduction, Branching statements, loops, functions, additional data types, plots, arrays, inputs/outputs etc.
2. Introduction regarding usage of any Network Simulator.
3. Practical Implementation of Queuing Models using C/C++.

Fourth Year - Seventh Semester
Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

COMPILER DESIGN
CSE711
External:-50
Programming
microprocessor
(CSE511)

Semester: -7th
Internal: -50

Credits
LTP
Elective

Fundamentals
(CS101/201), Contact
(EC317), operating system Hours

4
310
N
45

3 Hours
Time
Objective This course will provide the in-depth knowledge of different concepts involved while designing a compiler. s Note for The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Examiner marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
5
Introduction:
Compilers and Translators; The phases of the compiler Lexical Analysis, Syntax
Analysis, Intermediate Code Generation, Optimization, Code generation,
Bookkeeping, Error handling.
5
Lexical Analysis:
The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering,
Specifications of a token, Recognition of a tokens, Finite automata: Regular expressions, NFA, DFA, Design of a lexical analyzer generator.
12
Syntax Analysis:
The role of a parser, Context free grammars, Writing a grammar, Top down
Parsing: Recursive decent parser, Predictive parser, Bottom up Parsing: Handles,
Viable prefixes, Operator precedence parsing, LR parsers: SLR, LALR, CLR.
Parser generator (YACC).Error Recovery techniques for different parsers
Hrs
SECTION-B
4
Syntax directed translation:
Syntax directed definitions, Synthesized and inherited attributes, Construction of syntax trees.
6
Run time environments:
Source language issues (Activation trees, Control stack, scope of declaration,
Binding of names), Storage organization (Subdivision of run-time memory,
Activation records), Storage allocation strategies, Symbol tables: storage, data structures used
3
Intermediate code generation:
Intermediate languages, Graphical representation, Three-address code,
Implementation of three address statements (Quadruples, Triples, Indirect triples)
10
Code optimization and code generation:
Introduction, Basic blocks & flow graphs, DAG, principle sources of optimization: loop optimization, eliminating induction variable, eliminating common subexpression, loop unrolling, loop jamming etc. Peephole optimization, Issues in the design of code generator, a simple code generator, Register allocation & assignment. Suggested

Books

S.
Authors
No.
Aho,
1
Ullman
2

Course
Outcomes

Mapping of Course
Outcomes
with POs

Title

Publisher

Principles
Compiler
Design

Edition Year

Other
Details

of Nar osa Publication

Dhamdhere

Compiler
Macmillan,
ConstructionIndia 198
Principles a nd Practice
3
Holub
Compiler
PHI
Latest
Design in C
Edition
1. To understand the functioning of different phases of a compiler.
2. To understand the implementation details and concepts behind each phase of the compiler by stressing more on the syntax analysis and further on different parsing techniques. 3. To understand need of intermediate code generation, code optimization and actual machine code generation techniques.
COs
1
2
3

A
X
X
X

B
X
X
X

C
X
X
X

D
X
X
X

E
X
X
X

PO
F
X

G
X

H

I

J

K

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

COMPILER DESIGN (PRACTICAL)
CSE 761
Semester: - 7th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:
1. Implementation of lexical analyzer for a hypothetical language.
2. Implementation of LL parser.
3. Implementation of SLR parser.
4. Implementation of CLR parser.
5. Implementation of LALR parser.

02
003
N
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

Multimedia System Design
CSE712
External: -50

Semester: -7th
Internal: - 50

Credits
LTP
Elective

4
310
N

Peripheral Device Interface (CSE313), Computer
Graphics (CSE613)

45
Contact
Hours
3 Hours
Time
Objectives To provide an in-depth understanding of Multimedia system design Enabling technologies and standards.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
4
Introduction:
Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia Systems and their Characteristics, Challenges, Desirable Features, Components and Applications,
Trends in Multimedia
6
Multimedia Technology:
Multimedia Systems Technology , Multimedia Hardware devices, Multimedia software development tools, Multimedia Authoring Tools, Multimedia Standards for Document
Architecture, SGML, ODA, Multimedia Standards for Document interchange, MHEG,
Multimedia Software for different media.
4
Storage Media :
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards,
DVD and its standards, Multimedia Servers
8
Audio:
Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample
Rates and Bit Size, Nyquist's Sampling Theorem Typical Audio Formats Delivering
Audio over a Network , Introduction to MIDI (Musical Instrument Digital Interface),
Components of a MIDI System Hardware Aspects of MIDI ,MIDI Messages. Audio
Compression, Simple Audio Compression Methods, Psychoacoustics ,MPEG Audio
Compression
SECTION-B
6
Basics of Compression :
Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy
Encoding, Run-length Encoding, Pattern Substitution, Basics of Information theory,
Huffman Coding, Adaptive Huffman Coding, Arithmetic Coding, Lempel-Ziv-Welch
(LZW) Algorithm, Source Coding Techniques: Transform Coding, Frequency Domain
Methods, Differential Encoding.
6
Image and Graphics Compression :
Color in Images, Types of Color Models, Graphic/Image File Formats: TIFF, RIFF,
BMP, PNG, PDF, Graphic/Image Data, and JPEG Compression, GIF Compression.
Video Compression:
6
Basics of Video, Video Signals, Analog Video, Digital Video, TV standards, H. 261
Compression, Intra Frame Coding, Inter-frame (P-frame) Coding, MPEG Compression,
MPEG Video, The MPEG Video Bit stream, Decoding MPEG Video in Software.
5
Multimedia Communication:

Building Communication network, Application Subsystem, Transport Subsystem, QOS,
Resource Management, and Distributed Multimedia Systems.
Suggested
Books

S.
Authors
Title
No.
Ralf Steinmetz
Multimedia
1 amdKlaraNahrstedt Computing
Communications
and Applications
2
ParagHavaldar,
Multimedia
Gerard Medioni
Systems
3
4

Prabhat K.
Andleigh,
KranThakkar
Fred Halsall

Publisher

Edition Year Other
Details

Pearson
Educations

Cengage
Learning
publication
Multimedia System PHI
Latest
Design
Edition

Multimedia
Pearson
Communications
Education
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Knowledge of Multimedia Tools and Standards
Course
2. Understanding of Compression standards
Outcomes
3. Ability to understand current technologies in multimedia
4. Issues in multimedia communication systems
Mapping
of Course
Outcomes
with POs

CO
1
2
3
4

A B
*

C D E
*
*
*
*
*

PO S
F G H I

J

K L

*
*
*

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

SOFTWARE TESTING AND QUALITY ASSURANCE
CSE713
Semester: -7th
External: 50
Internal: 50

Credits
LTP
Elective

4
310
N

45
Contact
Hours
3 Hours
Time
This course offers a good understanding of the concepts, methods and techniques of
Objectives
software testing and quality assurance and prepares students to be in a position to develop error free and quality software.
1. To study the concept of quality control and quality assurance.
2. To study risk management and technique to manage changing requirement of software. 3. To study change control management process to tackle changing requirement of system 4. To study various software testing strategies for testing different type of system under test.
5. To enable the student to extend their testing concept to real scenarios and specialized systems.
6. To study the concepts of quality metrics and reporting formats.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
7
Introduction:
Overview of Software Engineering, Software Process, Characteristics of a Software Process,
Process Models, Project Management Process and its Phases, Software Measurements, Metrics,
Scheduling, Estimation.
8
Software Quality Assurance Concepts and Standards :
Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software Reviews,
Formal Technical Reviews, Review Guidelines, Software Reliability, Software Safety, Quality
Assurance Standards, ISO 9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six
Sigma, SPICE, Software Quality Assurance Metrics.
7
Risk Management and Change Management:
Software Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM Plan,
Software Configuration Management, Baselines, Software Configuration Items, SCM Process:
Version Control, Change Control, Configuration Audit, Configuration Management for Web
Engineering.
Programming Fundamentals (CS101/201)

SECTION-B
7
Software Testing:
Testing, Verification and Validation, Test Strategies for Conventional and Object Oriented
Software, Unit Testing, Integration Testing, Validation Testing, Alpha and Beta Testing,
System Testing, Recovery Testing, Security Testing, Stress Testing, Performance Testing,
Metrics for Source Code, Metrics for Testing, Debugging Process, Debugging Strategies.

Testing Techniques: Software Testing Fundamentals, Black Box and White Box Testing,
Basis Path Testing, Flow Graph Notation, Independent Program Paths, Graph Matrices, 8
Control Structure Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph Based
Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Object Oriented Testing
Methods: Applicability of Conventional Test Case Design Methods, Fault-Based Testing,
Scenario-Based Testing, Random Testing and Partition Testing for Classes, Interclass Test
Case Design.
8
Testing Process and Specialized Systems Testing:
Test Plan Development, Requirement Phase, Design Phase and Program Phase Testing, Testing
Client/Server Systems, Testing Web based Systems, Testing Off-the-Shelf Software, Testing in
Multiplatform Environment, Testing for Real Time Systems, Testing Security
Suggested
Books
S.
Authors
Title
Publisher
Edition Year
No.
1
Ian
Software Engineering Pearson
Seventh
Somerville
Education.
Edition
2
Pressman
Software Engineering: TataMcGraw- Sixth
A Practitioner's
Hill.
Edition,
Approach
3
William E.
Effective Methods for John Wiley
Second
Perry
Software Testing
Edition
References
1.

Course
Assessment
Methods

Course
Outcomes

Pfleeger

Software Engineering: Pearson
Theory and Practice
Education
2
K..Aggarwal, Software Engineering New.Age
Yogesh
International
Singh.
.
3
PankajJalote
An Integrated
Narosa
Approach to Software
Engineering
4
.Nina S
Software Quality
Narosa
Godbole
Assurance
:Narosa.
Principles and
Practice,
5
Boris Beizer Software Testing
Techniques
Assessment will consists of following components
1. Two Minors (30% Weightage )
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)

Second
Edition
Second
Edition

Second
Edition
Second

Second
Edition,

By the end of the course, students should be able to:1. Understand the concept of Software Testing and Quality Assurance to develop cost effective software system.
2. Understand the essence of risk management and control management and ability to develop RMMM plan to mitigate risk and manage the artifacts of software system..
3. Ability to tests the system at various levels and dimensions to control error generation and propagation which ultimately makes debugging successful and cost

effective.
4. Ability to extend the testing concept to real scenarios and specialized systems like multiplatform, Real Time system, Client-Server system.
Mapping of
Course
Outcomes with POs

PO

COs
A

B

C

1

*

2

D

E

F

G

H

I

J

K

*

*

*

*

3

*

*

4

*

*

*
*

*

*
*

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

SOFTWARE
TESTING
AND
QUALITY Credits
ASSURANCE (Practical)
CSE 763
Semester: - 7th
LTP
50
Elective

02

Time
Practical should be covered based on the following directions:
1. Study of different quality assurance and software testing tools.
2. Use of black box testing techniques to test programs.
3. Use of white box testing techniques to test programs.
4. Use of Object Oriented Testing Techniques to test programs.
5. Use of a software testing tool.
6. Use of a quality assurance tool.
7. Testing a web based system.
8. Design and Implementation of a quality assurance / software testing tool.

3 Hours

003
N

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

INFORMATION SECURITY
CSE 714
Semester: - 7th
External: - 100
Internal: - 50
Computer Network (CSE513)

Credits
LTP
Elective

04
300
Y

45
Contact
Hours
3 Hours
Time
Objectives The subject Information Security aims at providing essential concepts and methods for providing and evaluating security in information processing systems (operating systems and applications, networks, protocols, and so on). In addition to its technical content, the course touches on the importance of following:
· Develop a security mindset: learn how to critically analyze situations of computer and network usage from a security perspective, identifying the salient issues, viewpoints, and trade-offs.
· Basic Encryption and Decryption Algorithms, security threats, challenges in
Information Security
· Security management which describes access control, secure group management and authorization management.
· Various Key management protocols
· Security in Networks and Web
· Firewalls
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
6
Basic Encryption and Decryption:
Attackers and Types of threats, challenges for information security, Encryption Techniques,
Classical Cryptographic
Algorithms: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of
Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere, Vernam Cipher.
7
Stream, Block, Symmetric Key and Asymmetric Key Ciphers:
Rotor based system and shift register based systems. Block cipher: principles, modes of operations. The Data encryption Standard (DES), Analyzing and Strengthening of DES,
Introduction to Advance Encryption Standard (AES), Concept and Characteristics of Public
Key Encryption system, Rivets Shamir-Adlman (RSA) Encryption, Digital Signature
Algorithms and authentication protocols, The Digital Signature Standard (DSA).
Number theory and basic Algebra: Modular Arithmetic, Euclidean algorithm, Random 5 number generation
Key Management Protocols: Solving Key Distribution Problem, Diffie-Hellman 6
Algorithm, Key Exchange with Public Key Cryptography.
SECTION-B
5
Message Authentication and Hash Functions
Authentication Requirements, Authentication Functions, Message Authentication codes,
Hash Functions, Hash Algorithms (MD-5 and SHA-1), Key Management Algorithms.
Network Security: Kerberos, IP security: Architecture, Authentication Header, 5
Encapsulating Security Payload, Digital Signatures and Digital Signature Standards.
Web Security: Web security consideration, secure socket Layer protocol, Transport Layer 6
Security Secure Electronic Transaction Protocol.

Firewalls: Firewall Design principles, Characteristics, Types of Firewall, trusted systems,
Virtual Private Networks.
5
Suggested
S.
Authors
Title
Publisher Edition/ISBN Year
Books
No.
William Stallings
Network
Pearson
1.
Security
Education.38
Essentials,
Applications
and Standards
References:
William Stallings
Cryptography
Pearson
1
and Network
Education.
Security
Principles and practice . Bishop, Matt
Introduction to
Pearson
(2005)
2
Computer
Education,
Security.
Inc./ ISBN: 0Addison321-24744-2.
Wesley
Michael. E. Whitman Principles of
3
and Herbert J.
Information
Mattord
Security
AtulKahate
Cryptography
2nd Edition
4.
& Network
Security,
TMH,
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Understanding of data encryption and decryption techniques (such as caesar Cipher,
Course
Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere, Vernam Cipher
Outcomes
etc.)
2. Ability to apply these techniques on given data by using various softwares like:- RSA
Cryptosystem, Proxy Crypt, Packet Tracer, WireShark etc.
3. Understanding of the methods which authenticates and secure the messages.
4. Contribution towards network security and web security.
Mapping
Course
POs
of Course
Outcomes A B C D E F G H I J K L
Outcomes
I
* *
*
* *
*
* with POs
II
* * * *
*
*
III
IV

*

*

*
*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

BUSINESS INTELLIGENCE
Semester: - 7th
CSE 715
External: - 100
Internal: - 50

Credits
LTP
Elective

04
310
Y

45
Contact
Hours
3 Hours
Time
Objectives
· To introduce the concepts of Business process their requirements, key performance indicators and their evaluation in a typical Business houses.
· To introduces the concept of data warehouses and use of multi dimensional databases and Online Analytical processing.
· To introduce the basic data mining concepts like Association Rule Analysis, classification, clustering and their use in different application domains.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A
Hrs
8
Introduction to Business Intelligence:
Introduction to OLTP and OLAP, 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
8
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 ETL, Introduction to data quality, data profiling concepts and applications.
8
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
SECTION-B
6
Basics of Enterprise Reporting
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and overall architecture
15
Data Mining Functionalities:
Association rules mining, Mining Association rules from single level, multilevel transaction databases, Classification and prediction, Decision tree induction, Bayesian classification, knearest neighbor classification, Cluster analysis, Types of data in clustering, categorization of clustering methods
Suggested
Books

Database Management System (CSE412)

S. No. Authors
Title
Publisher
1.
R N Prasad,
Fundamentals Wiley
SeemaAcharya of Business
India
Analytics

Edition Year
First
2011
Edition

2.

Latest
Edition

.Han and M.
Kamber

Data Mining:
Concepts and
Techniques

Morgan
Kaufman
publishers,
Harcourt

2010

Other Details

3.

David Loshin

4.

Larissa
Terpeluk
Moss,
ShakuAtre
CindiHowson

5.

India pvt.
Ltd
Knowledge Latest
Enterprise. Edition

Business
Intelligence:
The
Savvy
Manager's
Guide.
Business
Addison
Intelligence
Wesley
roadmap

Latest
Edition

Mapping of Course
Outcomes
with POs

2012

Latest
Edition

2012

Latest
Edition

Successful
Tata
Business
McGraw
Intelligence:
Hill
Secrets to making Killer
BI
Applications
6.
Mike Biere
Business
Addison intelligence Wesley for the enterprise Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

2011

2010

1. Students will understand fundamental Business processes, their requirements, evaluation using key performance indicators,
2. Students will demonstrate an understanding of BI framework and its implementation using open source tools.
3. Students will demonstrate an understanding of various concepts related to data warehousing and OLAP.
4. Student will be able to use different data mining representation techniques used in different domains.
Learning
Outcome

POs
A

B

C

D

E

1.
2.

F

G

H

I

J

K
*

*

*

3.

*

*

4.

*

*

L

Branch: Computer Science and Engineering
Title
MOBILE COMPUTING
CSE716
Semester: - 7th
Code
External: - 100
Internal: - 50
Max.
Marks
PreComputer Networks (CSE513) requisites Credits
LTP
Elective

04
310
Y

45
Contact
Hours
3 Hours
Time
Objectives To impart knowledge of mobile and wireless computing systems and techniques.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
6
Mobility:
Issues, challenges, and benefits; Review of mobile and cellular communication technology;
Review of distributed/network operating systems, ubiquitous computing.
4
Global System for Mobile Communication (GSM) System Overview:
GSM Architecture, Mobility Management, Network Signaling, GPRS
4
Mobile IP Networks:
Physical mobility, challenges, limits and connectivity, mobile IP and cellular IP in mobile computing. 6
Mobile Transport Layer:
Transport layer issues in wireless, Indirect TCP, Snoop TCP, Mobile TCP
SECTION-B
5
Wireless LANs:
Introduction to IEEE 802.11, Bluetooth technologies and standards.
7
Mobile Adhoc Networks:
Hidden and exposed terminal problems; Routing protocols: DSDV, DSR, AODV.
7
Mobile Devices and OS:
Various types of Devices, Operating System: PalmOS, WindowsCE, Windows Mobile.
6
Application Development:
WWW programming model, Development Environment for MobileDevices
Suggested
Books

S.
No.
1.

Authors

Title

Publisher

Mobile
Pearson
Communication, Education.
U. Hansman and L. Principles of Springer
2.
Merck.
Mobile
Computing
References:
A. S. Tanenbaum
Computer
Pearson
1
Networks
Education
D.
Milojicic,
F. Mobility
Addison
2
Douglis.
Processes,
Wesley
Computers and
Agents ,
Raj Kamal
Mobile
Oxford
3
Computing
University
Press

Edition/ISBN Year

Jochen Schiller

2nd Ed

4th Ed

4.
Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1.
2.
3.
4.
5.

Awareness of mobile computing and networks.
Working knowledge of GSM architecture.
Learning about mobility issues on TCP/IP.
To understand wireless mobile ad-hoc networks.
To learn about operating system for mobile devices and applications.

Learning
Outcome

POs
A

B

C

D

E

F

G

*
*

*

3.

*
*

*

*

5

*

*

*

*

*

L
*

*

*

4.

J

*

2.

I

K
*

1.

H

*

Fourth Year - Eighth Semester
Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

ADVANCED DATABASE SYSTEMS
CSE811
Semester: - 8th
External: - -50
Internal: - -50

Credits
LTP
Elective

Database Management System (CSE412)

Contact Hours 45

04
310
N

3 Hours
Time
To review various Database concepts, Data models and their architectures.
To introduce Advanced Strategies for implementation of Transaction processing, concurrency control and Recovery management.
To learn how to optimize query processing.
To familiarize with concepts of Distributed databases and their implementation concepts.
To elaborate Significance of Data warehouses and their setup strategies.
To understand role of Data mining, OLAP, OLTP in databases and their implementation strategies. To familiarize with Object oriented databases and their significance.
To expose to various databases like oracle, Sql server, DB2, MySql etc through case studies. Note for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
Objectives

Introduction to Database Systems:
Database System Concepts and Architecture, Data Models, Data Independence, SQL:
DDL, DML, DCL, Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.
Query Processing and Optimization:
Query Processing, Syntax Analyzer, Query Decomposition, Query Optimization,
Heuristic Query Optimization, Cost Estimation, Cost Functions for Select, Join, Query
Evaluation Plans.
Transaction Processing and Concurrency Control:
Transaction Processing Concepts, Concurrency Control Techniques: Two-phase Locking,
Timestamp Ordering, Multiversion, Validation, Multiple Granularity Locking.
Object Oriented and Object Relational Databases:
Object Oriented Concepts, Object Oriented Data Model, Object Definition Language,
Object Query Language, Object Relational Systems, SQL3, ORDBMS Design.

6

6

5
5

SECTION-B
6
Distributed Databases:
Distributed Database Concepts, Advantages and Disadvantages, Types of Distributed
Database Systems, Data Fragmentation, Replication and Allocation Techniques for
Distributed Database Design, Five Level Schema Architecture, Query Processing,
Concurrency Control and Recovery in Distributed Databases.
5
Backup and Recovery:
Types of Database Failures, Types of Database Recovery, Recovery Techniques: Deferred
Update, Immediate Update, Shadow Paging, Checkpoints, Buffer Management.
5
Introduction to Data Warehousing and Data Mining:

Introduction to OLAP, OLTP, Data Warehouse, Data Marts, Data Mining, Data Mining
Process.
7
Commercial Databases:
Commercial Database Products, Familiarity with IBM DB2 Universal Database, Oracle,
Microsoft SQL Server, MySql, their features.
Suggested
Books

S.
Authors
No.
1
RamezElmasri,
ShamkantNavathe
2

3

4

5

6

Title

Publisher

Fundamentals of Database
Systems
Raghu
Database
Ramakrishnan,
Management
Johannes Gehrke
Systems,
C.J. Date
An
Introduction to
Database
Systems
Alexis
Leon, Database
Mathews Leon
Management
Systems
Abraham
Database
Silberschatz,
System
Henry F. Korth, S. Concepts
Sudarshan
S. K. Singh
Database
Systems
Concepts,
Design and Applications

Edition Year Other Details

Pearson
Fifth
2007
Education Edition
Tata
McGrawHill
Pearson
Eighth
Education Edition

Leon
Press
Tata
McGrawHill
Pearson
Education

Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1. Recall various Database concepts with discovery of advanced strategies for
Transaction processing, Concurrency control, Recovery management and Query
Processing.
2. Describe Object Oriented and Distributed databases.
3. Discuss significance of Data ware housing, Data mining, OLAP and OLTP.
4. Examine various Case studies: Oracle, Sql sever, DB2, MySql etc.

1
2

A
X

B
X

C

D

X

X

PO
E F

G

H

I

J

K

L

3
4

X

X

X

X
X

X

X

Branch: Computer Science and Engineering
Title
Code
Max. Marks
Prerequisites
Objectives

Digital Image Processing
CSE812
Semester: -8th
External: -50
Internal: - 50
Computer Graphics (CSE613)

Credits
LTP
Elective
Contact Hours

4
310
N
45

3 Hours
Time
To introduce the various image processing techniques and their applications in different domains. To get students acquainted with computer vision.

Note for
Examiner

The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
6
Introduction to Image Processing:
Digital Image representation, Sampling & Quantization, Steps in image Processing,
Image acquisition, color image representation
12
Image Transformation & Filtering:
Intensity transform functions, histogram processing, Spatial filtering, fourier transforms and its properties, frequency domain filters, , color models, Pseudo coloring, color transforms, Basics of Wavelet Transforms.
Image Restoration:
7
Image degradation and restoration process, Noise Models, Noise Filters, degradation function, Inverse Filtering, Homomorphism Filtering
.
SECTION-B
8
Image Compression:
Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding,
Arithmetic coding, Lossy compression techniques, JPEG Compression.
12
Image Segmentation & Representation:
Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough transforms, region Based Segmentation, Boundary representation,Boundary Descriptors,
Regional Descriptors.
Suggested
Books
S.
Authors
Title
Publisher Edition Year Other
No.
Details
Gonzalez
Digital Image Addison
1992
1 and Processing
Wesley
Woods
2

Computer
Vision,

3

Course

Boyle and
Thomas
Pakhira
Malay K

Digital Image PHI
Processing
and
Pattern
Recogination

Blackwell 2nd
Science
Edition

Assessment will consists of following components

1995

Assessment
Methods

Course
Outcomes

Mapping of
Course
Outcomes with POs

1.
2.
3.
4.
5.

Two Minors (30% Weightage )
Quiz (7.5%)
Assignment (7.5%)
Attendance (5%)
Final Exam (50%)

At the end of the course student should be able to:
1. Understand the basic terms related to imaging, types of images, image conversions, matrix calculations, steps involved in image processing, its need in real time applications, state of art, color models and color image processing, various domains.
2. Understand and develop various image enhancement filters both in spatial and frequency domain, restoration process after discussing degradation functions, role of image enhancement and restoration in any image processing application.
The implementation of same is also required to be done practically.
3. Discuss the role and need of image compression and its techniques, morphological operations, role and need of segmentation, types of segmentation, edge segmentation, various segmentation algorithms like region growing, region splitting and merging, watershed etc., calculations and practice of numerical related to segmentation.
4. Discuss various boundary and regional descriptor methods, equation related to boundary detection, various types of image features and methods defined for object recognition.

D

PO
E F

X
X

X
X
X

COs
1
2
3
4

A
X
X
X
X

B
X
X
X

C

G

H

I

J
X

K

L

X
X
X

X
X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

DIGITAL IMAGE PROCESSING (Practical)
CSE 862
Semester: - 8th
50

Credits
LTP
Elective

02
003
N

3 Hours
Time
Practical should be covered based on the following directions:
1. Reading and displaying images in different formats using different color models.
2. Converting color images into monochrome images, Image color enhancements using pseudo coloring techniques.
3.Images enhancements using grey level transformations and spatial and frequency domain filters
5.Image Noise removal and inverse filtering of images
6.Point, Line, Edge and Boundary Detections in images
7.Histogram Matching and specification on images
8.Boundary Linking, Representation and Description techniques on images
9.Thresholding& Magnification of Images
10. Image Morphological Operations
11. Object Recognition Techniques

Branch: Computer Science and Engineering
Title
NETWORK PROGRAMMING
CSE813
Semester: 8
Code
External: 50
Internal: 50
Max. Marks
Computer Networks (CSE513)
Prerequisites

4
Credits
LTP
310
Y
Elective
45
Contact
Hours
3 Hours
Time
To familiarize students with advanced concepts of networks, network
Objectives
programming in UNIX environment.
Note
for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions
Examiner
of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A
OSI model, client server model, TCP/IP protocols, Introduction to Unix; Process, groups, job control and non-job control shells, reliable and unreliable signals, shell
Programming.
Inter process communication in Unix, pipes, half duplex and full duplex pipes, FIFOs, properties of pipes and FIFOs, POSIX message queues, system Vmessage queues, semaphores, shared memory, mmap function and its use, RPC, authentication, timeout and retransmission, call semantics, XDR. .
Communication Protocol
Introduction, TCP, IP, XNS, SNA, NetBIOS, OSI protocols, comparisons
SECTION-B
Introduction to Berkeley sockets, socket addressing, TCP and UDP socket functions, sockets and Unix signals, socket implementation, client and server examples for TCP and UDP and their behaviour under abnormal conditions.
Socket options, IPv4, IPv6, TCP, I/O multiplexing, Unix I/O models, select and poll functions System V Transport Layer, interface Introduction Transport End Point address, TLI
Overview of Ping Routines, FTP, Remote Login
Suggested
Books
S.
Authors
Title
Publish Editio Year
Other
No. er n
Details
1
W. R.,
Unix
Pearson Vol. I,
Stevens,
Networ Educati 3rd
B. Fenner k on Ed. and A.
Progra
M., mming Rudoff

2

3

W.
R., Unix
Stevens
Networ k Progra mming, W.
R., Advanc
Stevens
ed
Progra

Pearson
Educati
on

Pearson
Educati
on

Vol. II,
2
nd
Ed.,

Hrs
6

10

5

10

5
5
4

mming in Unix
Environ
ment,

Course
Outcomes

1.
2.
3.
4.

To demonstrate the working of TCP/IP and its role in networks.
To learn about inter-process communication in unix environment.
To study about socket programming.
To learn about programming for Unix operating system
COs
PO
A
B C
D E F
G H I
J
K
*
*
*
1
2

*

*

*

3

*

*

*

4

*

*

*

L

*

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

NETWORK PROGRAMMING (Practical)
CSE 863
Semester: - 8th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:
Students will learn to implement programs in UNIX.
1.
2.
3.
4.
5.
6.
7.
8.

To study and implement various network commands like telnet, ftp, etc.
To study various system calls.
Programs related to inter-process communication
Programs related to message queues
Programs related to pipes
Programs related to file handling
Programs related to process control
Programs using Socket Programming

02
003
Y
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max. Marks
Prerequisites
Objectives

VISUAL PROGRAMMING
CSE814
Semester: 8
External: 50
Internal: 50
Object Oriented Programming (CSE414)

Credits
LTP
Elective
Contact
Hours
Time

4
310
Y
45
3 Hours

1. To introduce Visual C# and its programming model
2. To enable them write applications using Visual C#
3. To make them understand and use various controls to create GUI
4. To enable them handle exceptions and write multithreaded programs
5. To make them understand and use file and data access techniques
The Semester question paper of a subject will be of 50 marks having 7 questions
Note for
Examiner
of equal marks. First question, covering the whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
8
Introduction
Introduction to Programming: Variables, Functions, Visual Programming, and Object
Oriented Concepts: Abstraction, Inheritance, Polymorphism, Classes, Collections,
Debugging.
5
Graphical User Interface Concepts - I
Windows Forms, Control Properties and Layout, Using Common Dialogs, Event
Handling: Mouse and Keyboard, Labels, Textboxes, Buttons, GroupBoxes, Panels,
CheckBoxes and RadioButtons, PictureBoxes, ToolTips.
3. Graphical User Interface Concepts II Menus, Controls:
4
MonthCalendar,DateTimePicker,LinkLabel,ListBox,CheckedListBox, ComboBox,
TreeView, ListView,Datagrid, Gridview, TabControl, Multiple Document Interface
(MDI) Windows.
5
Multithreading and Exception Handling
Thread States, Lifecycle of a Thread, Thread Priorities and Scheduling, Creating and
Executing Threads, Thread Synchronization and Class Monitor, Exception Handling.
SECTION-B
5
Graphics and Multimedia
Drawing Classes and the Coordinate System, Graphics Contexts and Graphics Objects,
Color and Font Control, Drawing Lines, Rectangles, Ovals, Arcs, Loading, Displaying and Scaling Images, Animating a Series of Images.
5
File Processing and Streams
Data Hierarchy, Files and Streams, Classes File and Directory, Reading and Writing
Sequential Access Files, Serialization.
8
Data Access
Data Access Techniques, XML, LINQ, SQL, ADO.NET Object Model, LINQ to SQL,
ADO.NET and LINQ, LINQ to XML.
5
Additional Techniques
XML Documentation, Networking, Security, Web Services, Introduction to GDI+.
Suggested
Books
S.
Authors
Title
Publishe Editio Year
Other
No. r n
Details
1
Deitel
Visual
Deitel
Secon 2005

C#
2005
How to
Progra
m
Beginni Wrox ng Microso ft Visual
C#

Karli
2008
Watson,
Christian
Nagel,
Jacob
Hammer, et al.
3
Christian Professi Wrox
2008
Nagel, onal C#
Bill
Evjen, Jay
Glynn,
Morgan
Skinner,
Karli
Watson
Assessment will consists of following components
1. Two Minors (30% Weightage )
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
2

Course
Assessment
Methods

Course
Outcomes

Mapping of
Course
Outcomes with POs

d
Editio
n

After studying this course, students will be able to
1. Understand the fundamentals of visual programming
2. Apply the concept of multithreading, exception handling, file handling and data access while developing applications
3. Develop applications involving use of graphics controls, multithreading, exception handling and file handling.
4. Examine visual applications involving use of graphics controls, multithreading, exception handling and file handling.
COs
A
1
2
3
4

B
X

X

C

D

X
X
X

E
X
X

X

PO
F

G

H

I

J
X

K

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

VISUAL PROGRAMMING (Practical)
CSE 864
Semester: - 8th
50

Credits
LTP
Elective

02
003
Y

3 Hours
Time
Practical should be covered based on the following directions:
1. Writing basic C# programs demonstrating the concepts of functions, arrays, classes, inheritance, polymorphism etc.
2. Writing graphical programs demonstrating the concepts of event handling, Labels,
Textboxes, Buttons, GroupBoxes, Panels, CheckBoxes and RadioButtons, PictureBoxes,
ToolTips.
3. Writing MDI Applications and demonstration of controls like: MonthCalendar,
DateTimePicker, LinkLabel, ListBox, CheckedListBox, ComboBox, TreeView, ListView,
TabControl.
4. Writing programs demonstrating the concepts of Multithreading and Exception
Handling.
5. Writing programs demonstrating Graphics and Multimedia concepts.
6. Writing programs for reading and writing text files.
7. Writing programs demonstrating Database Access, Networking and Security.
8. Writing Web Services.

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

JAVA TECHNOLOGIES
CSE815
External: 50

Semester: 8
Internal: 50

Object Oriented Programming (CSE414)

Credits
LTP
Elective

4
310
Y

Contact
Hours
Time

45

3 Hours
1. To introduce Java and its programming model
2. To make them write desktop applications and applets in Java
3. To enable them handle exceptions in Java and write multithreaded programs
4. To give an overview of J2EE and JDBC
5. To make them understand and write JSP, Servlets and Java Beans.
Note for
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of
Examiner
conceptual nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part.
Hrs
SECTION-A
8
Java Methods, Classes and Inheritance
Introduction; classes; methods; constructors; overloading methods; arrays; recursion; passing arrays and objects to methods; Inheritance; method overriding; abstract classes; using final; packages; interfaces.
8
I/O, Applets and Graphics:
I/O basics; stream classes; byte and character streams; reading and writing files; Applet fundamentals; Applet class; Applet initialization and termination; event handling; keyboard and mouse events; AWT class; Layout managers; panels; canvases; Frame windows; drawing lines, rectangles, ellipses.
8
Exceptional Handling and Multithreaded Programming:
Exception handling fundamentals; exception types; uncaught exceptions; try and catch; creating exception classes; throwing exceptions; Java thread model; thread priorities; creating a thread; inter-thread communication; thread synchronization; suspending, resuming and stopping threads.
SECTION-B
7
Overview of J2EE and working with JDBC:
What is J2EE, component based architecture of J2EE: Web, Business and Application component, commonly used classes and interfaces of java.sql package, connecting java application to a database, prepared statements.
7
Servlets and JSP:
Java Servlets, compilation, deployment, and testing a servlet, session management, request dispatching, Java Server Pages, deploying and testing a JSP, using java beans in
JSP.
7
Enterprise Java Beans(EJB):
Architecture of EJB, creating a stateless-session EJB, statefull-session bean, Life Cycle of session beans, Entity beans, life cycle of entity beans.
Suggested
S.
Authors
Title
Publishe Edition
Year Other Details
Books
No. r 1
Deitel
Java: How Pearson 6th to Program Educatio Edition n Objectives

2

Herbert
Schildt

The
McGraw
Complete
-Hill
Reference
Java2
J2EE: The complete Reference

3

Course
Assessment
Methods

Course
Outcomes

Mapping of
Course
Outcomes with POs

James
Edward
Keogh,
Jim
Keogh
Assessment will consists of following components
1. Two Minors (30% Weightage )
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
After studying this course, students will be able to:1. Understand the fundamentals of object-oriented programming and the technologies of Java Enterprise Edition Software.
2. Study and Develop coding conventions of importing packages and use of interfaces.
Demonstrate the runtime exception, multi-threaded event-driven programming.
3. Apply the use of applet programming. Show competence in the use of the pure object oriented Java language in the development of small to medium-sized applications. 4. Examine the enterprise components including Enterprise JavaBeans (EJB) technology, servlets, and Java Server Pages (JSP) technology, JDBC.
COs
1
2
3
4

A
X
X
X
X

B
X
X
X

C
X
X

D

PO
E F

G

H

I

J
X

K

X
X

L

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Note
List

JAVA TECHNOLOGIES (PRACTICAL)
CSE 865
Semester: - 8th
50

Credits
LTP
Elective

Time
Practical should be covered based on the following directions:
1. Implementation of classes, inheritance, overloading.
2. Implantation of packages and interfaces
3. Implantation of threads.
4. Implementation of Applets, mouse events, and keyboard events.
5. Connecting to Database using JDBC.
6. Deployment of Servlets, JSP and EJB.

02
003
Y
3 Hours

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

SOFT COMPUTING
CSE806
External: - 50

Credits
LTP
Elective

Artificial Intelligence (CSE614)

04
310
Y

Contact Hours

Semester: - 8th
Internal: 50

45

Time

3
Hours
Objectives To understand the basic soft computing techniques available and to apply these concepts as applicable to different problems in real life.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
9
Intelligent Agents:
Agents Behavior and Environments, Structure of Agents, Planning Problem, Planning with state
Space Search, Partial order Planning, GRAPHPLAN, Planning in logic, Planning in nondeterministic domains, hierarchical task planning, Multi agent planning, execution.
Probabilistic Reasoning Fuzzy Logic:
12
Knowledge representation under uncertainty, Bayesian theorem, Bayesian Networks, Dempster
Shafer theory, Representing vagueness, Fuzzy sets, operation on fuzzy sets, reasoning with fuzzy logic, Fuzzy Automata, Fuzzy Control methods, Fuzzy decision making, inference in temporal models, Hidden Markov Models, Kalman Filters
SECTION-B
16
Neural Networks:
Basic concepts, Single layer perception, Multilayer Perception, Supervised and Unsupervised learning - Backpropagation networks - Kohnen's self organizing networks - Hopfield network.
Introduction to Artificial Neural Systems - Perceptron - Representation - Linear separability Learning
Training algorithm -Adaptive networks based Fuzzy interface systems Classification and Regression Trees - Data clustering algorithms - Rule based structure identification - Neuro-Fuzzy controls - Simulated annealing
8
Genetic Algorithms:
Evolutionary computation. Survival of the Fittest - Fitness Computations - Cross over
Mutation, Reproduction - Rank method - Rank space method.
Suggested
Books

S.
Authors
No.
Stuart
1.
J.Russel,
Norvig
Michael
2.
Negnevitsky

3.

James
Freeman A.

Title

Publisher

AI: A Modern
Approach

Pearson
Publications

Artificial
Intelligence: A
Guide to
Intelligent
Systems
Neural
Networks -

Addison
Wesley

Addison
Wesley

Edition Year Other
Details
Latest
2nd

2005

1992

and David
Skapura M

4.

Yegnanaraya na B

5.

Goldberg,
David E

Algorithms,
Applications
&
Programming
Techniques
Artificial
Neural
Networks
Genetic algorithms in search, optimization and machine learning Prentice
Hall of
India
Private Ltd
Addison
Wesley

1999

latest

Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
2. Quiz (7.5%)
Methods
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
1. Illustration of different soft computing techniques and their relation to artificial
Course
intelligence
Outcomes
2. Describe, argue for and critique Soft Computing discipline. Students will be able to use at least two of the Soft Computing techniques
3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems 4. Apply genetic algorithms to combinatorial optimization problems
5. Apply neural networks to pattern classification and regression problems
6. To analyze and study the problem in question conceptually and mathematically and solve the problem using any of soft computing techniques
Mapping
of Course
PO
Outcomes
A B C D E F
G H I
J
K L with POs
1
X
2
X X
X
3
X X X X
4
X X
X
5
X X
X
6
X X

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

EMBEDDED SYSTEMS
CSE817
External: - 50

Semester: - 8th
Internal: 50

Microprocessors (EC317)

Credits
LTP
Elective

03
300
Y

Contact Hours

45

Time

3
Hours
Objectives To get the basic knowledge of all the peripheral device controllers and to work on PIC
Microcontroller
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
10
Introduction Review of Embedded Hardware
Memory Microprocessors Buses Direct Memory Access Interrupts Built ins on the
Microprocessor, Conventions used on Schematic, Microprocessor Architecture
Interrupt
Basic Shared Data Problems Interrupt Latency.
PIC Micro controller & Interfacing
15
Introduction, CPU Architecture, Register file structure, Instruction Set, Programs, Timers and
Interrupts Interrupt Service Routine features of Interrupts Interrupt vector & Priority,
Timing Generation & Measurements, Compare mode, Capture mode, Event counter, PWM,
Frequency Measurement Interfacing Methods, I/O Interface, SPI, LCD interfacing, Seven segment interfacing, I2 C Bus, DAC, Serial EEPROM, ADC, UART
SECTION-B
8
Software Development & Tools:
Software architectures, Round Robin, Round-Robin with Interrupts, Function
Queue Scheduling architecture, Introduction to assembler Compiler n Cross compilers and
Integrated Development Environment IDE, Linker/ Locators, Simu lators, Getting Embedded software into target System Debugging Strategies
5
Introduction to Real Time Operating Systems:
Task And Task States, Tasks and Data, Semaphores and shared data
7
Operating System Services:
Message queues, Mailboxes and Pipes, Timer Function, Events, Memory Management,
Interrupt Routines in an RTOS Environment, Basic Design Using RTOS.
Suggested
S.
Authors
Title
Publisher
Edition Year Other
Books
No.
Details
David
E. An Embedded Pearson
1.
Simon
Software
Education,
Primer,
Latest
Edition
2.

John
Peatman

B. PIC
Pearson
Microcontrolle Education, r Latest
Edition

3.

4.

-

Steve Heath

5.

Course
Outcomes

D. D. Gajski,
F. Vahid, S.
Narayan, J.
Gong

F.
Balarin, Hardware
Chiodo
Software Codesign of Embedded
Systems, et al., Kluwer

S pecification and Design of
Embedded
Systems
Embedded
systems design, Newnes,
1997.

Prenti ce Hall.

Academic
Publishers,
May 1997

Branch: Computer Science and Engineering
Title
Code
Max.
Marks
Prerequisites

Building Enterprise Applications
CSE 818
Semester: - 8th
External: 50
Internal: 50

Credits
LTP
Elective

3
300
Y

Database Systems (CSE412)

Contact Hours

45

3 Hours
Time
To introduce the concepts of Enterprise applications and different issues related to their implementation
· To introduces the architecture of different Enterprise applications and different design modeling techniques for construction.
· To introduce the different testing techniques for Enterprise application and methodologies used to roll out these applications.
The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Note for marks. First question, covering the whole syllabus and having questions of conceptual
Examiner
nature, will be compulsory. Rest of the paper will be divided into two parts having three questions each and the candidate is required to attempt at least two questions from each part. Hrs
SECTION-A
8
Introduction to Enterprise application
Introduction to enterprise applications and their types, software engineering methodologies, life cycle of raising an enterprise application, introduction to skills required to build an enterprise application, key determinants of successful enterprise applications, and measuring the success of enterprise applications.
7
Incepting enterprise application and business process modelling
Inception of enterprise applications, enterprise analysis, business modelling, requirements elicitation, use case modelling, prototyping, non functional requirements, requirements validation, planning and estimation.
8
Enterprise Architecture and designing enterprise application
Concept of architecture, views and viewpoints, enterprise architecture, logical architecture, technical architecture - design, different technical layers, best practices, data architecture and design relational, XML, and other structured data representations,
Infrastructure architecture and design elements - Networking, Internetworking, and
Communication Protocols, IT Hardware and Software, Middleware, Policies for
Infrastructure Management, Deployment Strategy, Documentation of application architecture and design.
SECTION-B
12
Constructing enterprise application
Construction readiness of enterprise applications - defining a construction plan, defining a package structure, setting up a configuration management plan, setting up a development environment, introduction to the concept of Software Construction Maps, construction of technical solutions layers, methodologies of code review, static code analysis, build and testing, dynamic code analysis code profiling and code coverage.
10
Testing and rolling out enterprise application
Types and methods of testing an enterprise application, testing levels and approaches, testing environments, integration testing, performance testing, penetration testing, usability testing, globalization testing and interface testing, user acceptance testing, rolling out an enterprise application.
Objectives

·

Suggested
Books

S.
Authors
No.
AnubhavPradhan,
1.
Satheesha B. Nanjappa,
Senthil K. Nallasamy,
VeerakumarEsakimuthu
Brett McLaughlin
2.
3.

SorenLauesen

4.

Brian Berenbach,
Daniel J. Paulish,
Juergen
Kazmeier, Arnold
Rudorfer
Dean Leffingwell, Don
Widrig

5.

6.

VasudevVerma

7.

SrinivasanDesikan,
Gopalaswamy Ramesh

Title

Publisher

Edition Year Other
Details
First
2012
Edition

Raising
Enterprise
Applications

Wiley India

Building Java
Enterprise
Applications,
Software
Requirements:
Styles &
Techniques.
Software
Systems
Requirements
Engineering:
In Practice
Managing
Software
Requirements:
A Use Case
Approach,
Software
Architecture:
A Case Based
Approach
SOFTWARE
TESTING
Principles and
Practices,

O Reily
Media

Latest
Edition

2010

Addison
Wesley

Latest
Edition

2012

McGrawLatest
Hill/Osborne Edition
Media,

2009

Pearson

First
Edition

2003

Pearson

First
Edition

2009

Pearson

First
Edition

2006

Assessment will consists of following components
Course
1. Two Minors (30% Weightage )
Assessment
Methods
2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course
Outcomes

Mapping of Course
Outcomes
with POs

1. Students will understand fundamental of Enterprise applications and key determinants to measure the success.
2. Students will demonstrate an understanding of different modelling techniques used to design Enterprise applications.
3. Students will able to construct these application by understanding the design..
4. Student will be able to test and roll out the enterprise applications in real environment. Learning
Outcome

POs

A

B

C

D

E

F

G

H

I

1.

K
*

2.

*

*

3.

*

*

4.

J

*

*

L