Page 1 of 5

College of Engineering, Pune www.coep.org.in Department of Computer Engineering and Information Technology

Course Plan

Course Code: CT-09002 Course: Design and Analysis of Algorithms

Teaching Scheme: Examination Scheme: Lectures - 3 hours/week Tests/ Quizzes - 30 Marks ESE - 50 Marks Academic Year: 2014-15 Class: T.Y. BTech Semester: V

Teaching Learning Interaction: (Lectures, active learning, think-pair-share activities, flipped classrooms, assignments, presentations, take home assignments)

SN Unit Topic Lectures Total

01 I

Introduction to analysis of algorithms, need of time and space analysis of algorithms, issues and tradeoffs in analysing algorithms

01

06 Problems Growth functions, Necessity of time and space analysis of algorithms, Order notations (O, Θ, Ω notations), Problem Instance size, Frequently occurring recurrence relations in analysis of algorithms

03

Analyzing bubble sort, selection sort, insertion sort for O, Θ, Ω notations

02

02 II

Overview of data structures and their representations – Arrays, linked lists, stacks.

02

06 Data structures: queues, binary search trees, red-black trees, hash tables etc

01

Basics of graphs and their representations 01

Heaps and Heapsort, Analysis of Heapsort 02

03 III

Design Technique: Divide and Conquer (Merge Sort) 02

07 Design Technique: Greedy Method (Knapsack Problem) 02

Design Technique: Backtracking (8 Queens Problem, Graph Coloring) 03

04 IV Graph Theory: Elementary Algorithms, DFS, BFS, Topological Sor 01 06

Minimum spanning trees (Kruskal and Prim's algorithms), 01

Shortest Paths: Single Source shortest paths –Bellman-Ford algorithm, Dijkastra’s algorithm

02

String Matching : The naïve string-matching algorithm, The Robin-Karp algorithm

01

String Matching (The Knuth-Morris-Pratt algorithm), Geometric algorithms.

01

05 V

Introduction to Advanced Algorithm Design Techniques : Amortized Analysis, Aggregate analysis, The accounting method, The potential method, Probabilistic Analysis and Randomized Algorithms, The hiring problem, Indicator random variables, and Approximation Algorithms.

02

05 Advanced Algorithm Design Techniques Amortized Analysis: Aggregate analysis

01

The accounting method, The potential method, Probabilistic Analysis and Randomized Algorithms

01

The hiring problem, Indicator random variables, and Approximation Algorithms.

01

Page 2 of 5

06 VI

Complexity Theory :Lower - bound arguments. 2

6 NP – completeness 2

Introduction to NP - Complete.

2

Total: 36

2. Text Book:

1. Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, “Introduction to Algorithms”, 3rd edition, Prentice Hall of India, 2012.

2. E. Horowitz, S. Sahni, and S Rajasekaran, “Fundamentals of Computer Algorithms”, 2nd edition, Universities Press, 1991.

3. Reference books:

1. Dexter C Kozen, “The Design and Analysis of Algorithms,” Springer Verlag, 1992. 2. Jon Kelinberg, Eva Tardos, “Algorithm Design,” Pearson Education, 2006. 3. Donald E. Knuth, “The Art of Computer Programming,” Volumes 1-3, Addison-Wesley

Professional, 1998. 4. Robert Sedgewick, “Algorithms in Java,” Part 1-4, Addison Wesley Professional, 2002. 5. Steven Skiena, “The Algorithm Design Manual,” Springer Verlag, 2008 6. A V. Aho, J. E. Hopcroft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms”,

Addison Wesley, 1974 4. On-line Course Resources:

1. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-

algorithms-sma-5503-fall-2005/index.htm

2. http://www.cs.virginia.edu/~luebke/cs332/

3. http://people.cs.pitt.edu/~kirk/algorithmcourses/

4. http://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15850c-s96/www/home.html

5. http://www.algorist.com/

5. List of Assignments/ home works /problems:

1. From the different design techniques (viz., Greedy Methods, Divide and Conquer, Dynamic

Programming, Backtracking, etc.,) give a detailed analysis of any three algorithms (each of different design technique) by a group of two students.

2. For the problems discussed in classroom/ lab, propose a solution using any of the design technique which is relevant to that problem.

3. Design an algorithm on any idea of your choice. Submit a report and give a presentation on the work done.

Page 3 of 5

6. Learning Outcomes of the Course:

(i) Introduces the need of analyzing algorithms and basic techniques used in the analysis, (ii) Makes students aware of standard design techniques, (iii) Makes students aware of complexity theory, (iv) Students equipped with all these topics will always be keen on writing efficient code, use

standard techniques to solve problems from different domains and go for approximate solutions when the problems are computationally hard, and

(v) This course would give them an edge over other software professionals who know only technology.

7. Questions (Not full question – just type/ theme/topic / abstract): Submission of question-wise marks obtained in excel sheet to the Department. Note: Same sequence of questions is to be maintained in excel sheet and also mapping in item (9) below.

Test- 1 examination: Question 1: Understand, analyze, and describe concepts of analyzing algorithms.

Question 2: Analyzing basic sorting algorithms for O, Θ, Ω notations and in terms of

recurrence relations.

Question 3: Understanding concepts, representation and problems of basic data structures

and graphs.

….

Test- 2 examination: Question 4: Understanding and analyzing design techniques Question 5: Solving problems for design techniques Question 6: Understanding and solving problems on Graph Theory ….

End Semester examination: Question 7: Theory and/or problems on analyzing algorithms

Question 8: Theory and/or problems on design techniques

Question 9: Theory and/or problems on string matching and geometric algorithms.

Question 10: Case study on advanced algorithm design techniques

Question 11: Complexity theory problems

Question 12: Designing algorithms for real-life situations

...

Page 4 of 5

8. Program Outcomes relevant to the Outcomes:

a. Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms

and programming technologies and fundamentals of Computer Science.

b. Graduates will demonstrate knowledge of fundamentals of hardware technology relevant to

understanding Computer Science basics.

c. Graduates will have knowledge of the best practices in software development in industry.

d. Graduates will demonstrate the ability to design creative solutions to real life problems

faced by the industry.

e. Graduates will demonstrate capability to work in teams and in professional work

environments.

f. Graduates will be able to communicate technical topics in written and verbal forms.

g. Graduates will demonstrate an understanding of the problems most relevant in time to

Computer Engineering.

h. Graduates will demonstrate their ability to use the state of the art technologies and tools

including Free and Open Source Software (FOSS) tools in developing software.

i. Graduates will demonstrate good performance at the competitive examinations like GATE,

GRE, CAT for higher education.

j. Graduates will demonstrate their qualities of learning and demonstrating latest technology.

k. Graduates will have developed the capability for self-learning.

9. Mapping of Questions to CO’s: (Sequence of Questions as per item 7)

Questions CO’s

1 CO1

2 CO1

3 CO1

4 CO1,CO2

5 CO1,CO2

6 CO1,CO2

7 CO1

8 CO1,CO2

9 CO1,CO2,CO3

10 CO1,CO2,CO3 11 CO3

12 CO1,CO2,CO3,CO4,C05

Page 5 of 5

10. Mapping of CO’s to PO’s:

CO’s PO’s

1 a

2 a, c

3 a, c

4 g, h, i

5 d, g

11. Evaluation Scheme:

Examination Marks Date

Quiz I/Test I 20 Third week of August 2014

Quiz II/Test II 20 Third week of September 2014

End Sem Exam 60 19th Nov. to 2nd Dec. 2014

(Dr. J. V. Aghav) Head, Comp IT Dept

(Dr. Mrs. Y. V. Haribhakta) Course in charge

Page 1 of 2

College of Engineering, Pune www.coep.org.in Department of Computer Engineering and Information Technology

Course Plan

Course Code: CT-09006 Course: Design and Analysis of Algorithms Lab

Teaching Scheme: Examination Scheme: Practical - 3 hours/week TW - 50 Marks Practical - 50 Marks Academic Year: 2014-15 Class: T.Y. BTech Semester: V

Teaching Learning Interaction: (Lectures, active learning, think-pair-share activities, flipped classrooms, assignments, presentations, take home assignments)

Sr.

No Assignment List

01

Recursive and Iterative (Non Recursive ) algorithm for specific problem and their

complexity measures (Comparison Expected).

02 Verification of (worst and average) complexity measures of following sorting techniques

03 Selection sort, Bubble sort, Heap sort, Merge sort and Quick sort

04 Minimum Spanning tree as an example of Greedy approach [Prim’s VS. Kruskals ]

05 Implementation of Single Source and All Pairs Shortest algorithms.

06 Finding longest common subsequence of given two sequences using Dynamic Programming.

07 8-Queens Problem (Iterative and Recursive versions).

08 Pattern Matching Algorithms: Naïve, Robin-Karp and KMP

09 Finding closest pair of points.

Page 2 of 2

2. Learning Outcomes of the Course:

(i) Introduces the need of analyzing algorithms and basic techniques used in the analysis, (ii) Makes students aware of standard design techniques, (iii) Makes students aware of complexity theory, (iv) Students equipped with all these topics will always be keen on writing efficient code, use

standard techniques to solve problems from different domains and go for approximate solutions when the problems are computationally hard, and

(v) This course would give them an edge over other software professionals who know only technology.

3. Program Outcomes relevant to the Outcomes:

a. Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms

and programming technologies and fundamentals of Computer Science.

b. Graduates will demonstrate knowledge of fundamentals of hardware technology relevant to

understanding Computer Science basics.

c. Graduates will have knowledge of the best practices in software development in industry.

d. Graduates will demonstrate the ability to design creative solutions to real life problems

faced by the industry.

e. Graduates will demonstrate capability to work in teams and in professional work

environments.

f. Graduates will be able to communicate technical topics in written and verbal forms.

g. Graduates will demonstrate an understanding of the problems most relevant in time to

Computer Engineering.

h. Graduates will demonstrate their ability to use the state of the art technologies and tools

including Free and Open Source Software (FOSS) tools in developing software.

i. Graduates will demonstrate good performance at the competitive examinations like GATE,

GRE, CAT for higher education.

j. Graduates will demonstrate their qualities of learning and demonstrating latest technology.

k. Graduates will have developed the capability for self-learning.

4. Mapping of CO’s to PO’s:

CO’s PO’s

1 a, c

2 a, c

3 a, c

4 e, g, h, i, j

5 d, g

5. Evaluation Scheme: Continuous Evaluation

(Dr. J. V. Aghav) Head, Comp IT Dept

(Dr. Mrs. Y. V. Haribhakta) Course in charge

 

College of Engineering Pune 411005 Department of Computer Engineering and Information Technology

Course Plan: TY B Tech (Computer Engineering), 2014-2015, Semester V 

CT 303 : DATABASE MANAGEMENT SYSTEM

Teaching Scheme: Lectures- 3 hours/week Examination Scheme: Assignments/Quizzes- 40 Marks

End Semester Examination-60 Marks Objectives:

This course is one of the fundamental courses in Computer Engineering. This course helps students in understanding the Introduces the fundamental concepts

related to Database  It introduces the query languages that are essential for querying databases which

helps students in analyzing the user requirements.  Introduces the various data models which describes the structure of the database

and. Introduces various types of File Systems. Database design helps in applying the practical aspects of a problem/project

SN Unit Topic Lectures

Total

01 I Basic concepts, Advantages of DBMS over file-processing systems 01 03

Data abstraction, Data Models and data independence, Components of DBMS and overall structure of DBMS

01

Data Modeling, entity, attributes, relationships, constraints, keys E-R diagrams, Components of E-R Model.

01  

 

02 II Relational Model: Basic concepts. Attributes and domains, concept of integrity and referential constraints, schema diagram

02 04

Relational Query Languages: Relational Algebra and Relational Calculus: Tuple relational and domain relational calculus.

02

 03 III Introduction to SQL, Characteristics and advantages of SQL, SQL

Data Types and Literals, DDL 02 08

Tables: Creating, modifying, deleting, Views: Creating, dropping, Updation using Views

02

DML,SQL Operators, SQL DML queries, SELECT query and clauses, Set Operations, Predicates and Joins

02

Set membership, Tuple variables, set comparison, ordering of tuples, aggregate functions, nested queries,

02

       

 

04 IV Database modification using SQL Insert, Update and Delete queries, Dynamic and Embedded SQL and concept of stored procedures, Query-by-example.

03 06

Storage and File Systems,Secondary Storage, RAID, File Organization, Indices, Static and Dynamic Hashing, B-trees

03

 

04 V Relational Database Design, Notion of normalized relations 01 06

Functional dependency, decomposition and properties of decomposition

02

Normalization using functional dependency, Multi-valued dependency and Join dependency

03

 06 VI Query Management and Transaction Processing,Measures of

query cost, Selection operation, sorting and join operation 03 09

Transaction Concept, Components of transaction management, Concurrency and recovery system, Different concurrency control protocols such as timestamps and locking, validation, Multiple granularity, Deadlock handling

03

    Different crash recovery methods such as log-based recovery, shadowpaging, Buffer management and Remote backup system.

03

      Total 36

Text Books: · Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”, 5th Edition, McGraw Hill International Edition. · Raghu Ramkrishnan, Johannes Gehrke, “Database Management Systems”, Second Edition, McGraw Hill International Editions. Reference Books: · Rob Coronel, “Database systems : Design implementation and management”, 4th Edition, Thomson Learning Press. · Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.

Outcomes:

1.Understand various components of DBMS and enforcement of key constraints on database. 2.Analyse requirements and Construct ER model for given application. 3.Create basic and advance SQL queries. 4.Understand and analyse the atabase design and apply normalization. 5.Understand different file organization techniques. 6.Learn concurrency control ,failure and recovery of databases. 7.Connect high level programming language with database through JDBC. 8.Design client/server model for database application.

Evaluation Procedure:

Examination Marks Dates (Academic Calendar)

Quiz I 20 As per Academic calendar Quiz II 20 As per Academic calendar End Sem Exam 60 As per Academic calendar

(Dr Vahida Attar/ Dr S U Ghumbre) Head

Subject In charge Dept. of Computer Engg. and IT

 

College of Engineering, PUNE - 05 Department of Computer Engineering and Information Technology

Course Plan Course: CT-09007 - Database Management System Lab

Schedule: 3 hrs/week

List of Assignments: 

Assignment 1: Basic SQL a. Write the following simple SQL Queries on the given Schema.  b. Create a schema for given case using the DDL commands. Insert sample data using the command in the file Try inserting more data into these tables.

Assignment 2: More SQL a. Intermediate SQL: Aggregates and grouping and ordering b. Nested Subqueries and SQL Updates Assignment 3: SQL DDL and updates Assignment 4: Schema creation and constraints Create the schema and constraints on the relations. Assignment 5: Indexing and Query Processing Assignment 5: JDBC Assignment 6: Servlets Books: Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”, 5th Edition, McGraw Hill International Edition. 

Rob Coronel, “Database systems : Design implementation and management”, 4th Edition, Thomson Learning Press.

Outcomes:

1.Understand various components of DBMS and enforcement of key constraints on database.

2.Create basic and advance SQL queries.

3. Understand and analyse the database design.

4.Connect high level programming language with database through JDBC.

5.Design client/server model for database application.

Evaluation Scheme Continues Assessment – 50 marks Final Practical /Oral –50 marks

(Dr Vahida Attar/ Dr S U Ghumbre) Head

Subject In charge Dept. of Computer Engg. and IT

College of Engineering, Pune - 05 Department of Computer Engineering and Information Technology

CT – 09004: SYSTEM PROGRAMMING

Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks: Continuous evaluation-

Assignment/Quizzes – 40 marks End Sem Exam - 60 marks

Teaching plan

No. Unit Topic Count Total

1 I

System software and assemblers: Definition, Components of system software, Evolution of system software.

1

6

Language translators. Assemblers Structure of an assembler, Design of two pass assembler (8085 as ref)

1

Single Pass assembler – Table of incomplete instruction, back patching. Data structures used for design of One and Two pass assembler.

1

Design and Implementation of two pass assembler, Error handling and Symbol Table management in assembler.

1

Handling constants, literals, labels and Procedures. 1 One pass assembler design and comparison with two pass assembler design, Cross assembler.

1

2 II

Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion

1

6

Macro Processor Algorithm and Data Structures, Macro Parameters – Positional ,Keyword, Actual

1

Design and implementation of simple macro processor Nested Macro processor – Macro call within macro definition macro definition within macro definition

1

General Macro processing concepts - Concatenation of Macro Parameters, Generation of Unique Labels

1

Conditional Macro Expansion, Macro Processor Design Options 1 Recursive Macro Expansion, implementation Examples - MASM Macro Processor

1

3 III

Linkers and Loaders: Basic Loader Functions - Design of an Absolute Loader

1

6

A Simple Bootstrap Loader, Machine-Dependent Loader Features 1 Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader

1

Machine-Independent Loader Features - Automatic Library Search, Loader Options

1

Loader Design Options - Linkage Editor, Dynamic Linkage 1 Bootstrap Loaders, Implementation Examples - MS-DOS Linker 1

4 IV

Compiler: Basic Compiler Function Compiler phases 1

6

Lexical Analysis – NFA and DFA, Syntax analysis - Grammars 1 Top down v/s bottom up parsing, recursive descent parser 1 Shift reducing parser; Semantic Analysis and Intermediate code generation

1

Various types of intermediate code forms, Compiler-Compilers 1 Compiler generation tools – LEX and YACC. Interpreters 1

5 V Software Tools: Tools for program testing 2

6 Test editors – screen editor 2 line editor, Word processors, Debugger 2

6 VI

Dynamic linking in windows: Concept of clipboard, Dynamic data exchange

1

6 Dynamic link libraries. The need, conventional dynamic linking 1 Libraries, the class library, dynamic linking, name mangling and DLLs 1 The use of call back functions, far function prologs 1 Different methods of specifying link, Dynamic linking with and without import.

2

Text Books :

1. D. M. Dhamdere : “Systems programming and operating system”, Tata McGraw Hill. 2. Abranhan Silberschatz, Peter B Galvin ; Operating System Concepts, Addition Wesley Publishing

Company. References :

1. Milenkovic ; Operating System Concepts and Design; McGraw Hills. 2. John j Donovan ;System Programming, Tata McGraw Hill

Useful URLs: http://www.cs.bgu.ac.il/~spl091/Main

http://www.cs.uiuc.edu/class/fa05/cs241/lectures.html http://solomon.ipv6.club.tw/Course/SP.941/index.html http://www.cse.sc.edu/~matthews/Courses/510/Lectures.html

Course Outcomes:

1. CO-1: Introduce the major concepts areas of language translation and compiler design. 2. CO-2: Develop an awareness of the function and complexity of modern compilers, linkers,

loaders and assemblers. 3. CO-3: Give students the knowledge and skills necessary to develop system software

covering a broad range of engineering and scientific applications. 4. CO-4: Learn context free grammars, compiler parsing techniques, construction of abstract

syntax trees, symbol tables, and actual code generation. 5. CO-5: Provide a thorough coverage of the basic issues in programs interacting directly with

operating systems. Questions:

Test 1 Q1 – Basics of System software and assemblers. Q2 - Single Pass assembler and Data structures used for design of One and Two pass Assembler Q3 – Handling constants, literals, labels and Procedures and Cross assembler Test 2 Q4 – Basic Macro Processor and Macro Processor Algorithm and Data Structures Q5 – Design and implementation of simple macro processor Q6 – General Macro processing concepts and implementation Examples

End Semester Exam Q7 – On Unit one and two Q8 – On Unit two and three Q9 – Basic Loader Functions and Loader Design Options Q10 - Basic Compiler Function and Various types of intermediate code forms. Q11 - Tools for program testing and dynamic linking in windows Program Outcomes relevant to the Outcomes:

1. PO-1: Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and programming technologies and fundamentals of Computer Science.

2. PO-3: Graduates will have knowledge of the best practices in software development in industry. 3. PO-4: Graduates will be able to demonstrate the ability to design creative solutions to real life

problems faced by the industry. 4. PO-7: Graduates will demonstrate their ability to use the state of the art technologies and tools

including Free and Open Source Software (FOSS) tools in developing software. 5. PO-9: Graduates will demonstrate good performance at the competitive examinations like GATE,

GRE, CAT for higher education. 6. PO-10: Graduates will be able to demonstrate their qualities of learning and demonstrating latest

technology 7. PO-11: Graduates will be able to develop the capability for self-learning.

Mapping of Questions to CO’s:

Questions CO’s 1 1 2 1 3 2 4 3 5 3,4 6 4,5 7 1,2 8 2,3 9 4 10 4,5 11 5

Mapping of CO’s to PO’s:

CO’s PO’s 1 1 2 1,3 3 4,7 4 9,10 5 11

Evaluation Procedure

Examination Marks Dates (As per Academic Calendar) Quiz I 20 August 25-28, 2014 Quiz II 20 September 22-25, 2014 End Sem Exam 60 November 19 – December 02, 2014

(S.K. Gaikwad) Head Subject In charge Dept. of Computer Engg. and IT

CT – 09008: SYSTEM PROGRAMMING LABORATORY

Teaching Scheme Practical : 2 hrs/week

Examination Scheme Practical –50 marks Term Work – 50 marks

List of Assignments:

1 Designing a simple assembler for hypothetical machine. Student should handle data

segment, code segment, symbol table management as well as error handling.

2 Expand the above assignment to cover procedure.

3 Design simple macro processor. Student should handle macro with as well as without parameters, he/must handle keyword as well as actual parameters,

4 Design a nested macro processor [Call to a macro processor inside macro definition].

5 Assignment on LEX and YACC

6 Design a Line Editor

7 Design a Screen Editor

Outcomes: After completing this course the students should be able to

a) Implement translators (assembler, macro pre-processor) in a high level programming language like C, C++

b) Implement different programs in compiler generation tools like FLEX & c) Implement come intermediate code generation d) Implement code optimization techniques e) Students will be technically more familiar with Computer Systems.

( S.K. Gaikwad) Head Subject In charge Dept. of Computer Engg. and IT

College of Engineering, Pune www.coep.org.in Department of Computer Engineering and Information Technology

Course Plan Course Code: CT - 09005 Course: COMPUTER NETWORKS

Teaching Scheme: Lectures- 3 hours/week Examination Scheme: Tests/ Quizzes- 40 Marks ESE-60 Marks

Academic Year: 2014-15 Class: Third Year B Tech Semester: V

1. Teaching Learning Interaction: (Class, Tutorials, Assignments, presentations, home works)

SN

N Unit Topic Lecture(s) Total

01 I

Network layer services 1

10

IPv4 1 Problems with IPv4 1 Strategies to bridge the limitations (IP subnetting, CIDR, DHCP, NAT) 1 Network design with CIDR 1 IPv6 2 Dual stack, Addressing, Options 1 Extension headers 1 Packet forwarding 1

02

II

Routing algorithms: Unicast protocols 1

8

RIP 1

OSPF 1

BGP 1

multicast routing protocols 1

ICMP 1

IGMP, DHCP 1 enhancements to all protocols in V6 1

03 III

Transport layer services and protocols 1

6

UDP 1 TCP 1 TCP State Transition diagram 1 TCP flow control 1 TCP error control and TCP Timers 1

04 IV

Congestion control and Quality of Service introduction 1

6 Queuing disciplines 1 TCP Congestion control 2 Congestion Avoidance Mechanisms 1 Quality of Service 1

05 V

Multicast Routing 2

6 Multiprotocol Label Switching (MPLS), 2 Mobile IP 1 VoIP 1

06 VI

Traditional Applications( WWW, HTTP, FTP, Email, Telnet, SSH, DNS) 4

6 Peer-to-Peer Networks 1 Socket programming 1

Total 42 42

Page 1 of 3

2. Text Book:

• B. A. Forouzan and Firouz Mosharraf, Computer Networks, A Top-Down Approach, Tata McGraw-Hill, 2012 • Pete Loshin, IPv6:Theory, Protocol, and Practice, Elsevier, 2004

3. Reference Books:

• Larry L Peterson and B S Davie, Computer Networks: A Systems Approach, Elsevier,2012 • W. Richard Stevens, TCP/IP Illustrated, Vol. 1: The Protocols, 2nd Edition, Pearson, 2012 • B. A. Forouzan, “Data Communications and Networking”, 4th Edition, Tata McGraw-Hill, 2010 • William Stallings, “Data and computer Communication”, 7th Edition, Pearson Education, ISBN-81-297-0206-1 • A S Tanenbaum, “Computer Networks”, 4th Edition, Pearson Education, ISBN 9788177581652 • Alberto Leon Garcia and Indra Widjaja, “Communication Networks, Fundamental Concepts and Key

Architectures”, 2nd Edition, Tata McGraw-Hill. 2004, ISBN-10: 007246352X • J.F. Kurose and K. W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet” , 2nd

Edition, Pearson, 2003, ISBN-13: 9780201976991

4. On-line Course Resources:

1. IIT Kharakpur, Video Lectures: http://freevideolectures.com/Course/2276/Computer-Networks# 2. Networking Tools from MIT: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-829-

computer-networks-fall-2002/lecture-notes/T1tools.pdf 3. NPTEL videos: http://nptel.iitm.ac.in/video.php?subjectId=106105081 4. CMU course web page: http://www.cs.cmu.edu/~srini/15-441/F06/index.html 5. Berkeley course web page http://www.cs.berkeley.edu/~istoica/classes/cs268/10/ 6. UMAS course reading material: http://www.ecs.umass.edu/ece/wolf/courses/ECE697AA/reading.html

5. List of Assignments/ home works /problems:

1. Design of LAN 2. Routing table by OSPF and RIP 3. Solutions to TCP Congestion 6. Learning Outcomes of the Course:

• CO 1: To understand the state-of-the-art protocols and architectures in computer networks • CO 2 : Understand and build the skills of subnetting and routing mechanisms • CO 3: Identify various network hardware components at the appropriate layers • CO 4: Have a working knowledge of datagram and internet socket programming • CO 5: Identify, describe and give examples of the networking applications used in everyday tasks such as

reading email or surfing the web

7. Questions (Not full question – just type/ theme/topic / abstract):

Submission of question-wise marks obtained in excel sheet to the Department. Note: Same sequence of questions is to be maintained in excel sheet and also mapping in item (9) below.

Test- 1 examination:

Question 1: IPv4 fields, packet forwarding Question 2: design of subnets …

Test- 2 examination:

Question 3: routing protocols, table formulation Question 4: solving routing related problems …

Page 2 of 3

End Semester examination:

Question 5: IPv4 deficiency Question 6: Understanding of fields of IPv6 Question 7: TCP and UDP differences and applications Question 8: TCP congestion control algorithms Question 9: Networking applications Question 10: Question 11: ...

8. Program Outcomes relevant to the Outcomes:

Full listing on URL http://www.coep.org.in/index.php?pid=824

POA: Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and programming technologies and fundamentals of Computer Science.

POC: Graduates will have knowledge of the best practices in software development in industry.

POD: Graduates will demonstrate the ability to design creative solutions to real life problems faced by the industry.

POG: Graduates will demonstrate an understanding of the problems most relevant in time to Computer Engineering.

POI: Graduates will demonstrate good performance at the competitive examinations like GATE, GRE, CAT for higher education.

9. Mapping of Questions to CO’s: (Sequence of Questions as per item 7)

Questions CO’s

1 1,2 2 1 3 1 4 3 5 4 6 5 …

10. Mapping of CO’s to PO’s:

CO’s PO’s

1 A, I 2 A, C,D, G, I 3 A, C, D, G, I 4 A, G, I 5 A, D, G, I

11. Evaluation Scheme:

Examination Marks Date

Quiz I 20 As per academic schedule Quiz II 20 As per academic schedule

End Sem Exam 60 As per academic schedule

(Dr J V Aghav) Head, Comp IT Dept

(Dr Jibi Abraham) Course in charge

Page 3 of 3

College of Engineering, Pune www.coep.org.in Department of Computer Engineering and Information Technology

Course Plan Course Code: CT -09009 Course: COMPUTER NETWORKS Lab

Teaching Scheme: Lectures- 3 hours/week Examination Scheme: Tests/ Quizzes- 40 Marks ESE-60 Marks

Academic Year: 2014-15 Class: Third Year B Tech Semester: V

1. Teaching Learning Interaction: (Class, Tutorials, Assignments, presentations, home works)

SN

N Topic Lecture(s)

1. Client-server implementation using socket programming

2 labs

2. Implementing Sliding window Protocol 2 labs

3. Implementing Routing Protocol 2 labs

4. Wireshark based experiments on Ethernet, HTTP, IP, ICMP, TCP, DNS

3 labs

5. Creating network simulations using a Network Simulation tool

2 labs

6. Study of network components and resources

1 labs

2. Text Book:

• B. A. Forouzan and Firouz Mosharraf, Computer Networks, A Top-Down Approach, Tata McGraw-Hill, 2012

3. Reference Books:

• Larry L Peterson and B S Davie, Computer Networks: A Systems Approach, Elsevier,2012 • W. Richard Stevens, TCP/IP Illustrated, Vol. 1: The Protocols, 2nd Edition, Pearson, 2012 • William Stallings, “Data and computer Communication”, 7th Edition, Pearson Education, ISBN-81-297-0206-1

4. On-line Course Resources:

1. Wireshark Users Guide: http://www.wireshark.org/docs/wsug_html_chunked/ 2. Networking Tools from MIT: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-829-

computer-networks-fall-2002/lecture-notes/T1tools.pdf 3. OPNET IT Academic Edition:

http://www.opnet.com/university_program/itguru_academic_edition/install_software.html

5. Learning Outcomes of the Course:

• CO 1: To be familiar with network tools and network programming • CO 2 :Have a working knowledge of datagram and internet socket programming • CO 3: Recognize the different internetworking devices and their functions • CO 4: Familiar with Network simulation tools and conduct simulations

Page 1 of 2

6. Program Outcomes relevant to the Outcomes: POA: Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and programming technologies and fundamentals of Computer Science.

POC: Graduates will have knowledge of the best practices in software development in industry.

POD: Graduates will demonstrate the ability to design creative solutions to real life problems faced by the industry.

PO-E. Graduates will demonstrate capability to work in teams and in professional work environments

PO-F: Graduates will be able to communicate technical topics in written and verbal forms.

POI: Graduates will demonstrate good performance at the competitive examinations like GATE, GRE, CAT for higher education.

7. Mapping of CO’s to PO’s:

CO’s PO’s

1 A, C, D, E, F, I 2 A, C,D, , E, F, I 3 A, D, G, , E , F, I 4 A, C, D, , E, F

11. Evaluation Scheme:

Examination Marks Date

Quiz I 20 As per academic schedule Quiz II 20 As per academic schedule

End Sem Exam 60 As per academic schedule

(Dr J V Aghav) Head, Comp IT Dept

(Dr Jibi Abraham) Course in charge

Page 2 of 2