COURSE OUTCOMES

CO1 Demonstrate knowledge on: UML architecture, Routing algorithms, Error detection and correction techniques.
CO2 Analyze real world problems and study the applicability of UML design.
Apply Unified Modeling Language to design software and design routing algorithms Shortest path using Dijkstra’s, and
CO3
Distance vector.
CO4 Demonstrate independent problem solving skills in designing and developing software solutions.
CO5 Use NS-2 tool for simulating computer network processes.
CO6 Build network models and UML models suitable for societal needs.
CO7 Work effectively as an individual and as a member in team for mini-project implementation
CO8 Demonstrate communication skills, both oral and written for preparing and presenting reports.

IT - Program Outcomes
Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization
PO1.
to the solution of complex engineering problems.

Identify, formulate, research literature, and analyze complex engineering problems reaching substantiated
PO2.
conclusions using first principles of mathematics, natural sciences, and engineering sciences.

Design solutions for complex engineering problems and design system components or processes that meet
PO3. the specified needs with appropriate consideration for the public health and safety, and the cultural,
societal, and environmental considerations.

Use research-based knowledge and research methods including design of experiments, analysis and
PO4.
interpretation of data, and synthesis of the information to provide valid conclusions.

Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including
PO5.
prediction and modeling to complex engineering activities with an understanding of the limitations.

Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal, and cultural
PO6.
issues and the consequent responsibilities relevant to the professional engineering practice.

Understand the impact of the professional engineering solutions in societal and environmental contexts,
PO7.
and demonstrate the knowledge of, and need for sustainable development.

Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering
PO8.
practice.
Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary
PO9.
settings.

Communicate effectively on complex engineering activities with the engineering community and with
PO10. society at large, such as, being able to comprehend and write effective reports and design documentation,
make effective presentations, and give and receive clear instructions.

Demonstrate knowledge and understanding of the engineering and management principles and apply these
PO11. to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary
environments.
Recognize the need for, and have the preparation and ability to engage in independent and life-long
PO12.
learning in the broadest context of technological change.

Program Outcome PO1 PO2 PO4 PO5 PO6 PO10

Mapped Course CO2 and
CO1 CO4 CO5 CO6 CO7 and CO8
Outcomes CO3
OOAD Experiments

Exp-1 This experiment is mapped to CO1 and CO8. Hence it attains the PO1 and PO10
Remaining Experiments This experiment is mapped to CO1, CO2, CO3, CO4, CO6 and CO8. Hence it attains the
PO1, PO2, PO4, PO6 and PO10

CN Experiments

Implement the following data link layer framing methods:
a. Character Count.
b. Character stuffing.
c. Bit stuffing
Design a program to compute checksum for the given frame
1101011011 with the generator Polynomial of CRC
Implement Dijkstra‘s algorithm to compute the Shortest
path through the following graph
Design a program to obtain routing table for each node
using distance vector routing algorithm by considering the
given subnet with weights indicating delay between nodes.
Write a java program to implement RPC (remote procedure
call).
Explain the Installation procedure of NS-2 on Windows
using VMware.
Creation of Link between nodes and transmission of data
between nodes using NS-2.
Mini project-1: Implement Dijkstra‘s algorithm to compute
the Shortest path using NS-2.
This experiment is mapped to CO1, CO2 and
CO8. Hence it attains the PO1, PO2 and PO10.
This experiment is mapped to CO1, CO2 and
CO8. Hence it attains the PO1, PO2 and PO10.
This experiment is mapped to CO1, CO3 and
CO8. Hence it attains the PO1,PO2 and PO10.
This experiment is mapped to CO1, CO3 and
CO8. Hence it attains the PO1, PO2 and PO10.
This experiment is mapped to CO1, CO2 and
CO8. Hence it attains the PO1, PO2 and PO10.
This experiment is mapped to CO5 and CO8.
Hence it attains the PO5 and PO10
This experiment is mapped to CO6 and CO8.
Hence it attains the PO6 and PO10
This experiment is mapped to CO7 and CO8.
Hence it attains the PO10