SEMESTER VI

Sr. No. Course Codes Nomenclature of the Course Hours per week Credits
L T P
1. PCC-IT305-T/ Network Administration & Management 3 0 0 3
PEC-CSE411-T
2. PCC-IT306-T/ Compiler Design 3 0 0 3
PCC-CSE401-T
3. PCC-IT307-T Information and Cyber Security 3 0 0 3
4. PCC-IT308-T/ Python Programming 3 0 0 3
PCC-CSE302-T
5. PEC-IT301-T Professional Elective Course to be 3 0 0 3
to PEC-IT305-T opted by students
6. HSMC302-T Fundamentals of Management for Engineers 2 0 0 2
7. OEC-II Open Elective Course offered by 3 0 0 3
other Departments
8. PCC-IT305-P/ Network Administration & Management Lab. 0 0 2 1
PEC-CSE411-P
9. PCC-IT308-P/ Python Programming Lab. 0 0 3 1.5
PCC-CSE302-P
Total Credits 22.5
A Mini-Project/Training based on open source tools/.NET

List of Electives I
1. PEC-IT301-T/ PEC-CSE301-T: Embedded System Design
2. PEC-IT302-T/ PEC-CSE302-T: Soft Computing
3. PEC-IT303-T/ PEC-CSE303-T: Graph Theory
4. PEC-IT304-T/ PEC-CSE304-T: Bioinformatics
5. PEC-IT305-T/ PCC-CSE303-T: High Speed Network Technologies
6. Any one of the MOOC not studies earlier and of equal credits (3)

*
A student can do only one course from MOOC in leu of elective courses in a semester with the approval of
Chairperson of the Department.

18
 Network Administration and Management

General Course Information

Course Code: PCC-IT305-T/ Course Assessment Methods (internal: 30; external: 70)
PEC-CSE411-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Elective
marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Networking, protocols defined in layered Architecture, programming fundamentals.

About the Course:
Network Administration and Management is a Professional Elective course deemed to be necessary during the
present era of Information Technology and Computer Science. This course deals with analyzing Network for
statistics such as protocols, servers, memory, CPU etc. Network Monitoring and Management deals with
different events in various types of platforms for response.

Course Outcomes: By the end of the course students will be able to:
CO1. define Network Administration and its various components. (LOTS: Level 1: Remember)
CO2. distinguish Network Administration and its Management on various platforms. (LOTS: Level 2:
Understand)
CO3. classify the output for different responses to events by interpreting Network Monitoring statistics.
(LOTS: Level 3: Apply)
CO4. separate portions of Network for troubleshooting using various tools. (HOTS: Level 4: Analyse)
CO5. combine Network Administration, Network Management and Network Monitoring into a one scenario
and compute the performance of the integrated environment. (HOTS: Level 6: Create)

91
 Course Content

Unit I
Network Administration: Introduction to Network Administration Approaches, Addressing, Subnetting and
Supernetting, Fixed Vs Variable Masks, VLAN Principles and Configuration, Routing Concepts: Static and
Dynamic Routing, Routing Protocols: RIP, OSPF, BGP. Network Address Translation (NAT), Configuring a
Windows Box as a Router, Dial-up configuration and Authentication: PPP, Radius, RAS. Configuring a DNS
Server in windows, Configuring Sendmail Service, Configuring a Web Server, Configuring a Proxy Server,
TCP/IP Troubleshooting: ping, traceroute, ifconfig, netstat, ipconfig.

Unit II
Linux Network Administration: Setting up a file server, setting up samba server, configuring Network services:
installing and configuring DHCP server, installing and configuring DNS server, setting up internal NTP server,
hosting http content via Apache, sharing resources in a Network.

Unit III
Network management: Management Standards and models, Configuration Management and auto discovery,
Fault Management, Fault identification and isolation, Event correlation techniques, SNMPv1, SNMPv2:
Structure of Management Information, Standard Management Information Base (MIBs), MIB-II, Network
Management Functions: Accounting Management, Performance Management, Network Usage, Metrics, and
Quotas, SNMPv3: Protocol, MIB.

Unit IV
Network Monitoring: Network Performance Monitoring, Remote Network Monitoring (RMON1): Statistics
Collection, Alarms and Filters, RMON2: Monitoring Network Protocol Traffic, Application-Layer Visibility,
Management Tools, Systems and Applications: Test and Monitoring tools, Integrating tools, Development tools,
Web-based Enterprise Management.

Text and Reference Books:

1. Mark Burgess, Principles of Network and System Administration, 2nd Edition, Wiley publications,
2004.
2. Craig Hunt, TCP/IP Network Administration, 3rd Edition, O’Reilly Publications, 2002.
3. George Splading, Windows 2000 Administration, Tata McGraw-Hill, 2000.
4. Tony Bautts, Terry Dawson, and Gregor N. Purdy, Linux Network Administrator’s Guide, 3rd Edition,
O’Reilly publications, 2005.

92
 CO-PO Articulation Matrix Network Administration and Management Course (PEC-IT305-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Define Network Administration and its various components.
1 _ _ _ _ _ _ _ _ _ _ _ _ 3 _
(LOTS: Level 1: Remember)
CO2. Distinguish Network Administration and its Management on
1 _ _ _ _ _ _ _ _ _ _ _ _ 3 _
various platforms. (LOTS: Level 2: Understand)
CO3. Classify the output for different responses to events by
interpreting Network Monitoring statistics. (LOTS: Level 3: 2 2 2 3 3 _ _ _ _ _ _ _ _ 3 _
Apply)
CO4. Separate portions of Network for troubleshooting using
2 3 2 2 3 _ _ _ _ _ _ _ _ 3 _
various tools. (HOTS: Level 4: Analyse)
CO5. Combine Network Administration, Network Management and
Network Monitoring into a one scenario and compute the
3 3 2 3 3 _ _ _ _ _ _ _ _ 3 _
performance of the integrated environment. (HOTS: Level 6:
Create)
Level of Attainments : PEC-IT305-T

93
 Compiler Design

General Course Information

Course Code: PCC-IT306-T/ Course Assessment Methods (internal: 30; external: 70)
PCC-CSE401-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Core
marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Brief knowledge of programming languages, Data Structure, and Algorithm Design.
About the Course:
Compilers have become part and parcel of today’s computer systems. These are responsible for making the
user’s computing requirements, specified as a piece of program, understandable to the underlying machine.
There tools work as interface between the entities of two different domains – the human being and the machine.
The actual process involved in this transformation is quite complex. Compiler design covers basic translation
mechanism and, error detection and recovery. It includes lexical, syntax, and semantic analysis as front end, and
code generation and optimization as back-end.

Course Outcomes: By the end of the course students will be able to:
CO1. state principles of compiler design. (LOTS: Level 1: Remember)
CO2. illustrate the essential phases for automatically converting source code into object code. (LOTS: Level
2: Understand)
CO3. apply lexical analysis, syntax analysis and code optimization techniques for solving problems. (LOTS:
Level 3: Apply)
CO4. analyse a parse tree and a given BNF grammar. (LOTS: Level 4: Analyse)
CO5. compare and contrast syntax-oriented translation schemes (HOTS: Level 5: Evaluate)
CO6. design a lexical analyser from the specification of a language's lexical rules. (HOTS: Level 6: Create)

94
 Course Content

Unit I
Introduction To Compilers: Compilers and translators, need of translators, structure of compiler :its different
phases, Compiler construction tools.
Lexical Analysis: Role of lexical analyzer, design of lexical analyzer, regular expressions, Specification and
recognition of tokens, input buffering, A language specifying lexical analyzer. Finite automata, conversion from
regular expression to finite automata, and vice versa, minimizing number of states of DFA, Implementation of
lexical analyzer.

Unit II
Syntax Analysis: Role of parsers, context free grammars, definition of parsing. Parsing Technique: Shift- reduce
parsing, operator precedence parsing, top down parsing, predictive parsing.

Unit III
LR parsers, SLR, LALR and Canonical LR parser. Syntax Directed Translations: Syntax directed definition,
construction of syntax trees, syntax directed translation scheme, implementation of syntax directed translation,
three address code, quadruples and triples.

Unit IV
Symbol Table & Error Detection and Recovery: Symbol tables, its contents and data structure for symbol tables;
trees, arrays, linked lists, hash tables. Errors, lexical phase error, syntactic phase error, semantic error.
Code Optimization & Code Generation: Code generation, forms of objects code, machine dependent code,
optimization, register allocation for temporary and user defined variables.

Text and Reference Books:

1. Alfread V. AHO, Ravi Sethi and J.D. Ullman, Compilers Principle, Techniques and Tools, Addison
Wesley, 2007.
2. Tremblay and Sorenson, Theory and practice of compiler writing, Mc. Graw Hill, 1985.
3. Dhamdare, System software, MGH, 1986.
4. Alfred V. Aho, Jeffrey D. Ullman, Principles of Compiler Design, Narosa Publication, 2002.

95
 CO-PO Articulation Matrix Compiler Design Course (PCC-IT306-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1. State principles of compiler design. (LOTS: Level 1: Remember) 1 _ _ _ _ _ _ _ _ _ _ _ 2 _ _

CO2. Illustrate the essential phases for automatically converting source
1 _ _ _ _ _ _ _ _ _ _ _ 3 _ _
code into object code. (LOTS: Level 2: Understand)
CO3. Apply lexical analysis, syntax analysis and code optimization
2 1 _ _ _ _ _ _ _ _ _ _ 3 _ _
techniques for solving problems. (LOTS: Level 3: Apply)
CO4. Analyse a parse tree and a given BNF grammar. (LOTS: Level 4:
3 2 1 2 _ _ _ _ _ _ _ 3 _ _
Analyse)
CO5. Compare and contrast syntax-oriented translation schemes
2 2 1 2 _ _ _ _ _ _ _ 3 _ _
(HOTS: Level 5: Evaluate)
CO6. Design a lexical analyser from the specification of a language's
3 3 2 2 3 _ _ _ _ _ _ _ 3 _ _
lexical rules. (HOTS: Level 6: Create)
Level of Attainments PCC-IT306-T _ _

96
 Information and Cyber Security

General Course Information

Course Code: PCC-IT307-T Course Assessment Methods (internal: 30; external: 70)
Course Credits: 3 Two minor examinations (20 marks), Class Performance
Type: Open Elective measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Contact Hours: 3 hours/week
marks).
Mode: Lectures (L)
For the end semester examination, nine questions are to be set
Examination Duration: 3 hours
by the examiner. A candidate is required to attempt 5 questions
in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Basic knowledge of number theory, complexity theory and basic programming skills for
security.
About the Course:
The increase in techniques for unauthorised access into systems has led to variety of information and cyber
attacks, To mitigate the exploitation of the vulnerabilities leading to these attacks, we need to adopt robust
security architecture into our premises. We have to choose between various security technologies such as
cryptography, digital signatures, key management, program security, database security, cyber laws, Wifi
security. In the current scenario, we require to secure end-to-end devices, networks, networking devices and
clouds. The objective of this course is to enable students to

Course Outcomes: By the end of the course students will be able to:
CO7. recognize security principles and needs for an organization/institute. (LOTS: Level 1: Remember)
CO8. represent information security by means of cryptographic algorithms and digital signatures. (LOTS:
Level 2: Understand)
CO9. compute private keys by key exchange algorithms. (LOTS: Level 3: Apply)
CO10. analyse various types of attacks for their mitigation, proactive and reactive treatment. (HOTS: Level 4:
Analyse)
CO11. evaluate cybercrime situations and recommend appropriate cybersecurity laws. (HOTS: Level 5:
Evaluate)
CO12. integrate different types of securities under one environment and evaluate their performance. (HOTS:
Level 6: Create)

97
 Course Content

Unit I
Cryptography: Overview of information security, Basic concepts, Cryptosystems, Cryptoanalysis, Ciphers &
Cipher modes, Symmetric key Cryptography DES, AES asymmetric key cryptography, RSA algorithm, Key
management protocols, Diffie Hellman algorithm. Digital signature, Public Key Infrastructure.

Unit II
System Security: Program security, Security problems in coding, Malicious logic, Protection. Database
Security- Access controls, Security & integrity threats, Defense mechanisms. OS security-protection of system
resources, Models for OS security, Net Security-User based security, Code access security, form authentication.

Unit III
Ethics in Cyber Security: Privacy, Intellectual property in the cyberspace, Professional ethics, Freedom of
speech, Fair user and ethical hacking, Trademarks, Internet fraud, Electronic evidence, Forensic technologies,
Digital evidence collections. Tools and methods used in cybercrime: Introduction, Password cracking,
Keyloggers and spywares, Virus and worms, Phishing and identity theft, Trojan horses and backdoors,
Steganography.

Unit IV
Cybercrimes and Cybersecurity: Cybercrime and legal landscape around the world, Cyberlaws, The Indian IT
Act, Challenges, Digital signatures and Indian IT Act, Amendments to the Indian IT Act, Cybercrime and
punishment, Cost of Cybercrimes and IPR Issues, Web threats for organizations, Social computing and
associated challenges for organizations.

Text and Reference Books:

1. William Stalling, Cryptography and Network security-Principles and Practices, Pearson Education,
Ninth Indian Reprint 2005.
2. Charlie Kaufman, Network Security: Private communication in Public World, Prentice-Hall
International, Inc. April 2008
3. Nina Godhole and Sunit Belapure, Cyber Security, Wiley India, 2011.
4. James Graham, Ryan Olson, Rick Howard, Cyber Security Essentials, CRC Press, Taylor & Francis,
2011.

98
 CO-PO Articulation Matrix Information and Cyber Security Course (PCC-IT307)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Recognize security principles and needs for an 1 _ _ _ _ _ _ _ _ _ _ _
organization/institute. (LOTS: Level 1: Remember)
CO2. Represent information security by means of cryptographic 1 _ _ _ _ _ _ _ _ _ _ _
algorithms and digital signatures. (LOTS: Level 2:
Understand)
CO3. Compute private keys by key exchange algorithms. (LOTS: 2 3 2 _ 3 _ _ _ _ _ _ _
Level 3: Apply)
CO4. Analyse various types of attacks for their mitigation, 3 2 2 2 3 _ _ _ _ _ _ _
proactive and reactive treatment. (HOTS: Level 4: Analyse)
CO5. Evaluate cybercrime situations and recommend appropriate 2 3 3 2 - 3 _ 3 _ _ _ _
cybersecurity laws. (HOTS: Level 5: Evaluate)
CO6. Integrate different types of securities under one environment 3 3 2 3 3 _ _ _ _ _ _ _
and evaluate their performance. (HOTS: Level 6: Create)
Level of attainment: PCC-IT307-T

99
 Python Programming

General Course Information

Course Code: PCC-IT308-T/ Course Assessment Methods (internal: 30; external: 70) Two minor
PCC-CSE302-T examinations (20 marks), Class Performance measured through
Course Credits: 3 percentage of lectures attended (4 marks), assignments (6 marks), and
the end- semester examination (70 marks).
Type: Professional Core
For the end semester examination, nine questions are to be set by the
Contact Hours: 3hours/week
examiner. A candidate is required to attempt 5 questions in all. All
Mode: Lectures (L)
questions carry equal marks. Question number 1 will be compulsory and
Examination Duration: 3 hours based on the entire syllabus. It will contain seven parts of 2 marks each.
Question numbers 2 to 9 will be given by setting two questions from
each of the four units of the syllabus. A candidate is required to attempt
the remaining four questions by selecting one question from each of the
four units.

Pre-requisite: Exposure to programming languages

About the Course:
Python is a popular open source programming language used for both standalone programs and scripting
applications in a wide variety of domains. It is free, portable, and powerful and is both relatively easy and
remarkably fun to use. In today’s era Python has found great applicability in machine learning, data analytics
and many other data science application. This is introductory course and covers most of the basic concepts
required for basic python programming. Some of the contents are advanced may be useful for data analytics
purpose.

Course Outcomes: By the end of the course students will be able to:
CO1. outline various basic programming constructs including operators, character sets, basic data types and
control statements. (LOTS: level 1: Understand)
CO2. explain Python packages and their functionalities for data analysis. (LOTS: level 2: Understand)
CO3. solve problems using python programming. (LOTS: level 3: Apply)
CO4. analyse the results of data analysis or machine learning programs (HOTS: level 4: Analyse)
CO5. evaluate solutions according to the problem definition. (HOTS: level 5: Evaluate)
CO6. develop database applications in Python. (HOTS: level 6: Create)

Course Content

Unit I
Introduction to Python, History of Python, Features of Python, Python Identifiers, Python Character Set,
Keywords and Indentation, Comments, Command Line Arguments, Assignment Operator, Operators and
Expressions, print() Function, input() Function, eval() Function, Python Data Types: int, float, complex,
Variables, Mutable vs Immutable variables, Namespaces, Decision Statements: Boolean Type, Boolean
Operators, if statement, else statement, Nested Conditionals Statements, Multi-way Decision Statements (elif
statement).

100
Unit II
Loop Control Statements: While loop, range() Function, For Loop, Nested Loops, Infinite Loop, Break
Statement, Continue Statement, Pass Statement, Introduction to Strings, String Operations: Indexing and
Slicing, Lists: Operations on List: Slicing, Inbuilt Functions for Lists, List Processing: Searching and Sorting,
Dictionaries: Need of Dictionary, Operations on Directories: Creation, Addition, Retrieving Values, Deletion;
Tuples, operations on Tuples, Inbuilt Functions for Tuples, Introduction to Sets, operations on sets.
Python Functions, Inbuilt functions, Main function, User Defined functions, Defining and Calling Function,
Parameter Passing, Actual and Formal Parameters, Default Parameters, Global and Local Variables, Recursion,
Passing Functions as Data, Lamda Function, Modules, Importing Own Module, Packages.

Unit III
Operations on File: Reading text files, read functions, read(), readline() and readlines(), writing Text Files,
write functions, write() and writelines(),Manipulating file pointer using seek, Appending to Files.
Python Object Oriented: Overview of OOP, Classes and objects, Accessing attributes, Built-In Class
Attributes, Methods, Class and Instance Variables, Destroying Objects, Polymorphism, Overlapping and
Overloading of Operators, Class Inheritance: super(), Method Overriding, Exception Handling, Try-except-else
clause, Python Standard Exceptions, User-Defined Exceptions

Unit IV
Databases in Python: Create Database Connection, create, insert, read, update and delete Operation, DML and
DDL Operation with Databases.
Python for Data Analysis: numpy: Creating arrays, Using arrays and Scalars, Indexing Arrays, Array
Transposition, Universal Array Function, Array Processing, Array Input and Output
Pandas: Series, Data Frame, Panel, Index objects, Re-indexing, Iteration, Sorting. Matplotlib: Python for Data
Visualization, Visualization Section, Sklearn: loading of dataset, learning and predicting, Model Persistence.

Text and Reference Books:

1. Ashok Namdev Kamthane, Programming and Problem Solving with Python, Mc Graw Hill Education
Publication, 2018.
2. John Guttag, Introduction to Computation and Programming using Python, Springer, Revised and
Expanded version (Referred by MIT), 2013.
3. Lutz, M., Learning Python: Powerful Object-Oriented Programming. O'Reilly Media, Inc., 2013.
4. Michael T Goodrich and Robertto. Thamassia, Micheal S Goldwasser, Data Structures and Algorithms
in Python, Wiley, 2016.
5. Y. Daniel Liang, Introduction to Programming Using Python, Pearson, 2013.
6. Reema Thareja, Python Programming Using Problem Solving Approach , Oxford Publications, 2017.
7. Dr. R. Nageswara Rao, Allen B. Downey, Core Python Programming , Think Python, O’Reilly Media,
2012.
8. Kenneth A. Lambert, The Fundamentals of Python: First Programs, Cengage Learning, 2011.

101
 CO-PO Articulation Matrix Python Programming Course (PCC-IT308-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Outline various basic programming constructs including
operators, character sets, basic data types and control 1 _ _ _ _ _ _ _ _ _ _ _ _ _ 2
statements. (LOTS: level 1: Understand)
CO2. Explain Python packages and their functionalities for data
1 _ _ _ _ _ _ _ _ _ _ _ _ _ 3
analysis. (LOTS: level 2: Understand)
CO3. Solve problems using python programming. (LOTS: level 3:
3 2 2 _ 3 _ _ _ _ _ _ _ _ 3
Apply)
CO4. Analyse the results of data analysis or machine learning
2 3 2 2 _ _ _ _ _ _ _ _ _ _ 3
programs (HOTS: level 4: Analyse)
CO5. Evaluate solutions according to the problem definition.
2 3 2 2 _ _ _ _ _ _ _ _ _ _ 3
(HOTS: level 5: Evaluate)
CO6. Develop database applications in Python. (HOTS: level 6:
3 3 2 3 3 _ _ _ _ _ _ 3 3
Create)
Level of Attainments PCC-IT308-T

102
 Embedded System Design

General Course Information

Course Code: PEC-IT301-T/ Course Assessment Methods (internal: 30; external: 70) Two minor
PEC-CSE301-T examinations (20 marks), Class Performance measured through
Course Credits: 3 percentage of lectures attended (4 marks), assignments (6 marks), and
the end- semester examination (70 marks).
Type: Professional Elective
For the end semester examination, nine questions are to be set by the
Contact Hours: 3
examiner. A candidate is required to attempt 5 questions in all. All
Mode: Lectures (L)
questions carry equal marks. Question number 1 will be compulsory and
Examination Duration: 3 hours. based on the entire syllabus. It will contain seven parts of 2 marks each.
Question numbers 2 to 9 will be given by setting two questions from
each of the four units of the syllabus. A candidate is required to attempt
the remaining four questions by selecting one question from each of the
four units.

Pre-requisites: Introduction to Microprocessors and Operating Systems.

About the Course:
An embedded system is a self-contained unit that have a dedicated purpose within a device. We come across a
variety of applications of embedded systems in navigation tools, telecom applications, and networking
equipment to name just a few. An Embedded System’s Architecture begins with a view of embedded
development and how it differs from the other systems. Students learn about setting up a development
environment and then move on to the core system architectural concepts, exploring pragmatic designs, boot-up
mechanisms, and memory management. They are also explored to programming interface and device drivers to
establish communication via TCP/IP and take measures to increase the security of IoT solutions.

Course Outcomes: By the end of the course students will be able to:
CO1. state the concepts related to embedded system design. (LOTS: Level 1: Remember)
CO2. discuss the principles of embedded systems and their applications. (LOTS: Level 2: Understand)
CO3. apply the principles of embedded design for problem solving. (LOTS: Level 3: Apply)
CO4. analyze architectural design patterns and engineering tradeoffs. (HOTS: Level 4: Analyse)
CO5. design architectural patterns for connected and distributed devices in the IoT. (HOTS: Level 6: Create)

Course Content

Unit I
Embedded Systems: A Pragmatic Approach- Domain definitions, Embedded Linux systems, Low-end 8-bit
microcontrollers, Hardware architecture, Understanding the challenge, Multithreading, RAM, Flash memory,
Interfaces and peripherals, Asynchronous UART-based serial communication:-SPI - I2C - USB, Connected
systems, The reference platform, ARM reference design, The Cortex-M microprocessor
Work Environment and Workflow Optimization: Workflow overview, C compiler, Linker, Build automation,
Debugger, Embedded workflow, The GCC toolchain, The cross-compiler, Compiling the compiler, Linking the

103
executable, Binary format conversion, Interacting with the target, The GDB session, Validation, Functional tests,
Hardware tools, Testing off-target, Emulators.
Unit II
Architectural Patterns: Configuration management, Revision control, Tracking activities, Code reviews,
Continuous integration, Source code organization, Hardware abstraction, Middleware Application code, The life
cycle of an embedded project, Defining project steps, Prototyping Refactoring, API and documentation,
The Boot-Up Procedure: The interrupt vector table, Startup code, Reset handler, Allocating the stack, Fault
handlers, Memory layout, Building and running the boot code, The makefile, Running the application, Multiple
boot stages, Bootloader, Building the image, Debugging a multi-stage system, Shared libraries

Unit III
Distributed Systems and IoT Architecture: Network interfaces, Media Access Control, Ethernet, Wi-Fi, Low-
Rate Wireless Personal Area Networks (LR-WPAN), LR-WPAN industrial link-layer extensions, 6LoWPAN,
Bluetooth, Mobile networks, Low-power Wide Area Networks (LPWANs), Selecting the appropriate network
interfaces, The Internet Protocols, TCP/IP implementations, Network device drivers, Running the TCP/IP stack,
Socket communication, Mesh networks and dynamic routing, Transport Layer Security, Securing socket
communication, Application protocols, Message protocols, REST architectural pattern, Distributed systems;
single points of failure, Summary

Unit IV
Low-Power Optimizations: System configuration, Hardware design, Clock management, Voltage control,
Low-power operating modes, Deep-sleep configuration, Stop mode, Standby mode, Wake-up intervals,
Measuring power, Development boards, Designing low-power embedded applications, Replacing busy loops
with sleep mode, Deep sleep during longer inactivity periods, Choosing the clock speed, Power state transitions
Embedded Operating Systems: Real-time application platforms, FreeRTOS, ChibiOS, Low-power IoT
systems, Contiki OS, Riot OS, POSIX-compliant systems, NuttX, Frosted, The future of safe embedded
systems, Process isolation; Tock, Summary.

Text and Reference Books:

1. Daniele Lacamera, Embedded Systems Architecture, Packt Publishing, May 2018, ISBN:
9781788832502.
2. Raj Kamal, Embedded Systems, TMH, 2004.
3. M.A. Mazidi and J. G. Mazidi, The 8051 Microcontroller and Embedded Systems, PHI, 2004.
4. David E. Simon, An Embedded Software Primer, Pearson Education, 1999.
5. K.J. Ayala, , The 8051 Microcontroller, Penram International, 1991.
6. Rajiv Kapadia, 8051 Microcontroller & Embedded Systems, Jaico Press, 2004.
7. Prasad, Embedded Real Time System, Wiley Dreamtech, 2004.
8. John B. Peatman, Design with PIC Microcontrollers, Pearson Education Asia, 2002.
9. Wayne Wolf, Computers as components: Principles of Embedded Computing System Design, Morgan
Kaufman Publication, 2000.
10. Tim Wilmshurst, The Design of Small-Scale embedded systems, Palgrave, 2003.
11. Marwedel, Peter, Embedded System Design, Kluwer Publishers, 2004.

104
CO-PO Articulation Matrix Embedded System Design Course (PEC-IT301-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1. State the concepts related to embedded system design. (LOTS:

1 _ _ _ _ _ _ _ _ _ _ _ 3 _ _
Level 1: Remember)

CO2. Discuss the principles of embedded systems and their

1 _ _ _ _ _ _ _ _ _ _ _ 3 _ _
applications. (LOTS: Level 2: Understand)

CO3. Apply the principles of embedded design for problem solving.

2 2 _ _ 2 _ _ _ _ _ _ _ 3 _ _
(LOTS: Level 3: Apply)

CO4. Analyze architectural design patterns and engineering

3 3 2 2 2 _ _ _ _ _ _ _ 3 _ _
tradeoffs. (HOTS: Level 4: Analyse)

CO5. Design architectural patterns for connected and distributed

3 3 2 3 3 _ _ _ _ _ _ _ 3 _ _
devices in the IoT. (HOTS: Level 6: Create)

Level of Attainments PEC-IT301-T

105
 Soft Computing

General Course Information

Course Code: PEC-IT302-T/ Course Assessment Methods (internal: 30; external: 70)
PEC-CSE302-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Elective
marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Basic knowledge of Probability Theory, Set Theory and, Data Structure and Computer
Algorithms
About the Course:
We need to learn soft computing techniques to make intelligent machines that possess human like abilities to
reason, learn and handle the uncertainty and vagueness often inherent in real world problems. Unlike
conventional computing, soft computing techniques are tolerant of imprecision, uncertainty and approximations,
and provide low cost, robust and tractable solutions to the complex real-world problems where conventional
methods fail to do so. This introductory course on soft computing is going to cover Genetic Algorithms,
Artificial Neural Networks and Fuzzy Logic.

Course Outcomes: By the end of the course students will be able to:
CO1. define the terminology and concepts related to soft computing techniques. (LOTS: Level 1:
Remember)
CO2. discuss soft computing techniques including genetic algorithms, fuzzy systems and neural networks.
(LOTS: Level 2: Understand)
CO3. solve problems related to Genetic algorithms, Fuzzy logic and Neural Networks. (LOTS: Level 3:
Apply)
CO4. analyse the design of Genetic Algorithms, Neural Networks and Fuzzy Systems. (HOTS: Level 4:
Analyse)
CO5. justify the design of a soft computing algorithm for a given problem. (HOTS: Level 5: Evaluate)
CO6. design Genetic Algorithms and Neural Networks to solve optimization and pattern recognition
problems. (HOTS: Level 6: Create)

106
 Course Content

Unit I
Introduction to Soft Computing and related definitions: Defining soft computing, Differentiating the situations
for application of hard and soft computing; Working of a simple Genetic Algorithm: Representation/Encoding
Schemes, initializing a GA population, evaluation function, genetic operators, Function optimization using GA.
Study of parameters of genetic algorithms and its performance, sampling and selection mechanisms. Scaling of
GA population.

Unit II
Designing Genetic Algorithms for different applications: Different types encoding schemes, role of fitness
function, different types of genetic operators, Designing GAs for numerical optimization, knapsack problem and
travelling salesperson and other similar problems.

Unit III
Fuzzy sets: Basic terminology and definitions, Operations on Fuzzy sets, MF formulations and parameterisation,
MFs of one and two dimensions, Derivatives of parameterised MFs, Fuzzy numbers, Extension principle and
fuzzy relations, Operations on Fuzzy relations, Linguistic variables, Fuzzy If-Then Rules, Compositional rule of
inference.

Unit IV
Neural networks: Basic terminology and definitions, Model of an artificial neuron, Sigmoid function, Neural
Network Architectures, Rosenblatt's Perceptron, Fixed increment perceptron learning algorithm for a
classification problem, Examples of learning of AND/OR gate by perceptron, XOR problem. Back Propagation
Neural Networks: Architecture of a backpropagation network, Model for multi-layer perceptron, Back
propagation learning, Delta or gradient descent learning rule and effect of learning rate, Back propagation
learning algorithm.

Text and Reference Books:

1. David. E. Goldberg, Genetic Algorithms in Search, Optimization and machine learning, Addison
Wesley, 1999.
2. Zbigniew Michalewicz, Genetic algorithms + Data Structures = Evolution Programs, Springers-
Verlag, 1999.
3. M. Mitchell, An Introduction to Genetic Algorithms, Prentice-Hall, 1998.
4. S. Rajasekaran & G. A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic Algorithms:
Synthesis & Applications, PHI, 2003.
5. S. N. Sivanandam & S. N. Deepa, Principles of Soft Computing, Wiley - India, 2007.
6. J-S. R. Jang, C.-T. Sun, E. Mizutani, Neuro-Fuzzy and Soft Computing, PHI, 1997.
7. Simon O. Haykin, Neural Networks, A Comprehensive Foundation, PHI, 1994.

107
 CO-PO Articulation Matrix Soft Computing Course (PEC-IT302-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Define the terminology and concepts related to soft computing
1 _ _ _ _ _ _ _ _ _ _ _ _ _ 3
techniques. (LOTS: Level 1: Remember)
CO2. Discuss soft computing techniques including genetic
algorithms, fuzzy systems and neural networks. (LOTS: Level 1 _ _ _ _ _ _ _ _ _ _ _ _ _ 3
2: Understand)
CO3. Solve problems related to Genetic algorithms, Fuzzy logic and
3 3 _ _ 2 _ _ _ _ _ _ _ _ _ 3
Neural Networks. (LOTS: Level 3: Apply)
CO4. Analyse the design of Genetic Algorithms, Neural Networks
3 3 _ 2 2 _ _ _ _ _ _ _ _ _ 3
and Fuzzy Systems. (HOTS: Level 4: Analyse)
CO5. Justify the design of a soft computing algorithm for a given
3 3 2 2 _ _ _ _ _ _ _ _ _ _ 3
problem. (HOTS: Level 5: Evaluate)
CO6. Design Genetic Algorithms and Neural Networks to solve
optimization and pattern recognition problems. (HOTS: Level 3 3 3 3 3 _ _ _ _ _ _ _ _ _ 3
6: Create)
Level of Attainments PEC-IT302-T

108
 Graph Theory

General Course Information

Course Code: PEC-IT303-T/ Course Assessment Methods (internal: 30; external: 70)
PEC-CSE303-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Elective
marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Basic knowledge of Abstract Algebra, Set Theory and Counting Techniques
About the Course:
Graph Theory is an elective course for every graduate in Computer Science and Engineering. The importance of
Graph Theory reveals from the fact that it can be applied to solve any practical problem in electrical networks,
operation research, data structure or social sciences etc. Also, Graph Theory provides easy representation of
mathematical facts with insightful theories behind them. This course explains different types of graphical
structures, related properties, various operations and facts related to these graphical structures with the help of
proofs.

Course Outcomes: By the end of the course students will be able to:
CO1. recognize different kinds of Graphs. (LOTS: Level 1:Remember)
CO2. demonstrate various types of graphical structures with the operations implemented on these structures.
(LOTS: Level 2: Understand)
CO3. apply graph theory constructs for solving problems. (LOTS: Level 3: Apply)
CO4. justify various facts and results associated with graphical structures with the help of proofs. (HOTS:
Level 5: Evaluate)
CO5. sketch the graph to solve any problem in pictorial and easy representation. (HOTS: Level 6: Create)

109
 Course Content

Unit I
Introduction to graphs, Types of graphs -Regular, Complete, Bipartite, Isomorphic, Connected, Applications,
Operations on Graphs, Walks, Path, Circuits, Euler Graphs, Hamiltonian Path and Circuits, Trees, Properties of
Trees, Spanning Trees (Standard Results with proofs based on all mentioned topic).
Unit II
Cut-Sets, Properties of Cut-Set, All Cut-Sets in a graph, Fundamental Circuits and Cut-Sets, Connectivity and
Separability, Network Flows, 1-Isomorphism, 2- Isomorphism, Planar Graphs, Kuratowski’s Two Graphs
(Standard Results with proofs).

Unit III
Sets with one operation, Sets with two operations, Modular Arithmetic and Galois Fields, Vector and Vector
Spaces, Vector Space associated with a graph, Basic Vectors of a graph, Circuits and Cut-Set Subspaces,
Orthogonal Vectors and Spaces, Intersection and Join of W and Ws.

Unit IV
Matrix representation of graphs, Incidence Matrix, Submatrices, Circuit Matrix, Fundamental Circuit Matrix and
Rank, Coloring of graphs: Chromatic Number, Vertex Coloring of graphs, Edge Coloring of graphs, Coloring of
Planar Graphs.

Text and Reference Books:

1. V. K. Balakrishnan, Graph Theory, Tata McGraw Hill, 1st Edition, 2004.
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall of
India, Reprint, 2004.
3. Frank Harary, Graph Theory, Narosa/Addison Wesley, Indian Student Edition, 1988.
4. Bollobas, Bela, Modern Graph Theory, Springer Verlag New York, 1st Edition, 1998.
5. R. Diestel, Graph Theory, Springer, 2nd Edition, 2000.
6. Douglas B. West, Introduction to Graph Theory, Prentice Hall of India, 2nd Edition, 2002.

110
 CO-PO Articulation Matrix Graph Theory Course (PEC-IT303-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1. Recognize different kinds of Graphs. (LOTS: Level 1:

2 1 _ _ _ _ _ _ _ _ _ _ 2 _ _
Remember)

CO2. Demonstrate various types of graphical structures with the

operations implemented on these structures. (LOTS: Level 2: 2 1 _ _ _ _ _ _ _ _ _ _ 3 _ _
Understand)

CO3. Apply graph theory constructs for solving problems. (LOTS:

2 3 1 2 _ _ _ _ _ _ 2 3 _ _
Level 3: Apply)

CO4. Justify various facts and results associated with graphical

3 2 2 3 2 _ _ _ _ _ _ 2 3 _ _
structures with the help of proofs. (HOTS: Level 5: Evaluate)

CO5. Sketch the graph to solve any problem in pictorial and easy
3 _ 1 2 2 _ _ _ _ _ _ 2 3 _ _
representation. (HOTS: Level 6: Create)

Level of Attainments PEC-IT303-T

111
 Bio-informatics

General Course Information:

Course Code: PEC-IT304-T/ Course Assessment Methods (internal: 30; external: 70)
PEC-CSE304-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Elective
marks).
Contact Hours: 3 hours/week
For the end semester examination, nine questions are to be set
Mode: Lectures (L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: None
About the Course:
The scope of Bio-informatics is growing rapidly. Analysing data related to bio-informatics is not possible
without computational skills. This course is designed to impart fundamental knowledge of bio-informatic which
would enable students to understand the intricacies of Bioinformatics. The students will learn about the
characteristic of bio-informatic data and the tools for analysis of such data.

Course Outcomes: By the end of the course students will be able to:
CO1. list the applications of bioinformatics and biological databases. (LOTS: Level 1: Remember)
CO2. explain storage and retrieval of biological data from various biological databases. (LOTS: Level 2:
Understand)
CO3. apply the knowledge of bio-informatic concepts. (LOTS: Level 3: Apply)
CO4. identify challenges in bioinformatics and computational biology. (HOTS: Level 4: Analyse)
CO5. compare and contrast various algorithms for sequence alignment and scoring algorithms. (HOTS:
Level 5: Evaluate)
CO6. devise schemes for addressing bio-informatic problems. (LOTS: Level 6: Create)

112
 Course Content

Unit: I
Bioinformatics: Introduction to Bioinformatics, Scope, Overview of molecular biology & genetics, Nucleic
acid; structure & function, Protein structure & function; DNA Replication, Transcription, Translations, Genetic
code, Codon Bias, Molecular Biology Techniques used in Bioinformatics.
Computer applications in molecular biology, Protein domains and human genome analysis program (BLAST,
FASTA etc.). Search and retrieval of biological information and databases sequence, databank (NCBI)12hrs

Unit: II
Sequence Alignment
Pairwise Sequence Alignment: Evolutionary Basis, Sequence Homology versus Sequence Similarity, Sequence
Similarity versus Sequence Identity, Methods, Scoring Matrices, Statistical Significance of Sequence Alignment
Database Similarity Searching: Unique Requirements of Database Searching, Heuristic Database Searching,
Basic Local Alignment Search Tool (BLAST), FASTA, Comparison of FASTA and BLAST, Database Searching
with the Smith–Waterman Method.

Unit: III
Multiple Sequence Alignment: Scoring Function, Exhaustive Algorithms, Heuristic Algorithms, Practical
Issues.
Profiles and Hidden Markov Models: Position-Specific Scoring Matrices, Profiles, Markov Model and
Hidden Markov Model.
Protein Motifs and Domain Prediction: Identification of Motifs and Domains in Multiple Sequence
Alignment, Motif and Domain Databases Using Regular Expressions, Motif and Domain Databases Using
Statistical Models, Protein Family Databases, Motif Discovery in Unaligned Sequences, Sequence Logos.

Unit: IV
Molecular Phylogenetics
Phylogenetics Basics: Molecular Evolution and Molecular Phylogenetics, Terminology, Gene Phylogeny versus
Species Phylogeny, Forms of Tree Representation, Procedure.
Phylogenetic Tree Construction Methods and Programs: Distance-Based Methods, Character-Based
Methods, Phylogenetic Tree Evaluation, Phylogenetic Programs

Text and References Books:

1. T K Attwood and D J Parry Smith , Introduction to Bioinformatics, Pearson Education Asia, Singapore,
2001.
2. Sensen, C.W., Essentials of Genomics and Bioinformatics, John Wiley and Sons. 2002
3. Attwood, T. and Pary-Smith, D., Introduction to Bioinformatics, Prentice Hall.1999
4. Baxevanis, A.D. and Ouellette, B.F.F., Bioinformatics: A Practical Guide to the Analysis of genes and
Protein , Wiley- Interscience, 2001
5. Stuart M. Brown, Bioinformatics: A Biologists Guide to Computing and the Internet, NKU Medical
Centre, NY USA, 2000.

113
 CO-PO Articulation Matrix Bio-informatics Course (PEC-IT304-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. List the applications of bioinformatics and biological
1 _ _ _ _ _ _ _ _ _ _ _ _ _ 2
databases. (LOTS: Level 1: Remember)
CO2. Explain storage and retrieval of biological data from various
1 _ _ _ _ _ _ _ _ _ _ _ _ _ 3
biological databases. (LOTS: Level 2: Understand)
CO3. Apply the knowledge of bio-informatic concepts. (LOTS:
2 _ _ _ _ _ _ _ _ _ _ _ _ _ 3
Level 3: Apply)
CO4. Identify challenges in bioinformatics and computational
_ 2 _ _ _ _ _ _ _ _ _ _ _ _ 3
biology. (HOTS: Level 4: Analyse)
CO5. Compare and contrast various algorithms for sequence
2 3 2 _ 2 _ _ _ _ _ _ _ _ _ 3
alignment and scoring algorithms. (HOTS: Level 5: Evaluate)
CO6. Devise schemes for addressing bio-informatic problems.
3 3 2 3 2 _ _ _ _ _ _ _ _ _ 3
(LOTS: Level 6: Create)
Level of Attainments PEC-IT304-T

114
 High Speed Network Technologies

General Course Information

Course Code: PEC-IT305-T/ Course Assessment Methods (internal: 30; external: 70)
PCC-CSE303-T Two minor examinations (20 marks), Class Performance
Course Credits: 3 measured through percentage of lectures attended (4 marks),
assignments (6 marks), and the end- semester examination (70
Type: Professional Core
marks).
Contact Hours: 3 hours /week
For the end semester examination, nine questions are to be set
Mode: Lecture(L)
by the examiner. A candidate is required to attempt 5 questions
Examination Duration: 3 hours in all. All questions carry equal marks. Question number 1 will
be compulsory and based on the entire syllabus. It will contain
seven parts of 2 marks each. Question numbers 2 to 9 will be
given by setting two questions from each of the four units of
the syllabus. A candidate is required to attempt the remaining
four questions by selecting one question from each of the four
units.

Pre-requisites: Basic knowledge of computer networks, layers of OSI reference model, protocols at different
layers of OSI reference model.
About the course:
High Speed Network Technologies is a professional core course based around Network Architectures, protocols
used across the layers, techniques used in communication and modes of data transfer. The course deals with
creating High Speed Networks for any organization/institute with its various phases/life cycles.

Course Outcomes: By the end of the course students will be able to:
CO1. define different high speed network technologies. (LOTS: Level 1: Remember)
CO2. explain working of different wired / wireless technologies suitable for LAN and WAN communication.
(LOTS: Level 2: Understand)
CO3. illustrate the mapping of OSI reference model to different high speed technologies and Internet Suite
of Protocols. (LOTS: Level 3: Apply)
CO4. analyze the performance of different high speed technologies in different scenarios / situations.
(HOTS: Level 4: Analyse)
CO5. design a network for any organization using high speed technologies along with Internet connectivity.
(HOTS: Level 6: Create)

115
 Course Content

Unit I (High Speed LAN)

Gigabit Ethernet: Overview of fast Ethernet, Gigabit Ethernet – overview, specifications, layered protocol
architecture, frame format, network design using Gigabit Ethernet, applications, 10GB Ethernet – overview,
layered protocol architecture, frame format.
Fiber Channel: Fiber channel – overview, topologies, ports, layered protocol architecture, frame structure, class
of service.

UNIT II (High Speed WAN)

Frame Relay: Protocol architecture and frame format.
ISDN & B-ISDN: Channels, interfaces, addressing, protocol architecture, services.
ATM: Virtual circuits, cell switching, reference model, traffic management.

Unit III (Wireless LAN)

Wireless Networks: Existing and emerging standards, Wireless LAN (802.11), Broadband Wireless (802.16),
Bluetooth (802.15) their layered protocol architecture and security. Mobile Networks – GSM, CDMA.

Unit IV (Internet Suite of Protocols)

Internet Layer: IPV4 and IPV6, IP addressing, IP classes, CIDR.
Transport Layer: UDP/TCP protocols & architecture, TCP connection management.
Application Layer: DNS, E-Mail, Voice over IP.

Text and Reference Books:

1. Jochen Schiller, Mobile Communication, 2nd Edition, Pearson,2009.
2. Andrew S Tanenbaum, Computer Networks, 5th Edition, Pearson 2013.
3. William C Y Lee, Mobile Communication Engineering: Theory and Applications, 2nd Edition, McGraw
Hill, 1997.

116
 CO-PO Articulation Matrix High Speed Network Technologies Course (PEC-IT305-T)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1. Define different high speed network technologies. (LOTS:

1 - - - - _ _ _ - _ _ _ 2
Level 1: Remember)

CO2. Explain working of different wired / wireless technologies

suitable for LAN and WAN communication. (LOTS: Level 2: 1 - - - - _ _ _ - _ _ _ 3
Understand)

CO3. Illustrate the mapping of OSI reference model to different

high speed technologies and Internet Suite of Protocols. 2 - - - _ _ _ - _ _ _ 3
(LOTS: Level 3: Apply)

CO4. Analyze the performance of different high speed technologies

2 2 2 2 2 _ _ _ - _ _ _ 3
in different scenarios / situations. (HOTS: Level 4: Analyse)

CO5. Design a network for any organization using high speed

technologies along with Internet connectivity. (HOTS: Level 2 3 3 2 3 _ _ _ 2 _ _ 2 3
6: Create)

Level of Attainments PEC-IT305-T

117
 Network Administration and Management Lab.

General Course Information

Course Code: PCC-IT305-P/ Course Assessment Methods (internal: 30; external: 70) The
PEC-CSE411-P internal and external assessment is based on the level of
Course Credits: 1 participation in lab. sessions and the timely submission of lab
experiments/assignments, the quality of solutions designed for
Type: Professional Elective Lab. Course
the assignments, the performance in VIVA-VOCE, the quality
Contact Hours: 2 hours/week
of lab. file and ethical practices followed.
Mode: Lab practice and assignments
The internal examination is conducted by the course
coordinator. The external examination is conducted by external
examiner appointed by the Controller of Examination in
association with the internal examiner appointed by the
Chairperson of the Department.

Pre-requisites: knowledge of Computer Networks, System Administration, Unix/Linux Command line.

About the Course:
This lab. course on Network Administration and Management involves configuration of servers for different
platforms. It incorporates setting up of ones’ machine to be connected to a Network and checking its status
frequently for any intrusion. The objective of the lab. course is to equip the students to solve the practical
Administration, Management and Monitoring related problems.

Course Outcomes: By the end of the course students will be able to:
CO1. configure a server to work as a DNS/DHCP/FTP/Web/Mail/Print server (LOTS: Level 3: Apply)
CO2. detect the trends in attacks through in depth attack analysis. (HOTS: Level 4: Analyse)
CO3. formulate solutions for Monitoring assignments by using principles of Network statistics. (HOTS:
Level 6: Create)
CO4. plan solutions for overall security of Computer/Network systems. (HOTS: Level 6: Create)
CO5. create file records of solutions of assignments. (HOTS: Level 6: Create)
CO6. demonstrate use of ethical practices, self-learning and team spirit. (LOTS: Level 3: Apply)

List of experiments/assignments:
1. Management (creation, modification and deletion of left users) of the users & their domain.
2. Setting up the local security policy for the system, software.
3. Maintaining your system in Linux Networking and Setup Linux for firewall and IP filtering.
4. Configure the kernel for IP Accounting and IP Masquerade.
5. Install sendmail distribution and create sendmail configuration files.
6. Start and stop services from user window and command prompt.
7. Use of event viewer and performance monitor.
8. Management of the IIS and FTP server.

118
9. Setting up of router in Window 2000 server and Linux server.

10. Use of utilities (a) Ping (b) Tracert (c) netstat(d) net(e) IP configuration (f) Path ping
11. Monitor the Network using performance monitoring tools such as RMON, tcpdump etc.

12. Setting up of a DNS server.

13. Setting up and use “Terminal Client Services”.

Note:
The actual experiments/assignments will be designed by the course coordinator. One assignment should be
designed to be done in groups of two or three students. The assignments must meet the objective of the course
and the levels of the given course outcomes. The list of assignments and schedule of submission will be
prepared by the course coordinator at the beginning of the semester.

119
 CO-PO Articulation Matrix Network Administration and Management Lab. Course (PCC-IT305-P)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Configure a server to work as a
DNS/DHCP/FTP/Web/Mail/Print server (LOTS: Level 3: 1 _ 2 _ 3 _ _ _ _ _ _ _ _ 3 _
Apply)
CO2. Detect the trends in attacks through in depth attack analysis.
2 2 2 2 3 _ _ _ _ _ _ _ _ 3 _
(HOTS: Level 4: Analyse)
CO3. Formulate solutions for Monitoring assignments by using
3 3 3 3 3 _ _ _ _ _ _ _ _ 3 _
principles of Network statistics. (HOTS: Level 6: Create)
CO4. Plan solutions for overall security of Computer/Network
3 3 3 3 3 2 _ _ _ _ _ _ _ 3 _
systems. (HOTS: Level 6: Create)
CO5. Create file records of solutions of assignments. (HOTS: Level
_ _ _ _ _ _ _ _ _ 3 _ _ _ _ _
6: Create)
CO6. Demonstrate use of ethical practices, self-learning and team
_ _ _ _ _ _ _ 3 3 _ _ 3 _ _ _
spirit. (LOTS: Level 3: Apply)
Level of Attainments PCC-IT305-P

120
 Python Programming Lab.

General Course Information

Course Code: PCC-IT308-P/ Course Assessment Methods (internal: 30; external: 70) The
PCC-CSE302-P internal and external assessment is based on the level of
Course Credits: 2 participation in lab. sessions and the timely submission of lab
experiments/assignments, the quality of solutions designed for
Type: Professional Core Lab. Course
the assignments, the performance in VIVA-VOCE, the quality
Contact Hours: 4 hours/week
of lab. file and ethical practices followed.
Mode: Lab practice and assignments
The internal examination is conducted by the course
coordinator. The external examination is conducted by external
examiner appointed by the Controller of Examination in
association with the internal examiner appointed by the
Chairperson of the Department.

Pre-requisites: Basic programming skills

About the Course:
Python is a scripting programming language known for both its simplicity and wide breadth of applications. For
this reason it is considered one of the best languages for beginners. Used for everything from web development
to scientific computing Python is referred to as a general purpose language by the greater programming
community. The major objective of Python language is to make the students solve real word problem efficiently
using python library.

Course Outcomes: By the end of the course students will be able to:
CO1. implement solutions to the given assignments in Python. (LOTS: Level 3: Apply)
CO2. use various Python packages for solving different programming problems. (LOTS: Level 3: Apply)
CO3. devise solutions for complex problems of data analysis and machine learning. (HOTS: Level 6: Create)
CO4. Evaluate the output of data analysis and machine learning models. (HOTS: Level 5: Evaluate)
CO5. create lab records of the solutions for the given assignments. (HOTS: Level 6: Create)
CO6. demonstrate use of ethical practices, self-learning and team spirit.. (LOTS: Level 3: Apply)

List of experiments/assignments
8. Install Python and explore various popular IDE like IDLE, PyCharm, and Anaconda.
9. Assignments to perform various number operations like
a. Find maximum from a list of numbers
b. GCD of two number
c. Square root of a number
d. Check number is prime or not.
e. Print first N prime numbers
f. Remove duplicate numbers from list

121
 g. Print the Fibonacci series.
10. Assignments to perform various operations on Strings like creation, deletion, concatenation.
11. Create a List L = [10, 20, 30]. Write programs to perform following operations:
a. Insert new numbers to list L.
b. Delete numbers from list L.
c. Sum all numbers in list L.
d. Sum all prime numbers in list L.
e. Delete the list L.
12. Create a Dictionary D= {‘Name’: ‘Allen’, ‘Age’: 27, 5:123456}. Write programs to perform following
operations:
a. Insert new entry in D.
b. Delete an entry from D.
c. Check whether a key present in D.
d. Update the value of a key.
e. Clear dictionary D.
13. Two assignments on Sets to perform various operation like union, intersection, difference etc.
14. Two assignments related to searching operation like linear search, binary search.
15. Three assignments related to sorting like selection sort, bubble sort, insertion sort.
16. Demonstrate the use of dictionary for measuring student marks in five subjects and you have to find the
student having maximum and minimum average marks.
17. Two assignment on usage of different available packages like random package to perform
a. Print N random numbers ranging from 100 to 500.
b. Print 10 random strings whose length between 3 and 5.
18. Two assignments on usage of package such as Numpy, Pandas.

19. Implement and demonstrate the functions of a simple calculator.

20. One assignment on implementing object oriented concept such as classes, inheritance, and
polymorphism.

21. One assignment on file handling that how data is read and written to a file.

Note:
The actual experiments/assignments will be designed by the course coordinator. One assignment should be
designed to be done in groups of two or three students. The assignments must meet the objective of the course
and the levels of the given course outcomes. The list of assignments and schedule of submission will be
prepared by the course coordinator at the beginning of the semester.

122
 CO-PO Articulation Matrix Python Lab. Course (PCC-IT308-P)
List of Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1. Implement solutions to the given assignments in Python.
2 1 _ _ 3 _ _ _ _ _ _ _ _ _ 3
(LOTS: Level 3: Apply)
CO2. Use various Python packages for solving different
2 3 _ 3 3 _ _ _ _ _ _ _ _ _ 3
programming problems. (LOTS: Level 3: Apply)
CO3. Devise solutions for complex problems of data analysis and
3 3 1 3 3 _ _ _ _ _ _ _ _ _ 3
machine learning. (HOTS: Level 6: Create)
CO4. Evaluate the output of data analysis and machine learning
3 3 3 3 _ _ _ _ _ _ _ _ _ 3
models. (HOTS: Level 5: Evaluate)
CO5. Create lab records of the solutions for the given assignments.
_ _ _ _ _ _ _ _ _ 3 _ _ _ _ _
(HOTS: Level 6: Create)
CO6. Demonstrate use of ethical practices, self-learning and team
_ _ _ _ _ _ _ 3 3 _ _ 3 _ _ _
spirit. (LOTS: Level 3: Apply)
Level of Attainments PCC-IT308-P

123