DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY,

UTTAR PRADESH, LUCKNOW

EVALUATION SCHEME & SYLLABUS

FOR
B. TECH. THIRD YEAR

• Computer Engineering and Information

Technology
• Computer Science and Information
Technology
• Information Technology

Based
On

NEP2020

(Effective from the Session: 2024-25)

Curriculum & Evaluation Scheme: Computer Engineering and Information Technology, 1

Computer Science and Information Technology, IT (V & VI semester)
 Information Technology, Information Technology) CURRICULUM STRUCTURE
SEMESTER- VI

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 BCS601 Software Engineering 3 1 0 20 10 30 70 100 4

2 BIT601 Data Analytics 3 1 0 20 10 30 70 100 4

3 BCS603 Computer Networks 3 1 0 20 10 30 70 100 4

BCS061-
4 Departmental Elective-III 3 0 0 20 10 30 70 100 3
064

5 Open Elective-I 3 0 0 20 10 30 70 100 3

6 BCS651 Software Engineering Lab 0 0 2 50 50 100 1

7 BIT651 Data Analytics Lab 0 0 2 50 50 100 1

8 BCS653 Computer Networks Lab 0 0 2 50 50 100 1

BNC601/ Constitution of India/

9 BNC602 Essence of Indian Traditional 2 0 0 20 10 30 70
Knowledge
Total 17 3 6 800 21

Minor Degree/Honors
Degree MT-1/HT-1

Departmental Elective-I
1. BCS051 Statistical Computing
2. BIT052 Compiler Design
3. BCS053 Computer Graphics
4. BCS054 Object Oriented System Design with C++

Departmental Elective-II
5. BCS055 Machine Learning Techniques
6. BCS056 Application of Soft Computing
7. BCS057 Image Processing
8. BCS058 Data Warehousing & Data Mining

Departmental Elective-III
1. BCS061 Big Data
2. BCS062 Augmented & Virtual Reality
3. BCS063 Blockchain Architecture Design
4. BCS064 Data Compression

Curriculum & Evaluation Scheme: Computer Engineering and Information Technology, 3

Computer Science and Information Technology, IT (V & VI semester)
 B.TECH. (Computer Engineering and Information Technology , Computer Science and
Information Technology, Information Technology) SIXTH SEMESTER SYLLABUS

Software Engineering (BCS601)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to

Explain various software characteristics and analyze different software Development

CO 1 K1, K2
Models

Demonstrate the contents of a SRS and apply basic software quality assurance practices to
CO 2 K1, K2
ensure that design, development meet or exceed applicable standards

CO 3 Compare and contrast various methods for software design. K2, K3

Formulate testing strategy for software systems, employ techniques such as unit testing, Test
CO 4 K3
driven development and functional testing

Manage software development process independently as well as in teams and make use of
CO 5 K5
Various software management tools for development, maintenance and analysis.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Introduction to Software Engineering, Software Components, Software
Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from
I Conventional Engineering Processes, Software Quality Attributes. Software Development Life Cycle 08
(SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary
Development Models, Iterative Enhancement Models.
Software Requirement Specifications (SRS): Requirement Engineering Process: Elicitation,
Analysis, Documentation, Review and Management of User Needs, Feasibility Study, Information
II Modelling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, 08
IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA
Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model.
Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion
III Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and 08
Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures:
Halestead’s Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity
Measures: Control Flow Graphs.
Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing,
Regression Testing, Testing for Functionality and Testing for Performance, TopDown and Bottom-
Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing),
IV Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of 08
Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code
Inspection, Compliance with Design and Coding Standards.
Software Maintenance and Software Project Management: Software as an Evolutionary Entity,
Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective
Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering. Software
V Configuration Management Activities, Change Control Process, Software Version Control, An 08
Overview of CASE Tools. Estimation of Various Parameters such as Cost, Efforts,
Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Software
Risk Analysis and Management.

21
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
Text books:
1. RS Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.
2. Pankaj Jalote, Software Engineering, Wiley
3. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
4. KK Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers.
5. Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI Publication.
6. Ian Sommerville, Software Engineering, Addison Wesley.
7. Kassem Saleh, “Software Engineering”, Cengage Learning.
8. P fleeger, Software Engineering, Macmillan Publication

Curriculum & Evaluation Scheme: Computer Engineering and Information Technology, 22

Computer Science and Information Technology, IT (V & VI semester)
 Data Analytics (BIT 601)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Discuss various concepts of data analytics pipeline K1, K2

CO 2 Apply classification and regression techniques K3

CO 3 Explain and apply mining techniques on streaming data K2, K3

CO 4 Compare different clustering and frequent pattern mining algorithms K4

CO 5 Describe the concept of R programming and implement analytics on Big data using R. K2,K3

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Introduction to Data Analytics: Sources and nature of data, classification of data
(structured, semi-structured, unstructured), characteristics of data, introduction to Big Data
platform, need of data analytics, evolution of analytic scalability, analytic process and tools,
I analysis vs reporting, modern data analytic tools, applications of data analytics. 08
Data Analytics Lifecycle: Need, key roles for successful analytic projects, various phases
of data analytics lifecycle – discovery, data preparation, model planning, model building,
communicating results, operationalization.
Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, inference
and Bayesian networks, support vector and kernel methods, analysis of time series: linear
II systems analysis & nonlinear dynamics, rule induction, neural networks: learning and 08
generalisation, competitive learning, principal component analysis and neural networks,
fuzzy logic: extracting fuzzy models from data, fuzzy decision trees, stochastic search
methods.
Mining Data Streams: Introduction to streams concepts, stream data model and
architecture, stream computing, sampling data in a stream, filtering streams, countingdistinct
III elements in a stream, estimating moments, counting oneness in a window, decayingwindow, 08
Real-time Analytics Platform ( RTAP) applications, Case studies – real time sentiment
analysis, stock market predictions.
Frequent Itemsets and Clustering: Mining frequent itemsets, market based modelling,
Apriori algorithm, handling large data sets in main memory, limited pass algorithm, counting
IV frequent itemsets in a stream, clustering techniques: hierarchical, K-means, clustering high 08
dimensional data, CLIQUE and ProCLUS, frequent pattern based clustering methods,
clustering in non-euclidean space, clustering for streams and parallelism.
Frame Works and Visualization: MapReduce, Hadoop, Pig, Hive, HBase, MapR,
Sharding, NoSQL Databases, S3, Hadoop Distributed File Systems, Visualization: visual
V data analysis techniques, interaction techniques, systems and applications.
Introduction to R - R graphical user interfaces, data import and export, attribute and data 08
types, descriptive statistics, exploratory data analysis, visualization before analysis, analytics
for unstructured data.
Text books and References:
1. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer
2. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University Press.
3. John Garrett,Data Analytics for IT Networks : Developing Innovative Use Cases, Pearson Education
23
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
4. Bill Franks, Taming the Big Data Tidal wave: Finding Opportunities in Huge Data Streams with
AdvancedAnalytics, John Wiley & Sons.
5. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
BusinessIntelligence and Analytic Trends for Today's Businesses", Wiley
6. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big Data Analytics”, EMC Education
Series,John Wiley
7. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley and SAS Business
Series
8. Colleen Mccue, “Data Mining and Predictive Analysis: Intelligence Gathering and Crime
Analysis”,Elsevier
9. Michael Berthold, David J. Hand,” Intelligent Data Analysis”, Springer
10. Paul Zikopoulos, Chris Eaton, Paul Zikopoulos, “Understanding Big Data: Analytics for Enterprise
ClassHadoop and Streaming Data”, McGraw Hill
11. Trevor Hastie, Robert Tibshirani, Jerome Friedman, "The Elements of Statistical Learning", Springer
12. Mark Gardner, “Beginning R: The Statistical Programming Language”, Wrox Publication
13. Pete Warden, Big Data Glossary, O’Reilly
14. Glenn J. Myatt, Making Sense of Data, John Wiley & Sons
15. Pete Warden, Big Data Glossary, O’Reilly.
16. Peter Bühlmann, Petros Drineas, Michael Kane, Mark van der Laan, "Handbook of Big Data", CRC Press
17. Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, Second Edition, Elsevier

24
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Computer Networks(BCS603)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

Explain basic concepts, OSI reference model, services and role of each layer of OSI model and
CO 1 K1,K2
TCP/IP, networks devices and transmission media, Analog and digital data transmission
CO 2 Apply channel allocation, framing, error and flow control techniques. K3
Describe the functions of Network Layer i.e. Logical addressing, subnetting & Routing
CO 3 K2,K3
Mechanism.
Explain the different Transport Layer function i.e. Port addressing, Connection Management,
CO 4 K2,K3
Error control and Flow control mechanism.
CO 5 Explain the functions offered by session and presentation layer and their Implementation. K2,K3
Explain the different protocols used at application layer i.e. HTTP, SNMP, SMTP, FTP,
CO 6 K2
TELNET and VPN.
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introductory Concepts: Goals and applications of networks, Categories of networks, Organization
of the Internet, ISP, Network structure and architecture (layering principles, services, protocols and
standards), The OSI reference model, TCP/IP protocol suite, Network devices and components.
I Physical Layer:
08
Network topology design, Types of connections, Transmission media, Signal transmission and
encoding, Network performance and transmission impairments, Switching techniques and
multiplexing.

Link layer: Framing, Error Detection and Correction, Flow control (Elementary Data Link
II Protocols, Sliding Window protocols). 08
Medium Access Control and Local Area Networks: Channel allocation, Multiple access protocols,
LAN standards, Link layer switches & bridges (learning bridge and spanning tree algorithms).
Network Layer: Point-to-point networks, Logical addressing, Basic internetworking (IP, CIDR,
III 08
ARP, RARP, DHCP, ICMP), Routing, forwarding and delivery, Static and dynamic routing,
Routing algorithms and protocols, Congestion control algorithms, IPv6.
Transport Layer: Process-to-process delivery, Transport layer protocols (UDP and TCP),
IV 08
Multiplexing, Connection management, Flow control and retransmission, Window management,
TCP Congestion control, Quality of service.
Application Layer: Domain Name System, World Wide Web and Hyper Text Transfer Protocol,
V 08
Electronic mail, File Transfer Protocol, Remote login, Network management, Data compression,
Cryptography – basic concepts.
Text books and References:
1. Behrouz Forouzan, “Data Communication and Networking”, McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Pearson.
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson.
5. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann
6. W. A. Shay, “Understanding Communications and Networks”, Cengage Learning.
7. D. Comer, “Computer Networks and Internets”, Pearson.
8. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw Hill.

25
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Big Data(BCS061)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Demonstrate knowledge of Big Data Analytics concepts and its applications in business. K1,K2

CO 2 Demonstrate functions and components of Map Reduce Framework and HDFS. K1,K2

CO 3 Discuss Data Management concepts in NoSQL environment. K6

CO 4 Explain process of developing Map Reduce based distributed processing applications. K2,K5

CO 5 Explain process of developing applications using HBASE, Hive, Pig etc. K2,K5

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lectures
Introduction to Big Data: Types of digital data, history of Big Data innovation, introduction
to Big Data platform, drivers for Big Data, Big Data architecture and characteristics, 5 Vs of
Big Data, Big Data technology components, Big Data importance and applications, Big Data
I
features – security, compliance, auditing and protection, Big Data privacy and ethics, Big 06
Data Analytics, Challenges of conventional systems, intelligent data analysis, nature of data,
analytic processes and tools, analysis vs reporting,
modern data analytic tools.
Hadoop: History of Hadoop, Apache Hadoop, the Hadoop Distributed File System,
components of Hadoop, data format, analyzing data with Hadoop, scaling out, Hadoop
streaming, Hadoop pipes, Hadoop Echo System.
II 08
Map Reduce: Map Reduce framework and basics, how Map Reduce works, developing a
Map Reduce application, unit tests with MR unit, test data and local tests, anatomy of a Map
Reduce job run, failures, job scheduling, shuffle and sort, task execution, Map Reducetypes,
input formats, output formats, Map Reduce features, Real-world Map Reduce
HDFS (Hadoop Distributed File System): Design of HDFS, HDFS concepts, benefits and
challenges, file sizes, block sizes and block abstraction in HDFS, data replication, how does
HDFS store, read, and write files, Java interfaces to HDFS, command line interface, Hadoop
III file system interfaces, data flow, data ingest with Flume and Scoop, Hadoop archives, 08
Hadoop I/O: compression, serialization, Avro and file-based data structures.
Hadoop Environment: Setting up a Hadoop cluster, cluster specification, cluster setup
and installation, Hadoop configuration, security in Hadoop, administering Hadoop, HDFS
monitoring & maintenance, Hadoop benchmarks, Hadoop in the cloud
Hadoop Eco System and YARN: Hadoop ecosystem components, schedulers, fair and
capacity, Hadoop 2.0 New Features - NameNode high availability, HDFS federation,MRv2,
YARN, Running MRv1 in YARN.
NoSQL Databases: Introduction to NoSQL
IV MongoDB: Introduction, data types, creating, updating and deleing documents, querying, 09
introduction to indexing, capped collections
Spark: Installing spark, spark applications, jobs, stages and tasks, Resilient Distributed
Databases, anatomy of a Spark job run, Spark on YARN
SCALA: Introduction, classes and objects, basic types and operators, built-in control
structures, functions and closures, inheritance.
Hadoop Eco System Frameworks: Applications on Big Data using Pig, Hive and HBase
V 09
Pig - Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases,
Grunt, Pig Latin, User Defined Functions, Data Processing operators,
26
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Hive - Apache Hive architecture and installation, Hive shell, Hive services, Hive metastore,
comparison with traditional databases, HiveQL, tables, querying data and user defined
functions, sorting and aggregating, Map Reduce scripts, joins & subqueries.
HBase – Hbase concepts, clients, example, Hbase vs RDBMS, advanced usage, schema
design, advance indexing, Zookeeper – how it helps in monitoring a cluster, how to build
applications with Zookeeper.
IBM Big Data strategy, introduction to Infosphere, BigInsights and Big Sheets, introduction
to Big SQL.
Text books and References:
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today's Businesses", Wiley
2. DT Editorial Services, Big-Data Black Book, Wiley
3. Dirk deRoos, Chris Eaton, George Lapis, Paul Zikopoulos, Tom Deutsch, “Understanding Big Data Analytics for
Enterprise Class Hadoop and Streaming Data”, McGraw Hill.
4. Thomas Erl, Wajid Khattak, Paul Buhler, “Big Data Fundamentals: Concepts, Drivers and Techniques”, Prentice
Hall.
5. Bart Baesens “Analytics in a Big Data World: The Essential Guide to Data Science and its Applications (WILEY
Big Data Series)”, John Wiley & Sons
6. ArshdeepBahga, Vijay Madisetti, “Big Data Science & Analytics: A HandsOn Approach “, VPT
7. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP
8. Tom White, "Hadoop: The Definitive Guide", O'Reilly.
9. Eric Sammer, "Hadoop Operations", O'Reilly.
10. Chuck Lam, “Hadoop in Action”, MANNING Publishers
11. Deepak Vohra, “Practical Hadoop Ecosystem: A Definitive Guide to Hadoop-Related Frameworks and Tools”,
Apress
12. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilly
13. Lars George, "HBase: The Definitive Guide", O'Reilly.
14. Alan Gates, "Programming Pig", O'Reilly.
15. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer
16. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced
Analytics”, John Wiley & sons
17. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons
18. Pete Warden, “Big Data Glossary”, O’Reilly

27
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Software Engineering Lab (BCS651)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

Identify ambiguities, inconsistencies and incompleteness from a requirements specification and K2, K4
CO 1
state functional and non-functional requirement

Identify different actors and use cases from a given problem statement and draw use case K3, K5
CO 2
diagram to associate use cases with different types of relationship

CO 3 Draw a class diagram after identifying classes and association among them K4, K5

Graphically represent various UML diagrams , and associations among them and K4, K5
CO 4 identify the logical sequence of activities undergoing in a system, and represent them
pictorially

CO 5 Able to use modern engineering tools for specification, design, implementation and testing K3, K4

DETAILED SYLLABUS
For any given case/ problem statement do the following;
1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors. Also state the precondition, post
condition and function of each use case.
3. Draw the activity diagram.
4. Identify the classes. Classify them as weak and strong classes and draw the class diagram.
5. Draw the sequence diagram for any two scenarios.
6. Draw the collaboration diagram.
7. Draw the state chart diagram.
8. Draw the component diagram.
9. Perform forward engineering in java. (Model to code conversion)
10. Perform reverse engineering in java. (Code to Model conversion) 11. Draw the deployment diagram.

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( Open Office , Libra ,
Junit, Open Project , GanttProject , dotProject, AgroUML, StarUML etc. )
Software Engineering Lab (BCS651): Mapping with Virtual Lab

Name of the Lab Name of the Experiment

Identifying the Requirements from Problem Statements
Estimation of Project Metrics
Modeling UML Use Case Diagrams and Capturing Use Case Scenarios
E-R Modeling from the Problem Statements
Identifying Domain Classes from the Problem Statements
Software Engineering Lab (BCS-651)
Statechart and Activity Modeling
Modeling UML Class Diagrams and Sequence diagrams
Modeling Data Flow Diagrams
Estimation of Test Coverage Metrics and Structural Complexity
Designing Test Suites
32
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Data Analytics Lab (BIT651)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

Implement numerical and statistical analysis on various data sources K3

CO 1
Apply data preprocessing and dimensionality reduction methods on raw data K3
CO 2
Implement linear regression technique on numeric data for prediction K3
CO 3
Execute clustering and association rule mining algorithms on different datasets K3
CO 4
K3, K4
CO 5 Implement and evaluate the performance of KNN algorithm on different datasets
DETAILED SYLLABUS
1. To get the input from user and perform numerical operations (MAX, MIN, AVG, SUM, SQRT, ROUND) using
in R.
2. To perform data import/export (.CSV, .XLS, .TXT) operations using data frames in R.
3. To get the input matrix from user and perform Matrix addition, subtraction, multiplication, inverse transpose and
division operations using vector concept in R.
4. To perform statistical operations (Mean, Median, Mode and Standard deviation) using R.
5. To perform data pre-processing operations i) Handling Missing data ii) Min-Max normalization
6. To perform dimensionality reduction operation using PCA for Houses Data Set
7. To perform Simple Linear Regression with R.
8. To perform K-Means clustering operation and visualize for iris data set
9. Write R script to diagnose any disease using KNN classification and plot the results.
10. To perform market basket analysis using Association Rules (Apriori).
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab (R , Python etc. )

33
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Computer Networks Lab (BCS653)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Simulate different network topologies. K3,K4

CO 2 Implement various framing methods of Data Link Layer. K3,K4

CO 3 Implement various Error and flow control techniques. K3,K4

CO 4 Implement network routing and addressing techniques. K3, K4

CO 5 Implement transport and security mechanisms K3, K4

DETAILED SYLLABUS
1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.
2. Study of Socket Programming and Client – Server model
3. Write a code simulating ARP /RARP protocols.
4. Write a code simulating PING and TRACEROUTE commands
5. Create a socket for HTTP for web page upload and download.
6. Write a program to implement RPC (Remote Procedure Call)
7. Implementation of Subnetting .
8. Applications using TCP Sockets like
a. Echo client and echo server b. Chat c. File Transfer
9. Applications using TCP and UDP Sockets like d. DNS e. SNMP f. File Transfer
10. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms using NS

11. Perform a case study about the different routing algorithms to select the network path with its optimum and
economical during data transfer. i. Link State routing ii. Flooding iii. Distance vector
12. To learn handling and configuration of networking hardware like RJ-45 connector, CAT-6 cable, crimping tool,
etc.
13. Configuration of router, hub, switch etc. (using real devices or simulators)
14. Running and using services/commands like ping, traceroute, nslookup, arp, telnet, ftp, etc.
15. Network packet analysis using tools like Wireshark, tcpdump, etc.
16. Network simulation using tools like Cisco Packet Tracer, NetSim, OMNeT++, NS2, NS3, etc.
17. Socket programming using UDP and TCP (e.g., simple DNS, data & time client/server, echo client/server, iterative
& concurrent servers)
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( C , C++ , Java , NS3,
Mininet, Opnet, TCP Dump, Wireshark etc.

34
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)
 Software Project Management (BOE068)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able :

CO 1 Identify project planning objectives, along with various cost/effort estimation models. K3

CO 2 Organize & schedule project activities to compute critical path for risk analysis. K3

CO 3 Monitor and control project activities. K4, K5

CO 4 Formulate testing objectives and test plan to ensure good software quality under SEI-CMM. K6

CO 5 Configure changes and manage risks using project management tools. K2, K4

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Project Evaluation and Project Planning :
Importance of Software Project Management – Activities – Methodologies – Categorization of
I 08
Software Projects – Setting objectives – Management Principles – Management Control – Project
portfolio Management – Cost-benefit evaluation technology – Risk evaluation – Strategic program
Management – Stepwise Project Planning.
Project Life Cycle and Effort Estimation :
Software process and Process Models – Choice of Process models – Rapid Application development
II 08
– Agile methods – Dynamic System Development Method – Extreme Programming– Managing
interactive processes – Basics of Software estimation – Effort and Cost estimation
techniques – COSMIC Full function points – COCOMO II – a Parametric Productivity Model.
Activity Planning and Risk Management :
Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling –
III Network Planning models – Formulating Network Model – Forward Pass & Backward Pass 08
techniques – Critical path (CRM) method – Risk identification – Assessment – Risk Planning –Risk
Management – – PERT technique – Monte Carlo simulation – Resource Allocation – Creation of
critical paths – Cost schedules.
Project Management and Control:
IV Framework for Management and control – Collection of data – Visualizing progress – Cost 08
monitoring – Earned Value Analysis – Prioritizing Monitoring – Project tracking – Change control
– Software Configuration Management – Managing contracts – Contract Management.
Staffing in Software Projects :
Managing people – Organizational behavior – Best methods of staff selection – Motivation – The
V 08
Oldham – Hackman job characteristic model – Stress – Health and Safety – Ethical and
Professional concerns – Working in teams – Decision making – Organizational structures –
Dispersed and Virtual teams – Communications genres – Communication plans – Leadership.
Text books:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, McGraw Hill,
New Delhi, 2012.
2. Robert K. Wysocki ―Effective Software Project Management – Wiley Publication, 2011.
3. Walker Royce: ―Software Project Management- Addison-Wesley, 1998.
4. Gopalaswamy Ramesh, ―Managing Global Software Projects – McGraw Hill Education (India), Fourteenth
Reprint 2013.

37
Curriculum & Evaluation Scheme: Computer Engineering and Information Technology,
Computer Science and Information Technology, IT (V & VI semester)