emester VI, Course Hand-Outrajagiritech.ac.in/Home/CSE/pdf/S6CSEHand-out.pdfMrs. Jincy J Fernandez Mr. Ajith S (H.O.D) (HOD) Semester VI, Course Hand-Out Department of ... 1 Day 1

COURSE HAND-OUT

KTU B.TECH. - SEMESTER VI

DEPARTMENT OF COMPUTER SCIENCE

AND ENGINEERING

Semester VI, Course Hand-Out

Department of CSE, RSET 2

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 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.



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.



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 6TH SEMESTER 6

CS302 Design and Analysis of Algorithms 7

COURSE INFORMATION SHEET 7

CS304 Compiler Design 12


CS306 Computer Networks 18


CS308 Software Engineering and Project Management 22


HS300 Principles of Management 27


CS362 Computer Vision 32


CS366 Natural Language Processing 37


CS368 Web Technologies 41


CS372 High Performance Computing 45


CS332 Microprocessor Lab 50


CS334 Network Programming Lab 55




SCHEME: B.TECH 6TH SEMESTER

(Computer Science & Engineering)

Kerala Technological University Revised Scheme for B.Tech Syllabus Revision 2015

Course Code Course Name L-T-P Credits Exam Slot

CS302 Design and Analysis of Algorithms

3-1-0 4 A

CS304 Compiler Design 3-0-0 3 B

CS306 Computer Networks

3-0-0 3 C

CS308 Software Engineering and Project Management

3-0-0 3 D

HS300 Principles of Management

3-0-0 3 E

HS210/HS200 Elective 2 3-0-0 3 F

CS332 Microprocessor Lab

0-0-3 1 S

CS334 Network Programming Lab

0-0-3 1 T

CS352 Comprehensive Exam

0-1-1 2 U

Total Credits = 23 Hours: 27

Cumulative Credits= 140



CS302 Design and Analysis of Algorithms

COURSE INFORMATION SHEET PROGRAMME:COMPUTER SCIENCE AND ENGINEERING DEGREE: BTECH

COURSE: DESIGN AND ANALYSIS OF ALGORITHMS SEMESTER: VI CREDITS: 4

COURSE CODE: CS010 601

REGULATION: 2010

COURSE TYPE: CORE

COURSE AREA/DOMAIN: DESIGN AND ANALYSIS CONTACT HOURS: 4+1(Tutorial) hours/Week.

CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME:

SYLLABUS:

UNIT DETAILS HOURS

I Introduction to Algorithm AnalysisTime and Space Complexity- Elementary

operations and Computation of Time Complexity- Best, worst and Average Case

Complexities- Complexity Calculation of simple algorithms Recurrence

Equations:Solution of Recurrence Equations – Iteration Method and Recursion Tree

Methods,

8

II Master’s Theorem(Proof not required) – examples, Asymptotic Notations and their

propertiesApplication of Asymptotic Notations in Algorithm Analysis- Common

Complexity Functions AVL Trees – rotations, Red-Black Trees insertion and deletion

(Techniques only; algorithms not expected). B-Trees – insertion and deletion

operations. SetsUnion and find operations on disjoint sets.

9

III Graphs – DFS and BFS traversals, complexity, Spanning trees – Minimum Cost

Spanning Trees, single source shortest path algorithms, Topological sorting, strongly

connected components.

7

IV Divide and Conquer:The Control Abstraction, 2 way Merge sort, Strassen’s Matrix

Multiplication, Analysis Dynamic Programming : The control Abstraction- The

Optimality Principle- Optimal matrix multiplication, Bellman-Ford Algorithm

8

V Analysis, Comparison of Divide and Conquer and Dynamic Programming strategies

Greedy Strategy: - The Control Abstraction- the Fractional Knapsack Problem,

Minimal Cost Spanning Tree Computation- Prim’s Algorithm – Kruskal’s Algorithm

9

VI Back Tracking: -The Control Abstraction – The N Queen’s Problem, 0/1 Knapsack

Problem Branch and Bound:Travelling Salesman Problem. Introduction to Complexity

Theory :-Tractable and Intractable Problems- The P and NP ClassesPolynomial Time

Reductions - The NP- Hard and NPComplete Classes

9

TOTAL HOURS 50



TEXT/REFERENCE BOOKS:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms,

MIT Press [Modules 1,2,6]

2. Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, Computer Algorithms, Universities Press, 2007

[Modules 3,4,5]

REFERENCES

1. AnanyLevitin, Introduction to the Design and Analysis of Algorithms, Pearson, 3rd Edition.

2. Richard E. Neapolitan,KumarssNaimipour, Foundations of Algorithms using C++ Psuedocode, Second

Edition.

3. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, The Design and Analysis of Computer

Algorithms, Pearson Education, 1999.

4. Gilles Brassard, Paul Bratley, Fundamentals of Algorithmics, Pearson Education.

COURSE PRE-REQUISITES:

C.CODE COURSE NAME DESCRIPTION SEM

CS010 403 Data Structures and Algorithms Detailed study of different data structures and

algorithms

S4

COURSE OBJECTIVES:

1 To develop an understanding about basic algorithms and different problem solving strategies.

2 To improve creativeness and the confidence to solve non-conventional problems and expertise for analyzing existing solutions.

COURSE OUTCOMES:

C302.1 Students will be able to Analyze a given algorithm and express its time and space

complexities in asymptotic notations. (Level 1- Knowledge)

C302.2 Students will be able to Solve recurrence equations using Iteration Method, Recurrence Tree Method and Master’s Theorem (Level 3-4-5 –Apply-Analyze –Evaluate)

C303.3 Students will be able to design algorithms using Divide and Conquer Strategy. (Level 3-5-

Apply- Evaluate)

C304.4 Students will be able to compare Dynamic Programming and Divide and Conquer Strategies.(Level 3- 4 – Apply-Analyze)

C305.5 Students will be able to solve Optimization problems using Greedy strategy. (Level 2 & 4 –Understand and Analyze)

C306.6 Students will be able to design efficient algorithms using Back Tracking and Branch Bound

Techniques for solving problems. C306.7 Students will be able to classify computational problems into P, NP, NP-Hard and NP-



Complete.

COURSE OUTCOMES:

PO MAPPING

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PSO

1

PSO

2

PSO

3

C302.1 1 1 1 1 _ _ _ _ _ _ _ _ _ _ _

C302.2 _ _ 3 3 _ _ _ _ _ _ _ _ 2 - _

C303.3 - _ 1 _ 3 _ _ _ _ _ _ _ 3 _ _

C304.4 2 2 2 _ _ _ _ _ _ _ _ _ _ 2 _

C305.5 _ _ 1 3 _ _ _ _ _ _ _ _ - _ _

C306.6 2 2 2 2 3 - _ _ _ _ _ _ 3 1 _

C306.7

CS 010

601(over

all level)

JUSTIFATIONS FOR CO-PO MAPPING

Mapping LOW/MEDIUM/HIGH Justification

C601.1-PO1 L As the students could just define the knowledge acquired

C601.1-PO2 L Knowledge of algorithm analysis methods helps students in

problem analysis

C601.1-PO3 L Knowledge of algorithm analysis is the first step in developing

solutions

C601.1-PO4 L This knowledge is the basis of conducting investigations of

complex problems

C601.2-PO3 H Complexity analysis of the engineering solutions will help students

to design and develop sustainable solutions.

C601.2-PO4 H A complexity analysis of the engineering solutions provide

Information to provide valid conclusions

C601.2-PSO1 M Estimation of the complexity of an algorithm should be done

during the design and development of an algorithm

C601.3-PO3 L Choosing an appropriate problem solving method helps students

during the design and development of solutions.

C601.3-PO5 H A knowledge in the problem solving methods will help the students

to choose the best method to solve a problem



C601.3-PSO1 H choosing the appropriate method to analyze the algorithm will help

in a better analysis of algorithm

C601.4-PO1 M Having the knowledge of different algorithm development

strategies students can apply these knowledge in solving complex

engineering problems

C601.4-PO2 M Having the knowledge in algorithm development strategies

students could analyze the problem and come to a conclusion on

which design principle to be used

C601.4-PO3 M Having the knowledge in algorithm development strategies

students could analyze the problem and come to a conclusion on

which design principle to be used

C601.4-PSO2 M Selecting the appropriate method to analyze the algorithm will

help in a better analysis of algorithm

C601.5-PO3 L Knowledge of classification of algorithms into different classes

helps the students in identifying the framework to be used for

designing a new algorithm

C601.5-PO4 H Knowledge of classification of algorithms into different classes

helps the students to get to know various complex algorithms

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

SNO DESCRIPTION PO/PSO

Mappings

PROPOSED

ACTIONS

1 Substitution method Assignment

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN

SL

NO

TOPICS PO/PSO MAPPINGS PROPOSED ACTIONS

1 Examples of NP Hard, NP Complete

problems.

WEB SOURCE REFERENCES:

1 https://www.cs.duke.edu/courses/fall08/cps230/Book.pdf

2 http://www.cse.iitd.ernet.in/~ssen/csl356/root.pdf

3 http://www.imsc.res.in/~vraman/pub/intro_notes.pdf

4 http://www.ics.uci.edu/~goodrich/teach/cs161/notes/

5 http://elearning.vtu.ac.in/06CS43.html

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

CHALK & TALK STUD.

ASSIGNMENT

WEB

RESOURCES

LCD/SMART

BOARDS

STUD.

SEMINARS

☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT

https://www.cs.duke.edu/courses/fall08/cps230/Book.pdf

http://www.cse.iitd.ernet.in/~ssen/csl356/root.pdf

http://www.imsc.res.in/~vraman/pub/intro_notes.pdf



ASSIGNMENTS STUD.

SEMINARS

TESTS/MODEL

EXAMS

UNIV.

EXAMINATIO

N

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

Prepared by Approved by

Mehbooba P Shareef HOD



CS304 Compiler Design

COURSE INFORMATION SHEET

PROGRAMME: Computer Science and

Engineering

DEGREE: B TECH YEAR: 2017-2018

COURSE: COMPILER DESIGN SEMESTER: 6 CREDITS: 3

COURSE CODE: CS304 REGULATION:

2015

COURSE TYPE: CORE

COURSE AREA/DOMAIN: System Software

Concepts

CONTACT HOURS: 3hours/Week.


SYLLABUS:

UNIT DETAILS HOURS

I Introduction to compilers – Analysis of the source program, Phases of a

compiler, Grouping of phases, compiler writing tools – bootstrapping

Lexical Analysis: The role of Lexical Analyzer, Input Buffering, Specification of Tokens using

Regular Expressions, Review of Finite Automata, Recognition of Tokens.

7

II

Syntax Analysis: Review of Context-Free Grammars – Derivation trees and Parse Trees,

Ambiguity.

Top-Down Parsing: Recursive Descent parsing, Predictive parsing, LL(1)

Grammars.

6

III Bottom-Up Parsing:

Shift Reduce parsing – Operator precedence parsing (Concepts only)

LR parsing – Constructing SLR parsing tables, Constructing, Canonical LR parsing

tables and Constructing LALR parsing tables.

7

IV Syntax directed translation: Syntax directed definitions, Bottom- up evaluation of S- attributed definitions, L-

attributed definitions, Top-down translation, Bottom-up evaluation of inherited

attributes.

Type Checking : Type systems, Specification of a simple type checker.

8

V Run-Time Environments: Source Language issues, Storage organization, Storage- allocation strategies.

Intermediate Code Generation (ICG): Intermediate languages – Graphical representations, Three-Address code,

Quadruples, Triples. Assignment statements, Boolean expressions.

7



VI Code Optimization:Principal sources of optimization, Optimization of Basic

blocks

Code generation: Issues in the design of a code generator. The target machine, A simple code

generator.

7


T/

R

BOOK TITLE/AUTHORS/PUBLICATION

R1 Aho A Ravi Sethi and J D Ullman, Compilers Principles Techniques and Tools,Addison Wesley

R2 Kenneth C Louden, “Compiler Construction Principles and Practice”, Cenage Learning Indian

Edition

R3 D M Dhamdhare, System programming and operating system, Tata McGraw Hill & Company

R4 Tremblay and Sorenson, The Theory and Practice of Compiler Writing - Tata McGraw Hill &

Company



CS100 Problem Solving and Computer

Programming

C Programming language 2

CS301 Theory of Computation Computational Models 5

COURSE OBJECTIVES:

1

To provide a thorough understanding of the internals of Compiler Design.

COURSE OUTCOMES:

SNO DESCRIPTION

304.1 Students will be able to explain the concepts and different phases of compilation with

compile time error handling.

304.2 Students will be able to represent language tokens using regular expressions, context free

grammar and finite automata and design lexical analyzer for a language.

304.3 Students will be able to compare top down with bottom up parsers, and develop

appropriate parser to produce parse tree representation of the input.

304.4 Students will be able to generate intermediate code for statements in high level language.

304.5 Students will be able to design syntax directed translation schemes for a given context free



grammar

304.6 Students will be able to apply optimization techniques to intermediate code and generate

machine code for high level language program.

CO-PO AND CO-PSO MAPPING

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

P0

10

PO

11

PO

12

PSO

1

PSO

2

PSO

3

C304.1 3 - 2 - - - - - - - - - - 3 2

C304.2 2 - - - 3 - - - - - - - - 2 -

C304.3 - - 2 - 1 - - - - - - - - 1 1

C304.4 - - 3 1 - - - - - - - - 3 3 2

C304.5 - - 2 - - - - - - - - - - 1 -

CS 304

(overall

level)

JUSTIFICATIONS FOR THE MAPPING

Mapping LOW/MEDIUM/HI

GH

Justification

C304.1-PO1 H Understanding the various phases of compiler helps to design

a compiler.

C304.1-PO3 M Knowledge of various phases of compiler helps to design

system components.

C304.1-PSO2 H Knowledge of various phases of compiler helps to design a

compiler.

C304.1-PSO3 M Ability to apply the knowledge of various phases of compiler

helps to design a compiler.

C304.2-PO1 M Usage of Compiler tools helps to understand how to design

the lexical analyzer and parser.

C304.2-PO5 H Usage of tools like LEX and YACC helps to understand how to

design the lexical analyzer and parser.

C304.2-PSO2 M Knowledge of tools like LEX and YACC helps to design the

lexical analyzer and parser.

C304.3-PO3 M Differentiating various parsers helps to design language

parsers.

C304.3-PO5 L Knowledge of tools like YACC helps to design parser.

C304.3-PSO2 L Understanding various parsers helps to restructure current

parsing methods.

C304.3-PSO3 L Knowledge of designing parsers helps to develop new



efficient parsing method.

C304.4-PO3 H Knowledge of optimization techniques help to design

algorithms with minimum time and space complexity

C304.4-PO4 L Study of storage allocation strategies helps to analyze various

types of data to reach valid conclusions.

C304.4-PSO1 H Knowledge of various storage allocation strategies help

students to identify, analyze and design solutions as it belong

to the core principles of Computer Science.

C304.4-PSO2 H Knowledge of stack, heap etc help students to acquire

programming efficiency by designing memory efficient

algorithms

C304.4-PSO3 M This core fundamental concept can be applied in any area of

research.

C304.5-PO3 M Knowledge about Register reusability helps the students to

develop programs with less number of data hazards.

C304.5-PSO2 L Knowledge about register allocation help students to develop

programs with minimum memory usage


S. NO DESCRIPTION PROPOSED

ACTIONS

PO

MAPPING

1 Scanner Generator- Lex Assignment a, c

2 Parser Generator- YACC Assignment b, c

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

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

S. NO TOPIC PO MAPPING

1 ANTLR D

2 JAVACC D


1 http://www.cse.iitd.ernet.in%2F~sak%2Fcourses%2Fcdp%2Fslides.pdf&ei=xl4xUsWwI8n_rQe

24YDoAQ&usg=AFQjCNFeZnxu6BwhgXtl0FMEDQFq9FECzw&bvm=bv.52109249,d.bmk

2 http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-KANPUR/compiler-desing/

3 http://www.diku.dk/~torbenm/Basics/basics_lulu2.pdf

4 http://www.antlr.org/wiki/display/ANTLR3/Tutorials

5 http://javacc.java.net/

6 http://www.engr.mun.ca/~theo/JavaCC-Tutorial/javacc-tutorial.pdf


☑ CHALK & TALK ☑ STUD. ☑ WEB RESOURCES

http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-KANPUR/compiler-desing/

http://www.diku.dk/~torbenm/Basics/basics_lulu2.pdf

http://www.antlr.org/wiki/display/ANTLR3/Tutorials

http://javacc.java.net/

http://www.engr.mun.ca/~theo/JavaCC-Tutorial/javacc-tutorial.pdf



ASSIGNMENT

☐ LCD/SMART

BOARDS

☐ STUD. SEMINARS ☐ ADD-ON COURSES


☑ ASSIGNMENTS ☐ STUD. SEMINARS ☑ TESTS/MODEL

EXAMS

☑ UNIV.

EXAMINATION

☑ STUD. LAB

PRACTICES

☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐ CERTIFICATIONS

☐ ADD-ON COURSES ☐ OTHERS


☑ ASSESSMENT OF COURSE OUTCOMES (BY

FEEDBACK, ONCE)

☑ STUDENT FEEDBACK ON FACULTY

(ONCE)


EXT. EXPERTS

☐ OTHERS


JINCY J FERNANDEZ SHIMMI ASOKAN

MEERA M. (HOD)





CS306 Computer Networks

COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH YEAR: JAN 2018 – JUNE 2018

COURSE: COMPUTER NETWORKS SEMESTER: VI CREDITS: 4

COURSE CODE: CS 306 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H

COURSE AREA/DOMAIN:

NETWORKING & COMMUNICATION

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

CORRESPONDING LAB COURSE CODE (IF ANY): CS 334 LAB COURSE NAME: NETWORKING LAB

SYLLABUS:

UNIT DETAILS HOURS

I

Introduction – Uses – Network Hardware – LAN –MAN – WAN, Internetworks – Network Software –

Protocol hierarchies – Design issues for the layers – Interface & Service – Service Primitives. Reference

models – OSI – TCP/IP.

7

II

Data Link layer Design Issues – Flow Control and ARQ techniques. Data link Protocols – HDLC. DLL in

Internet. MAC Sub layer – IEEE 802 FOR LANs & MANs, IEEE 802.3, 802.4, 802.5. Bridges - Switches

– High Speed LANs - Gigabit Ethernet. Wireless LANs - 802.11 a/b/g/n, 802.15.PPP

8

III

Network layer – Routing – Shortest path routing, Flooding, Distance Vector Routing, Link State Routing,

RIP, OSPF, Routing for mobile hosts.

7

IV

Congestion control algorithms – QoS. Internetworking – Network layer in internet. IPv4 - IP Addressing

– Classless and Classfull Addressing. Sub-netting.

7

V

Internet Control Protocols – ICMP, ARP, RARP, BOOTP. Internet Multicasting – IGMP, Exterior

Routing Protocols – BGP. IPv6 – Addressing – Issues, ICMPv6.

7

VI

Transport Layer – TCP & UDP. Application layer –FTP, DNS, Electronic mail, MIME, SNMP.

Introduction to World Wide Web.

7

TOTAL HOURS

43

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

T1 Andrew S. Tanenbaum, Computer Networks, 4/e, PHI.

T2 Behrouz A. Forouzan, Data Communications and Networking, 4/e, Tata McGraw Hill.

T3 Larry L. Peterson & Bruce S. Dave, Computer Networks-A Systems Approach, 5/e, Morgan Kaufmann,

2011.

R1 Fred Halsall, Computer Networking and the Internet, 5/e.

R2 James F. Kurose, Keith W. Ross, Computer Networking: A Top-Down Approach, 6/e.

R3 Keshav, An Engineering Approach to Computer Networks, Addison Wesley, 1998.

R4 Request for Comments (RFC) Pages - IETF -https://www.ietf.org/rfc.html

R5 W. Richard Stevens. TCP/IP Illustrated volume 1, Addison-Wesley, 2005.

R6 William Stallings, Computer Networking with Internet Protocols, Prentice-Hall, 2004.





Nil

COURSE OBJECTIVES: 1 To build an understanding of the fundamental concepts of computer networking.

2 To introduce the basic taxonomy and terminology of computer networking.

3 To introduce advanced networking concepts.

COURSE OUTCOMES:


PO

CO

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

PO

10

PO

11

PO

12

PSO

1

PSO

2

PSO

3

C306.1 1 2 - 3 - - - - - - - - 3 - 2

C306.2 - 1 - 2 - - - - - - - - 3 - 1

C306.3 - - 1 2 3 - - - - - - - 3 - 1

C306.4 - 1 - 2 - - - - - - - - 3 - 2

C306.5 1 1 - 2 2 - - - - - - - 3 1 2

306

CS306

(Overall

attainme

nt)

JUSTIFICATIONS FOR CO-PO MAPPING

Mapping Low/Medium/High Justification

C306.1-PO1 L They could just apply the knowledge acquired to classify the layers based

on its function

C306.1-PO2 M Understanding the layer functions helps the students to identify and

formulate the problems based on the layer

C306.1-PO4 H Understanding the layer functions and understanding the network factors,

helps in analyzing and interpreting the quality of networks.

Sl.N

o.

CO. No. DESCRIPTION BLOOMS

TAXONOMY

LEVELS

1 C306.1 Enables the students to visualize the different aspects of networks,

protocols and network design models.

Level 1

2 C306.2 Enables the students to examine various Data Link layer design issues

and Data Link protocols.

Level 1

3 C306.3 Enables the students to analyze and compare different LAN protocols. Level 2,4

4 C306.4 Enables the students to compare and select appropriate routing

algorithms for a network.

Level 4,5

5 C306.5 Enables the students to examine the important aspects and functions of

network layer, transport layer and application layer in internetworking.

Level 3



C306.2-PO2 L Applies the knowledge in identifying the appropriate channel access

techniques for both wired and wireless communications

C306.2-PO4 M Understanding the various channel access techniques helps in analyzing

and interpreting the quality of networks.

C306.3-PO3 L Studies about the various routing techniques helps the students to fix up

the shortest path routes for packets in the network.

C306.3-PO4 M Understanding the various routing techniques helps in analyzing and

interpreting the quality of networks.

C306.3-PO5 H Understanding the various routing techniques helps in analyzing research

based works.

C306.4-PO2 L Applies the knowledge in identifying the appropriate end to end protocol

for reliable communication.

C306.4-PO4 M Understanding the various end to end protocols helps in analyzing and

interpreting the quality of networks.

C306.5-PO1 L They could apply the knowledge acquired on various applications over

internet.

C306.5-PO2 L They could identify the various applications over internet.

C306.5-PO4 M The students could analyze the applications over internet.

C306.5-PO5 M The students could analyze and interpret the applications over internet.


SNO DESCRIPTION Mapping

to PO

PROPOSED

ACTIONS

1 Designing and developing programs that implements various protocols PO3,

PO4,

PO5

Lab

Session

2 A session on the college Networking System PO7 Session

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

GUEST LECTURER/NPTEL ETC


Sl.

No

DESCRIPTION Mapping to P O

1 Implementation/ simulation of the protocols PO3, PO4,

PO5


1 en.wikipedia.org/wiki/

2 www.w3schools.com/

3 www.w3.org/

4 http://computing.dcu.ie/~humphrys/ca651/index.html

5 http://www.cs.ccsu.edu/~stan/classes/CS490/Slides/Networks4-Ch4-4.pdf

6 http://ecourses.vtu.ac.in/nptel/courses/Webcourse-contents/IIT-MADRAS/ComputerNetworks/pdf/

7 http://www.solarwinds.com/support/tutorials.aspx


http://computing.dcu.ie/~humphrys/ca651/index.html

http://www.cs.ccsu.edu/~stan/classes/CS490/Slides/Networks4-Ch4-4.pdf

http://www.solarwinds.com/support/tutorials.aspx



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 (ONCE)

ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS


Tripti C

Mr. Paul Augustine Ms. Shimmi Asokan

(H.O.D)



CS308 Software Engineering and Project Management

COURSE INFORMATION SHEET PROGRAMME: Computer Science & Engineering DEGREE: B.Tech.

COURSE: Software Engineering and Project

Management SEMESTER: S6 CREDITS: 3

COURSE CODE: CS308 REGULATION: 2016 COURSE TYPE: Core

COURSE AREA/DOMAIN: Software Engineering and

Project Management

CONTACT HOURS: 3 (Lecture) + 0 (Tutorial) + 0

(Practical) Hours / Week

CORRESPONDING LAB COURSE CODE (IF ANY):

NA LAB COURSE NAME: NA

SYLLABUS:

Module DETAILS HOURS

I Introduction to Software Engineering: Introduction to Software Engineering – scope of software engineering – historical aspects, economic aspects, maintenance aspects, specification and design aspects, team programming aspects. Software engineering a layered technology – processes, methods and tools. Software process models – prototyping models, incremental models, spiral model, waterfall model.

07

II Process Framework Models: Process Framework Models: Capability maturity model (CMM), ISO 9000.

Phases in Software development – requirement analysis- requirements

elicitation for software, analysis principles, software prototyping,

specification.

06

III Project Planning: Planning phase – project planning objective, software scope, empirical

estimation models- COCOMO, single variable model, staffing and personal

planning. Design phase – design process, principles, concepts, effective

modular design, top down, bottom up strategies, stepwise refinement.

07

IV Coding: Coding – programming practice, verification, size measures, complexity

analysis, coding standards. Testing – fundamentals, white box testing,

control structure testing, black box testing, basis path testing, code walk-

throughs and inspection, testing strategies-Issues, Unit testing, integration

testing, Validation testing, System testing.

07

V Risk Management:

Maintenance-Overview of maintenance process, types of maintenance. Risk

management: software risks - risk identification-risk monitoring and

management. Project Management concept: People – Product-Process-

Project.

07

VI Project Scheduling and Tracking:

Project scheduling and tracking: Basic concepts-relation between people and

effort-defining task set for the software project-selecting software

08



engineering task

Software configuration management: Basics and standards User interface

design - rules. Computer aided software engineering tools - CASE building

blocks, taxonomy of CASE tools, integrated CASE environment.

TOTAL HOURS 42


S. No. T/R AUTHORS/BOOK TITLE/PUBLICATION

1. R Ian Sommerville, Software Engineering, University of Lancaster, Pearson Education, Seventh edition, 2004.

2. R K. K. Aggarwal and Yogesh Singh, Software Engineering, New age International Publishers, Second edition, 2005.

3. R Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw Hill publication, Eighth edition, 2014.

4. R S.A. Kelkar, Software Project Management: A concise study, PHI, Third edition, 2012.

5. R Walker Royce, Software Project Management : A unified frame work, Pearson Education, 1998.



NIL NIL NIL NIL

COURSE OBJECTIVES:

1 To introduce the fundamental concepts of software engineering.

2 To build an understanding on various phases of software development.

3 To introduce various software process models.

COURSE OUTCOMES:

Students will be able to

Ref. No. DESCRIPTION Blooms

Taxonomy Level

CS308.1 Identify suitable life cycle models to be used.

Remember,

Understand

(Level 1 & 2)



CS308.2 Analyze a problem and identify and define the computing requirements

to the problem.

Analyze

(Level 4)

CS308.3 Translate a requirement specification to a design using an appropriate

software engineering methodology.

Create

(Level 6)

CS308.4 Formulate appropriate testing strategy for the given software system. Evaluate, Create

(Level 5 & 6)

CS308.5 Develop software projects based on current technology, by managing

resources economically and keeping ethical values.

Apply

(Level 3)


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CS308.1 3

CS308.2 2 3

CS308.3 3 3 3

CS308.4 1 1

CS308.5 2


MAPPING LOW/MEDIUM/HIGH JUSTIFICATION

CS308.1-PSO2 H Students will be able to apply the standard practices in

software development. CS308.2-PO2 M Students will be able to analyze and design complex

engineering problems.

CS308.2-PSO1 H Students will be able to analyze and design complex


CS308.3-PO3 H Students will be able to analyze and design complex






CS308.4-PSO1 L Students will be able to formulate appropriate testing

strategy and evaluate the software systems developed. CS308.4-PSO2 L Students will be able to formulate appropriate testing

strategy and evaluate the software systems developed. CS308.5-PO8 M Students will be able to develop software systems,

keeping ethical values.



INDUSTRY RELEVANCE:

Software Engineering and Project Management is very relevant in software industry for successful

completion of software projects, meeting customer requirements, on time and within budget. Since,

majority of our students get placed in software industry, knowledge on software engineering and

project management practices are very important for the students to excel in their career in

software industry.

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


ACTIONS

PO

MAPPING

1 Software Quality Assurance Faculty shall provide materials

for self-study by students

2 Human Resource Management Faculty shall provide materials

for self-study by students

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

LECTURER/NPTEL ETC



1

2


1 NIL

2


☐ CHALK & TALK √ ☐ STUD. ASSIGNMENT √ ☐ WEB RESOURCES

☐ LCD/SMART BOARDS √ ☐ STUD. SEMINARS ☐ DISCUSSIONS/ DEBATES


☐ ASSIGNMENTS √ ☐ STUD. SEMINARS ☐ TESTS/MODEL EXAMS √ ☐ UNIV. EXAMINATION √

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐ CERTIFICATIONS



☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) √ ☐ STUDENT FEEDBACK ON FACULTY (ONCE) √

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS ☐ OTHERS




Prof. K. S. Mathew Shimmi A

(Faculty) (HOD)



HS300 Principles of Management


PROGRAMME: Electrical and Electronics Engineering, Civil Engineering, Computer Science Engineering, Information Technology and Engineering

DEGREE: B.TECH

COURSE: PRINCIPLES OF MANAGEMENT SEMESTER: 6 CREDITS: 3 COURSE CODE: HS300 REGULATION: 2018

COURSE TYPE: CORE

COURSE AREA/DOMAIN: MANAGEMENT CONTACT HOURS: 3-0-0 CORRESPONDING LAB COURSE CODE (IF ANY): NIL

LAB COURSE NAME: NA

SYLLABUS:

UNIT

DETAILS HOUR

S

I

Introduction to Management: definitions, managerial roles and functions; Science or Art perspectives- External environment-global, innovative and entrepreneurial perspectives of Management (3 Hrs.)– Managing people and organizations in the context of New Era- Managing for competitive advantage - the Challenges of Management (3 Hrs.)

6

II

Early Contributions and Ethics in Management: Scientific Management- contributions of Taylor, Gilbreths, Human Relations approach-contributions of Mayo, McGregor's Theory, Ouchi's Theory Z (3 Hrs.) Systems Approach, the Contingency Approach, the Mckinsey 7-S Framework Corporate Social responsibility- Managerial Ethics. (3 Hrs)

6

FIRST INTERNAL EXAM

III Planning: Nature and importance of planning, -types of plans (3 Hrs.)- Steps in planning, Levels of planning - The Planning Process. – MBO (3 Hrs.)

6

IV

Organising for decision making: Nature of organizing, organization levels and span of control in management Organisational design and structure –departmentation, line and staff concepts (3 Hrs.) Limitations of decision making-Evaluation and selecting from alternatives- programmed and non programmed decisions - decision under certainty, uncertainty and risk-creative process and innovation (3 Hrs.)

6

SECOND INTERNAL EXAM

V

Staffing and related HRD Functions: definition, Empowerment, staff – delegation, decentralization and recentralisation of authority – Effective Organizing and culture-responsive organizations –Global and entrepreneurial organizing (3 Hrs.) Manager inventory chart-matching person with the job-system approach to selection (3 Hrs.) Job design-skills and personal characteristics needed in managers-selection process,

9



techniques and instruments (3 Hrs.)

VI

Leading and Controlling: Leading Vs Managing – Trait approach and Contingency approaches to leadership - Dimensions of Leadership (3 Hrs.) - Leadership Behavior and styles – Transactional and Transformational Leadership (3 Hrs.) Basic control process- control as a feedback system – Feed Forward Control – Requirements for effective control – control techniques – Overall controls and preventive controls – Global controlling (3 Hrs.)

9

TOTAL HOURS 42


T/R


T Harold Koontz and Heinz Weihrich, Essentials of Management, McGraw Hill Companies, 10th Edition

T Daft, New era Management, 11th Edition, Cengage Learning

R1 Heinz Weirich, Mark V Cannice and Harold Koontz, Management: a Global, Innovative and Entrepreneurial Perspective, McGraw Hill Education, 14th Edition

R2 Peter F Drucker, The Practice of Management, McGraw Hill, New York

R3 Robbins and Coulter, Management, 13th Edition, 2016, Pearson Education

R4 I.M .Pandey, Financial Management, Vikas Publishing House. New Delhi

COURSE OBJECTIVES:

1 To develop ability to critically analyse and evaluate a variety of management practices in the contemporary context

2 To understand and apply a variety of management and organisational theories in practice

3 To be able to mirror existing practices or to generate their own innovative management competencies required for today's complex and global workplace



4 To be able to critically reflect on ethical theories and social responsibility ideologies to create sustainable organisations

COURSE OUTCOMES:

COURSE OUTCOME

EXPLANATION

CO1 KNOWLEDGE

To recall and identify the relevance of management concepts

CO2 COMPREHENSION

To describe, discuss and relate management techniques adopted within an organization

CO3 APPLICATION

To apply management techniques for meeting current and future management challenges faced by the organization

CO4 ANALYSIS

To compare the management theories and models critically and to inspect and question its validity in the real world

CO5 SYNTHESIS

To assess and modify different theories of management so as to relate it to current management challenges

CO6 EVALUATION

To apply principles of management in order to execute the role as a manager

CO-PO-PSO MAPPING:

CO/PO

PO 1

PO 2

PO 3

PO 4

PO 5

PO 6

PO 7

PO 8

PO 9

PO 10

PO 11

PO 12

CO 1 3 3

CO 2 2 3 3 3 3

CO 3 2 3 3

CO 4 3 3 2 2

CO 5 3 3

CO 6 2 3 3



JUSTIFICATION FOR CO-PO-PSO CORRELATION:

CO/PO

PO 1

PO 2

PO 3

PO 4

PO 5

PO 6

PO 7

PO 8

PO 9

PO 10

PO 11

PO 12

CO 1

Management is a social science hence helps to

apply basic management principles to societal

problems

Apply management principles in a team work and to manage projects

CO 2



problems

This helps to understand the managerial ethical

principles that has to be followed while monitoring

a project

This enhances the leadership quality of

students before entering into team

works

Management principles are flexible and adaptable and hence it can be used and

applied in the future course of action

CO 3



works

Apply management principles in a team work and to manage

projects



CO 4



problems

This helps to understand the managerial ethical

principles that has to be followed while monitoring

a project



works



CO 5


projects



CO 6



problems



works


projects


SNO DESCRIPTION PROPOSED

ACTIONS 1 Henry Fayol’s management principles Tutorial classes 2 Financial management NPTEL

3 Human resource management NPTEL

4 Total Quality Management- Quality Circle NPTEL

5. Environmental context of management NPTEL

6 Organizational Communication NPTEL

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC




1 Managerial competencies 2 Customer management 3 Economics and financial qualitative analysis 4 Operations and technology 5 Building resources in a Start-Up 6 Marketing Tactics


1 www.wto.org 2 www. comtrade.org 3 www.euroasiapub.org/ijrim/june2012/ 4 www.startupmission.kerala.gov.in


CHALK & TALK

STUD. ASSIGNMENT

☐ WEB RESOURCES ☐LCD/SMART BOARDS

STUD. SEMINARS

☐ ADD-ON COURSES ICT ENABLED CLASSES


ASSIGNMENTS STUD. SEMINARS

TESTS/MODEL EXAMS

UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR PROJECTS ☐

CERTIFICATIONS ☐ ADD-ON COURSES ☐ OTHERS GROUP

DISCUSSION(IV)


ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)

STUDENT FEEDBACK ON FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by Approved by Lekshmi Vijayakumar, Saritha V & Reny Elizabeth Dr. Antony V Varghese (Faculty)



CS362 Computer Vision

COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE AND ENGINEERING DEGREE: BTECH (JANUARY- MAY 2018)

COURSE: COMPUTER VISION SEMESTER: VI CREDITS: 3

COURSE CODE: CS362

REGULATION:2016

COURSE TYPE:ELECTIVE

COURSEAREA/DOMAIN: COMPUTER VISION CONTACT HOURS: 3 hours/week.


SYLLABUS: MODULE DETAILS HOURS

I Image formation and Image model- Components of a vision system- Cameras-

camera model and camera calibration- Radiometry- Light in space- Light in

surface - Sources, shadows and shading.

6

II Multiple images-The Geometry of multiple views- Stereopsis- Affine structure

from motion- Elements of Affine Geometry Affine structure and motion from

two images- Affine structure and motion from multiple images- From Affine to

Euclidean images.

7

III High level vision- Geometric methods- Model based vision- Obtaining

hypothesis by pose consistency, pose clustering and using Invariants,

Verification.

7

IV Introduction to pattern and classification, supervised and unsupervised learning,

Clustering Vs classification, Bayesian Decision Theory- Minimum error rate

classification Classifiers, discriminant functions, decision surfaces- The normal

density and discriminant-functions for the Normal density.

7

V Linear discriminant based classifiers and tree classifiers Linear discriminant function based classifiers- Perceptron- Minimum Mean

Squared Error (MME) method, Support Vector machine, Decision Trees:

CART, ID3.

7

VI Unsupervised Methods Basics of Clustering; similarity / dissimilarity

measures; clustering criteria. Different distance functions and similarity

measures, K-means algorithm.

Recent Advances in Pattern Recognition Neural network structures for pattern

recognition, Pattern classification using Genetic Algorithms.

8

TOTAL HOURS 42


T/R BOOK TITLE/AUTHORS/PUBLICATION

T Bernd Jahne and Horst HauBecker, Computer vision and Applications, Academic press, 2000.

T David A. Forsyth & Jean Ponce, Computer vision – A Modern Approach, Prentice Hall, 2002.

R C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.



R

R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, John Wiley, 2001.

R

Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second

Edition, Cambridge University Press, 2004.

R

S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009.

COURSE OBJECTIVES:

1

To build an understanding on detailed models of image formation

2

To expose the students to image feature detection and matching.

3 To introduce fundamental algorithms for pattern recognition

4 To introduce various classification techniques

5 To expose the students to various structural pattern recognition and feature extraction techniques.

COURSE OUTCOMES:

Sl No DESCRIPTION

Blooms’

Taxonomy

Level

C362.1

Students should be able to appreciate the detailed models of image

formation.

Understand

(level 1)

C362.2

Analyse the techniques for image feature detection and matching.

Understand

(level 2)

C362.3

Apply various algorithms for pattern recognition.

Apply

(level 2)



C362.4

Examine various clustering algorithms.

Apply

(level 2)

C362.5

Analyze structural pattern recognition and feature extraction techniques.

Apply

(level 3)

CORSE OUTCOME AND PROGRAMME OUTCOME MAPPING

CO-PO MAPPING


C362.1 1 _ _ _ _ _ _ _ _ _ _ _ 1 _ _

C362.2 2 _ _ _ _ _ _ _ _ _ _ _ 2 _ _

C362.3 2 _ 2 _ _ _ _ _ _ _ _ _ 2 _ 2

C362.4 2 2 2 _ _ _ _ _ _ _ _ 2 2 _ 2

C362.5 2 _ _ _ 2 _ _ _ _ _ _ 2 2 _ _

C362 2 2 2 _ 2 _ _ _ _ _ _ 2 2 _ 2


SLNO DESCRIPTION PROPOSED

ACTIONS

PO

1 Image Processing concepts Workshop PO1, PO12

Proposed Actions: Topics beyond Syllabus/Assignment/Industry Visit/Guest Lecturer/Nptel Etc



C362.1-PO1 L The students will be able to gain a thorough understanding of the concepts of image formation.

C362.1- PSO1 L The students will develop the ability to identify, analyze and design solutions for complex engineering problems in computer vision and image formation by understanding the core principles and concepts.

C362.2- PO1 M The students will be able to gain a thorough understanding of the techniques of image feature detection and matching.

C362.2- PSO1 M The students will develop the ability to identify, analyze and design solutions for complex engineering problems in computer vision and image feature detection and matching by understanding the core principles and concepts.



C362.3-PO1 M The students will be able to gain a thorough understanding of the concepts of pattern recognition.

C362.3-PO3 M The students will be able to design solutions for complex engineering

problems such as pattern recognition and design system components

or processes.

C362.3-PSO1 M The students will develop the ability to identify, analyze and design solutions for complex engineering problems in pattern recognition by understanding the core principles and concepts.

C362.3-PS03 M The students will be able to apply the fundamentals of pattern

recognition for competitive research and to develop innovative

products.

C362.4- PO1 M The students will be able to gain a thorough understanding of the concepts of various clustering algorithms.

C362.4-PO2 M The students will be able to identify and analyze various problems in

clustering and reach conclusions using principles of engineering.

C362.4-PO3 M The students will be able to design solutions for complex engineering

problems such as clustering and design system components or

processes.

C362.4-PO12 M The students will be able engage in lifelong learning in the field of clustering.

C362.4-PSO1 M The students will develop the ability to identify, analyze and design solutions for complex engineering problems involving clustering by understanding the core principles and concepts.

C362.4-PS03 M The students will be able to apply the fundamentals of clustering for

competitive research and to develop innovative products.

C362.5-PO1 M The students will be able to gain a thorough understanding of the concepts of pattern recognition and feature extraction.

C362.5-PO5 M The students will be able to acquire the skills needed to use modern

tools and techniques in the area of feature extraction and pattern

recognition.

C362.5-P012 M The students will be able engage in lifelong learning in the field of pattern recognition and feature extraction.

C362.5-PSO1 M The students will develop the ability to identify, analyze and design solutions for complex engineering problems in feature extraction by understanding the core principles and concepts.


SLNO DESCRIPTION PROPOSED ACTIONS PO

1 Pattern recognition Assignments and

extra classes

PO1, PO3, PO5, PO12

2 Classification and Clustering Assignments PO1, PO2, PO3, PO12




1 https://en.wikipedia.org/wiki/Computer_vision

2 https://in.udacity.com/course/introduction-to-computer-vision--ud810

3 https://www.tutorialspoint.com/dip/computer_vision_and_graphics.htm

4 https://www.tutorialspoint.com/biometrics/pattern_recognition_and_biometrics.htm

5 https://home.deib.polimi.it/matteucc/Clustering/tutorial_html/

6 https://www.datascience.com/blog/k-means-clustering


CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES LCD/SMART BOARDS

STUD. SEMINARS ☐ ADD-ON COURSES


ASSIGNMENTS STUD. SEMINARS TESTS/MODEL

EXAMS

UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐ CERTIFICATIONS




FEEDBACK, ONCE)


☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT.

EXPERTS

☐ OTHERS


Mr. Harikrishnan M Ms. Shimmi Asokan

(Faculty) (HOD)



CS366 Natural Language Processing


PROGRAMME: COMPUTER SCIENCE

& ENGINEERING

DEGREE: B TECH

COURSE: NATURAL LANGUAGE

PROCESSING

SEMESTER: 6 CREDITS: 3

COURSE CODE: CS366

REGULATION: 2015

COURSE TYPE: ELECTIVE

COURSE AREA/DOMAIN:LANGUAGE

PROCESSING

CONTACT HOURS: 3

CORRESPONDING LAB COURSE CODE

(IF ANY): NA

LAB COURSE NAME:

SYLLABUS: UNIT DETAILS HOURS

I Introduction to Natural Language Understanding- Levels of language analysis- Syntax, Semantics, Pragmatics. Linguistic Background- An Outline of English Syntax.

10

II Lexicons, POS Tagging, Word Senses. Grammars and Parsing- Features, Agreement and Augmented Grammars.

10

III Grammars for Natural Language, Parsing methods and Efficient Parsing. Ambiguity Resolution- Statistical Methods. Probabilistic Context Free Grammar.

12

IV Semantics and Logical Form: Linking Syntax and Semantics- Ambiguity Resolution- other Strategies for Semantic Interpretation- Scoping and the Interpretation of Noun Phrases.

08

V Knowledge Representation and Reasoning- Local Discourse Context and Reference- Using World Knowledge- Discourse Structure- Defining a Conversational Agent.

10

VI Applications- Machine Translation, Information Retrieval and Extraction, Text Categorization and Summarization.

06

TOTAL HOURS 56


T/

R


T1 James Allen, Natural Language Understanding, The Benjamin/Cummings Publishing Company Inc., Redwood City, CA.

T2 D. Jurafsky and J. H. Martin, Speech and Language Processing, Prentice Hall India.



R1 Charniak, Eugene, Introduction to Artificial intelligence, Addison-Wesley.

R2 Ricardo Baeza-Yates and BerthierRibeiro-Neto, Modern Information Retrieval, Addison- Wesley,1999.

R3 U. S. Tiwary and TanveerSiddiqui, Natural Language Processing and Information Retrieval, Oxford University Press.

COURSE OBJECTIVES:

1 To introduce the fundamentals of Language processing from the algorithmic viewpoint.

2 To discuss various issues those make natural language processing a hard task.

3 To discuss some applications of Natural Language Processing (NLP).

COURSE OUTCOMES:

SNO DESCRIPTION Bloom’s Taxonomy Level

366.1 Students will be able to appreciate the

fundamental concepts of Natural Language

Processing.

Appreciate(Level 3)

366.2 Students will be able to design algorithms for

NLP tasks.

Design(Level 6)

366.3 Students will be able to develop useful

systems for language processing and related

tasks involving text processing.

Develop(Level 6)


CO-PO MAPPING

PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

P0

10

PO

11

PO

12

PSO

1

PS

O2

PSO3

C366.1 2 2 3 2 - - - - - - - - 2 2 2

C366.2 - 2 3 - - - - - - - - - 1 3 2

C366.3 - 2 3 - - - - - - - - - 2 2 2



ACTIONS

PO

MAPPING

1 HMM models Assignment 3,2

2 Error Correction methods. Assignment 1,2,3




C366.1-PO1 M Complex engineering problems like machine translation, semantic



processing etc can be automated.

C366.1-PO2 M Problems in different languages can analyze easily.

C366.1-PO3 H New systems can be developed for public safety in the local

languages.

C366.1-PO4 M Fundamental concept from NLP can create new research ideas.

C366.1-PSO1 M By knowing fundamental natural language concepts student can

solve different automated language translation problems.

C366.1-PSO2 M With usage of NLP concept students can design software for

different languages.

C366.1-PSO3 M Deep learning in NLP concepts will create more research

opportunities for students

C366.2-PO2 M Based on problem analysis new algorithm can design.

C366.2-PO3 M For public heath and safety new algorithms can be designed.

C366.2-PSO1 L With knowledge of language syntax and semantic students can

design algorithm for various languages.

C366.2-PSO2 H Students can design various algorithms for natural language

processing like parsing, stemming, tokenization etc.

C366.2-PSO3 M For various Indian languages there is no language processing

systems students can work on it.

C366.3-PO2 M New problems and their solution can be find out in this area

C366.3-PO3 H In the field of heath and safety new research can be done in the area

of natural language processing.

C366.3-PSO1 M Students can design algorithms for local language text processing.

C366.3-PSO2 M Currently available algorithms can be modified .

C366.3-PSO3 M New text processing methods can be developed with the concepts of

NLP.



1 Speech Processing 1,2,3


1 https://web.stanford.edu/~jurafsky/slp3/

2 http://stp.lingfil.uu.se/~santinim/ml/2014/JurafskyMartinSpeechAndLanguageProcessing2ed_draft%202007.pdf

3 http://www.nptelvideos.in/2012/11/natural-language-processing.html

4 https://www.cse.iitb.ac.in/~cs626-460-2012/

5 https://www.cl.cam.ac.uk/teaching/2002/NatLangProc/nlp1-4.pdf


☑ CHALK & TALK ☑ STUD.

ASSIGNMENT

☑ WEB RESOURCES



☐ LCD/SMART

BOARDS

☐ STUD. SEMINARS ☐ ADD-ON COURSES


☑ ASSIGNMENTS ☐ STUD. SEMINARS ☑ TESTS/MODEL

EXAMS

☑ UNIV.

EXAMINATION

☑ STUD. LAB

PRACTICES


PROJECTS

☐ CERTIFICATIONS



☑ ASSESSMENT OF COURSE OUTCOMES (BY

FEEDBACK, ONCE)

☑ STUDENT FEEDBACK ON FACULTY

(ONCE)


EXT. EXPERTS

☐ OTHERS


SHIMMI ASOKAN

MEERA M. (HOD)



CS368 Web Technologies

COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH (JULY 2017 – NOVEMBER 2017)

COURSE: WEB TECHNOLOGIES SEMESTER: VI

COURSE CODE: CS368 COURSE TYPE: CORE

COURSE AREA/DOMAIN: PROGRAMMING ,

DATASTRUCTURES & ALGORITHMS

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

CORRESPONDING LAB COURSE CODE (IF ANY): LAB COURSE NAME: Nil

SYLLABUS: UNIT DETAILS HOURS

I Introduction to the Internet: The World Wide Web, Web Browsers, Web Servers,

Uniform Resource Locators, Multipurpose Internet Mail Extensions, The Hypertext

Transfer Protocol. Common Gateway Interface (CGI), Content Management System

– Basics Case Study: Apache Server, Word Press.

6

II Introduction to HTML/XHTML : Origins and Evolution of HTML and XHTML, Basic Syntax of HTML, Standard HTML Document Structure, Basic Text Markup, Images, Hypertext Links, Lists, Tables, Forms, HTML5, Syntactic Differences between HTML and XHTML.

7

III Introduction to Styles sheets and Frameworks Cascading Style Sheets: Levels of Style Sheets - Style Specification Formats, Selector Forms, Property-Value Forms, Font Properties, List Properties, Alignment of Text, Color, The Box Model, Background Images, The span and div Tags. Frameworks: Overview and Basics of Responsive CSS Frameworks - Bootstrap.

6

IV Introduction to JavaScript and jQuery The Basics of JavaScript: Overview of

JavaScript, Object Orientation and JavaScript, General Syntactic Characteristics-

Primitives, Operations, and Expressions, Screen Output and Keyboard Input,

Control Statements, Object Creation and Modification,Arrays, Functions.

Callback Functions, Java Script HTML DOM. Introduction to jQuery: Overview and

Basics

7

V Introduction to Data Interchange Formats XML: The Syntax of XML, XML Document

Structure, Namespaces, XML Schemas, Displaying Raw XML Documents, Displaying

XML Documents with CSS, XSLT Style Sheets, XML Applications. JSON(Basics Only):

Overview, Syntax, Datatypes, Objects, Schema, Comparison with XML

8

VI Introduction to PHP: Origins and Uses of PHP, Overview of PHP - General Syntactic Characteristics - Primitives, Operations, and Expressions - Control Statements, Arrays, Functions, Pattern Matching, Form Handling, Cookies, Session Tracking.

8



TOTAL HOURS 60



1 Robert W Sebesta, Programming with World Wide Web , 7th ed., Pearson Education ,New Delhi, 2009

2 Deitel & Deitel Internet & World Wide Web How To Program 4th ed., Pearson International Edition Education ,New Delhi, 2009

3 Bob Boiko, Content Management Bible, 2nd Edition, Wiley Publishers. [Chapter 1, 2]

4 Chris Bates, Web Programming Building Internet Applications, 3/e, Wiley India Edition 2009.

5 Bear Bibeault and Yehuda Katz, jQuery in Action, Second Edition, Manning Publications.[Chapter 1]

Black Book, Kogent Learning Solutions Inc. 2009

6 Dream Tech, Web Technologies: HTML, JS, PHP, Java, JSP, ASP.NET, XML, AJAX,

9 Jeffrey C Jackson, Web Technologies A Computer Science Perspective, Pearson Education Inc. 2009.



CS100 Computer programing Programming skills II

COURSE OBJECTIVES:

1 To impart the design, development and implementation of Dynamic Web Pages.

2 To develop programs for Web using Scripting Languages.

3 To give an introduction to Data Interchange formats in Web.

COURSE OUTCOMES:

Sl No DESCRIPTION

Blooms’

Taxonomy

Level

C01 Graduate will be able to summarize the basic tags and properties in HTML, XHTML and CSS.

Understand

(Level 2)

C02 Graduate will be able to select XHTML tags and CSS properties to design web pages.

Evaluate

(Level 5)

C03 Graduates will be able to prepare XML documents to store and transport data.

Apply

(Level 3)

C04 Graduates will be able to write programs in PHP.

Apply

(Level 3)

C05 Graduates will be able to develop web applications using

Javascript and PHP.

Knowledge

(Level 1)


CO-PO MAPPING




C01 1 _ 2 _ _ _ _ _ _ _ _ _ 2 _ _

C02 _ 2 3 2 _ _ _ _ _ _ _ _ _ _ 2

C03 _ 2 2 _ _ _ _ _ _ _ _ _ 1 _ 2

C04 1 2 3 2 _ _ _ _ _ _ _ _ 2 2 _

C05 - _ 3 _ _ _ _ _ _ _ _ _ 2 _ _



C01-PO1 L Graduate attains a basic knowledge about XHTML and its tags.

C01-PO3 H Graduate is equipped to use XHTML tags for design of a static web page

and forms.

C01-PSO1 M Graduate is made able to identify the core principles of basic web page

creation.

C02-PO2 M Graduate is made capable of identifying the basic suitable tags and CSS

styles to design web pages.

C02-PO3 H Graduate is able to design simple and creative web pages.

C02-PO4 M Graduate is able to apply CSS properties to basic tags in XHTML.

C0.2-PSO3 M Graduate is able to use XHTML and CSS for developing innovative web

pages.

C03-PO2 M Graduate will be able to create XML documents to store and maintain

data.

C03-PO3 M Graduates are able to create DTDs to design the structure of XML

documents.

C03-PSO1 L Graduate attains a basic knowledge on XML schemas and their need in

XML.

C03-PSO3 M Graduate attains information on basic structure of XML documents

which can be used for creating XML documents.

C04-PO1 L Graduate achieves a basic insight on PHP programming languages.

C04-PO2 M Graduate is able to analyze a problem and write solutions using PHP.

C04-PO3 H Graduate is able to develop solutions to complex problems using the

given programming languages.

C04-PO4 M Graduates achieves knowledge on writing PHP programs

C04-PSO1 M Graduates achieves knowledge on writing PHP programs

C04-PSO2 M Graduates achieves knowledge on writing PHP programs

C05-PO3 H Graduate is made able to develop web pages using javascipt and PHP.

C05-PSO1 M Graduates will able to develop web applications.

GAP in the syllabus PO

Introduction to Data bases PO1, PO3


1 www.w3schools.com/



2 www.w3.org/

3 www.htmldog.com / Tutorials/ HTML

4 www.validator.w3.org/

5 www.php.net/manual/en/index.php

6 httpd.apache.org/download.cgi

7 https://alistapart.com/article/frameworks

8 http://getbootstrap.com/css/

9 https://www.w3.org/TR/WD-DOM/introduction.html


CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES

LCD/SMART

BOARDS

STUD. SEMINARS ADD-ON COURSES


ASSIGNMENTS STUD. SEMINARS TESTS/MODEL

EXAMS

UNIV.

EXAMINATION

STUD. LAB

PRACTICES

STUD. VIVA MINI/MAJOR PROJECTS CERTIFICATIONS



ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK,

ONCE)

STUDENT FEEDBACK ON FACULTY

(TWICE)

ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT.

EXPERTS

OTHERS


Ms. Jyotsna A. Ms. Shimmi Asokan

(Faculty) (H.O.D)

http://www.htmldog.com/guides/

http://www.htmldog.com/guides/html/



CS372 High Performance Computing

COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH (JANUARY- MAY 2018)

COURSE: HIGH PERFORMANCE COMPUTING

SEMESTER: IVCREDITS: 6

COURSE CODE: CS372

REGULATION:2016

COURSE TYPE:ELECTIVE

COURSEAREA/DOMAIN: Computer Architecture CONTACT HOURS: 3 hours/week.


SYLLABUS: MODULE DETAILS HOURS

I

Modern Processors : Stored Program Computer Architecture- General

purpose cache- based microprocessor-Performance based metrics and

benchmarks- Moore's Law- Pipelining- Superscalarity-SIMD- Memory

Hierarchies Cache- mapping- prefetch- Multicore processors- Mutithreaded

processors- Vector Processors- Design Principles- Maximum performance

estimates- Programming for vector architecture.

7

II

Basic optimization techniques for serial code : scalar profiling- function and line

based runtime profiling- hardware performance counters- common sense

optimizations- simple measures, large impact- elimination of common

subexpressions- avoiding branches- using simd instruction sets- the role of

compilers - general optimization options- inlining - aliasing- computational

accuracy- register optimizations- using compiler logs- c++ optimizations -

temporaries- dynamic memory management- loop kernels and iterators data

access optimization: balance analysis and light speed estimates- storage order-

case study: jacobi algorithm and dense matrix transpose.

7

III

Parallel Computers : Taxonomy of parallel computing paradigms- Shared

memory computers- Cache coherance- UMA - ccNUMA- Distributed-memory

computers- Hierarchical systems- Networks- Basic performance characteristics-

Buses- Switched and fat- tree networks- Mesh networks- Hybrids - Basics of

parallelization - Why parallelize - Data Parallelism - Function Parallelism-

Parallel Scalability- Factors that limit parallel execution- Scalability metrics-

Simple scalability laws- parallel efficiency - serial performance Vs Strong

scalability- Refined performance models- Choosing the right scaling baseline-

Case Study: Can slow processors compute faster- Load balance.

7

IV

Distributed memory parallel programming with MPI : message passing -

introduction to MPI – example - messages and point-to-point communication -

collective communication – nonblocking point-to-point communication- virtual

topologies - MPI parallelization of Jacobi solver- MPI implementation -

performance properties

8



V

Shared memory parallel programming with OpenMp : introduction to OpenMp -

parallel execution - data scoping- OpenMp work sharing for loops-

synchronization - reductions - loop scheduling - tasking - case study: OpenMp-

parallel jacobi algorithm- advanced OpenMpwavefront parallelization- Efficient

OpenMP programming: Profiling OpenMP programs - Performance pitfalls-

Case study: Parallel Sparse matrix-vector multiply.

8

VI

Efficient MPI programming : MPI performance tools- communication

parameters- Synchronization, serialization, contention- Reducing

communication overhead- optimal domain decomposition- Aggregating

messages – Nonblocking Vs Asynchronous communication- Collective

communication- Understanding intra-node point-to-point communication

8

TOTAL HOURS 42



T

Georg Hager, Gerhard Wellein, Introduction to High Performance Computing for Scientists

and Engineers, Chapman & Hall / CRC Computational Science series, 2011

R Charles Severance, Kevin Dowd, High Performance Computing, O'Reilly Media, 2nd Edition,

1998.

R Kai Hwang, Faye Alaye Briggs, Computer Architecture and Parallel Processing, McGraw Hill,

1984.



CS202

Computer Organization and Architecture

Basics of Computer Architecture S4

COURSE OBJECTIVES:

1

To introduce the concepts of Modern Processors.

2

To introduce Optimization techniques for serial code.

3

To introduce Parallel Computing Paradigms.

4

To introduce Parallel Programming using OpenMP and MPI.

COURSE OUTCOMES:



Sl No DESCRIPTION

Blooms’

Taxonomy

Level

C206.1

Learn the advantages, issues and challenges of the current processors Understand

(level 2)

C206.2

Learn how to optimize a parallel code.

Apply

(level 3)

C206.3 Understand the various parallel programming paradigms and learn how to choose the right one based on the application domain.

Understand

(level 3)

C206.4

Implement parallel codes that are optimized for performance.

Apply

(level 3)


CO-PO MAPPING


C206.1 1

C206.2 2 2 1 2

C206.3 2 2 2 2

C206.4 2 2


SLNO DESCRIPTION PROPOSED

ACTIONS

PO

MAPPING

1 GPU ASSIGNMENT PO1, PO5




C206.1 PO1 L Student will obtain knowledge about the latest processors. The advantage of using these processors and also their issues and challenges.



C206.2- PSO1 H The students will be able to gain knowledge in how to optimize parallel and serial code.

C206.2- PO3 M Students will be able to design solutions for complex problems that can

be solved using parallel program there by producing better performing

solutions.

C206.2-PO7 L Better optimized codes leads to better resource utilization and less power consumption.

C206.2-PSO2 H Students will be able to design codes, algorithms and solutions that are better optimized.

C206.3-PO1 H Students will be able to gain knowledge about the different

programming paradigms.

C206.3-PO3 M Students will be able to choose from different parallel programming

paradigms while implementing the algorithm.

C206.3- PO4 H Students will be able to design codes, algorithms and solutions by selecting the appropriate programming paradigms.

C206.3- PSO2 H Students will be able to implement codes, algorithms and solutions by selecting the appropriate programming paradigms. Also they will be able to evaluate which paradigms to choose from.

C206.4-PO5 H Students will be able to learn OpenMP, MPI and profiling tools.


SLNO DESCRIPTION PROPOSEDACTIONS

1 CUDA Workshop


1 http://www.openmp.org/resources/tutorials-articles/

2 http://mpitutorial.com/tutorials/

3 http://www.nvidia.com/docs/IO/116711/sc11-cuda-c-basics.pdf


CHALK & TALK STUD. ASSIGNMENT WEB RESOURCES LCD/SMART BOARDS

STUD. SEMINARS ADD-ON COURSES




ASSIGNMENTS ☐ STUD. SEMINARS TESTS/MODEL

EXAMS

UNIV. EXAMINATION

☐ STUD. LAB PRACTICES ☐ STUD. VIVA ☐ MINI/MAJOR

PROJECTS

☐ CERTIFICATIONS




FEEDBACK, ONCE)


☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT.

EXPERTS

☐ OTHERS


Mr. Joseph John Ms. Shimmi Asokan

(Faculty) (HOD)



CS332 Microprocessor Lab


PROGRAMME: Computer Science and

Engineering.

DEGREE: BTECH

COURSE: Microprocessor Lab SEMESTER: 6 CREDITS: 1

COURSE CODE: CS332

REGULATION: 2016

COURSE TYPE: CORE

COURSE AREA/DOMAIN: ELECTRONICS CONTACT HOURS: 3 hours/Week.

CORRESPONDING LAB COURSE CODE (IF

ANY): EC233

LAB COURSE NAME: Logic Circuit Design

Lab

SYLLABUS:

DETAILS HOURS

A.

8086 Programs using kits : 1. Implementation of simple decimal arithmetic and bit manipulation

operations.

2. Programming exercises using stack and subroutines.

Peripherals and Interfacing Experiments 3. Interfacing with stepper motor - Rotate through any given sequence.

4. Interfacing with 8255

5. Interfacing with 7-segment LED Display

6. Interfacing with Digital-to-Analog Converter.

8051 Experiments using kits :

7. Basic arithmetic and Logical operations

4X3=12

B.

8. Decimal Arithmetic Programming using 8051 (Keil)

9. Bit manipulation programming using 8051 (Keil)

10.LED blinking using Timer programming (Keil)

11. Interfacing of stepper motor with 8051

12. Decimal arithmetic programming using MASM (8086)

13. String manipulation operation using MASM

4X3=12

TOTAL HOURS 24



1. The 8051 Microcontroller: Muhammad Ali Mazidi, Pearson Education.

2. The 8051 Microcontroller: Kenneth J Ayala, Penram International

3. Microprocessors and Architecture: Ramesh S Goankar

4. Microcomputers and Microprocessors: John Uffenbeck, PHI

5. The Microprocessors 6th Edition Barry B. Brey Pearson Edu.

6. Microprocessor and Interfacing 2nd Edition Douglous V. Hall TMH



7. The 80x 86 families John Uffenbeck

8. Advanced Microprocessors and Pheripherals A K Ray



CS305

Microprocessors

and

Microcontrollers

Familiarization of the basic concepts of

microprocessor and microcontroller.

Programming concepts were introduced

5

COURSE OBJECTIVES:

1 To write ALP for arithmetic and logical operations in 8086 and 8051

2 Implement interfacing of various I/O devices to the microprocessor/microcontroller through

assembly language programming

COURSE OUTCOMES:

SNO DESCRIPTION Blooms’ Taxonomy

Level

1

Students will be able to get the basic knowledge of 8086

microprocessor programming and understand how to use trainer

kit.

Knowledge

Understand & Apply

(Level 1,2 &3)

2

Students will be able to get the basic knowledge of 8051

microprocessor programming and understand how to use trainer

kit.

Knowledge

Understand & Apply

(Level 1,2 &3)

3 By acquiring the basic knowledge of programming students can

apply it to program advanced controllers.

Knowledge & Apply

(Level 1 & 3)

4 Students will be equipped with the basic knowledge of Microprocessor &

Microcontroller interfacing. Knowledge

(Level 1)

5 Students are able to select, describe and apply the interfacing

applications for developing their projects.

Knowledge,

Understand, Apply

& Create

(Level 1,2, 3 & 6)



CO.1 1 - - - 2 - - - - - - - 1 - -

CO.2 1 - - - 2 - - - - - - - 1 - -



CO.3 2 1 2 - 2 - - - - - - - 2 - 1

CO.4 1 - 1 - - - - - - - - - 1 - -

CO.5 2 1 1 1 2 - - - - - - - 1 - 1

JUSTIFATIONS FOR CO-PO-PSO MAPPING

MAPPING LOW/MEDIUM

/HIGH JUSTIFICATION

CO.1- PO1 L Understands the fundamental programming concepts and write

programs in 8086 assembly language for various problems.

CO.1 – PO5 M Able to execute the programs using 8086 microprocessor trainer kit.

CO.1 – PSO1 L Get technical knowledge about the 8086 microprocessor.

CO.2 – PO1 L Understands the fundamental programming concepts and write

programs in 8051 assembly language for various problems.

CO.2 – PO5 M Able to execute the programs using 8051 microprocessor trainer kit.

CO.2 – PSO1 L Get technical knowledge about the 8051 microprocessor.

CO.3 – PO1 M Able to understand the advanced controllers.

CO.3 – PO2 L Capable of solving various problems by developing different

programs using the instruction set.

CO.3 – PO3 M With the knowledge acquired, development of different program to

various systems is possible.

CO.3 – PO5 M

Understand how to execute programs using the processor and

controller kits and interfacing cards for executing programs and

finding the solutions.

CO.3 – PSO1 M Get technical knowledge about the interfacing microprocessor with

external devices.

CO.3 – PSO3 L With the knowledge acquired, able to face technological challenges.

CO.4 – PO1 L Understands about microprocessor and microcontroller interfacing.

CO.4 – PO3 L With the knowledge acquired, development of different program to


CO.4 – PSO1 L Get technical knowledge of interfacing 8086 microprocessor and

8051 microcontroller with various peripherals.

CO.5 – PO1 M Able to describe about microprocessor and microcontroller



interfacing

CO.5 – PO2 L Able to develop solution for complex problems.

CO.5 – PO3 L With the knowledge acquired, development of different program to


CO.5 – PO4 L Solutions for complex programs may be developed.

CO.5 – PO5 M With the interfacing knowledge students are able to use the tools to

build their projects.

CO.5 – PSO1 L Get technical knowledge of interfacing 8086 microprocessor and

8051 microcontroller with various peripherals.

CO.5 – PSO3 L With the knowledge acquired, able to face technological challenges.



ACTIONS

RELEVANCE

WITH POs

RELEVANCE

WITH PSOs

1 Embedded C and other user friendly

languages are needed.

Free

tutorials.

PO2,PO3,

PO5

PSO1,

PSO3

2 Interfacing various practical devices has to

be concentrated.

Extra lab

experiments.

PO2,PO3,

PO5

PSO1,

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



ACTIONS

RELEVANCE

WITH POs

RELEVANCE

WITH PSOs

1 Detailed study about advanced

microcontrollers.

Extra

Assignments PO1 PSO1

2 Familiarization of various development

boards and Integrated development area.

(IDE)

Short term

course PO1, PO5 PSO1, PSO3


1 Web site of Atmel - www.atmel.com

2 Microchip semiconductor web site – www.microchip.com

3 www.embeddedcraft.org

4 www.mikroe.com

http://www.atmel.com/

http://www.microchip.com/

http://www.embeddedcraft.org/

http://www.mikroe.com/



5 www.technologystudent.com


☐ CHALK & TALK ☐ STUD.

ASSIGNMENT

☐ WEB RESOURCES

☐ LCD/SMART

BOARDS

☐ STUD. SEMINARS ☐ ADD-ON

COURSES


☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL

EXAMS

☐ UNIV.

EXAMINATION

☐ STUD. LAB

PRACTICES


PROJECTS

☐ CERTIFICATIONS

☐ ADD-ON

COURSES

☐ OTHERS


☐ ASSESSMENT OF COURSE OUTCOMES (BY

FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON FACULTY

(TWICE)


EXT. EXPERTS

☐ OTHERS

Prepared by, Approved by,

Dr. Jos Prakash A.V Dr. Jobin K Antony

Mr. Nitheesh Kurian (HOD/DEC)

Ms. Sherry Ann Sacharia

(Course in-charges)

http://www.technologystudent.com/



CS334 Network Programming Lab

COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING DEGREE: BTECH

COURSE: NETWORK PROGRAMMING LAB SEMESTER: VI CREDITS: 1

COURSE CODE: CS334

REGULATION: 2016

COURSE TYPE: LAB

COURSE AREA/DOMAIN: PROGRAMMING/DATA

COMMUNICATION

CONTACT HOURS: 3 Lab hours/Week.

CORRESPONDING THEORY COURSE CODE (IF ANY): CS306 LAB COURSE NAME:NA

SYLLABUS:

List of Exercises/ Experiments (12 Exercises/ Experiments are to be completed. Exercises/

Experiments marked with * are mandatory)

1. Getting started with Basics of Network configurations files and Networking Commands in Linux.

2. To familiarize and understand the use and functioning of System Calls used for Operating system and

network programming in Linux.

3. Familiarization and implementation of programs related to Process and thread.

4. Implement the First Readers-Writers Problem.

5. Implement the Second Readers-Writers problem.

6. Implement programs for Inter Process Communication using PIPE, Message Queue and Shared

Memory.

7. Implement Client-Server communication using Socket Programming and TCP as transport layer

protocol.*

8. Implement Client-Server communication using Socket Programming and UDP as transport layer

protocol.*

9. Implement a multi user chat server using TCP as transport layer protocol.*

10. Implement Concurrent Time Server application using UDP to execute the program at remoteserver.

Client sends a time request to the server, server sends its system time back to the client. Client displays

the result.*

11. Implement and simulate algorithm for Distance vector routing protocol.

12. Implement and simulate algorithm for Link state routing protocol.

13. Implement Simple Mail Transfer Protocol.*

14. Develop concurrent file server which will provide the file requested by client if it exists. If not server

sends appropriate message to the client. Server should also send its process ID (PID) to clients for display

along with file or the message.*

15. Using Wireshark observe data transferred in client server communication using UDP and identify the

UDP datagram.

16. Using Wireshark observe Three Way Handshaking Connection Establishment, Data Transfer and

Three Way Handshaking Connection Termination in client server communication using TCP.

17. Develop a packet capturing and filtering application using raw sockets.

18. Design and configure a network with multiple subnets with wired and wireless LANs using required

network devices. Configure the following services in the network- TELNET, SSH, FTP server, Web

server, File server, DHCP server and DNS server.*

19. Install network simulator NS-2 in any of the Linux operating system and simulate wired and wireless

scenarios.



LAB CYCLE

1. Write simple java program for the following:

a. To find the factorial of a given number

b. To print the first n fibonacci series

c. To check whether a given string is palindrome.

2. Familiarization of Basic Networking Commands and Network configuration files in

Linux.

3. Familiarization of system calls used for operating system and network

programming in linux.

4. Write a program to implement process creation.

5. Write a program to implement a simple thread.

6. Implementation of Inter Process Communication using

a. PIPE

b. Message Queue

c. Shared Memory.

7. Implement Distance vector routing protocol.

8. Implement Link state routing protocol.

9. Implement Client Server Communication using socket programming and TCP as

transport layer protocol.

10. Implement Client Server Communication using socket programming and UDP as

transport layer protocol.

11. Implement a multi user chat server using TCP as Transport layer protocol.

12. Implement Concurrent Time Server application using UDP to execute the program

at remote server. Client sends a time request to the server, server sends its system

time back to the client. Client displays the result.

13. Implement Simple Mail Transfer Protocol.

14. Develop concurrent file server which will provide the file requested by client if it

exists. If not server sends appropriate message to the client. Server should also send

its process ID (PID) to clients for display along with file or the message.

15. Familiarization of Wireshark (home assignment).



16. Familiarization programs for GUI and Applet.



R1 Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.

R2 Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013

R3 Abraham Silberschatz, Peter B Galvin, Greg Gagne, Operating System Concepts, 9/e, Wiley India, 2015.

R4 Computer Networks A Systems Approach-Larry L.Peterson and Bruce S.Davie,4th

Edition .Morgan Kaufman

COURSE PRE-REQUISITES: C.CODE COURSE NAME DESCRIPTION SEM

CS206 Object Oriented Design and Programming Fundamentals of Java programming 4

CS204 Operating Systems Overview of thread, process and IPC 4

CS307 Data Communication Fundamentals of communication 5

CS306 Computer Networks Familiarization of Network protocols 6

COURSE OBJECTIVES: 1 To introduce Network related commands and configuration files in Linux Operating System.

2 To introduce tools for Network Traffic Analysis and Network Monitoring

3 To practice Network Programming using Linux System Calls.

4 To design and deploy Computer Networks.

COURSE OUTCOMES: SNO DESCRIPTION

CS 334.1 Use network related commands and configuration files in Linux Operating

System. CS 334.2 Develop operating system and network application programs. CS 334.3 Analyze network traffic using network monitoring tools.




PO

1

PO

2

PO

3

PO

4

PO

5

PO

6

PO

7

PO

8

PO

9

P0

10

PO

11

PO

12

PSO

1

PSO

2

PSO

3

CS334.1 3 - - - 1 - - - - - - - 1 - -

CS334.2 - - 3 - - - - - - - - - 3 - -

CS334.3 2 2 - - 1 - - - 2 3 - - 3 - -

CS

231(overa

ll level)

1 2 3 2 1 - - - 2 2 - - 2 - -



CS334.1-PO1 H The knowledge about system calls helps to find the solution of

complex engineering problems related to OS.

CS334.1-PO5 L Engineering tools can be created and applied to complex

engineering activities using Linux concepts

CS334.1-PSO1 L Analyze and design solutions for complex engineering problems in

multidisciplinary areas by understanding the core principles and

concepts of Linux

CS334.2-PO3 H The knowledge about process helps to choose the suitable

algorithm to solve complex problems.

CS334.2-PSO1 H Analyze and design solutions for complex engineering problems in


concepts of Operating system and network application programs.

CS334.3-PO1 M The knowledge about Wireshark and other network protocols to

find the solution of complex engineering problems related to

network.

CS334.3-PO2 M Knowledge about networking protocols helps to identify, formulate

and analyze network traffic monitoring.

CS334.3-PO5 L Familiarization of Wireshark and other tools helps to model

complex engineering activities related to network simulation.

CS334.3-PO9 M Individual and team work effectively help to understand the

network traffic monitoring and tools associated to it.

CS334.3-PO10 H Communication can be made possible by demonstrating the

networking traffic and commands.

CS334.3-PSO1 H Analyze and design solutions for complex engineering problems in


concepts of networking

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION

REQUIREMENTS: SNO DESCRIPTION PO MAPPING

1 Knowledge about network protocols. PO1 PO2 PO3 PO5 PO10

2 Knowledge about network traffic. PO1 PO2 PO3 PO5 PO10

3

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY

VISIT/GUEST LECTURER/NPTEL ETC




No Topic PO

Mapping

1 Applets and GUI PO1 PO2

PO5 PO10

PO11

2 ns-3 PO1 PO2

PO5 PO10

PO11


1 http://www.studytonight.com/operating-system

2 https://hubpages.com/technology/Communication-Engineering-FAQs

3 https://www.smartzworld.com/notes/data-communication-and-computer-networks-notes-pdf-dccn

4 https://www.tecmint.com/linux-network-configuration-and-troubleshooting-commands

5 http://www.comptechdoc.org/os/linux/commands/linux_crspfiles.html

6 http://www.nptelvideos.in/2012/11/computer-networks.html

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


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

ONCE)


ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS OTHERS


Ms. Shimmi Asokan

HoD

Ms. Anjusree V.K

Ms. Asha Raj

Ms. Meharban M S