Escolar Documentos
Profissional Documentos
Cultura Documentos
Teaching plan
4 IV Type Checkers : type checking for expressions, declarations ( variable, type, function, 1 8
recursive), statements,
Intermediate code generation: Intermediate languages, Design issues, Intermediate 2
representations: three address, postfix
& abstract syntax trees, Intermediate code generation for declaration, assignment, 1
iterative statements, case statements, arrays
Structures, conditional statements, Boolean expressions, procedure/function 1
definition and call.
Run-Time Memory Management & Code generation: Model of a program in 1
5 V execution, Stack and static allocation, 7
Activation records , Issues in the design of code generation, 2
Target machine description, Basic blocks & flow graphs, Expression Trees, 1
Unified algorithms for instruction selection and code generation. 1
Sethi Ullman algorithm for expression trees , Aho Johnson algorithm, Different 1
models of machines
order of evaluation, register allocation , Code generator-generator concept. 1
Code Optimization Introduction, Principal sources of optimization, 1
Machine Independent Optimization, Machine dependent Optimization 1
Various Optimizations: Function preserving transformation, Common Sub- 2
expressions
6 VI 7
Copy propagation, Dead-code elimination, Loop Optimizations, 1
reduction in strength, Peephole Optimization, 1
Code Motion, Induction variables & Redundant –instruction elimination 1
total 38
Text Books :
• Alfred V. Aho, Monica S.Lam, R. Sethi and J.D. Ullman “Compilers: principles, techniques and tools” Pearson
Education.
References :
Useful URLs:
1. The lex and Yacc page : http://dinosaur.compilertools.net/
2. http://www.personal.kent.edu/~rmuhamma/Compilers/compiler.html
3. http://www.cs.sjsu.edu/~louden/cmptext/
4. http://www.gtoal.com/software/CompilersOneOhOne/
5. http://lambda.uta.edu/cse5317/notes/node4.html
Course Outcomes:
1. CO-1: Introduce the major concepts in areas of language translation and compiler design.
2. CO-2: Develop an awareness of the function and complexity of modern compilers.
3. CO-3: Give students the knowledge and skills necessary to develop a language translator or compiler 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 code optimization techniques.
Questions:
Test 1
Q1 – Basics of compilers.
Q2 - lexical analysis and its tools.
Q3 –regular expressions and DFA and NFA
Test 2
Q4 – different types of parsers.
Q5 – Design of LL and LR parsers.
Q6 – SDT and intermediate code generation.
1. PO-1: Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and programming
technologies and fundamentals of Computer Science.
2. PO-4: Graduates will be able to demonstrate the ability to design creative solutions to real life problems faced by the
industry.
3. 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.
4. PO-9: Graduates will demonstrate good performance at the competitive examinations like GATE, GRE, CAT for higher
education.
5. PO-10: Graduates will be able to demonstrate their qualities of learning and demonstrating latest technology
6. PO-11: Graduates will be able to develop the capability for self-learning.
Questions CO’s
1 1
2 1
3 1
4 2
5 3,4
6 3,4
7 1,2
8 2,3
9 4
10 4,5
11 1,2
CO’s PO’s
1 1
2 1,3
3 4,7
4 9,10
5 11
Evaluation Procedure
List of Assignments:
1 Calculator (text or graphics) using LEX and YACC or Document Editor (find, replace, macro) using LEX and YACC, or
Similar kind of assignment using LEX and YACC.
2 Lexical Analyzer for extracting noun and verb phrases from the input English text document.
3 Syntax Analyzer along with Intermediate code generation (Triple, Quad) for a subset of English language.
4 Any two optimization techniques on Intermediate Code Generation
Page 1 of 4
2. Text Book:
3. Reference Books:
2. http://cseweb.ucsd.edu/~mihir/papers/gb.pdf
3. http://www.emc.com/emc-plus/rsa-labs/index.htm
Page 2 of 4
6. Learning Outcomes of the Course:
7. Questions :
Test- 1 examination:
Test- 2 examination:
Page 3 of 4
8. Program Outcomes relevant to the Outcomes:
Full listing on URL http://www.coep.org.in/index.php?pid=824
(3) Graduates will have knowledge of the best practices in software development
in industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(6) Graduates will be able to communicate technical topics in written and verbal forms.
(7) Graduates will demonstrate an understanding of the problems most relevant in time
to Computer Engineering and IT industry.
(10) Graduates will demonstrate their qualities of learning and demonstrating latest
technology
Questions CO’s
1 1,3
2 3,10
3 4
4 3, 6
5 7
CO’s PO’s
1 1
2 1,7
3 4
4 7
5 4,5
6 6, 10
7 3
Page 4 of 4
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course Code: Course: Cryptography and Network Security Lab
Page 1 of 2
2. Learning Outcomes of the Course:
1) Implementing the cryptographic algorithms using the language they have studied
2) Demonstrate the practical importance of Information Security
3) Analyze the implementations for time required to generate keys and encryption/decryption
process also various possible attacks
4) Installing and configuring the proxy server and IDS
(3) Graduates will have knowledge of the best practices in software development in industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(6) Graduates will be able to communicate technical topics in written and verbal forms.
(7) Graduates will demonstrate an understanding of the problems most relevant in time
to Computer Engineering and IT industry.
CO’s PO’s
1 1
2 1,7
3 4, 6
4 7, 3
5. Evaluation Scheme:
Page 2 of 2
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course Code: CT – DE3 Course: ADVANCED UNIX PROGRAMMING
Page 1 of 3
2. Text Book:
• W. Richard Stevens, Stephen A Rago, Advanced Programming in the UNIX Environment, Addison-
Wesley / PHI, 2nd Edition, 2011.
• Maurice J. Bach, The Design of Unix Operating System, PHI. 2009
3. Reference Books:
• Terrence Chan: UNIX System Programming Using C++, Prentice Hall India, 1999.
• Kay A Robbins and Steve Robbins, Unix Systems Programming, Pearson Education, 2004.
• Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education, 2005.
• CO 1: To understand the role of Unix system calls as in files and internal data structures used by
Unix.
• CO 2 : Able to identify the central role of concurrency in systems programming and produce
programs which generate and control a process, establish relationship and communication between
multiple processes
• CO 3: Learn the fundamentals of reliable signal handling and the related system calls.
• CO 4: Develop short system utilities and applications using system calls
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:
Test- 2 examination:
Page 2 of 3
Question 4: creating and executing processes
…
• PO-A: Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and
programming technologies and fundamentals of Computer Science.
• PO-D: Graduates will be able to 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.
• PO-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.
• PO-I: Graduates will demonstrate good performance at the competitive examinations like GATE, GRE,
CAT for higher education and / or seek employment.
Questions CO’s
1 1
2 1,4
3 2
4 2, 4
5 1
6 3
…
CO’s PO’s
1 A, I
2 A, I
3 A, I
4 A, D, E, F, H, I
Page 3 of 3
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course Code: Course: Storage & Virtualisation
Page 1 of 7
Data Center End to End View- Overview of complete stack including
Storage, Network, Host, Clustering, High Availability, Applications, 2
Total 37
2. Text Books:
• Designing Storage Area Networks: A Practical Reference for Implementing Fibre Channel and
IP SANs, Second Edition Publisher: Addison-Wesley Author: Tom Clark.
3. Reference Books:
• Cloud Computing: Concepts, Technology & Architecture (The Prentice Hall Service
Technology Series from Thomas Erl) by Thomas Erl, Prentice Hall, 2013.
• Cloud Computing: Principles and Paradigms (Wiley Series on Parallel and Distributed
Page 2 of 7
• Computer Systems – A Programmer‟s Perspective, Randall Bryant and David
O‟Hallaron,Pearson Education. 2003.
• The Design and Implementation of the 4.4 BSD Operating System, McKusick, Bostic, Karels,and
Quaterman, 1996.
• lecturer.eepis-its.edu/~isbat/materikuliah/.../Virtualization.ppt
• http://csis.bits-pilani.ac.in/faculty/sundarb/courses/old/fall06/dstn/cnotes.html
• www.dc.uba.ar/events/eci/2008/courses/.../Virtualization-Introduction.pp...
• www.strassmann.com/pubs/gmu/2008-10.pdf
1.Remote Copy: Take two hosts. Create synchronous remote replication functionality from host1 to host2.
Remote copy for a data is used for disaster recovery. A copy of data is kept on a remote m/c which can be
used for recovery in case of disaster of local site.
Following are key properties of remote copy:
1. Data written on local disk should be synchronously copied to remote disk.
2. A write from an application should be completed only when data has been written to both source
and replicated node.
2.Writing a simple File System which provide functionality of "ls, mkdir, pwd" posix commands. Apart from
that it should support print operation . Please also write a application program to test these functionality.
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.
Page 3 of 7
Test- 1 examination:
Test- 2 examination:
(3) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(9) Graduates will demonstrate good performance at the competitive examinations like
GATE, GRE, CAT for higher education.
(10) Graduates will be able to demonstrate their qualities of learning and demonstrating
latest technology
Questions CO’s
1 1,2
2 3,5
3 4,5
4 3,4
5 2,3
6 1,2
7 2,3
Page 4 of 7
8 2,3
9 3,4
10 3,4
11 2,5
CO’s PO’s
1 1,2,3
2 11
3 4,9
4 10,4
5 10,11
Page 5 of 7
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Storage & Virtualization laboratory
Teaching Scheme: Examination Scheme:
Practical- 3 hours/week Practical/Oral Exam: 50 marks
Term work: 50 marks
Academic Year: 2014-15 Class: S. Y.- B.Tech Semester: III
Snapshot:
A snapshot is a point in time image of any device. Once a snapshot is taken, the content of the
snapshot should be what existed before snapshot was taken. No new I/O should go to snapshot.
To support snapshot while I/Os are still running on original disk, a mapping has to be preserved
which identifies which blocks are copied into snapshot device. Any new I/O on original device
should check for the map and if data has not been copied to snapshot, it should be first read
from original disk, written to snapshot disk and then new I/O should be allowed on source disk.
The snapshot should be preserved in a flat file on local disk.
Recovery:
A recovery involves restoring data from a previously taken backup. In our example, an interface
should be provided to read data from backup (flat file) and put into hard disk.
Problem:
Write a "Examination data server" which is using MySQL open source database for storing
students examination report, which is a snapshot of all present students's report of college.
The report consist of six field :
Name Id Branch Grade{ in each semester} Final Grade Papers Uncleared
A client program{ please also write client program to support it } can query on various parameter
and this server should generate a report for same {e.g. The no of students having CGPA(final
grade) 7.0 and above in all branches/particular branches., The No. of students not cleared in
Mathematics yet , Name of topper in every branch etc..}. Please user pthreads to support
multiuple client queries. Please also implement write functionality {update in case of old students
/ addition (new students) / delition (final semester students who has passed out } and use
reader/writer lock.
Lab Outcomes:
Introduces the fundamental storage & virtualisationl concepts to the students
Introduces the concept of solving problems using fundamental concepts
Introduces the importance of efficient designing & analysis of storage,duplication,
recovery scenarios.
Make the students technically more familiar towards Computer hardware & peripheral
design.
Page 6 of 7
(Dr J V Aghav) Tanuja Pattanshetti
Head, Comp IT Dept Course Co-ordinator
Page 7 of 7
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course: Artificial Intelligence
Teaching Scheme: Lect- 3 hours/week Examination Scheme: Tests/ Quizzes- 40 Marks
ESE-60 Marks
Introduction:
1
What is AI, History, AI problems, Production Systems
Problem characteristics, Intelligent Agents, Agent Architecture 2
01 I AI Application (E-Commerce, & Medicine), 1 6
AI Representation, Properties of internal representation 1
Future scope of AI , Issues in design of search algorithms 1
Logic Programming:
Introduction, Logic, Logic Programming, Forward and Backward 2
reasoning
forward and Backward chaining rules Knowledge representation
03 III 2 6
using non monotonic logic: TMS (Truth maintenance system)
statistical and probabilistic reasoning, fuzzy logic, structure
knowledge representation, semantic net, Frames, Script, Conceptual 2
dependency
Learning:
04 IV What is Learning, Types of Learning (Rote, Direct instruction 2
Analogy, Induction, Deduction)
6
Planning: Block world, strips, Implementation using goal stack, Non
3
linear planning with goal stacks
Hierarchical planning, Least commitment strategy 1
SN Unit Topic Lecture(s) Total
Advance AI Topics:
1
Game playing: Min-max search procedure
Alpha beta cutoffs, waiting for Quiescence 1
Secondary search, Natural Language Processing: Introduction, Steps
05 V 1 6
in NLP, Syntactic Processing
ATN, RTN, Semantic analysis 1
Discourse & Pragmatic Processing 1
Perception and Action: Perception, Action, Robot Architecture 1
Total 36
2. Text Book:
1. Stuart Russell & Peter Norvig : “Artificial Intelligence : A Modern Approach”, Prentice
Hall, 2nd Edition.
2. Ivan Bratko : “Prolog Programming For Artificial Intelligence” , 2 nd Edition Addison
Wesley, 1990.
3. Herbert A. Simon, “The Sciences of the Artificial “, MIT Press, 3rd Edition (2nd Printing),
1998.
4. Tim Jones “Artificial Intelligence Application Programming” M. Dreamtech Publication.
5. George F Luger : “Artificial Intelligence : Structures and Strategies for Complex Problem
Solving”, Pearson Edu., 4th Edition.
6. Rajendra Akerkar : ”Introduction to Artificial Intelligence ”,PHI Publication.
4. On-line Course Resources:
1. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-034-artificial-
intelligence-fall-2010/
2. https://www.edx.org/course/uc-berkeleyx/uc-berkeleyx-cs188-1x-artificial-579#.U8JcbpSSy7c
3. http://web.stanford.edu/class/cs221/
4. www.csail.mit.edu/
5. www.aaai.org/
6. www.formal.standard.edu/jmc/whatisai/
1. List down various applications of Artificial Intelligence and give a case study from any
domain in a group of two students.
2. Find out a problem definition and give a solution using any of the AI technique which is
relevant to that problem.
CO-1: Introduction to problems which are hard to solve using conventional programming.
CO-2: Learn the Concept of machine (Artificial) intelligence.
CO-3: AI techniques to search a solution in a huge solution space efficiently.
CO-4: Logic programming using some high level language such as Prolog with emphasis on how
it is different from procedural programming.
CO-5: Explain the difference between plan space and state space. Describe and implement several
of the major approaches to classical Learning and planning.
CO-6: For constraint satisfaction problems, implement backtracking search with conflict directed
back jumping, arc consistency, and the Minimum Remaining Values and Least
Constraining Value heuristics. Implement local search with the min- conflicts heuristic.
7. Questions :
Test 1
Q1 - Basics of Heuristic Algorithms
Q2 - Different Algorithms for Searching
Q3 - Types of logic representation
Test 2
Q4 – Truth Maintenance System
Q5 – Logic Programming
Q6 – Learning and Planning
Questions CO’s
1 1
2 2
3 3
4 3
5 3
6 4
7 1, 2, 3
8 1, 2, 3
9 5, 6
10 5, 6 & 11
11 5, 6, 8,9 & 10
CO’s PO’s
1 1, 2
2 2, 6
3 3
4 2, 3
5 2, 3, 4, 6
6 2, 3, 4, 7
11. Evaluation Scheme:
Objectives:
To understand, learn and implement Intelligent algorithms
To understand, learn and implement A* Algorithm
To understand concept of Neural Networks
To understand concepts of Natural Language Processing
Wesley, 1990.
2. Tim Jones “Artificial Intelligence Application Programming” M. Dreamtech Publication
Course Outcomes
CO-1: Introduction to problems which are hard to solve using conventional programming.
CO’s PO’s
1 1, 2
2 2, 6
3 3
4 2, 3
5 2, 3, 4, 6
6 2, 3, 4, 7,8,9,11 and 12
Evaluation Scheme:
Page 1 of 3
2. Text Book:
• Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”, 5th Edition ,
McGraw Hill International Edition.
3. Reference Books:
• Rob Coronel, Database systems: “Design implementation and management”, 4th Edition,
Thomson Learning Press.
• J. D. Ullman, Principles of Database Systems, Galgotia Publication, 2nd Edition, 1999.
• R. Elmasri, and S. Navathe, Fundamentals of Database Systems, Benjamin Cummings,Pearson, 6th
Edition, 2010.
• http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-830-database-systems- fall-
2010/lecture-notes/
• http://www.cs.princeton.edu/courses/archive/spr96/cs425/
• http://www.cs.duke.edu/courses/fall10/cps216/
• https://wiki.cites.illinois.edu/wiki/display/DAIS/Home
• http://codex.cs.yale.edu/avi/db-book/db6/practice-exer-dir/
• http://www.comp.nus.edu.sg/~cs5225/
6. Questions :
Test- 1 examination:
1. Fundamental concepts of parallel databases.
2. Analyse and understand differnt types of parallelism for different types of database tasks.
Test- 2 examination:
3 Di scribing and analyzing different distributed systems.
4 Design highly available distributed database for different types of network.
5 Identify and discuss types of failures in distributed database in types of network.
Page 2 of 3
7. Program Outcomes relevant to the Outcomes:
(1) Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and
programming technologies and fundamentals of Computer Science and IT.
(2) Graduates will have knowledge of the best practices in software development in industry.
(3) Graduates will be able to demonstrate the ability to design creative solutions to real life problems
faced by the industry.
(4) Graduates will be able to communicate technical topics in written and verbal forms.
(5) Graduates will demonstrate an understanding of the problems most relevant in time to computer
engginering.
(6) 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.puter Engineering and IT
industry.
Questions CO’s
1 1
2 1
3 2
4 3
5 3
6 4
7 5
8 6
CO’s PO’s
1 1
2 1,5
3 1,3,6
4 1,2,5
5 1,3,5
6 6
(V.M.Khadse)
Course in charge
Head, Comp IT Dept
Page 3 of 3
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course Code: Course: Introduction to Business Analytics
Page 1 of 5
2. Text Book:
• James R. Evans, “Business Analytics: Methods, Models, and Decisions”, Pearson 2012
3. Reference Books:
3. Evan Stubbs, “Delivering Business Analytics: Practical Guidelines for Best Practice”,
Wiley 2013
2. BA Courses:
http://business.uc.edu/departments/obais/Courses/Business_Analytics_Courses.ht
ml
3. http://galitshmueli.com/content/business-analytics-using-data-mining
4. http://www.dbta.com/Editorial/Trends-and-Applications/What-is-Data-Analysis-
and-Data-Mining-73503.aspx
5. https://sites.google.com/site/badmcourse/home/syllabus
1. List down various applications of Analytics and give a case study from any domain in a
group of two students.
2. Find out a problem definition and give a solution using any of the analytics technique
which is relevant to that problem.
Page 2 of 5
Page 3 of 5
6. Learning Outcomes of the Course:
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:
Test- 2 examination:
Page 4 of 5
8. Program Outcomes relevant to the Outcomes:
Full listing on URL http://www.coep.org.in/index.php?pid=824
(3) Graduates will have knowledge of the best practices in software development
in industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(6) Graduates will be able to communicate technical topics in written and verbal forms.
(7) Graduates will demonstrate an understanding of the problems most relevant in time
to Computer Engineering and IT industry.
Questions CO’s
1 1,3
2 3
3 4
4 3, 6
5 7
6
…
CO’s PO’s
1 1
2 1,7
3 4
4 7
5 4,5
6 6
7 3
Page 5 of 5
Department of Computer Engineering and Information Technology
Course Plan
Course Code: CT-DE4-14006 Course: High Performance Computing
Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: Quizzes- 40 Marks
ESE-60 Marks
Class: B Tech (Computer & IT) Semester: VII Academic Year: 2014-15
parallel algorithms
Message passing libraries for parallel programming interface, Parallel 01
01
Cluster: COW’s and NOW’s (Cluster and Network of Workstations), Different ways of
building a cluster
Total 36
Text Book:
1. John L Hennessy, David A Patterson, “Computer Architecture: A Quantitative Approach”, Fifth Edition, Morgan
Kaufmann, 2011
2. Kai Hwang, Naresh Jotwani, “Advanced Computer Architecture”, Second Edition, Tata McGrawhill Edition,
2010
Reference Books:
1. Kai Hwang, Faye A. Briggs, “Computer Architecture and Parallel Processing” McGrawhill International
Edition, 1985
2. V. Rajaraman, L Sivaram Murthy, “Parallel Computers”, PHI, 2004
3. Michael J Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw-Hill Edition, 2011
4. Dezaso Sima, Terence Fountain, Peter Kascuk, “Advanced Computer Architectures: A Design Space
Approach”, Pearson Education, 2009
5. Peter S Pacheco, “An Introduction to Parallel Programming”, Morgan Kaufmann, 2011
http://vr.sdu.edu.cn/~gb/Architecture/courseware/Computer%20Architecture,%20Fifth%20Edition-%20A
%20Quantitative%20Approach.pdf
http://prdrklaina.weebly.com/uploads/5/7/7/3/5773421/an_introduction_to_parallel_programming_-
_peter_s._pacheco.pdf
List of Assignments:
Course Outcomes:
4. Use of the programming environment like pthreads, openMp and MPI, CUDA
Questions:
Test 1
Q1 – Basics, Performance Laws, Types of Parallelism, Flynn's Classification
Q2 - Pipeline Techniques
Q3 – Problems on Pipeline Techniques
Test 2
Q4 – SIMD, Vector Operations
Q5 – Interconnection Networks, GPU Case Study
Q6 – Multiprocessors and their study
1.
Mapping of Questions to CO’s:
Questions CO’s
1 1, 5
2 2
3 2
4 2
5 2, 4
6 2, 4
7 1, 2, 5
8 1, 2, 5
9 3, 5, 6
10 3, 5, 6
11 3, 5, 6
CO’s PO’s
1 1, 2
2 2, 6
3 3, 6
4 2, 3
5 4, 5, 7
6 3, 5, 8
Evaluation Procedure
Class: B Tech (Computer & IT) Semester: VII Academic Year: 2014-15
The list of following assignments shall be executed as per the discussions in theory classes.
Text Books:
1. John L Hennessy, David A Patterson, “Computer Architecture: A Quantitative Approach”, Fifth Edition, Morgan
Kaufmann, 2011
2. Kai Hwang, Naresh Jotwani, “Advanced Computer Architecture”, Second Edition, Tata McGrawhill Edition,
2010
Reference Books:
1. Kai Hwang, Faye A. Briggs, “Computer Architecture and Parallel Processing” McGrawhill International Edition,
1985
2. V. Rajaraman, L Sivaram Murthy, “Parallel Computers”, PHI, 2004
3. Michael J Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw-Hill Edition, 2011
4. Dezaso Sima, Terence Fountain, Peter Kascuk, “Advanced Computer Architectures: A Design Space
Approach”, Pearson Education, 2009
5. Peter S Pacheco, “An Introduction to Parallel Programming”, Morgan Kaufmann, 2011
• http://vr.sdu.edu.cn/~gb/Architecture/courseware/Computer%20Architecture,%20Fifth%20Edition-%20A
%20Quantitative%20Approach.pdf
• http://prdrklaina.weebly.com/uploads/5/7/7/3/5773421/an_introduction_to_parallel_programming_-
_peter_s._pacheco.pdf
List of Assignments:
Course Outcomes:
As per stated in section Teaching Learning Interaction continuous evaluation will be performed and external
examiner will ask questions in Oral exam.
Questions CO’s
1 1
2 1, 2, 4
3 2
4 2
5 2
6 3
7 3
8 2
9 2
10 2
CO’s PO’s
1 1, 2
2 1, 4, 5, 6
3 3, 7
4 3, 5, 7, 8
Evaluation Procedure
The list of following assignments shall be executed as per the discussion in theory
classes.
Text Books :
• C.Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks Architectures and
protocols, 2nd edition, Pearson Education. 2007.
Reference Books :
Useful URLs:
http://www.eecs.berkeley.edu/~dtse/book.html
http://www.nari.ee.ethz.ch/commth/teaching/wirelessIT/#reading
http://www.site.uottawa.ca/~ivan/adhoc.html
http://www.cs.tut.fi/kurssit/TLT-2616
https://inst.eecs.berkeley.edu/~ee122/sp06/syllabus.htm
Page 1 of 2
2. Learning Outcomes of the Course:
CO’s PO’s
1 1
2 3,4
3 6
4 6,7
5. Evaluation Scheme:
Page 2 of 2
College of Engineering, Pune - 05
Department of Computer Engineering and Information Technology
DE : MOBILE AND AD-HOC NETWORKS
Teaching Scheme: Lectures- 3 Hrs/Week Examination Scheme: 100 marks:
Continuous evaluation-
Assignment/Quizzes – 40 marks
End Sem Exam - 60 marks
Teaching plan
• C.Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks Architectures and
protocols, 2nd edition, Pearson Education. 2007
Reference Books
Course outcomes
1. Have an understanding of the principles of mobile ad hoc networks and what distinguishes
them from infrastructure-based networks.
2. Have an understanding of the principles and characteristics of wireless sensor networks
3. Be able to understand how routing protocols function and their implications on data
transmission delay and bandwidth consumption
4. Be familiar with the mechanisms for implementing security, transport layer and energy
efficiency in MANETs
1. Set up an infrastructure wireless network consisting of multiple nodes and an access point.
observing IEEE 802.11 traffic
2. Configure an ad hoc network, measure the throughput
3. Measuring delay, throughput, connectivity, and overhead in MANET routing protocols using a
network simulator
4. Configure Bluetooth piconets and analyse the interference with 802.11
5. Configure the Mobile IP
Questions:
Test 1
Q1 – Basics of Wireless Communication, Multiple Access Techniques.
Q2 - Wireless LANs and PANs, Bluetooth
Q3 – The Cellular Concept and Cellular Architecture
Test 2
Q4 – Cellular System Generations, Wireless Internet
Q5 – WAP, Optimizing Web Over Wireless
Q6 – Introduction to Ad-Hoc Networks and Medium Access Protocols
(1) Graduates will demonstrate basic knowledge in fundamentals of programming, algorithms and
programming technologies and fundamentals of Computer Science.
(3) Graduates will have knowledge of the best practices in software development in industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life problems
faced by the industry.
(6) Graduates will be able to communicate technical topics in written and verbal forms.
(7) Graduates will demonstrate an understanding of the problems most relevant in time to Computer
Engineering and IT industry.
Questions CO’s
1 1
2 1
3 1,2
4 2
5 2
6 2,3
7 1,2,3
8 1,2,3
9 3
10 3,4
11 3,4
CO’s PO’s
1 1
2 3,4
3 6
4 6,7
Evaluation Procedure
Text Books:
1. Richardo Baeza –Yates, Berthier Ribiero-Neto “Modern Information Retrieval “
Addison – Wesley. 2nd Edition, 2011
2. C J Van Rijsbergen “Information Retrieval”, An online book by C J Van
Rijsbergen, University of Glasgow, 2004
Reference Books:
1. Gerard Salton – Michael J. McGill “ Introduction To Modern Information
Retrieval” McGraw Hill. 3rd edition
2. Christopher D. Manning – “Introduction to Information Retrieval” Cambridge Univ Press
On-line Course Resources:
http://nlp.stanford.edu/IR-book/
http://www.dcs.gla.ac.uk/Keith/Preface.html
http://www.ccs.neu.edu/course/cs6200f12/syllabus.html
http://www.is.informatik.uni-duisburg.de/courses/ir_ss10/index.html.en
http://apl.jhu.edu/~paulmac/ir.html
http://mitpress.mit.edu/books/information-retrieval
http://ir.exp.sis.pitt.edu/res2/resources.php
Test 1
Q1 – Understanding Basic Models of IR, ranked retrieval, text-similarity metrics.
Q2 - Describe Document is represented inside a computer, Automatic classification
methods in general
Test 2
Q4 – classification methods in IR, File Structures in IR
Q5 – Analysis of Search strategies in IR, Use of feedback
Q6 – Understanding collections structured in different ways
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
CO’s PO’s
1 1
2 1,3
3 4,7
4 9,10
5 11
Evaluation Scheme:
List of Assignments:
1. To implement Conflation Algorithm.
2. Assignments based on classification
3. To implement a program for graphic theoretic method for Clustering.
4. To implement a program Retrieval of documents using Cluster based search strategies.
5. Assignments based on Multimedia IR.
6. Assignments based on Digital Libraries.
2. Text Book:
3. Reference Books:
• Richard Brealey, Principles of Corporate Finance, McGraw Hill Education India Pvt
Ltd, ISBN-13 9781259004650
1. http://www.cs.sunysb.edu/~skiena/691/
2 http://www-2.rotman.utoronto.ca/~hull/ofodslides/
3 https://www.cs.purdue.edu/homes/fmoranda/pubs/ecoop12.pdf
Page 1 of 2
5. List of Assignments/ home works /problems:
(3) Graduates will have knowledge of the best practices in software development in industry.
(4) Graduates will be able to demonstrate the ability to design creative solutions to real life
problems faced by the industry.
(6) Graduates will be able to communicate technical topics in written and verbal forms.
(7) Graduates will demonstrate an understanding of the problems most relevant in time
to Computer Engineering and IT industry.
Questions CO’s
1 1,3
2 3
3 4
4 3, 6
5 7
CO’s PO’s
1 1
2 1,7
3 4
4 7
5 4,5
6 6
7 3
9. Evaluation Scheme:
Page 1 of 4
2. Text Book:
3. Reference Books:
Page 2 of 4
6. Learning Outcomes of the Course:
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:
Test- 2 examination:
Page 3 of 4
8. Program Outcomes relevant to the Outcomes:
Full listing on URL http://www.coep.org.in/index.php?pid=824
1) Graduates will demonstrate basic knowledge in fundamentals of programming,
algorithms and programming technologies and fundamentals of Computer Science.
2) Graduates will be able to demonstrate the ability to design creative solutions to real
life problems faced by the industry.
3) Graduates will demonstrate capability to work in teams and in professional work
environments
4) Graduates will demonstrate an understanding of the problems most relevant in time
to Computer Engineering.
5) 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.
6) Graduates will demonstrate good performance at the competitive examinations like
GATE, GRE, CAT for higher education.
7) Graduates will be able to develop the capability for self-learning.
Questions CO’s
1 1
2 2
3 2, 3
4 2, 3
5 2, 3
6 2, 3, 4
CO’s PO’s
1 1
2 4
3 1, 2, 3, 5
4 6, 7
Page 4 of 4
College of Engineering, Pune www.coep.org.in
Department of Computer Engineering and Information Technology
Course Plan
Course Code: PCC Course: Graph Theory and Applications Lab
Teaching Scheme: Lab session - 2 hours/week Examination Scheme: Term work - 50 marks
Practical - 50 Marks
Academic Year: 2014-15 Class: Final Year B Tech Semester: VII
Sr Assignment
No
1 Decide whether a given degree sequence is graphical (that is, it corresponds to a simple graph)
2 Find out if the given graph is connected and also decide the number of connected components in
the graph.
3 Find all directed circuits in a digraph.
4 Given a connected even graph G and a specified vertex u of G, find an Euler tour of G starting
(and ending) at u using BFS (Breadth First Search) method
5 Find either a bipartition or an odd cycle in a given graph.
6 Find a maximal matching in a bipartite graph.
7 Color a graph using greedy method so that at most (Δ+1) colors are used (Δ represents maximum
degree of the graph).
8 Implement Ford-Fulkerson algorithm to compute maximum flow in a flow network
Page 1 of 2
4. Mapping of CO’s to PO’s:
CO’s PO’s
1 1, 2, 3,4, 5, 6
2 1, 2, 3,4, 5, 6
3 1, 2, 3,4, 5, 6
5. Evaluation Scheme:
Continuous Evaluation and Practical Examination at the end of term
Page 2 of 2