Vous êtes sur la page 1sur 57

COURSE HAND-OUT

B.TECH. - SEMESTER VIII

DEPARTMENT OF COMPUTER SCIENCE


AND ENGINEERING

Semester VI, Course Hand-Out

RAJAGIRI SCHOOL OF ENGINEERING AND


TECHNOLOGY (RSET)

VISION
TO EVOLVE INTO A PREMIER TECHNOLOGICAL AND RESEARCH INSTITUTION,
MOULDING EMINENT PROFESSIONALS WITH CREATIVE MINDS, INNOVATIVE
IDEAS AND SOUND PRACTICAL SKILL, AND TO SHAPE A FUTURE WHERE
TECHNOLOGY WORKS FOR THE ENRICHMENT OF MANKIND

MISSION

TO IMPART STATE-OF-THE-ART KNOWLEDGE TO INDIVIDUALS IN VARIOUS


TECHNOLOGICAL DISCIPLINES AND TO INCULCATE IN THEM A HIGH DEGREE
OF SOCIAL CONSCIOUSNESS AND HUMAN VALUES, THEREBY ENABLING
THEM TO FACE THE CHALLENGES OF LIFE WITH COURAGE AND CONVICTION

Department of CSE, RSET

Semester VI, Course Hand-Out

DEPARTMENT OF COMPUTER SCIENCE AND


ENGINEERING (CSE), RSET

VISION
TO BECOME A CENTRE OF EXCELLENCE IN COMPUTER SCIENCE &
ENGINEERING, MOULDING PROFESSIONALS CATERING TO THE RESEARCH
AND

PROFESSIONAL

NEEDS

OF

NATIONAL

AND

INTERNATIONAL

ORGANIZATIONS.

MISSION

TO INSPIRE AND NURTURE STUDENTS, WITH UP-TO-DATE KNOWLEDGE IN


COMPUTER SCIENCE & ENGINEERING, ETHICS, TEAM SPIRIT, LEADERSHIP
ABILITIES, INNOVATION AND CREATIVITY TO COME OUT WITH SOLUTIONS
MEETING THE SOCIETAL NEEDS.

Department of CSE, RSET

Semester VI, Course Hand-Out

B.TECH PROGRAMME

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)


1. Graduates shall have up-to-date knowledge in Computer Science & Engineering along
with interdisciplinary and broad knowledge on mathematics, science, management
and allied engineering to become computer professionals, scientists and researchers.
2. Graduates shall excel in analysing, designing and solving engineering problems and
have life-long learning skills, to develop computer applications and systems, resulting
in the betterment of the society.
3. Graduates shall nurture team spirit, ethics, social values, skills on communication and
leadership, enabling them to become leaders, entrepreneurs and social reformers.

PROGRAMME OUTCOMES (POs)


Graduates will be able to achieve
a. An ability to apply mathematical foundations, algorithmic principles, and computer
science theory in the modelling and design of computer-based systems.
b. An ability to identify, analyse, formulate and solve technical problems by applying
principles of computing and mathematics relevant to the problem.
c. An ability to define the computing requirements for a technical problem and to
design, implement and evaluate a computer-based system, process or program to
meet desired needs.
d. An ability to learn current techniques, skills and modern engineering tools necessary
for computing practice.
e. An ability to carry out experiments, analyse results and to make necessary
conclusions.
f. An ability to take up multidisciplinary projects and to carry out it as per industry
standards.
g. An ability to take up research problems and apply computer science principles to
solve them leading to publications.
h. An ability to understand and apply engineering solutions in a global and social
context.
i. An ability to understand and practice professional, ethical, legal, and social
responsibilities as a matured citizen.
j. An ability to communicate effectively, both written and oral, with a range of
audiences.
Department of CSE, RSET

Semester VI, Course Hand-Out

k. An ability to engage in life-long learning and to engage in continuing professional


development.
l. An ability to cultivate team spirit and to develop leadership skills thereby moulding
future entrepreneurs.

INDEX
SCHEME: B.TECH 8TH SEMESTER

CS010 801 High Performance Computing

COURSE INFORMATION SHEET


COURSE PLAN
CS010 802 Artificial Intelligence

7
10
14

COURSE INFORMATION SHEET

14

COURSE PLAN

17

CS010 803 Security in Computing

19

COURSE INFORMATION SHEET

19

COURSE PLAN

22

CS010 804L05 Mobile Computing

24

COURSE INFORMATION SHEET

24

Course Plan

31

CS010 804L06 Advanced Networking Trends

34

COURSE INFORMATION SHEET

34

Course Plan

37

CS010 805G02 Neural Networks

39

COURSE INFORMATION SHEET

39

COURSE PLAN

42

CS010 805G05 Natural Language Processing

44

COURSE INFORMATION SHEET

44

CS010 806 Computer Graphics Lab

48

COURSE INFORMATION SHEET

48

COURSE PLAN

51

CS010 807 Project

54

COURSE INFORMATION SHEET

Department of CSE, RSET

54

Semester VI, Course Hand-Out

SCHEME: B.TECH 8TH SEMESTER


(Computer Science & Engineering)
Mahatma Gandhi University Revised Scheme for B.Tech Syllabus Revision 2010

Hours/Week
Code
CS010 801
CS010 802
CS010 803
CS010
804Lxx
CS010
805Gxx
CS010 806
CS010 807
CS010 808

Subject
High Performance
Computing
Artificial Intelligence
Security in Computing
Elective III
Elective IV
Computer Graphics Lab
Project
Viva Voce
Total

Marks
Inter End-nal Sem

End-Sem
duration
hours

Credits

P/D

50

100

2
2

2
2

50
50

100
100

3
3

4
4

50

100

50

100

11

10

3
6
9

50
100
-

100
50

3
-

2
4
2
28

Electives III
CS010 804L01 E-commerce
CS010 804L02 Grid Computing
CS010 804L03 Biometrics
CS010 804L04 Optimization Techniques
CS010 804L05 Mobile Computing
CS010 804L06 Advanced Networking Trends

Electives IV
CS010 805G01 Multimedia Techniques
CS010 805G02 Neural networks
CS010 805G03 Advanced Mathematics
CS010 805G04 Software Architecture
CS010 805G05 Natural Language Processing
CS010 805G06 Pattern Recognition

Department of CSE, RSET

Semester VI, Course Hand-Out

CS010 801 High Performance Computing


COURSE INFORMATION SHEET
PROGRAMME:
COMPUTER SCIENCE & ENGINEERING
COURSE: HIGH PERFORMANCE COMPUTING
COURSE CODE: CS010 801
COURSE AREA/DOMAIN: COMPUTER HARDWARE
CORRESPONDING LAB COURSE CODE (IF ANY):

DEGREE: BTECH
YEAR: JAN 2014 JUNE 2014
SEMESTER: VIII
CREDITS: 4
COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H
CONTACT HOURS: 3+2 (Tutorial) hours/Week.
LAB COURSE NAME:

SYLLABUS:
UNIT
I

II

III

IV

DETAILS

HOURS

Introduction to parallel processing - Trends towards parallel processing - Parallelism in


uniprocessor - Parallel computer structures-Architecture classification schemes
,Amdahls
law,Indian contribution to parallel processing.
Principles of pipelining and vector processing - Linear pipelining - Classification of
pipeline processors - General pipelines - Instruction and Arithmetic pipelines Design
of Pipelined instruction unit-Principles of Designing Pipeline Processors- Instruction
prefetch and branch handling- Data Buffering and Busing Structure-Internal
forwarding and register tagging- Hazard detection and Resolution,Dynamic pipelines
and Reconfigurability
Array processors - SIMD array processors - Interconnection networks - Static vs
dynamic
networks - mesh connected networks - Cube interconnection networks - Parallel
algorithms for array processors - SIMD matrix multiplication-Parallel sorting on array
processors - Associative array processing - Memory organization.
Multiprocessor architectures and Programming - Loosely coupled and Tightly coupled
multiprocessors - Interconnection networks - Language features to exploit parallelism
Inter process communication mechanism-Process synchronisation mechanisms,
synchronization with semaphores.
Dataflow computers - Data driven computing and Languages, Data flow computers
architectures - Static data flow computer , Dynamic data flow computer ,Data flow
design
alternatives.
TOTAL HOURS

15

15

15

15

15
60

TEXT/REFERENCE BOOKS:
T/R
T
R1
R2
R3
R4
R5
R6
R7

BOOK TITLE/AUTHORS/PUBLICATION

Computer Architecture & Parallel Processing - Kai Hwang & FayeA.Briggs,Mc Graw Hill
Computer architecture A quantitative approach - John L Hennessy and David A.PattersonELSEVIER, Fourth Edition
Elements of Parallel computing - V. Rajaraman - PHI
Super Computers - V. Rajaraman - Wiely arstern
Parallel Processing for Super Computers & AI Kai Hwange & Douglas Degneot Mc Graw Hill
Highly parallel computing - George S. Almasi,Allan Gottlieb. - Benjamin Cumings Publishers.
HIgh Performance Computer Architecture - Harold S. Stone, Addison Wesley.
Advanced Computing- Vijay P.Bhatkar, Asok V.Joshi, Arirban Basu, Asok K.Sharma.

Department of CSE, RSET

Semester VI, Course Hand-Out

COURSE PRE-REQUISITES:
C.CODE
CS010
304

COURSE NAME
COMPUTER ORGANISATION

DESCRIPTION
ARCHITECTURE

SEM
III

COURSE OBJECTIVES:
1
2

To design a powerful and cost-effective computer system


To provide the basic concepts of parallel processing on high performance
computers.

COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING
a

1
Graduates will be able to classify and describe the operation of parallel computer architectures
2
3
4
5

a, b

Graduates will be able to understand the basic concepts of pipelining and related design issues.
Graduates will be able to learn advanced concepts in multiprocessor architecture and interconnection networks
Graduates will understand the concepts of parallelism especially inter process communication and synchronization

c, d
a

Graduates will get a thorough knowledge of various design alternatives of dataflow computers

c, d

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO

DESCRIPTION

PROPOSED
ACTIONS

PO
MAPPING

Study of RISC and CISC architectures

Assignment

Case study : IBM Power1( RS6000)

Reading
assignment

c,d

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


Sl.No
DESCRIPTION
1
2

To study the internal structure of the processing elements in Illiac IV


To study operating system requirements for multiprocessors

PO
MAPPING
a, d
a, d

WEB SOURCE REFERENCES:


1
https://computing.llnl.gov/tutorials/parallel_comp/
2
www.seas.gwu.edu/~narahari/cs211/materials/lectures/simd.pdf
3

csd.ijs.si/courses/dataflow/

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK


LCD/SMART BOARDS

STUD. ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES
ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

ASSIGNMENTS
STUD. LAB PRACTICES

Department of CSE, RSET

STUD. SEMINARS
SIMPLE QUESTIONS

TESTS/MODEL EXAMS
MINI/MAJOR PROJECTS

UNIV. EXAMINATION
CERTIFICATIONS

Semester VI, Course Hand-Out

ADD-ON COURSES

IN TUTORIAL HOUR
OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT

ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,


ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by
Ms.Deepa John

STUDENT FEEDBACK ON FACULTY (TWICE)


OTHERS

Approved
Mr. Ajith S

(H.O.D)

Department of CSE, RSET

Semester VI, Course Hand-Out

2014 S8 CS
CS010 801- HIGH PERFORMANCE COMPUTING
COURSE PLAN

Sl.No

Module

Day 1

Introduction to parallel processing

Day 2

Trends towards parallel processing

Day 3

Parallelism in Uniprocessor

Day 4

Parallelism in Uniprocessor

Day 5

Parallel computer structures

Day 6

Parallel computer structures

Day 7

Architecture classification schemes

Day 8

Architecture classification schemes

Day 9

Amdahls Law

10

Day 10

Principles of pipelining and vector processing

11

Day 11

Linear pipelining

12

Day 12

Classification of pipeline processors

13

Day 13

General pipelines

14

Day 14

Instruction and Arithmetic pipelines

15

Day 15

Design of Pipelined Instruction Unit

Department of CSE, RSET

Planned

10

Semester VI, Course Hand-Out

16

Day 16

Design of Pipelined Instruction Unit

17

Day 17

Principles of Designing Pipeline Processors

18

Day 18

Instruction Prefetch and Branch Handling

19

Day 19

Instruction Prefetch and Branch Handling

20

Day 20

Data Buffering and Busing Structure

21

Day 21

Data Buffering and Busing Structure

22

Day 22

Internal forwarding and register tagging-

23

Day 23

Internal forwarding and register tagging-

24

Day 24

Hazard detection and Resolution

25

Day 25

Hazard detection and Resolution

26

Day 26

Dynamic pipelines and Reconfigurability

27

Day 27

Dynamic pipelines and Reconfigurability

28

Day 28

Array processors - SIMD array processors

29

Day 29

Array processors - SIMD array processors

30

Day 30

Interconnection networks

31

Day 31

Static vs dynamic networks

32

Day 32

mesh connected networks

33

Day 33

Cube interconnection networks

34

Day 34

Parallel algorithms for array processors -

Department of CSE, RSET

11

Semester VI, Course Hand-Out

35

Day 35

SIMD matrix multiplication

36

Day 36

SIMD matrix multiplication

37

Day 37

Parallel sorting on array processors

38

Day 38

Parallel sorting on array processors

39

Day 39

Associative array processing

40

Day 40

Associative array processing

41

Day 41

Memory organization

42

Day 42

Multiprocessor architectures and Programming

43

Day 43

Loosely Coupled and Tightly Coupled Multiprocessors

44

Day 44

Loosely Coupled and Tightly Coupled Multiprocessors

45

Day 45

Interconnection networks

46

Day 46

Language features to exploit parallelism

47

Day 47

Inter Process communication Mechanism

48

Day 48

Process synchronisation mechanisms

49

Day 49

Process synchronisation mechanisms

50

Day 50

synchronization with semaphores.

51

Day 51

synchronization with semaphores.

52

Day 52

Dataflow computers

53

Day 53

Data driven computing and Languages

Department of CSE, RSET

12

Semester VI, Course Hand-Out

54

Day 54

Data flow computers Architectures

55

Day 55

Static data flow computer

56

Day 56

Static data flow computer

57

Day 57

Dynamic data flow computer

58

Day 58

Dynamic data flow computer

59

Day 59

Data flow design Alternatives.

60

Day 60

Data flow design Alternatives.

Department of CSE, RSET

13

Semester VI, Course Hand-Out

CS010 802 Artificial Intelligence


COURSE INFORMATION SHEET
PROGRAMME:

COMPUTER SCIENCE & ENGINEERING

COURSE: ARTIFICIAL

DEGREE: BTECH
SEMESTER: VIII

COURSE CODE:

COURSE TYPE: CORE

INTELLIGENCE
CS010 802

REGULATION:
2010
COURSE AREA/DOMAIN: RECENT TRENDS IN
COMPUTING
CORRESPONDING LAB COURSE CODE (IF ANY):

YEAR: JAN 2014 JUNE 2014


CREDITS: 4

CONTACT HOURS: 2+2 (Tutorial) hours/Week.


LAB COURSE NAME:

SYLLABUS:
UNIT
I

II

DETAILS

HOURS

Problems- problem spaces and search, production systems, Problem


characteristics, Searching strategies Generate and Test, Heuristic Search
Techniques- Hill climbing issues in hill climbing, General Example Problems.
Python-Introduction to Python- Lists Dictionaries & Tuples in Python- Python
implementation of Hill Climbing
Search Methods- Best First Search- Implementation in Python- OR Graphs,
The A * Algorithm, Problem Reduction- AND-OR Graphs, The AO*
algorithm, Constraint Satisfaction. Games as search problem, MINIMAX
search procedure, AlphaBeta pruning.

14

12
III

IV

Knowledge representation -Using Predicate logic- representing facts in logic,


functions and predicates, Conversion to clause form, Resolution in
propositional logic, Resolution in predicate logic, Unification, Question
Answering, forward and backward chaining.
Learning- Rote Learning Learning by Advice- Learning in Problem Solving
- By Parameter Adjustment with Macro Operators, Chunking, Learning from
Examples- Winstons Learning Program, Version Spaces- Positive & Negative
Examples Candidate Elimination- Decision Trees- ID3 Decision Tree
Induction Algorithm.
Fuzzy Sets Concept of a Fuzzy number- Operations on Fuzzy Sets Typical
Membership Functions Discrete Fuzzy Sets.
Expert System Representing and using Domain Knowledge Reasoning
with knowledge Expert System Shells Support for explanation- examples
Knowledge acquisition-examples.
TOTAL HOURS

12

12

10

60

TEXT/REFERENCE BOOKS:
T/R
R1

R2

BOOK TITLE/AUTHORS/PUBLICATION

Elaine Rich, Kevin Knight, Shivashankar B Nair


Tata McGraw Hill- Artificial Intelligence, 3rd Edn ,2004.
Stuart Russell Peter Narang, Pearson Education Asia - Artificial

Department of CSE, RSET

14

Semester VI, Course Hand-Out

R3
R4

Intelligence- A modern approach.


George F Luger - Artificial Intelligence, Pearson Education Asia
Allen B. Downey (Think Python) Python for software design- How to
think like a computer scientist, Cambridge University press, 2009 .

COURSE PRE-REQUISITES:
C.CODE
CS010 303

COURSE NAME
Problem Solving & Computer Programming

CS010 403

Data Structures and Algorithms

EN010301
B

Engineering Mathematics II

DESCRIPTION
Knowledge of Programming Techniques
knowledge of search and data structures, such as
balanced binary trees.
Knowledge of mathematical strategies and
graphs

SEM
III

IV
III

COURSE OBJECTIVES:
1
2
3

Enabling Knowledge: Ability to apply artificial intelligence techniques, including search heuristics, knowledge
representation, planning and reasoning.
Problem Solving: Ability to design and implement appropriate solutions for search problems (such as playing two-person
games) and for planning problems (such as determining a sequence of actions for a robot).
Critical Analysis: Ability to analyse problem specifications and derive appropriate solution techniques for them.

COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING

Graduates will be able to assess critically the techniques presented and to apply them to real world
problems

b,c,d

Graduates will be able aware of the major challenges facing AI and the complexity of typical problems
within the field

b,e

3
4
5

Graduates will get to understand the major areas and challenges of AI


Graduates will be able to apply basic AI algorithms to solve problems.

c,e
a,b,c,d
a,b,e

Graduates will be able to get a knowledge of applications in different areas of computing including the
web and human interaction

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO

DESCRIPTION

PROPOSED
ACTIONS

Given a planning problem, be able to develop the proper representation


for the problem in a planning language, and then create a plan using an
appropriate planning method
Given a learning problem, be able to determine which learning techniques
may be applied to this problem, and be able to outline a method to solve the
problem

Assignment

Assignment

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


SNO TOPICS
1
Agents and Intelligent agents
2
Design a problem which uses A* Algorithm

PO MAPPING
d
c,d

WEB SOURCE REFERENCES:

Department of CSE, RSET

15

Semester VI, Course Hand-Out

www.nptel.iitm.ac.in/video.php?subjectId=106105077

http://code.google.com/p/aima-python/ - Website for search strategy


implementation in python

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK


LCD/SMART BOARDS

STUD. ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES
ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
STUD. LAB PRACTICES
ADD-ON COURSES

STUD. SEMINARS
STUD. VIVA
OTHERS

TESTS/MODEL EXAMS
MINI/MAJOR PROJECTS

UNIV. EXAMINATION
CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT

ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,


ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by
Ms. Sangeetha Jamal

STUDENT FEEDBACK ON FACULTY (ONCE)

OTHERS

Approved
Mr. Ajith S

(H.O.D)

Department of CSE, RSET

16

Semester VI, Course Hand-Out

COURSE PLAN

SL
NO

TOPICS

MODULE

DAY 1
DAY 2
DAY 3

problem spaces and search


production systems
Problem characteristics

MODULE 1
MODULE 1
MODULE 1

DAY 4
DAY 5
DAY 6
DAY 7
DAY 8
DAY 9
DAY
10

Searching Strategies
Generate and Test
Heuristic Search Techniques
Hill climbing
issues in hill climbing
Introduction to Python- Lists Dictionaries & Tuples in Python

MODULE 1
MODULE 1
MODULE 1
MODULE 1
MODULE 1
MODULE 1

Python implementation of Hill Climbing

MODULE 1

Best First Search

MODULE 2

Implementation in Python OR Graphs

MODULE 2

The A * Algorithm

MODULE 2

Problem Reduction

MODULE 2

AND-OR Graphs, The AO* algorithm

MODULE 2

Constraint Satisfaction

MODULE 2

Games as search problem

MODULE 2

MINIMAX search procedure

MODULE 2

AlphaBeta pruning

MODULE 2

Using Predicate logic

MODULE 3

representing facts in logic

MODULE 3

functions and predicates

MODULE 3

Conversion to clause form

MODULE 3

Resolution in propositional logic

MODULE 3

Resolution in predicate logic


Unification, Question Answering

MODULE 3
MODULE 3

DAY
11
DAY
12
DAY
13
DAY
14
DAY
15
DAY
16
DAY
17
DAY
18
DAY
19
DAY
20
DAY
21
DAY
22
DAY
23
DAY
24
DAY
25
DAY

Department of CSE, RSET

17

Semester VI, Course Hand-Out

26
DAY
27
DAY
28
DAY
29
DAY
30
DAY
31
DAY
32
DAY
33
DAY
34
DAY
35
DAY
36
DAY
37
DAY
38
DAY
39
DAY
40
DAY
41
DAY
42
DAY
43
DAY
44
DAY
45
DAY
46

forward and backward chaining

MODULE 3

Rote Learning

MODULE 4

Learning by Advice

MODULE 4

Learning in Problem Solving

MODULE 4

By Parameter Adjustment with Macro Operators, Chunking,

MODULE 4

Learning from Examples

MODULE 4

Winstons Learning Program, Version Spaces

MODULE 4

Positive & Negative Examples

MODULE 4

Candidate Elimination

MODULE 4

Decision Trees

MODULE 4

ID3 Decision Tree Induction Algorithm

MODULE 4

Concept of a Fuzzy number

MODULE 5

Operations on Fuzzy Sets

MODULE 5

Typical Membership Functions

MODULE 5

Discrete Fuzzy Sets

MODULE 5

Representing and using Domain Knowledge

MODULE 5

Reasoning with knowledge

MODULE 5

Expert System Shells

MODULE 5

Support for explanation- examples

MODULE 5

Knowledge acquisition-examples

MODULE 5

Department of CSE, RSET

18

Semester VI, Course Hand-Out

CS010 803 Security in Computing


COURSE INFORMATION SHEET
PROGRAMME:
ENGINEERING

COMPUTER SCIENCE &

DEGREE: BTECH

YEAR: JAN 2013 JUNE 2013

COURSE: SECURITY IN COMPUTING

SEMESTER:

COURSE CODE:

COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H

CS010 803

VIII

CREDITS: 4

COURSE AREA/DOMAIN: RECENT TRENDS IN


COMPUTING

CONTACT HOURS: 3+1 (Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY): NIL

LAB COURSE NAME: NIL

SYLLABUS:
UNIT

DETAILS

Introduction: Security basics Aspects of network security Attacks


Different types Security attacks -Security services and mechanisms.
Cryptography: Basic Encryption & Decryption Classical encryption
techniques symmetric encryption, substitution ciphers Caesar
cipher Monoalphabetic Cipher, Playfair Cipher, Polyalphabetic cipher Vigenre Cipher, Transposition ciphers - Rail Fence cipher, Row
Transposition Ciphers.
Modern Block Ciphers - Fiestel Networks , DES Algorithm
Avalanche Effect.
Introduction to Number Theory - Prime Factorisation, Fermat's
Theorem, Euler's Theorem, Primitive Roots, Discrete Logarithms.
Public key Cryptography:- Principles of Public key Cryptography
Systems, RSA algorithms- Key Management Diffie-Hellman Key
Exchange, Elliptic curve cryptography.

II

III

IV

Message Authentication-Requirements- Authentication functionsMessage authentication codes-Hash functions- Secure Hash Algorithm,
MD5, Digital signatures- protocols- Digital signature standards, Digital
Certificates.
Application Level Authentications- Kerberos, X.509 Authentication
Service, X.509 certificates.
Network Security: Electronic Mail Security, Pretty Good Privacy,
S/MIME, IP Security Overview, IP Security Architecture, Authentication
Header, Encapsulating Security Payload.
Web Security: Web Security considerations- Secure Socket Layer Transport layer Security- Secure electronic transaction. FirewallsPacket filters- Application Level Gateway- Circuit Level Gateway.
Operating System Security: Memory and Address Protection, Control
of Access to General Objects, File Protection Mechanisms, Models of
Security Bell-La Padula Confidentiality Model and Biba Integrity
Model.
System Security: Intruders, Intrusion Detection, Password
Management, Viruses and Related Threats, Virus Countermeasure.
TOTAL HOURS

Department of CSE, RSET

HOURS

12

12

12

12

12
60

19

Semester VI, Course Hand-Out

TEXT/REFERENCE BOOKS:
T/R

BOOK TITLE/AUTHORS/PUBLICATION

William Stallings, Cryptography and Network Security Principles and Practices, Pearson
Education, Fourth Edition, 2006.

Charles P. Pfleeger, Security in Computing, Pearson Education, Third Edition, 2005.

Behrouz A. Forouzan, Dedeep Mukhopadhyay Cryptography & Network Security, Second


Edition,Tata McGraw Hill, New Delhi, 2010.

Andrew S. Tanenbaum, Modern Operating Systems, Pearson Education, Second Edition,


2002.

Atul Kahate, Cryptography and Network Security, Second Edition, Tata McGraw Hill

Wenbo Mao, Modern Cryptography- Theory & Practice, Pearson Education, 2006.

Bruce Schneier, Applied Cryptography, John Wiley and Sons Inc, 2001.

COURSE PRE-REQUISITES:
C.CODE
EN010
103,301

COURSE NAME

DESCRIPTION

Engineering mathematics I & II

Mathematical Skills

CS010303
CS010505
CS010604
CS010701

PSCP

Problem Solving Skills

SEM
I,II
&
III
III

Operating Systems

System Architecture

Computer Networks

Networking

VI

Web Technologies

Programming Skills

VII

COURSE OBJECTIVES:
1
2
3

To impart an essential study of computer security issues


To develop basic knowledge on cryptography
To impart an essential study of various security mechanisms

COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING

Students will have the basic knowledge of different types of


Security attacks

a,b

Students will be able to analyze and compare different security


mechanisms and services.

a,b,c

Students will be able to analyze different modern encryption


algorithms.

a.b.c.h

Students will have the basic knowledge of different Authentication


mechanisms
Students will have the knowledge on latest techniques used in
different Security aspects (e.g. network security, web security
etc.)

a,b

a,b,c,h

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

Department of CSE, RSET

20

Semester VI, Course Hand-Out

SNO

DESCRIPTION

PROPOSED
ACTIONS

PO
MAPPING

1
2
3
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


SNO
DESCRIPTION

PO
MAPPING

1
WEB SOURCE REFERENCES:
1
2
10
DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK

LCD/SMART BOARDS

STUD.
ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES

ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

ASSIGNMENTS

STUD. LAB PRACTICES


ADD-ON COURSES

STUD. SEMINARS
STUD. VIVA
OTHERS

TESTS/MODEL
EXAMS
MINI/MAJOR PROJECTS

UNIV.
EXAMINATION
CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by
Mr. Mintu Philip

STUDENT FEEDBACK ON FACULTY (TWICE)


OTHERS

Approved
Mr. Ajith S

(H.O.D)

Department of CSE, RSET

21

Semester VI, Course Hand-Out

COURSE PLAN
SL NO
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

TOPIC
Introduction: Security basics
Aspects of network security
Attacks Different types
Security attacks
Security services and mechanisms
Basic Encryption & Decryption
Classical encryption techniques
symmetric encryption, substitution ciphers
Caesar cipher
Monoalphabetic Cipher, Playfair Cipher
Polyalphabetic cipher - Vigenre Cipher
Transposition ciphers - Rail Fence cipher, Row Transposition Ciphers
Modern Block Ciphers - Fiestel Networks
DES Algorithm
Avalanche Effect
Introduction to Number Theory - Prime Factorisation
Fermat's Theorem
Euler's Theorem
Primitive Roots
Discrete Logarithms
Public key Cryptography:- Principles of Public key Cryptography Systems
RSA algorithms
Key Management
Diffie-Hellman Key Exchange
Elliptic curve cryptography
Message Authentication-Requirements
Authentication functions
Message authentication codes
Hash function
Secure Hash Algorithm
MD5
Digital signatures- protocols
Digital signature standards
Digital Certificates
Application Level Authentications- Kerberos
X.509 Authentication Service
X.509 certificates
Network Security: Electronic Mail Security
Pretty Good Privacy
S/MIME
IP SecurityOverview
IP Security Architecture
Authentication Header
Encapsulating Security Payload
Web Security: Web Security considerations
Secure Socket Layer

Department of CSE, RSET

22

Semester VI, Course Hand-Out

47
48
49
50
51
52
55
56
57
58
59
60
61
62
63
64
65

Transport layer SecuritySecure electronic transaction


Firewalls
Packet filters
Application Level Gateway
Circuit Level Gateway
Operating System Security:
Memory and Address Protection
Control of Access to General Objects
File Protection Mechanisms
Models of Security Bell-La Padula Confidentiality Model
Biba Integrity Model
System Security: Intruders
Intrusion Detection
Password Management
Viruses and Related Threats
Virus Countermeasure.

Department of CSE, RSET

23

Semester VI, Course Hand-Out

CS010 804L05 Mobile Computing


COURSE INFORMATION SHEET
PROGRAMME:
ENGINEERING

COMPUTER SCIENCE &

DEGREE: BTECH
2014

YEAR: JAN 2014 JUNE

COURSE NAME: MOBILE COMPUTING

SEMESTER: VIII

CREDITS: 4

COURSE CODE: CS010 804 L05

COURSE TYPE: ELECTIVE

REGULATION: 2010
COURSE AREA/DOMAIN: NETWORKING AND
COMMUNICATION

CONTACT HOURS: 2+2 (Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY):


NIL

LAB COURSE NAME: NA

SYLLABUS:
UNIT

DETAILS

Introduction to wireless communication system:- 2G cellular network,2G TDMA

HOURS

Standards,3G wireless networks, wireless local loop and LMDS, Broadcast


Systems-Broadcast transmission, Digital Audio Broadcasting-Multimedia Object
Transfer Protocol. Digital Video Broadcasting.
Cellular concepts-channel assignment strategy-hand off strategy-interface and
system

10

Capacity-trunking improving coverage and capacity in cellular system.

II

Wireless Communication Systems:-Telecommunication Systems-GSM-GSM


services &
features,architecture,channel type, frame structure, signal processing in GSM &
DECT features & characteristics,architecture,functional concepts & radio link,
personal access
communication system(PACS)-system architecture-radio interface,
Protocols. Satellite Systems-GEO, LEO, MEO.

Department of CSE, RSET

12

24

Semester VI, Course Hand-Out

III

Wireless LAN and ATM:- Infra red and Radio Transmission, Infrastructure and ad
hoc
networks ,802.11- Bluetooth- Architecture, Applications and Protocol, Layers,
Frame
structure. comparison between 802.11 and 802.16.

11

Wireless ATM- Services, Reference Model, Functions, Radio Access Layer.


HandoverReference Model, Requirements, Types, handover scenarios.
Location Management, Addressing, Access Point Control Protocol (APCP).

IV

TreesBary
Mobile Network and Transport Layers:- Mobile IP- Goals, Requirements, IP
packet

14

delivery, Advertisement and discovery. Registration, Tunneling and


Encapsulation,
Optimization, Reverse Tunneling, IPv6, Dynamic Host configuring protocol, Ad hoc
networks Routing, DSDV, Dynamic source routing. Hierarchical Algorithms.
Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Transmission.

Wireless Application Protocol & World Wide Web


WAP- Architecture, Protocols-Datagram, Transaction, Session.-Wireless
Application
Environment-WML- Features, Script- Wireless Telephony Application.

13

WWW- HTTP, Usage of HTML, WWW system architecture.

TOTAL HOURS

Department of CSE, RSET

60

25

Semester VI, Course Hand-Out

TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
1

Jochen Schiller Mobile Communications , Preason Education Asia

Wireless communications Principles and practice-second edition-Theodore


S.Rappaport,PHI,Second Edition ,New Delhi, 2004

Computer Networks Andrew S. Tanenbaum , PHI

Communication Networks -Fundamental Concepts and Key Architectures


Leon-Garcia & Indra Widjaja, Tata McGraw Hill

COURSE PRE-REQUISITES:
C.CODE COURSE NAME

DESCRIPTION

SEM

CS010
604

NETWORKING FUNDAMENTALS

VI

COMPUTER NETWORKS

COURSE OBJECTIVES:
1

To learn about the concepts and principles of mobile computing.

To learn about the key components and technologies involved in building mobile applications.

Department of CSE, RSET

26

Semester VI, Course Hand-Out

To learn about Wireless networks such as 2G/3G networks and protocols , Mobile Ad-hoc
networks and mobility management strategies that are needed to support mobile computing.

COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING

Students should be able to describe the basic concepts and principles in


wireless communication systems and satellite communication systems.

a, d

Students should understand the concept of wireless LANs, wireless ATM,


Mobile and ad-hoc networks.

a, b, c, d

Students should be able to explain the structure and components of Mobile IP


,adhoc routing protocols and mobility management.

Students should be able to understand positioning techniques and location based


services and applications.

b, c, d

Students should have a good understanding of how the underlying wireless and
mobile communication networks work, their technical features and what kind of
applications they support.

a,c,h

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO DESCRIPTION

Wireless Personal Area Networks-Comparative study

PO
Mapping

PROPOSED

c, h

Reading
Assignment

ACTIONS

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST


LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1

Evolution of wireless communication systems

a, b

WEB SOURCE REFERENCES:


1

http://wsl.stanford.edu/~andrea/Wireless/SampleChapters.pdf

Department of CSE, RSET

27

Semester VI, Course Hand-Out

http://www.iject.org/pdf/amit.pdf

http://web.ee.ccu.edu.tw/~wl/wireless_class/Introduction%20to%20Wireless%20Communicati
on%20Systems.pdf

http://johnkooker.com/blog/wp-content/uploads/2009/05/jkooker_BTZigBeeWibree.pdf

5
6
7
8
9
1
0

DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK

STUD.
ASSIGNMENT

WEB RESOURCES

LCD/SMART
BOARDS

STUD. SEMINARS

ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS

STUD. SEMINARS

TESTS/MODEL
EXAMS

UNIV.
EXAMINATION

STUD. LAB
PRACTICES

STUD. VIVA

MINI/MAJOR
PROJECTS

CERTIFICATIONS

ADD-ON COURSES

OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY
FEEDBACK, ONCE)

STUDENT FEEDBACK ON FACULTY


(TWICE)

ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT.


EXPERTS

OTHERS

Department of CSE, RSET

28

Semester VI, Course Hand-Out

Prepared by
by

Approved

Ms. Tripti. C

Mr. Ajith S

(H.O.D)

Department of CSE, RSET

29

Semester VI, Course Hand-Out

Department of CSE, RSET

30

Semester VI, Course Hand-Out

2014S8CS
CS010 804L05
Course Plan
Sl.No

Module

Introduction

2G cellular network,2G TDMA


Standards,3G wireless networks

3
4
5

1
1
1

2G cellular network,2G TDMA


Standards,3G wireless networks
wireless local loop and LMDS
wireless local loop and LMDS

Broadcast Systems-Broadcast
transmission

Digital Audio Broadcasting-Multimedia


Object Transfer Protocol. Digital Video
Broadcasting.

Digital Audio Broadcasting-Multimedia


Object Transfer Protocol. Digital Video
Broadcasting.

Cellular concepts-channel assignment


strategy

10

hand off strategy-interface and system


Capacity

11
12

1
1

trunking improving coverage and


capacity in cellular system
Tutorial

13

Telecommunication Systems-GSM

14

GSM services & features,architecture

15
16

2
2

GSM services & features,architecture


channel type, frame structure

17

signal processing in GSM & DECT


features & characteristics

18

architecture,functional concepts &


radio link

19

architecture,functional concepts &


radio link

personal access communication


system(PACS)-system architecture

20

Planned

Department of CSE, RSET

31

Semester VI, Course Hand-Out

21
22
23
24

2
2
2
2

personal access communication


system(PACS)-system architecture
radio interface Protocols
radio interface Protocols
Tutorial

25

Satellite Systems-GEO, LEO, MEO

3
3

Infra red and Radio Transmission,


Infrastructure and ad hoc networks
802.11

28

Bluetooth- Architecture, Applications


and Protocol, Layers, Frame structure

29

comparison between 802.11 and


802.16

30

Wireless ATM- Services, Reference


Model, Functions, Radio Access Layer

31

Wireless ATM- Services, Reference


Model, Functions, Radio Access Layer

Handover- Reference Model,


Requirements, Types, handover
scenarios.

33

Handover- Reference Model,


Requirements, Types, handover
scenarios.

34
35

3
3

Location Management, Addressing,


Access Point Control Protocol (APCP).
Tutorial

36

Mobile IP- Goals, Requirements, IP


packet delivery, Advertisement and
discovery

37

Registration, Tunneling and


Encapsulation, Optimization

Reverse Tunneling, IPv6, Dynamic Host


configuring protocol

Ad hoc networks Routing, DSDV,


Dynamic source routing. Hierarchical
Algorithms.

26
27

32

38

39

Department of CSE, RSET

32

Semester VI, Course Hand-Out

40

Ad hoc networks Routing, DSDV,


Dynamic source routing. Hierarchical
Algorithms.

41

Traditional TCP, Indirect TCP, Snooping


TCP, Mobile TCP, Transmission.

42
43

4
4

Traditional TCP, Indirect TCP, Snooping


TCP, Mobile TCP, Transmission.
Tutorial

44

Wireless Application Protocol & World


Wide Web WAP- Architecture

45

Wireless Application Protocol & World


Wide Web WAP- Architecture

46

Protocols-Datagram, Transaction,
Session

47

Wireless Application EnvironmentWML- Features, Script

5
5
5
5
5

Wireless Application EnvironmentWML- Features, Script


Wireless Telephony Application
WWW- HTTP, Usage of HTML
WWW system architecture
Tutorial

48
49
50
51
52

Department of CSE, RSET

33

Semester VI, Course Hand-Out

CS010 804L06 Advanced Networking Trends


COURSE INFORMATION SHEET
PROGRAMME:
COMPUTER SCIENCE & ENGINEERING
COURSE: Advanced Networking Trends
COURSE CODE: CS010 804L06
COURSE AREA/DOMAIN: Networking & Communication
CORRESPONDING LAB COURSE CODE (IF ANY): NIL

DEGREE: BTECH
YEAR: JAN 2013 JUNE 2013
SEMESTER: VIII
CREDITS: 4
COURSE TYPE: Elective
CONTACT HOURS: 2(lecture)+2 (Tutorial) hours/Week.
LAB COURSE NAME: NIL

SYLLABUS:
UNIT
I

DETAILS

HOURS

Ethernet Technology Frame format Interface Gap CSMA/CD 10 mbps


Ethernet, Fast Ethernet, Gigabit Ethernet, Wireless Ethernet.
ISDN - Definition - Protocol architecture - System architecture - Transmission
channels - ISDN interface, B-ISDN.
12

II

III

ATM ATM Principles BISDN reference model ATM layers ATM adaption
Layer AAL1, AAL2, AAL3/4, AAL5 ATM addressing UNI Signaling PNNI
Signaling

12

Wireless LAN Infrared Vs Radio transmission Infrastructure & ad hoc n/w


IEEE 802.11 Physical Layer MAC layer.
Bluetooth Physical Layer MAC layer Networking Security
12

IV

Mesh Networks- Necessity for Mesh Networks MAC enhancements IEEE


802.11s Architecture Opportunistic Routing Self Configuration and Auto
Configuration - Capacity Models Fairness Heterogeneous Mesh Networks
Vehicular Mesh Networks
Sensor Networks- Introduction Sensor Network architecture Data Dissemination
Data Gathering MAC Protocols for sensor Networks Location discovery Quality
of Sensor Networks Evolving Standards Other Issues Recent trends in
Infrastructure less Networks
TOTAL HOURS

12

12

60

TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
T1
An introduction to Computer Networking - Kenneth C Mansfield, Jr., James L. Antonakos, PHI.
T2
Communication Networks Fundamental Concepts & Key Architecture - Leon-Garcia
Widjaja, Tata McGraw Hill.
R1
Mobile Communication - Jochen Schiller, Pearson Education Asia.
R2
C. Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks Architectures and
Protocols, Pearson Education, 2004.
R3
C.K.Toh, Adhoc Mobile Wireless Networks, Pearson Education, 2002.

COURSE PRE-REQUISITES:

Department of CSE, RSET

34

Semester VI, Course Hand-Out

C.CODE

COURSE NAME

DESCRIPTION

SEM

CS010 604

Computer Networks

Basic knowledge of different types of computer


networks

VI

COURSE OBJECTIVES:
1 To acquaint the students with the application of networking.
2 To understand the various TCP/IP protocols and the working of ATM and its
performance, Network security and authentication, and various algorithms related to
it has been dealt, to get a practical approach ,advanced topics in the design of
computer networks and network protocols

COURSE OUTCOMES:
Sno
1
2
3
4
5

Description

Graduates have a detailed knowledge about ethernet services, functions and ISDN
Graduates will get a better idea about ATM principles
Graduates are acquainted with thorough knowledge of wireless LAN applications and their
requirements
Graduates have awareness on mesh networks
Graduates will be familiar with architectures, functions and performance of wireless sensor
networks systems and platforms.

PO
Mapping
a,b
a,b
a,b,d
a,b
a,b,c

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO

DESCRIPTION

Android based mobile applications

Study of the Ethernet Network at college

PROPOSED
ACTIONS

Conducting workshops, main


projects.
Assignment

PO Mapping

a,c,d
a, c, d

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


Sno Topics
PO
Mapping
1
Study of various Cyber Security issues
e,h
2
Study of Broadband Wireless Communications
a,c
WEB SOURCE REFERENCES:
1
en.wikipedia.org/wiki/
2
http://www.infotoday.com/online
3
http://www.scribd.com/doc
4
http://compnetworking.about.com/cs/
5
http://www.ask.com/question
6
http://www.sciencedirect.com
7
http://www.slideshare.net
8
http://www.britannica.com
9
http://mobileoffice.about.com

Department of CSE, RSET

35

Semester VI, Course Hand-Out

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK


LCD/SMART BOARDS

STUD. ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES
ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

ASSIGNMENTS

STUD. LAB PRACTICES


ADD-ON COURSES

STUD. SEMINARS
STUD. VIVA
OTHERS

TESTS/MODEL EXAMS

MINI/MAJOR PROJECTS

UNIV. EXAMINATION

CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by
Mr. Biju Abraham N.

STUDENT FEEDBACK ON FACULTY (ONCE)


OTHERS

Approved
Mr. Ajith S

(H.O.D)

Department of CSE, RSET

36

Semester VI, Course Hand-Out

ADVANCED NETWORKING TRENDS (CS010 804L06)

Course Plan
Sl.No Module
Planned
1
1 Introduction
2
1 Ethernet Technology, Frame Format
3
1 Interface Gap
4
1 CSMA/CD
5
1 10 Mbps Ethernet, Fast Ethernet, Gigabit Ethernet
6
1 Wireless Ethernet
7
1 ISDN, Definition
8
1 Protocol Architecture
9
1 System Architecture
10
1 Transmission Channels
11
1 ISDN Interface
12
1 B-ISDN
13
2 ATM, ATM Principles
14
2 BISDN Reference Model
15
2 ATM Layers
16
2 ATM Adaptation Layer - AAL1, AAL2
17
2 ATM Adaptation Layer - AAL3/4, AAL5
18
2 ATM Addressing
19
2 UNI Signalling
20
2 PNNI Signalling
21
3 Wireless LAN
22
3 Infrared Vs Radio Transmission
23
3 Infrastrure & Adhoc N/W
24
3 IEEE 802.11
25
3 Physical Layer
26
3 MAC Layer
27
3 Bluetooth
28
3 Bluetooth Physical Layer
29
3 Bluetooth MAC Layer
30
3 Networking
31
3 Security
32
4 Mesh Networks
33
4 Necessity for Mesh Networks
34
4 MAC enhancements
35
4 IEEE 802.11s Architecture
36
4 Opportunistic Routing
37
4 Self Configuration and Auto Configuration
38
4 Capacity Models
39
4 Fairness
40
4 Heterogeneous Mesh Networks

Department of CSE, RSET

37

Semester VI, Course Hand-Out

41
42
43
44
45
46
47
48
49
50

4
5
5
5
5
5
5
5
5
5

Vehicular Mesh Networks


Sensor Networks - Introduction
Sensor Network Architecture
Data Dissemination, Data Gathering
MAC Protocols for sensor networks
Location Discovery
Quality of Sensor Networks
Evolving Standards
Other issues
Recent Trends in Infrastructureless Networks

Department of CSE, RSET

38

Semester VI, Course Hand-Out

CS010 805G02 Neural Networks


COURSE INFORMATION SHEET
PROGRAMME: COMPUTER SCIENCE & ENGINEERING
COURSE: NEURAL NETWORKS
COURSE CODE: CS010 805G02 REGULATION: 2010
COURSE AREA/DOMAIN: RECENT TRENDS IN
COMPUTING
CORRESPONDING LAB COURSE CODE (IF ANY): NIL

DEGREE: BTECH
SEMESTER: VIII
CREDITS: 4
COURSE TYPE: ELECTIVE
CONTACT HOURS: 2+2 (Tutorial) hours/Week.
LAB COURSE NAME: NIL

SYLLABUS:
UNIT
I

DETAILS

HOURS

Biological Neurons and Neural Networks, Basic Structures and Properties of Artificial
Neural Networks, Basic Neuron Models-McCulloch-Pitts -Nearest Neighbour- Radial Basis
Function, Activation Functions ,Singe Layer Perceptrons-Linear Seperability, Learning and
Generalization in Single Layer Perceptron-Hebbian Learning-Gradient Descent LearningWidrow-Hoff Learning-The Generalized Delta rule, Practical Considerations

14

II

Multi Layer Perceptron Learning,Back Propogation Algorithim -Applications


LimitationsNetwork Paralysis Local Minima Temporal Instability, Pattern Analysis
Tasks- Classification-Regression- Clustering, Pattern Classification and Regression using
Multilayer Perceptron.

12

III

Radial Basis Function Networks: Fundamentals, Algorithms and Applications, Learning


with Momentum, Conjugate Gradient Learning, Bias and Variance. Under-Fitting and OverFitting,Stochastic neural networks, Boltzmann machine.
Network based on competition:- Fixed weight competitive Network-Maxnet, Mexican Hat
and Hamming Net, Counter Propagation Networks- Kohonens self-organizing map
Training the Kohonen layer Training the Grossberg layer Full counter propagation
network Application, Adaptive resonance theory classification- Architecture Learning
and generalization.

10

Pattern Association: - training algorithm for pattern association - Hetro Associative


Network, Auto Associative Network, Architecture of Hopfield nets stability analysis
,General Concepts of Associative Memory, Bidirectional Associative Memory (BAM)
Architecture, BAM training algorithms.

12

TOTAL HOURS

60

IV

12

TEXT/REFERENCE BOOKS:
T/R
R1.
R2.
R3.
R4.

BOOK TITLE/AUTHORS/PUBLICATION

B. Yegnanarayana, "Artificial Neural Networks", PHI.


Simon Haykin, Neural Networks, 2/e, Prentice Hall
Neural Computing & Practice Philip D. Wass
Neural Networks in Computer Intelligence-Limin Fu,Tata Mc.Hill Edition

COURSE PRE-REQUISITES:
C.CODE

EN010301 B
CS010 601

COURSE NAME
Engineering Mathematics II

Design And Analysis Of Algorithms

Department of CSE, RSET

DESCRIPTION

Graph Theory
To develop an understanding about how to develop an
algorithm, how to do pseudo code conversion and to
analysis time and space complexity.

SEM
III
VI

39

Semester VI, Course Hand-Out

CS010 802

VII

Introduction to the basic knowledge representation,


problem solving, and learning methods of Artificial
Intelligence.

ARTIFICIAL INTELLIGENCE

COURSE OBJECTIVES:
1

To understand the fundamental building blocks of Neural networks

COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING
a,b,c,e

Graduates will be able to differentiate biological neural network and artificial neural network and will
also understand the basic structures, models and properties of neural network

Graduate will gain knowledge on pattern analysis task, applications of neural network using back
propagation algorithm and its limitations.

a,b,c

Graduate will be able to learn fundamentals, algorithm and applications of radial basis function
network

a,b,c

4.

Graduate will have an insight into different neural network based on competition

a,b,c

Graduate will be able to learn pattern association and Associative Neural-networks

a,b,c

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO

DESCRIPTION

Implementation of neural network application


like handwritten detection, cancer detection

PROPOSED
ACTIONS

Project work on neural network


applications and guest lectures on
neural network applications

PO
MAPPING

b,c,e,f

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


SNO TOPICS
1
Implementation of handwritten detection using neural network
2
Realization of logical gates using neural networks

PO MAPPING
b,c,d,e
c,d

WEB SOURCE REFERENCES:


http://www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/neural-networks/Neuron/index.html
1

http://www.codeproject.com/Articles/24361/A-Neural-Network-on-GPU

http://www.sourcecodeonline.com/ (To get sample project on neural network)

http://www.codeproject.com/Articles/14188/Brainnet-1-A-Neural-Netwok-Project-WithIllustrati#1.1%20Introduction%20To%20This%20Article%20Series

Department of CSE, RSET

40

Semester VI, Course Hand-Out

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK

LCD/SMART
BOARDS

STUD.
ASSIGNMENT

STUD. SEMINARS

WEB RESOURCES

ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

ASSIGNMENTS

STUD. SEMINARS

STUD. LAB PRACTICES

STUD. VIVA

ADD-ON COURSES

OTHERS

TESTS/MODEL
EXAMS
MINI/MAJOR PROJECTS

UNIV.
EXAMINATION

CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT

ASSESSMENT OF COURSE OUTCOMES (BY


FEEDBACK, ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by
Amitha Mathew

Department of CSE, RSET

STUDENT FEEDBACK ON FACULTY (ONCE)


OTHERS

Approved
(HOD)

41

Semester VI, Course Hand-Out

CS010 805G02 :Neural networks(Elective IV)


COURSE PLAN
Sl
Day Module
TOPIC
No
1
1
Introduction,Biological Neurons and Neural Networks
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

Basic Structures and Properties of Artificial Neural Networks


Basic Neuron Models
McCulloch-Pitts
Nearest Neighbour
Radial Basis Function
Activation Functions
Single Layer Perceptrons
Linear Seperability
Learning and Generalization in Single Layer Perceptron
Hebbian Learning-Gradient Descent Learning
Widrow-Hoff Learning
The Generalized Delta rule
Practical Considerations
Multi Layer Perceptron Learning
Back Propogation Algorithim
Applications
Limitations
Network Paralysis
Local Minima
Temporal Instability
Pattern Analysis Tasks
Classification
Regression
Clustering
Pattern Classification and Regression using Multilayer Perceptron
Radial Basis Function Networks: Fundamentals
Algorithms
Applications
Learning with Momentum
Conjugate Gradient Learning
Bias and Variance
Under-Fitting and Over-Fitting
Stochastic neural networks
Boltzmann machine
Network based on competition:- Fixed weight competitive Network
Maxnet, Mexican Hat and Hamming Net
Counter Propagation Networks

Department of CSE, RSET

42

Semester VI, Course Hand-Out

39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

Kohonens self-organizing map


Training the Kohonen layer
Training the Grossberg layer
Full counter propagation network
Application
Adaptive resonance theory classification
Architecture
Learning and generalization
Pattern Association: - training algorithm for pattern association
Hetro Associative Network
Auto Associative Network
Architecture of Hopfield nets
stability analysis
General Concepts of Associative Memory
Bidirectional Associative Memory (BAM) Architecture
BAM training algorithms
University Question Paper Discussion
Revision

Department of CSE, RSET

43

Semester VI, Course Hand-Out

CS010 805G05 Natural Language Processing


COURSE INFORMATION SHEET
PROGRAMME:
COMPUTER SCIENCE & ENGINEERING
COURSE: NATURAL LANGUAGE PROCESSING
COURSE CODE: CS010 805G05
COURSE AREA/DOMAIN: PROGRAMMING LANGUAGE
CORRESPONDING LAB COURSE CODE (IF ANY):

DEGREE: BTECH
YEAR: JUNE 2013 DEC 2013
SEMESTER: VIII
CREDITS: 4
COURSE TYPE: ELECTIVE
CONTACT HOURS: 2+2 (Tutorial) hours/Week.
LAB COURSE NAME:

SYLLABUS:
UNIT
I

DETAILS

HOURS

INTRODUCTION:Introduction: Knowledge in speech and language processing Ambiguity Models


and Algorithms Language, Thought and Understanding. Regular Expressions and automata: Regular
expressions Finite-State automata. Morphology and Finite-State Transducers: Survey of English
morphology Finite-State Morphological parsing Combining FST lexicon and rules Lexicon-Free
FSTs: The porter stammer Human morphological processing

12

II

III

IV

SYNTAX:Word classes and part-of-speech tagging: English word classes Tagsets for English Partof-speech tagging Rule-based part-of-speech tagging Stochastic part-of speech tagging
Transformation-based tagging Other issues. Context-Free Grammars for English: Constituency
Context-Free rules and trees Sentence-level constructions The noun phrase Coordination
Agreement The verb phase and sub categorization Auxiliaries Spoken language syntax Grammars
equivalence and normal form Finite-State and Context-Free grammars Grammars and human
processing. Parsing with Context-Free Grammars: Parsing as search A Basic Top-Down parser
Problems with the basic Top- Down parser The early algorithm Finite-State parsing methods.
ADVANCED FEATURES AND SYNTAX :Features and Unification: Feature structures
Unification of feature structures Features structures in the grammar Implementing unification
Parsing with unification constraints Types and Inheritance. Lexicalized and Probabilistic Parsing:
Probabilistic context-free grammar problems with PCFGs Probabilistic lexicalized CFGs
Dependency Grammars Human parsing.
SEMANTIC:Representing Meaning: Computational desiderata for representations Meaning
structure of language First order predicate calculus Some linguistically relevant concepts
Related representational approaches Alternative approaches to meaning. Semantic Analysis:
Syntax-Driven semantic analysis Attachments for a fragment of English Integrating semantic analysis
into the early parser Idioms and compositionality Robust semantic analysis. Lexical semantics:
relational among lexemes and their senses WordNet: A database of lexical relations The Internal
structure of words Creativity and the lexicon.
APPLICATIONS:Word Sense Disambiguation and Information Retrieval: Selectional restriction-based
disambiguation Robust word sense disambiguation Information retrieval other information retrieval
tasks. Natural Language Generation: Introduction to language generation Architecture for generation
Surface realization Discourse planning Other issues. Machine Translation: Language similarities and
differences The transfer metaphor The interlingua idea: Using meaning Direct translation Using
statistical techniques Usability and system development.
TOTAL HOURS

12

12

12

12

60

TEXT/REFERENCE BOOKS:
T/R
1

BOOK TITLE/AUTHORS/PUBLICATION

James Allen, Natural Language Understanding, Pearson Education, 2003

Daniel Jurafsky & James H.Martin, Speech and Language Processing, Pearson
Education(Singapore)Pte.Ltd.,2002.

COURSE PRE-REQUISITES:
C.CODE
CS010
702,CSOIO406

COURSE NAME
COMPILER CONSTRUCTION,THEORY OF
COMPUTATION

DESCRIPTION
Compiler consepts,parsing,automata langauges

SEM
VI,IV

COURSE OBJECTIVES:
1

To acquire a general introduction including the use of state automata for

Department of CSE, RSET

44

Semester VI, Course Hand-Out

2
3
4
5

language processing
To understand the fundamentals of syntax including a basic parse
To explain advanced feature like feature structures and realistic parsing
Methodologies
To explain basic concepts of remotes processing
To give details about a typical natural language processing applications

COURSE OUTCOMES:
SNO

DESCRIPTION

1
2
3
4
5

PO
MAPPING
a,b
a,b,c,d
b,c
b
f,g,h

Graduates will have knowledge in Morphological features of English language


Graduates will have the ability to design a parser for English language
Graduates will be able to design a good Syntax representation a language
Graduates will be able represent syntax and semantics of a language
Graduates will able to do projects in Translation,Disambiguation,Discourse analysis etc.

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SN
O

DESCRIPTION

PROPOSED
ACTIONS

Morphology of Malayalam or other Indian


languages
Parsing Indian languages
Translating Indian languages

2
3

PO
MAPPING

Assignment

Assignment
Lab Session/projects

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


SNO

Topic

PO MAPPINGS

Text Segmentation

Text Clustering

b,c,g
b,c,g

Text Summarization

b,c,g

Implementation of Support vector machines

Use of Neural networks,Genetic algorithms


Fuzzy logic for Text processing

b,c,g
b,c,f,g

WEB SOURCE REFERENCES:


1
http://www.cs.toronto.edu/~kazemian/textsegsum.pdf
2
www.unal.edu.co/diracad/einternacional/Weka.pdf
3
4
5

http://link.springer.com/chapter/10.1007%2F978-1-4614-3223-4_3#page-1
www.joachims.org publications joachims
a.pd
http://www.statsoft.com/textbook/support-vector-machines/

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK


LCD/SMART BOARDS

STUD. ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES
ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT
m.

ASSIGNMENTS

STUD. SEMINARS

STUD. LAB PRACTICES

MINI/MAJOR PROJECTS

Department of CSE, RSET

STUD. VIVA

TESTS/MODEL EXAMS

UNIV.
EXAMINATION
CERTIFICATIONS

45

Semester VI, Course Hand-Out

ADD-ON COURSES

OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
Dhanya P.M

Department of CSE, RSET

STUDENT FEEDBACK ON FACULTY (ONCE)


OTHERS

Approved by
Mr. Ajith S
(H.O.D)

46

Semester VI, Course Hand-Out

Department of CSE, RSET

47

Semester VI, Course Hand-Out

CS010 806 Computer Graphics Lab


COURSE INFORMATION SHEET
PROGRAMME: COMPUTER SCIENCE & ENGINEERING
COURSE: COMPUTER GRAPHICS LAB
COURSE CODE: CS010 806
REGULATION: 2010
COURSE AREA/DOMAIN: RECENT TRENDS IN
COMPUTING
CORRESPONDING LAB COURSE CODE (IF ANY):

DEGREE: BTECH JAN-JUN 2014


SEMESTER: EIGHTH
CREDITS: 2
COURSE TYPE: CORE
CONTACT HOURS: 3 hours/Week.
LAB COURSE NAME:

SYLLABUS:
UNIT
I

II

DETAILS

HOURS
9

Experiments to implement the following


1 DDA Algorithm
2. Bresenham's Line drawing Algorithm for any slope.
3. Mid-point Circle Algorithm.
4. 2D Transformations
Experiments to implement the following
1. 3D Rotations on a cube (about any axis, any general line) controlled by keyboard
navigation keys.
2. 3D Rotations on a cube with hidden surface elimination.(keyboard controlled)
3. Composite transformations
4. Bezier cubic splines like screen saver
5. Any Fractal Construction (Koch curve )
6. Animations using the above experiments.(eg.moving along curved path)

33

TOTAL HOURS

42

Lab Cycle
1.
2.
3.
4.

Implement DDA line Algorithm.


Implement Bresenhams line Algorithm.
Implement Bresenham's circle Algorithm.
Implement Midpoint Circle Algorithm

5.

6.

Menu driven program to do the following transformations on an asymmetric


quadrilateral. a)Translation. b) Scaling. c) Rotation. d) Reflection.
Write a program to implement Bezier and B-Spline curves

7.
8.

Write a program to implement Cohen-Sutherland line clipping algorithm.


Implement polygon clipping using Sutherland-Hodgeman polygon clipping algorithm.

9. Write a program to implement Composite transformations


10. Menu driven program to do the following 3d transformations on a cube
a) Translation. c) Rotation. d) hidden surface elimination

11. Simulate a scene in which a man with an umbrella rowing a boat is subjected to three
different climatic conditions like hot sun, heavy rain and strong wind.
12. Simulate a moving conveyor belt with a ball placed on it. The spokes of the wheel
should rotate.
13. Simulate the motion of a cyclist on a slope. The cycle should ascend the hill, descend
the hill and move through the plain.
14. Simulate a burning candle (height should reduce gradually).Show how the flame
waves in the wind

Department of CSE, RSET

48

Semester VI, Course Hand-Out

15. Write a program to implement a fern (fractal)

TEXT/REFERENCE BOOKS:
T/R
R1
R2
R3

BOOK TITLE/AUTHORS/PUBLICATION

Computer Graphics (C version) - Donald Hearn & Pauline Baker (Pearson Education
Asia)
Procedural Elements for Computer Graphics David F. Rogers, TATA McGraw Hill
edition-second edition.
Computer Graphics - Zhigang Xiang & Roy A Plastack, Schaums Series McGraw
Hill edition.

COURSE PRE-REQUISITES:
C.CODE
COURSE NAME
EN010101 Engineering Mathematic I
CS010307
CS010703

Programming Lab
COMPUTER GRAPHICS

DESCRIPTION
Basic familiarity with calculus and linear
algebra
Programming skills
Theoretical background

SEM
1
3
7

COURSE OBJECTIVES:
1 To acquaint the students with the implementation of fundamental algorithms in Computer Graphics.
COURSE OUTCOMES:
SNO

DESCRIPTION

PO
MAPPING
A,b,c

Students will develop programs for lines and circle drawing.

Students will program the hidden surface elimination technique and demonstrate the
rotation of the 3d object.

A,b,c

Students will write program functions to implement the different transformations that
includes rotation, translation, scaling of 2d objects

A,b,c,e

Students will be able to construct curves and irregular patterns

A,b,c

Students will write programs that demonstrate computer graphics animations

A,c,b

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO
DESCRIPTION

PROPOSED
ACTIONS

1
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST
LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
SNO
DESCRIPTION
1

Conics drawing algorithm

Department of CSE, RSET

PO
MAPPING
A,b

49

Semester VI, Course Hand-Out

WEB SOURCE REFERENCES:


1
http://www.sersc.org/journals/IJCG/vol3_no2/1.pdf
2
http://winnyefanho.net/research/MEA.pdf
3
http://users.iit.demokritos.gr/~agalex/publications/CAG98.pdf
4
http://www.hhhprogram.com/2013/05/draw-elipse-midpoint-elipse-algorithm.html
5
http://comjnl.oxfordjournals.org/content/10/3/282.full.pdf
DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK


LCD/SMART BOARDS

STUD. ASSIGNMENT
STUD. SEMINARS

WEB RESOURCES
ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
STUD. LAB PRACTICES
ADD-ON COURSES

STUD. SEMINARS
STUD. VIVA
OTHERS

TESTS/MODEL EXAMS
MINI/MAJOR PROJECTS
RECORD

UNIV. EXAMINATION
CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT

ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,


ONCE)
ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by
by

STUDENT FEEDBACK ON FACULTY (ONCE)


OTHERS

Approved
Ajith S

Elizabeth Isaac

Department of CSE, RSET

50

Semester VI, Course Hand-Out

COURSE PLAN
CS010 806 Computer Graphics Lab
LAB SCHEDULE-S8CS A & B

Cycle 1: Implementation of Graphics Algorithm


Day-1
1. Implement DDA Line Drawing Algorithm.
2. Implement Bresenhams line Algorithm.
Viva: Module 1
Day-2
3. Implement Bresenhams circle Algorithm.
4. Implement Midpoint circle Algorithm.
Viva: Module 1
Day-3
5. Menu driven program to do the following transformations on an asymmetric
quadrilateral.
a. Translation.
b. Scaling.
c. Rotation.
d. Reflection.
6. Write a menu driven program to implement composite 2d transformation.
Viva: Module 2 , Fair Record submission of Experiment 1,2,3,4.
Day-4
7. Menu driven program to do the following 3d transformations on a cube
a) Translation. c) Rotation. d) hidden surface elimination
8. Write a program to Implement Sierpinski Gasket using fractals
Viva: Module 2
Day-5
9. Write a program to implement Bezier cubic splines like screen saver.
10. Write a program to implement Bezier Curves and B-Spline Curves.
Viva: Module 3
Day-6
11. Implement polygon clipping using Sutherland-Hodgeman polygon clipping
algorithm.
12. Write a program to implement Cohen-Sutherland line clipping algorithm.
Viva: Module 3, Fair Record submission of Experiment 5,6,7,8.
Day-7
Mid term Lab Exam
12.

Viva: Module 1,2,3. , Fair Record submission of Experiments 1-

Department of CSE, RSET

51

Semester VI, Course Hand-Out

Cycle 2: Animation
Day-8
13. To write a program in c to simulate working of a table fan, display the
regulator and change rotation speed using mouse clicks.
14. To write a program in c to simulate aeroplane with the following functions
1.take off
2.landing
3.turning left
4.turning right
Use arrow keys for different functions.
Viva: Module 4 and 5
Day-9
15. Simulate the motion of a cyclist on a slope. The cycle should ascend the hill,
descend the hill and move through a plain.
16. Simulate a burning candle (height should reduce gradually).Show how the
flame waves in the wind.
Viva: Module 4 and 5
Day-10
Final lab exam & Viva , Final record submission.

SI NO

Heading

R1

DDA LINE DRAWING ALGORITHM

R2

BRESENHAMS LINE DRAWING ALGORITHM

R3

BRESENHAMS CIRCLE DRAWING ALGORITHM

R4

MIDPOINT CIRCLE DRAWING ALGORITHM

R5

2D TRANSFORMATION

R6

2D COMPOSITE TRANSFORMATION

R7

3D TRANSFORMATION

Department of CSE, RSET

52

Semester VI, Course Hand-Out

R8

COHEN-SURTHERLAND LINE CLIPPING ALGORITHM

R9

SIERPINSKI GASKET

R10

BEZIER CURES AND B-SPLINES CURVES

R11

BEZIER CUBIC SPLINES

R12

SUTHERLAND-HODGEMAN POLYGON CLIPPING

R13

TABLE FAN

R14

AEROPLANE MOVEMENTS

R15

MAN RIDING A BYCYCLE

R16

BURNING CANDLE

Department of CSE, RSET

53

Semester VI, Course Hand-Out

CS010 807 Project


COURSE INFORMATION SHEET
PROGRAMME:
COMPUTER SCIENCE
& ENGINEERING
COURSE: PROJECT WORK

DEGREE: BTECH

COURSE CODE : CS010 807


REGULATION:
2010
COURSE AREA/DOMAIN:
CORRESPONDING LAB COURSE CODE (IF
ANY):

COURSE TYPE: CORE

SEMESTER:

VII

CREDITS: 4

CONTACT HOURS: 6 hours/Week.


LAB COURSE NAME:

SYLLABUS:
UNIT DETAILS
HOURS
The progress in the project work is to be presented by the middle of
eighth semester before the evaluation committee. By this time, the
students will be in a position to publish a paper in international/
national journals/conferences. The EC can accept, accept with
modification, and request a resubmission. The progress of project
work is found unsatisfactory by the EC during the middle of the eighth
semester presentation, such students has to present again to the EC at
the end of the semester and if it is also found unsatisfactory an
extension of the project work can be given to the students.
Project report: To be prepared in proper format decided by the
concerned department. The report shall record all aspects of the work,
highlighting all the problems faced and the approach/method
employed to solve such problems. Members of a project group shall
prepare and submit separate reports. Report of each member shall
give details of the work carried out by him/her, and only summarize
other members work.
The students sessional marks for project will be out of 100, in which
60 marks will be based on day to day performance assessed by the
guide. Balance 40 marks will be awarded based on the presentation of
the project by the students before an evaluation committee.
TOTAL HOURS 6
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
Seven latest international journal papers having high impact factor
COURSE PRE-REQUISITES:
C.CODE
COURSE NAME
CS010 304 Computer Organization
Department of CSE, RSET

DESCRIPTION

SEM
3
54

Semester VI, Course Hand-Out

CS010 305
CS010 403
CS010 405
CS010 406
CS010503
CS010505
CS010602
CS010604
CS010710

Switching Theory and Logic


Design
Data Structures and
Algorithms
Microprocessor Systems
Theory of Computation
Database Management
Systems
Operating Systems
Internet Computing
Computer Networks
Project Work

3
4
4
4
5
5
6
6
7

COURSE OBJECTIVES:
1 To help student demonstrate practical concepts, command and knowledge gained so
far into realistic project
2 Provide exposure to prominent cutting edge technologies, sufficient training and
opportunistic to work as teams on multidisciplinary projects with effective writing
and communication skills

COURSE OUTCOMES:
SNO
1
2

3
4

DESCRIPTION

Graduates will be able to make contributions in design,


implementations and execution of Computer science related projects.
Graduates will be able to develop practical skills needed to
understand and modify problems related to programming and
designing
Graduates will get an exposure to current technologies
Graduates will get opportunities to work as teams on
multidisciplinary projects with effective writing and communication
skills

PO
MAPPING
a,c
a,c

d
f,g

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:


SNO
DESCRIPTION
PROPOSED
ACTIONS
Department of CSE, RSET

55

Semester VI, Course Hand-Out

1
2
3
4
5
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY
VISIT/GUEST LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
1
2
3
4
5
WEB SOURCE REFERENCES:
1
ieee.org
2
dl.acm.org
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK
WEB
STUD.
RESOURCES
ASSIGNMENT
LCD/SMART
BOARDS

STUD.
SEMINARS

ASSESSMENT METHODOLOGIES-DIRECT
STUD.

SEMINA
ASSIGNMEN
RS
TS
STUD.
LAB
PRACTICES
ADD-ON
COURSES

STUD.
VIVA

TESTS/MOD
EL EXAMS

UNIV.
EXAMINATION

MINI/MAJOR
PROJECTS

CERTIFICATIO
NS

OTHER
S

ASSESSMENT METHODOLOGIES-INDIRECT
ASSESSMENT OF COURSE OUTCOMES
(BY FEEDBACK, ONCE)

Department of CSE, RSET

ADD-ON
COURSES

STUDENT FEEDBACK ON
FACULTY (TWICE)

56

Semester VI, Course Hand-Out

ASSESSMENT OF MINI/MAJOR

OTHERS

PROJECTS BY EXT. EXPERTS

Prepared by
by
Mintu Philip

Department of CSE, RSET

Approved
(HOD)

57

Vous aimerez peut-être aussi