Académique Documents
Professionnel Documents
Culture Documents
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
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
B.TECH PROGRAMME
INDEX
SCHEME: B.TECH 8TH SEMESTER
7
10
14
14
COURSE PLAN
17
19
19
COURSE PLAN
22
24
24
Course Plan
31
34
34
Course Plan
37
39
39
COURSE PLAN
42
44
44
48
48
COURSE PLAN
51
54
54
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
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
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.
COURSE PRE-REQUISITES:
C.CODE
CS010
304
COURSE NAME
COMPUTER ORGANISATION
DESCRIPTION
ARCHITECTURE
SEM
III
COURSE OBJECTIVES:
1
2
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
DESCRIPTION
PROPOSED
ACTIONS
PO
MAPPING
Assignment
Reading
assignment
c,d
PO
MAPPING
a, d
a, d
csd.ijs.si/courses/dataflow/
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
STUD. ASSIGNMENT
STUD. SEMINARS
WEB RESOURCES
ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
STUD. LAB PRACTICES
STUD. SEMINARS
SIMPLE QUESTIONS
TESTS/MODEL EXAMS
MINI/MAJOR PROJECTS
UNIV. EXAMINATION
CERTIFICATIONS
ADD-ON COURSES
IN TUTORIAL HOUR
OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
Prepared by
by
Ms.Deepa John
Approved
Mr. Ajith S
(H.O.D)
2014 S8 CS
CS010 801- HIGH PERFORMANCE COMPUTING
COURSE PLAN
Sl.No
Module
Day 1
Day 2
Day 3
Parallelism in Uniprocessor
Day 4
Parallelism in Uniprocessor
Day 5
Day 6
Day 7
Day 8
Day 9
Amdahls Law
10
Day 10
11
Day 11
Linear pipelining
12
Day 12
13
Day 13
General pipelines
14
Day 14
15
Day 15
Planned
10
16
Day 16
17
Day 17
18
Day 18
19
Day 19
20
Day 20
21
Day 21
22
Day 22
23
Day 23
24
Day 24
25
Day 25
26
Day 26
27
Day 27
28
Day 28
29
Day 29
30
Day 30
Interconnection networks
31
Day 31
32
Day 32
33
Day 33
34
Day 34
11
35
Day 35
36
Day 36
37
Day 37
38
Day 38
39
Day 39
40
Day 40
41
Day 41
Memory organization
42
Day 42
43
Day 43
44
Day 44
45
Day 45
Interconnection networks
46
Day 46
47
Day 47
48
Day 48
49
Day 49
50
Day 50
51
Day 51
52
Day 52
Dataflow computers
53
Day 53
12
54
Day 54
55
Day 55
56
Day 56
57
Day 57
58
Day 58
59
Day 59
60
Day 60
13
COURSE: ARTIFICIAL
DEGREE: BTECH
SEMESTER: VIII
COURSE CODE:
INTELLIGENCE
CS010 802
REGULATION:
2010
COURSE AREA/DOMAIN: RECENT TRENDS IN
COMPUTING
CORRESPONDING LAB COURSE CODE (IF ANY):
SYLLABUS:
UNIT
I
II
DETAILS
HOURS
14
12
III
IV
12
12
10
60
TEXT/REFERENCE BOOKS:
T/R
R1
R2
BOOK TITLE/AUTHORS/PUBLICATION
14
R3
R4
COURSE PRE-REQUISITES:
C.CODE
CS010 303
COURSE NAME
Problem Solving & Computer Programming
CS010 403
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
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
DESCRIPTION
PROPOSED
ACTIONS
Assignment
Assignment
PO MAPPING
d
c,d
15
www.nptel.iitm.ac.in/video.php?subjectId=106105077
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
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
Prepared by
by
Ms. Sangeetha Jamal
OTHERS
Approved
Mr. Ajith S
(H.O.D)
16
COURSE PLAN
SL
NO
TOPICS
MODULE
DAY 1
DAY 2
DAY 3
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
MODULE 1
MODULE 2
MODULE 2
The A * Algorithm
MODULE 2
Problem Reduction
MODULE 2
MODULE 2
Constraint Satisfaction
MODULE 2
MODULE 2
MODULE 2
AlphaBeta pruning
MODULE 2
MODULE 3
MODULE 3
MODULE 3
MODULE 3
MODULE 3
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
17
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
MODULE 3
Rote Learning
MODULE 4
Learning by Advice
MODULE 4
MODULE 4
MODULE 4
MODULE 4
MODULE 4
MODULE 4
Candidate Elimination
MODULE 4
Decision Trees
MODULE 4
MODULE 4
MODULE 5
MODULE 5
MODULE 5
MODULE 5
MODULE 5
MODULE 5
MODULE 5
MODULE 5
Knowledge acquisition-examples
MODULE 5
18
DEGREE: BTECH
SEMESTER:
COURSE CODE:
CS010 803
VIII
CREDITS: 4
SYLLABUS:
UNIT
DETAILS
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
HOURS
12
12
12
12
12
60
19
TEXT/REFERENCE BOOKS:
T/R
BOOK TITLE/AUTHORS/PUBLICATION
William Stallings, Cryptography and Network Security Principles and Practices, Pearson
Education, Fourth Edition, 2006.
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
Mathematical Skills
CS010303
CS010505
CS010604
CS010701
PSCP
SEM
I,II
&
III
III
Operating Systems
System Architecture
Computer Networks
Networking
VI
Web Technologies
Programming Skills
VII
COURSE OBJECTIVES:
1
2
3
COURSE OUTCOMES:
SNO
DESCRIPTION
PO
MAPPING
a,b
a,b,c
a.b.c.h
a,b
a,b,c,h
20
SNO
DESCRIPTION
PROPOSED
ACTIONS
PO
MAPPING
1
2
3
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC
PO
MAPPING
1
WEB SOURCE REFERENCES:
1
2
10
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
LCD/SMART BOARDS
STUD.
ASSIGNMENT
STUD. SEMINARS
WEB RESOURCES
ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
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
Approved
Mr. Ajith S
(H.O.D)
21
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
22
47
48
49
50
51
52
55
56
57
58
59
60
61
62
63
64
65
23
DEGREE: BTECH
2014
SEMESTER: VIII
CREDITS: 4
REGULATION: 2010
COURSE AREA/DOMAIN: NETWORKING AND
COMMUNICATION
SYLLABUS:
UNIT
DETAILS
HOURS
10
II
12
24
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
IV
TreesBary
Mobile Network and Transport Layers:- Mobile IP- Goals, Requirements, IP
packet
14
13
TOTAL HOURS
60
25
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
1
COURSE PRE-REQUISITES:
C.CODE COURSE NAME
DESCRIPTION
SEM
CS010
604
NETWORKING FUNDAMENTALS
VI
COMPUTER NETWORKS
COURSE OBJECTIVES:
1
To learn about the key components and technologies involved in building mobile applications.
26
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
a, d
a, b, c, d
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
PO
Mapping
PROPOSED
c, h
Reading
Assignment
ACTIONS
a, b
http://wsl.stanford.edu/~andrea/Wireless/SampleChapters.pdf
27
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)
OTHERS
28
Prepared by
by
Approved
Ms. Tripti. C
Mr. Ajith S
(H.O.D)
29
30
2014S8CS
CS010 804L05
Course Plan
Sl.No
Module
Introduction
3
4
5
1
1
1
Broadcast Systems-Broadcast
transmission
10
11
12
1
1
13
Telecommunication Systems-GSM
14
15
16
2
2
17
18
19
20
Planned
31
21
22
23
24
2
2
2
2
25
3
3
28
29
30
31
33
34
35
3
3
36
37
26
27
32
38
39
32
40
41
42
43
4
4
44
45
46
Protocols-Datagram, Transaction,
Session
47
5
5
5
5
5
48
49
50
51
52
33
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
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
IV
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:
34
C.CODE
COURSE NAME
DESCRIPTION
SEM
CS010 604
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
DESCRIPTION
PROPOSED
ACTIONS
PO Mapping
a,c,d
a, c, d
35
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
STUD. ASSIGNMENT
STUD. SEMINARS
WEB RESOURCES
ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
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.
Approved
Mr. Ajith S
(H.O.D)
36
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
37
41
42
43
44
45
46
47
48
49
50
4
5
5
5
5
5
5
5
5
5
38
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
12
III
10
12
TOTAL HOURS
60
IV
12
TEXT/REFERENCE BOOKS:
T/R
R1.
R2.
R3.
R4.
BOOK TITLE/AUTHORS/PUBLICATION
COURSE PRE-REQUISITES:
C.CODE
EN010301 B
CS010 601
COURSE NAME
Engineering Mathematics II
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
CS010 802
VII
ARTIFICIAL INTELLIGENCE
COURSE OBJECTIVES:
1
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
a,b,c
DESCRIPTION
PROPOSED
ACTIONS
PO
MAPPING
b,c,e,f
PO MAPPING
b,c,d,e
c,d
http://www.codeproject.com/Articles/24361/A-Neural-Network-on-GPU
http://www.codeproject.com/Articles/14188/Brainnet-1-A-Neural-Netwok-Project-WithIllustrati#1.1%20Introduction%20To%20This%20Article%20Series
40
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
LCD/SMART
BOARDS
STUD.
ASSIGNMENT
STUD. SEMINARS
WEB RESOURCES
ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS
STUD. SEMINARS
STUD. VIVA
ADD-ON COURSES
OTHERS
TESTS/MODEL
EXAMS
MINI/MAJOR PROJECTS
UNIV.
EXAMINATION
CERTIFICATIONS
ASSESSMENT METHODOLOGIES-INDIRECT
Prepared by
by
Amitha Mathew
Approved
(HOD)
41
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
42
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
43
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
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
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
44
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
DESCRIPTION
PROPOSED
ACTIONS
2
3
PO
MAPPING
Assignment
Assignment
Lab Session/projects
Topic
PO MAPPINGS
Text Segmentation
Text Clustering
b,c,g
b,c,g
Text Summarization
b,c,g
b,c,g
b,c,f,g
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:
STUD. ASSIGNMENT
STUD. SEMINARS
WEB RESOURCES
ADD-ON COURSES
ASSESSMENT METHODOLOGIES-DIRECT
m.
ASSIGNMENTS
STUD. SEMINARS
MINI/MAJOR PROJECTS
STUD. VIVA
TESTS/MODEL EXAMS
UNIV.
EXAMINATION
CERTIFICATIONS
45
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
Approved by
Mr. Ajith S
(H.O.D)
46
47
SYLLABUS:
UNIT
I
II
DETAILS
HOURS
9
33
TOTAL HOURS
42
Lab Cycle
1.
2.
3.
4.
5.
6.
7.
8.
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
48
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 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
A,b,c
A,c,b
PROPOSED
ACTIONS
1
PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST
LECTURER/NPTEL ETC
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
SNO
DESCRIPTION
1
PO
MAPPING
A,b
49
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
Prepared by
by
Approved
Ajith S
Elizabeth Isaac
50
COURSE PLAN
CS010 806 Computer Graphics Lab
LAB SCHEDULE-S8CS A & B
51
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
R2
R3
R4
R5
2D TRANSFORMATION
R6
2D COMPOSITE TRANSFORMATION
R7
3D TRANSFORMATION
52
R8
R9
SIERPINSKI GASKET
R10
R11
R12
R13
TABLE FAN
R14
AEROPLANE MOVEMENTS
R15
R16
BURNING CANDLE
53
DEGREE: BTECH
SEMESTER:
VII
CREDITS: 4
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
CS010 305
CS010 403
CS010 405
CS010 406
CS010503
CS010505
CS010602
CS010604
CS010710
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
PO
MAPPING
a,c
a,c
d
f,g
55
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)
ADD-ON
COURSES
STUDENT FEEDBACK ON
FACULTY (TWICE)
56
ASSESSMENT OF MINI/MAJOR
OTHERS
Prepared by
by
Mintu Philip
Approved
(HOD)
57