Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

Savitribai Phule Pune University

Third Year of Computer Engineering (2019 Course) Home

310241: Database Management Systems

Teaching Scheme: Credit: 03 Examination Scheme:
Theory: 03 Hours/Week Mid-Sem (TH) : 30 Marks
End-Sem (TH): 70 Marks
Prerequisites Courses: Discrete Mathematics (210241), Data Structures and Algorithms
(210252)
Companion Course: Database Management Systems Laboratory (310246)
Course Objectives:
● To understand the fundamental concepts of Database Management Systems
● To acquire the knowledge of database query languages and transaction processing
● To understand systematic database design approaches
● To acquire the skills to use a powerful, flexible, and scalable general-purpose databases
to handle Big Data
● To be familiar with advances in databases and applications

Course Outcomes:
On completion of the course, learners should be able to
CO1: Analyze and design Database Management System using ER model
CO2: Implement database queries using database languages
CO3: Normalize the database design using normal forms
CO4: Apply Transaction Management concepts in real-time situations
CO5: Use NoSQL databases for processing unstructured data
CO6: Differentiate between Complex Data Types and analyze the use of appropriate data
types
Course Contents
Unit I Introduction to Database Management 06 Hours
Systems and ER Model
Introduction, Purpose of Database Systems, Database-System Applications, View of Data,
Database Languages, Database System Structure, Data Models. Database Design and ER
Model: Entity, Attributes, Relationships, Constraints, Keys, Design Process, Entity-
Relationship Model, ER Diagram, Design Issues, Extended E-R Features, converting ER and
EER diagram into tables.
#Exemplar/Case Analyze and design database using ER Model for any real-time
Studies application and convert the same into tables.
*Mapping of Course
CO1
Outcomes for Unit I
Unit II SQL and PL/SQL 07 Hours
SQL: Characteristics and Advantages, SQL Data Types and Literals, DDL, DML, DCL, TCL,
SQL Operators. Tables: Creating, Modifying, Deleting, Updating.SQL DML Queries:
SELECT Query and clauses, Index and Sequence in SQL. Views: Creating, Dropping,
Updating using Indexes, Set Operations, Predicates and Joins, Set membership, Tuple
Variables, Set comparison, Ordering of Tuples, Aggregate Functions, SQL Functions, Nested
Queries.PL/SQL: Concept of Stored Procedures and Functions, Cursors, Triggers, Assertions,
Roles and Privileges.
#Exemplar/Case
Implementation of Unit 1 case study using SQL and PL/SQL.
Studies

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #10/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

*Mapping of Course
CO1, CO2
Outcomes for Unit II
Unit III Relational Database Design 06 Hours
Relational Model: Basic concepts, Attributes and Domains, CODD's Rules. Relational
Integrity: Domain, Referential Integrities, Enterprise Constraints. Database Design: Features
of Good Relational Designs, Normalization, Atomic Domains and First Normal Form,
Decomposition using Functional Dependencies, Algorithms for Decomposition, 2NF, 3NF,
BCNF.
#Exemplar/Case
Studies Normalize relational database designed in Unit I.

*Mapping of Course
Outcomes for Unit CO1, CO3
III
Unit IV Database Transaction Management 07 Hours
Introduction to Database Transaction, Transaction states, ACID properties, Concept of
Schedule, Serial Schedule. Serializability: Conflict and View, Cascaded Aborts, Recoverable
and Non-recoverable Schedules. Concurrency Control: Lock-based, Time-stamp based
Deadlock handling. Recovery methods: Shadow-Paging and Log-Based Recovery,
Checkpoints. Log-Based Recovery: Deferred Database Modifications and Immediate Database
Modifications.
#Exemplar/Case Studies
Study of Transaction Management in Postgre SQL

*Mapping of Course
CO3, CO4
Outcomes for Unit IV
Unit V NoSQL Databases 07 Hours

Introduction to Distributed Database System, Advantages, Disadvantages, CAP Theorem.

Types of Data: Structured, Unstructured Data and Semi-Structured Data.
NoSQL Database: Introduction, Need, Features. Types of NoSQL Databases: Key-value
store, document store, graph, wide column stores, BASE Properties, Data Consistency model,
ACID Vs BASE, Comparative study of RDBMS and NoSQL. MongoDB (with syntax and
usage): CRUD Operations, Indexing, Aggregation, MapReduce, Replication, Sharding.
#Exemplar/Case Studies Use of NoSQL databases for processing unstructured data from
social media.
*Mapping of Course
CO5, CO6
Outcomes for Unit V
Unit VI Advances in Databases 07 Hours

Emerging Databases: Active and Deductive Databases, Main Memory Databases, Semantic
Databases.
Complex Data Types:
Semi-Structured Data, Features of Semi-Structured Data Models. Nested Data Types: JSON,
XML. Object Orientation: Object-Relational Database System, Table Inheritance, Object-
Relational Mapping. Spatial Data: Geographic Data, Geometric Data.
#Exemplar/Case Studies
Applications of advanced databases in real time environment.

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #11/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
*Mapping of Course
CO5, CO6
Outcomes for Unit VI
Learning Resources
Text Books :
1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", McGraw Hill
Publishers, ISBN 0-07-120413-X, 6th edition
2. Connally T, Begg C., "Database Systems", Pearson Education, ISBN 81-7808-861-4
3. Pramod J. Sadalage and Martin Fowler, “NoSQL Distilled”, Addison Wesley, ISBN-
10: 0321826620, ISBN-13: 978-0321826626
Reference Books :
1. C J Date, “An Introduction to Database Systems”, Addison-Wesley, ISBN: 0201144719
2. S.K.Singh, “Database Systems: Concepts, Design and Application”, Pearson Education,
ISBN 978-81-317-6092-5
3. Kristina Chodorow, Michael Dierolf, “MongoDB: The Definitive Guide”, O‘Reilly
Publications, ISBN: 978-1-449-34468-9
4. Adam Fowler, “NoSQL For Dummies”, John Wiley & Sons, ISBN-1118905628
5. Kevin Roebuck, “Storing and Managing Big Data - NoSQL, HADOOP and More”,
Emereopty Limited, ISBN: 1743045743, 9781743045749
6. Joy A. Kreibich, “Using SQLite”, O'REILLY, ISBN: 13:978-93-5110-934-1
7. Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB Publications
ISBN: 9788176569644, 9788176569644
8. Seema Acharya, “Demystifying NoSQL”, Wiley Publications, ISBN: 9788126579969
e-Books :
1. SQL and Relational Theory
a. (How to Write Accurate SQL code), C.J. Date, O’REILLY Publication
2. SQL A Beginner’s Guide, Andy Oppel, Robert Sheldon, McGraw Hill Publication
MOOCs Courses Links:
• http://www.nptelvideos.com/lecture.php?id=6518
@ The CO-PO Mapping Matrix
CO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
PO 10 11 12
CO1 2 2 3 1 - - - 1 - - - 3
CO2 - 2 3 - - 2 - - - - - 3
CO3 - 2 3 - 1 - - - - - - 3
CO4 2 2 2 2 - - - - - 1 - 3
CO5 - 2 3 - - - - - - - 1 3
CO6 2 2 - - - - 1 - 2 - 1 1

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #12/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

Savitribai Phule Pune University

Third Year of Computer Engineering (2019 Course) Home

310242: Theory of Computation

Teaching Scheme: Credit: 03
Examination Scheme:
Theory: 03 Hours/Week Mid-Sem (TH) : 30 Marks
End-Sem (TH): 70 Marks
Prerequisites Courses: Discrete Mathematics (210241)
Companion Course: --
Course Objectives:
● To introduce the students to basics of Theory of Computation
● To study abstract computing models to provide a formal connection between algorithmic
problem solving and the theory of languages
● To understand Grammar, Pushdown Automata and Turing Machine for language
processing and algorithm design
● To learn about the theory of computability and complexity for algorithm design
Course Outcomes:
After completion of the course, learners should be able to
CO1: Understand formal language, translation logic, essentials of translation, alphabets, language
representation and apply it to design Finite Automata and its variants
CO2: Construct regular expression to present regular language and understand pumping lemma for
RE
CO3: Design Context Free Grammars and learn to simplify the grammar
CO4: Construct Pushdown Automaton model for the Context Free Language
CO5: Devise Turing Machine for the different requirements outlined by theoretical computer
science
CO6: Analyze different classes of problems, and study concepts of NP completeness

Course Contents
Unit I Formal Language Theory and Finite 07 Hours
Automata
Finite Automata (FA): An informal picture of FA, Finite State Machine (FSM), Language
accepted by FA, Definition of Regular Language.
FA without output: Deterministic and Nondeterministic FA (DFA and NFA), epsilon- NFA and
inter-conversion. Minimization of DFAs.
FA with output: Moore and Mealy machines -Definition, models, inter-conversion.
#Exemplar/Case
FSM for vending machine, spell checker
Studies
*Mapping of Course
CO1
Outcomes for Unit I
Unit II Regular Expressions (RE) 07 Hours
Introduction, Operators of RE, Precedence of operators, Algebraic laws for RE, Language to
Regular Expressions, Equivalence of two REs. Conversions: RE to NFA, DFA, DFA to RE using
Arden’s theorem, Pumping Lemma for Regular languages, Closure and Decision properties of
Regular languages. Myhill-Nerode theorem.
#Exemplar/Case
RE in text search and replace
Studies

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #13/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

*Mapping of Course
CO2
Outcomes for Unit II
Unit III Context Free Grammar (CFG) and 07 Hours
Context Free Language(CFL)
Basic Elements of Grammar, Formal Definition of Context Free Grammar, Sentential form,
Derivation and Derivation Tree/ Parse Tree, Context Free Language (CFL), Ambiguous Grammar,
writing grammar for language. Simplification of CFG: Eliminating Є-productions, unit
productions, useless production, and useless symbols. Normal Forms: Chomsky Normal Form,
Greibach Normal Form, Pumping Lemma for CFG, Closure properties of CFL, Decision properties
of CFL, Chomsky Hierarchy, Cock-Younger-Kasami Algorithm.
#Exemplar/Case
Parser, CFG for Palindromes, Parenthesis Match
Studies
*Mapping of Course
CO3
Outcomes for Unit III
Unit IV Pushdown Automata (PDA) 07 Hours
Introduction, Formal definition of PDA, Equivalence of Acceptance by Final State and Empty
stack, Non-deterministic PDA (NPDA), PDA and Context Free Language, Equivalence of PDA
and CFG, PDA vs CFLs. Deterministic CFLs.
#Exemplar/Case Parsing and PDA: Top-Down Parsing, Bottom-up Parsing simulation
Studies showing use of PDA
*Mapping of Course
CO4
Outcomes for Unit IV
Unit V Turing Machines (TM) 07 Hours
Turing Machine Model, Formal definition of Turing Machines, Language Acceptability by Turing
Machines, Design of TM, Description of TM, Techniques for TM Construction, Computing
function with Turing Machine, Variants of Turing Machines, Halting Problem of TM, Halting vs
Looping, A Turing-unrecognizable language, Reducibility, Recursion Theorem. The Model of
Linear Bounded Automata.
#Exemplar/Case
Algorithms using Turing Machine
Studies
*Mapping of Course
CO5
Outcomes for Unit V
Unit VI Computability and Complexity Theory 07 Hours
Computability Theory: Decidable Problems and Un-decidable Problems, Church-Turing Thesis.
Reducibility: Undecidable Problems that is recursively enumerable, A Simple Un-decidable
problem.
Complexity Classes: Time and Space Measures, The Class P, Examples of problems in P, The
Class NP, Examples of problems in NP, P Problem Versus NP Problem, NP-completeness and NP-
hard Problems.
#Exemplar/Case
Traveling salesman problem, Post Correspondence Problem (PCP)
Studies
*Mapping of Course CO6
Outcomes for Unit VI
Learning Resources

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #14/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
Text Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman, “Introduction to Automata Theory
Languagesand Computation”, Addison-Wesley,ISBN 0-201-44124-1
2. Daniel Cohen, “Introduction to Computer Theory”, Wiley & Sons, ISBN 97881265133454

Reference Books:
1. Sanjeev Arora and Boaz Barak, “Computational Complexity: A Modern Approach”,
Cambridge University Press, ISBN: 0521424267 97805214242643
2. John Martin, “Introduction to Languages and The Theory of Computation”, 2nd Edition,
McGrawHill Education, ISBN-13: 978-1-25-900558-9, ISBN-10: 1-25-900558-5
3. J.Carroll & D Long, “Theory of Finite Automata”, Prentice Hall, ISBN 0-13-913708-45
4. Kavi Mahesh, “Theory of Computation: A Problem-Solving Approach”, Wiley India,
ISBN1081265331106
5. Michael Sipser, “Introduction to the Theory of Computation”, Cengage Learning, ISBN-
13: 97811331878137
6. Vivek Kulkarni, “Theory of Computation”, Oxford University Press, ISBN 0-19-808458
e-Books :
• https://cglab.ca/~michiel/TheoryOfComputation/TheoryOfComputation.pdf
• https://www.cs.virginia.edu/~robins/Sipser_2006_Second_Edition_Problems.pdf
• http://ce.sharif.edu/courses/94-95/1/ce414-
2/resources/root/Text%20Books/Automata/John%20E.%20Hopcroft,%20Rajeev%20Motw
ani,%20Jeffrey%20D.%20Ullman-
Introduction%20to%20Automata%20Theory,%20Languages,%20and%20Computations-
Prentice%20Hall%20(2006).pdf
MOOCs Courses Links:
• https://nptel.ac.in/courses/106/104/106104148/
• https://nptel.ac.in/courses/106/104/106104028/

@ The CO-PO Mapping Matrix

CO/ PO PO PO PO PO PO PO
PO1 PO2 PO3 PO4 PO5
PO 6 7 8 9 10 11 12
CO1 3 3 2 2 1 - - - - - - 2
CO2 3 3 2 2 1 - - - - - - 1
CO3 3 3 2 2 1 - - - - - - 1
CO4 3 3 2 2 1 - - - - - - 1
CO5 3 3 3 2 1 - - - - - - 2
CO6 3 3 3 3 1 - - - - - - 1

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #15/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

Savitribai Phule Pune University

Third Year of Computer Engineering (2019 Course) Home

310243: Systems Programming and Operating System

Teaching Scheme: Credit: 03 Examination Scheme:
Theory: 03 Mid-Sem (TH) : 30 Marks
Hours/Week End-Sem (TH): 70 Marks
Prerequisites Courses: Programming and Problem Solving (110005), Data Structures and
Algorithms (210252), Principles of Programming Languages (210255), Microprocessor (210254)
Companion Course: Laboratory Practice I (310248)
Course Objectives:
● To get acquainted with the basics of System Programming
● To acquire knowledge of data structures used in the design of System Software
● To be familiar with the format of object modules, the functions of linking, relocation, and
loading
● To comprehend the structures and functions of Operating Systems and process
management.
● To deal with concurrency and deadlock in the Operating System
● To learn and understand memory management of Operating System
Course Outcomes:
On completion of the course, learners should be able to
CO1: Analyze and synthesize basic System Software and its functionality.
CO2: Identify suitable data structures and Design & Implement various System Software
CO3: Compare different loading schemes and analyze the performance of linker and loader
CO4: Implement and Analyze the performance of process scheduling algorithms
CO5: Identify the mechanism to deal with deadlock and concurrency issues
CO6: Demonstrate memory organization and memory management policies
Course Contents
Unit I Introduction 08 Hours
Introduction to Systems Programming, Need of Systems Programming, Software Hierarchy,
Types of software: system software and application software, Machine structure.
Evolution of components of Systems Programming: Text Editors, Assembler, Macros,
Compiler, Interpreter, Loader, Linker, Debugger, Device Drivers, Operating System. Elements of
Assembly Language Programming: Assembly Language statements, Benefits of Assembly
Language, A simple Assembly scheme, Pass Structure of Assembler.
Design of two pass Assembler: Processing of declaration statements, Assembler Directives and
imperative statements, Advanced Assembler Directives, Intermediate code forms, Pass I and Pass
II of two pass Assembler.
#Exemplar/Case
Study of Debugging tools like GDB
Studies
*Mapping of Course
CO1, CO2, CO3
Outcomes for Unit I
Unit II Macro Processor and Compilers 06 Hours
Introduction, Features of a Macro facility: Macro instruction arguments, Conditional Macro
expansion, Macro calls within Macros, Macro instructions, Defining Macro, Design of two pass
Macro processor, Concept of single pass Macro processor.
Introduction to Compilers: Phases of Compiler with one example, Comparison of Compiler and
Interpreter.

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #16/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
#Exemplar/Case
GNU M4 Macro Processor
Studies
*Mapping of Course
CO1, CO2, CO3
Outcomes for Unit II
Unit III Linkers and Loaders 07 Hours
Introduction, Loader schemes: Compile and Go, General Loader Scheme, Absolute Loaders,
Subroutine Linkages, Relocating Loaders, Direct linking Loaders, Overlay structure, Design of
an Absolute Loader, Design of Direct linking Loader, Self-relocating programs, Static and
Dynamic linking.
#Exemplar/Case
Study the concepts of Class loading in Java.
Studies
*Mapping of Course
CO1, CO2, CO3
Outcomes for Unit III
Unit IV Operating System (OS) 07 Hours
Introduction: Evolution of OS, Operating System Services, Functions of Operating System.
Process Management: Process, Process States: 5 and 7 state model, Process control block,
Threads, Thread lifecycle, Multithreading Model, Process control system calls.
Process Scheduling: Uni-processor Scheduling, Scheduling: Preemptive, Non-preemptive, Long-
term, Medium-term, Short term scheduling. Scheduling Algorithms: FCFS, SJF, RR, and
Priority.
#Exemplar/Case Process management in Linux /Windows/Android
Studies Readers-Writers problem
*Mapping of Course
CO4
Outcomes for Unit IV
Unit V Synchronization and Concurrency Control 07 Hours
Concurrency: Principle and issues with Concurrency, Mutual Exclusion, Hardware approach,
Software approach, Semaphore, Mutex and monitor, Reader writer problem, Producer Consumer
problem, Dining Philosopher problem.
Deadlocks: Principle of Deadlock, Deadlock prevention, Deadlock avoidance, Deadlock
detection, Deadlock recovery.
#Exemplar/Case
Concurrency Mechanism: Unix/Linux/Windows.
Studies
*Mapping of Course
CO5
Outcomes for Unit V
Unit VI Memory Management 07 Hours
Introduction: Memory Management concepts, Memory Management requirements.
Memory Partitioning: Fixed Partitioning, Dynamic Partitioning, Buddy Systems Fragmentation,
Paging, Segmentation, Address translation.
Placement Strategies: First Fit, Best Fit, Next Fit and Worst Fit.
Virtual Memory (VM): Concepts, Swapping, VM with Paging, Page Table Structure, Inverted
Page Table, Translation Look aside Buffer, Page Size, VM with Segmentation, VM with
Combined paging and segmentation.
Page Replacement Policies: First In First Out (FIFO), Last Recently Used(LRU), Optimal,
Thrashing.
#Exemplar/Case
Memory management in Linux /Windows/Android
Studies

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #17/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
*Mapping of Course
CO6
Outcomes for Unit VI
Learning Resources
Text Books:
1. John Donovan, “Systems Programming”, McGraw Hill, ISBN 978-0--07-460482-3
2. Dhamdhere D., "Systems Programming and Operating Systems", McGraw Hill, ISBN 0 -
07 - 463579 – 4
th
3. Silberschatz, Galvin, Gagne, "Operating System Principles", 9 Edition, Wiley, ISBN
978- 1-118-06333-0
Reference Books:
1. Leland Beck, “System Software: An Introduction to Systems Programming”, Pearson
2. John R. Levine, Tony Mason, Doug Brown, “Lex & Yacc”, 1st Edition, O’REILLY,
ISBN 81-7366-062-X
3. Alfred V. Aho, Ravi Sethi, Reffrey D. Ullman, “Compilers Principles, Techniques, and
Tools”, Addison Wesley, ISBN 981-235-885-4
e-Books :
● https://www.elsevier.com/books/systems-programming/anthony/978-0-12-800729-7
● https://www.kobo.com/us/en/ebook/linux-system-programming-1
● https://www.ebooks.com/en-us/subjects/computers-operating-systems-ebooks/279/
● https://www.e-booksdirectory.com/details.php?ebook=9907
MOOCs Courses Links:
● https://www.udacity.com/course/introduction-to-operating-systems--ud923
● nptel video lecture link: https://nptel.ac.in/courses/106/105/106105214/
● https://www.edx.org/course/computer-hardware-and-operating-systems
● https://onlinecourses.nptel.ac.in/noc19_cs50/preview
● https://www.udemy.com/course/system-programming/
@ The CO-PO Mapping Matrix
CO/ PO PO
PO1 PO2 PO4 PO6 PO7 PO8 PO9 PO10 PO11 PO12
PO 3 5
CO1 2 2 2 1 - - - - - - - -
CO2 2 2 1 2 - - - - - - - -
CO3 2 2 1 1 - - - - - - - -
CO4 2 1 2 1 - - - - - - - 1
CO5 2 2 1 2 - - - - - - - 1
CO6 2 1 2 1 - - - - - - - 1

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #18/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

Savitribai Phule Pune University

Third Year of Computer Engineering (2019 Course) Home

310244: Computer Networks and Security

Teaching Scheme: Credit: 03 Examination Scheme:
Theory: 03 Mid-Sem (TH) : 30 Marks
Hours/Week End-Sem (TH): 70 Marks
Prerequisites Courses: Discrete Mathematics (210241)
Companion Course: Computer Networks and Security Laboratory (310247)
Course Objectives:
● To understand the fundamental concepts of networking standards, protocols and
technologies
● To learn different techniques for framing, error control, flow control and routing
● To learn different layer protocols in the protocol stacks
● To understand modern network architectures with respect to design and performance
● To learn the fundamental concepts of Network Security
Course Outcomes:
On completion of the course, learners should be able to
CO1: Summarize fundamental concepts of Computer Networks, architectures, protocols and
technologies
CO2: Illustrate the working and functions of data link layer
CO3: Analyze the working of different routing protocols and mechanisms
CO4: Implement client-server applications using sockets
CO5: Illustrate role of application layer with its protocols, client-server architectures
CO6: Comprehend the basics of Network Security
Course Contents
Unit I Introduction To Computer Networks 06 Hours
Definition, Types of Networks: Local area networks (LAN), Metropolitan area networks (MAN),
Wide area networks (WAN), Wireless networks, Networks Software, Protocol, Design issues for
the Network layers. Network Models: The OSI Reference Model, TCP/IP Model, Network
Topologies, Types of Transmission Medium. Network Architectures: Client-Server, Peer To Peer,
Hybrid. Network Devices: Bridge, Switch, Router, Gateway, Access Point. Line Coding
Schemes: Manchester and Differential Manchester Encodings, Frequency Hopping (FHSS) and
Direct Sequence Spread Spectrum (DSSS).
#Exemplar/Case
Study of Campus wide networking.
Studies
*Mapping of Course
CO1
Outcomes for Unit I
Unit II Data Link Layer 08 Hours
Introduction, functions. Design Issues: Services to Network Layer, Framing.ARQ strategies:
Error detection and correction, Parity Bits, Hamming Codes (11/12-bits) and CRC. Flow
Control Protocols: Unrestricted Simplex, Stop and Wait, Sliding Window Protocol.WAN
Connectivity: PPP and HDLC. MAC Sub layer: Multiple Access Protocols: Pure and Slotted
ALOHA, CSMA, WDMA, CSMA/CD, CSMA/CA, Binary Exponential Back-off algorithm,
Introduction to Ethernet IEEE 802.3, IEEE 802.11 a/b/g/n, IEEE 802.15 and IEEE 802.16
Standards.
#Exemplar/Case
Demonstration of DLL protocols on Simulator
Studies

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #19/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

*Mapping of Course
CO2
Outcomes for Unit II
Unit III Network Layer 08 Hours
Introduction: Functions of Network layer. Switching Techniques: Circuit switching, Message
Switching, Packet Switching. IP Protocol: Classes of IP (Network addressing), IPv4,
IPv6,Network Address Translation, Sub-netting, CIDR. Network layer Protocols: ARP, RARP,
ICMP, IGMP. Network Routing and Algorithms: Static Routing, Dynamic Routing, Distance
Vector Routing, Link State Routing, Path Vector. Routing Protocols: RIP, OSPF, BGP, MPLS.
Routing in MANET: AODV, DSR, Mobile IP.
#Exemplar/Case
Demonstration of Routing Protocols on simulator.
Studies
*Mapping of Course
CO3
Outcomes for Unit III
Unit IV Transport Layer 07 Hours
Process to Process Delivery, Services, Socket Programming. Elements of Transport Layer
Protocols: Addressing, Connection establishment, Connection release, Flow control and buffering,
Multiplexing, Congestion Control. Transport Layer Protocols: TCP and UDP, SCTP, RTP,
Congestion control and Quality of Service (QoS), Differentiated services, TCP and UDP for
Wireless networks.
#Exemplar/Case
Demonstration of Transport layer protocols on Simulator.
Studies
*Mapping of Course
CO4
Outcomes for Unit IV
Unit V Application Layer 06 Hours
Introduction, Web and HTTP, Web Caching, DNS, Email: SMTP, MIME,POP3, Webmail, FTP, TELNET,
DHCP, SNMP.
#Exemplar/Case Study of Application Layer protocols using network protocol analyzer.
Studies e.g. Wireshark
*Mapping of Course
CO5
Outcomes for Unit V
Unit VI Security 07 Hours
Introduction, Security services, Need of Security, Key Principles of Security, Threats and
Vulnerabilities, Types of Attacks, ITU-T X.800 Security Architecture for OSI, Security Policy and
mechanisms, Operational Model of Network Security, Symmetric and Asymmetric Key
Cryptography.
Security in Network, Transport and Application: Introduction of IPSec, SSL, HTTPS, S/MIME,
Overview of IDS and Firewalls.
#Exemplar/Case Study of security protocols in Network, Transport and Application Layer
Studies using network protocol analyzer. Wireshark
*Mapping of Course
CO6
Outcomes for Unit VI
Learning Resources
Text Books :
1. Fourauzan B.,"Data Communications and Networking",5thEdition,TataMcGraw-
Hill,Publications, ISBN:0–07 – 058408 – 7
2. Andrew S. Tanenbaum, “Computer Networks”, 5th Edition, Pearson India, 2012.

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #20/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
Reference Books :
1. Kurose, Ross, “Computer Networking a Top Down Approach Featuring the Internet”,
Pearson, ISBN-10: 0132856204
2. L. Peterson and B. Davie, “Computer Networks: A Systems Approach”, 5th Edition,
Morgan-Kaufmann, 2012.
3. Douglas E. Comer & M.S Narayanan, “Computer Network & Internet”, Pearson Education
4. William Stallings, “Cryptography and Network Security: Principles and Practice”, 4th
Edition
5. Pachghare V. K., “Cryptography and Information Security”, 3rd Edition, PHI,
e-Books :
• https://people.cs.clemson.edu/~jmarty/courses/kurose/KuroseCh1-2.pdf
• http://eti2506.elimu.net/Introduction/Books/Data Communications and Networking By
Behrouz A.Forouzan.pdf
• http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf
• https://www.tutorialspoint.com/data_communication_computer_network/data_communicati
on_computer_network_tutorial.pdf

Case Study:
• https://slideplayer.com/slide/6106945
• http://www.worldcolleges.info/sites/default/files/Cisco_-_Ccie_Fundamental_-
Network_Design_And_Case_Studies.PDF
• http://vlabs.iitb.ac.in/vlabs-dev/labs_local/computer-networks/labs/explist.php
MOOCs Courses link:
• nptel.ac.in/courses/106/105/106105183
• nptel.ac.in/courses/106/105/106105080
• nptel.ac.in/courses/106/105/106105081
• nptel.ac.in/courses/106/106/106106091
• nptel.ac.in/courses/106/105/106105031
• https://www.mooc-list.com/tags/computer-networking
• https://www.coursera.org/courses?query=computer%20network
@ The CO-PO Mapping Matrix
CO/
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
PO
CO1 1 - 1 2 2 1 - - - - 1 1
CO2 1 1 1 1 1 - 1 - - 1 - -
CO3 3 1 2 1 2 - - - - - - 1
CO4 1 2 1 2 2 - - - 1 - 1 1
CO5 1 3 - - 1 - 1 1 - - - -
CO6 1 - 2 1 - 1 - - - - - 1

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #21/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University

Savitribai Phule Pune University

Third Year of Computer Engineering (2019 Course) Home
Elective I
310245(B): Human Computer Interface
Teaching Scheme: Credit: 03 Examination Scheme:
Theory: 03 Mid-Sem (TH) : 30 Marks
Hours/Week End-Sem (TH): 70 Marks
Prerequisites Courses: Computer Graphics (210244), Software Engineering (210253)
Companion Course: Laboratory Practice I (310248)
Course Objectives:
● To understand the importance of HCI design process in software development
● To learn fundamental aspects of designing and implementing user interfaces
● To study HCI with technical, cognitive and functional perspectives
● To acquire knowledge about variety of effective human-computer-interactions
● To co-evaluate the technology with respect to adapting changing user requirements in
interacting with computer
Course Outcomes:
On completion of the course, learners should be able to
CO1: Design effective Human-Computer-Interfaces for all kinds of users
CO2: Apply and analyze the user-interface with respect to golden rules of interface
CO3: Analyze and evaluate the effectiveness of a user-interface design
CO4: Implement the interactive designs for feasible data search and retrieval
CO5: Analyze the scope of HCI in various paradigms like ubiquitous computing, virtual
reality ,multi-media, World wide web related environments
CO6: Analyze and identify user models, user support, and stakeholder requirements of HCI
systems
Course Contents
Unit I Introduction and Foundation of HCI 07 Hours
Foundation: Human Memory. Thinking: Reasoning and Problem Solving, Emotion, Individual
Difference, Psychology and design of Interactive systems, The Computer-Text Entry Device,
Positioning, Pointing, Display devices, Devices for virtual reality and 3D Interaction, The
Interactions-Models of Interaction, Frameworks and HCI, Ergonomics, Interaction styles,
Ergonomics, Elements of WIMP Interface, Interactivity, Measurable Human Factors, The context
of Interaction. Importance of User Interface: Defining user Interface, Brief History of Human-
Computer Interface, Good and Poor Design- Importance of good design.

#Exemplar/Case Studies Paper prototype – Design elements of GUI

*Mapping of Course
CO1,CO6
Outcomes for Unit I
Unit II Human Perspective in Interaction 07 Hours
Design Process
Know your user/client: Understanding how people interact with computers, Important human
characteristics in Design, Human considerations in design of Business systems, Human Interaction
speeds, Performance versus Preference, Methods of gaining an understanding of users, Miller’s
Law.
Design Guidelines: Navigating the interface, Organizing the display, Getting user’s attention,
Facilitating data entry. Principles: Determine user’s skill level, Identify the tasks, Choose an

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #25/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
interaction style, Natural Language, Eight Golden rules of Interface design, Prevent errors,
Ensuring Human control while increasing automation. Theories: Design-by-level, Stages of action,
Consistency, Contextual Theories, Dynamic theories.

#Exemplar/Case Studies Registration form design.

*Mapping of Course
CO1,CO2
Outcomes for Unit II
Unit III Interaction Styles and HCI in Software 07 Hours
Process
Design, Process of Interaction Design. Interaction styles: Command line, Menu Selection, Form
fill-in, Direct Manipulation. Graphical User Interface: Popularity of Graphics, Concept of direct
manipulation, Advantages, Disadvantages and characteristics of Graphical user interface. Web
User Interface: Popularity and Characteristics, Merging of Graphical business systems and the
Web- Characteristics of Intranet versus Internet, Web page versus application design, Principles for
user interface design, Software life cycle, Usability Engineering, Iterative design and prototyping,
Design Rationale.
#Exemplar/Case Studies Comparison - GUI and Web design with a real time example.
*Mapping of Course
CO1,CO3,CO5
Outcomes for Unit III
Unit IV Usability Evaluation and Universal Design 07 Hours
User interface design process: Designing for People: Seven commandments, Usability
Assessment in the Design process, Common Usability problems, Practical and Objective measures
of Usability, Formative and Summative evaluation, Usability specifications for evaluation, Analytic
methods, Model based analysis, GOMS model, Empirical methods, Field studies, Usability testing
in Laboratory, Controlled experiments, Heuristic Evaluation, Cognitive Walkthrough.
Evaluation framework: Paradigms and techniques, DECIDE: a framework to guide evaluation,
Universal design principles, Multi-modal interaction, Designing for diversity.
#Exemplar/Case Studies GOMS model - Adding items to a cart of e-shopping website.
*Mapping of Course
CO1,CO3
Outcomes for Unit IV
Unit V HCI Paradigms 07 Hours
Paradigms for Interaction: Time sharing, Video display units, Programming toolkits, Personal
computing, The metaphor, Direct manipulation, Hypertext, Computer-supported cooperative work,
Agent based interfaces. Ubiquitous Computing: Sensor-based and context-aware interaction,
Data Integrity versus Data immunity, Handling missing data, Data entry and fudge ability, Auditing
versus Editing, Retrieval in Physical World, Retrieval in Digital world, Constrained Natural
Language output, Five stage search framework, Dynamic queries and faceted search, The social
aspects of search.
Pattern Recognition: Introduction, Examples, Role of Machine Learning, Pattern Recognition
Process, Pattern Recognition in HCI.
#Exemplar/Case Studies Interface Design- Pattern gesture recognition
*Mapping of Course
CO1,CO3,CO4
Outcomes for Unit V
Unit VI HCI for Mobile and Handheld devices 07 Hours
Designing for Mobile and other devices: Anatomy of a Mobile app, Mobile form factors,
Handheld format apps, Tablet format apps, Mini-tablet format apps, Mobile Navigation, Content,
and control idioms- browse controls, Navigation and toolbars, Drawers, Tap-to-reveal and direct
manipulation, Searching, Sorting and Filtering, Welcome and help screens, Multi-touch gestures,

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #26/99
 Curriculum for Third Year of Computer Engineering (2019 Course), Savitribai Phule Pune University
Inter-app integration, Android Accessibility Guidelines.
Other devices: Designing for kiosks, Designing for 10-foot interfaces, Designing for automotive
interfaces, Designing for audible interfaces.
#Exemplar/Case Studies GUI in Python
Enlist and evaluate handled devices
*Mapping of Course
CO3,CO5,CO6
Outcomes for Unit VI
Learning Resources
Text Books:
1. Alan J, Dix. Janet Finlay, Rusell Beale, “Human Computer Interaction”, Pearson Education,
3rd Edition, 2004, ISBN 81-297-0409-9
2. Jenny Preece, Rogers, Sharp, “Interaction Design-beyond human-computer interaction”,
WILEY-INDIA, ISBN 81-265-0393-9
3. Ben Shneiderman, Catherine Plaisant, Maxine Cohen, Steven Jacobs, “Designing the User
Interface: Strategies for Effective Human- Computer Interaction”, 6th Edition, Pearson
Education Limited, ISBN 987-1-292-03701-1.
Reference Books :
1. Alan Cooper, Robert Reiman, David Cronin, Christopher Noessel, “About Face: The
Essentials of Interaction Design”, 4th edition, WILEY, ISBN 978-1-118-76658-3
2. Mary Beth Rosson and John M. Carroll, “Usability Engineering: Scenario-Based
Development of Human-Computer Interaction”, Morgan Kaufmann Publishers, ISBN 978-
1-558-60712-5
3. Wibert O. Galitz,“The Essential Guide to user Interface Design”, WILEY India, ISBN: 978-
1-265-0280-6
4. Jenifer Tidwell, “Designing Interfaces”, O’REILLY, ISBN: 978-1-449-37970-4
5. Julie A. Jacko (Ed), “The Human-Computer Interaction Handbook”, 3rd edition, CRC
Press, 2012
6. Zou J., Nagy G. (2006) “Human-Computer Interaction for Complex Pattern Recognition
Problems”
7. Basu M., Ho T.K. (eds) “Data Complexity in Pattern Recognition. Advanced Information
and Knowledge Processing”, Springer, London
e-Books :
• http://www.37steps.com/data/pdf/PRIntro_medium.pdf
• https://www.ecse.rpi.edu/~nagy/PDF_chrono/2005_Zou_Nagy_complexity_05.pdf
• https://www.raywenderlich.com/240-android-accessibility-tutorial-getting-started
MOOCs Courses link
• https://www.edx.org/course/human-computer-interaction-i-fundamentals-design-p
• https://www.edx.org/course/human-computer-interaction-ii-cognition-context-cu
@ The CO-PO Mapping Matrix
CO/
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
PO
CO1 1 3 2 1 1 1 - - 1 1 3 1
CO2 2 2 - 1 - - - 2 1 - - -
CO3 - 1 2 3 - 1 - 1 - - 1 -
CO4 - - - 2 3 1 - - 1 - - -
CO5 3 2 2 - 2 2 2 - - 2 2 3
CO6 - 1 2 1 2 3 - 1 - - - 2

http://collegecirculars.unipune.ac.in/sites/documents/Syllabus2021/Forms/AllItems.aspx #27/99