1
Course Title Computer Networks
Code IT-215, IT-216(Lab)
Credit hours 3+1
Prerequisite None
Category Major Course
Course Description Introduction and protocols architecture, basic concepts of
networking, network topologies, layered architecture, physical
layer functionality, data link layer functionality, multiple
access techniques, circuit switching and packet switching, LAN
technologies, wireless networks, MAC addressing, networking
devices, network layer protocols, IPv4 and IPv6, IP addressing,
sub netting, CIDR, routing protocols, transport layer protocols,
ports and sockets, connection establishment, flow and
congestion control, application layer protocols, latest trends in
computer networks
Lab Work: LAN Cabling using twisted pair, Internetworking
Devices orientation, LAN Designing, LAN Implementation,
Basic Trouble shooting, Utility Tools including (File Sharing,
Net sharing, Data Recovery, Ghost, partition Magic, Antivirus,
etc), Wireless LAN devices Orientation and WLAN
Implementation, Programming Exercises, basics of Simulation
tools, Exercises of Flow control, error control and network
design
• To provide students with a comprehensive introduction
to fundamental concepts of data communication and
Aims & Objectives
computer networks for building a sound foundation for
subsequent courses in the field of networking.
• To introduce the layered architecture approach with
reference to OSI Model.
• To examine the characteristics of different transmission
media.
To understand the basic encoding and modulation
techniques.
To understand various error detection, flow and error
control techniques.
To introduce basic network devices and LAN
technologies.
To provide fundamental concepts of switched networks.
3
To provide the IP addressing concepts and subnetting
skills.
To provide hands on experience of basic Computer
Utility Tools
To provide the necessary skills for LAN
implementation.
To provide basic introduction on Network Simulation
and Analysis Tools (Opnet, NS2…)
To provide basic concepts of System and Network
system and Network Programming.
Programming
Text Book A. Data
The Communications and Networking
students will have by of
a unified view Behrouz
data A.
Forouzan, Fifth Edition, Tata
communications McGraw-Hill
and computer companies
networks.
The students will be able to understand the layered
Reference Books & 1.S. Data and Computer Communications by William Stallings,
architecture approach with reference to OSI Model. The
Material Seventh Edition, Prentice Hall, 2004
students will be aware of the characteristics of different
2. Computer Networks by Andrew S. Tanenbaum, Third Edition
Prenticetransmission
Hall, 2003 media.
The
3. Computerstudents will have
Networking: the fundamental
A Top-Down knowledge
Approach Featuringofthe
encoding and modulation techniques.
Internet,
6th edition by James F. Kurose and Keith W. Ross
The Fundamentals:
4. Network students will beCCNA
able toExploration
understand Companion
various error
Guide,
detection,
ByMark flow and
DyePublishederror control
Cisco techniques.
Press, 2011 The
students will be able to distinguish between
different network devices.
Learning Outcomes
Grading Breakup and Assignment(s):
The students will have the basic concepts 10%of circuit and
Policy Quizzes:packet switched networks. 5%
Project: 10% IP
The students will have the ability of performing
Midtermaddressing
Examination:
and subnetting. 25%
Final Examination: 50%
The students will have hands on experience to use
different basic Computer utility Tools
Week# Lecture # TOPICS
The student will have Source Recommendations
able to implement a LAN
(Book, Chapter
including cabling, configuring the IP address, managing
for Learning
workgroup, and InternetNo)
sharing utilities.
The students will have basic how know ofActivities
Network
Simulation and Network Analysis Tools. (Mention
Assignments,
The students will have hands on experience of basicTest,
Case Study,
,
Projects, Lab Work
or Reading
Assignments)
01 01 Introduction to Data
Communications and Computer
Networks: B-1.1.
Data Communications,
Communication Tasks, Data
Representation (Text, Numbers,
Images, Audio, Video), Data
Flow (Simplex, Half Duplex, Full
Duplex)
02 Computer Networks: B-1.2,
4
Computer Networks, Network B-1.3
Criteria, Connection Types
Network Types, LAN (Wired and
Wireless LAN), WAN (Circuit
and Packet switch)
02 03 Protocols and Standards:
Protocols and Standards, Syntax,
Semantics, Timing, De facto, De
Jure, Some Standard B-1.5
Organizations
04 Protocol Layering: B-2.1
Principles of protocol layering,
Logical Connections, Layered B-2.2
Architecture
03 05 TCP/IP Protocol Suite: B-2.2 Assignment 1
Overview of TCP/IP Protocol B-2.3
Suite and Addressing, OSI model
06 Fundamentals of Data and B-3.1, Test 1
signals:
B-3.2,
Analog and Digital Data, Periodic
and Aperiodic Signals, Analog
Signals, Sine Wave, Peak
Amplitude, Period and
Frequency, Phase, Time and
Frequency Domains, Composite
Signals
04 07 Digital Signals:
Digital Signals, Bit Interval and
B-3.3
Bit Rate, Analog and digital
transmission, Treatment of
Signals, Comparison of Digital
and Analog Signals
08 Transmission Impairments:
Transmission Impairments,
5
Attenuation, Distortion, Noise B-3.4
and its Types, Channel Capacity,
B-3.5
Nyquist and Shannon Capacity
Formula, Data Rate Limits, B-3.6
Performance
05 09 Guided Transmission Media:
Twisted Pair, Coaxial Cable,
Physical Structure, Connector
Types, Applications B-7.1
Fiber Optic physical structure,
B-7.2
10 Guided and Unguided
Transmission media: B-7.2
Fiber Optic Propagation Modes,
Connector Types, Applications, B-7.3
Ground Propagation, Unguided
Propagation, Line of sight
Propagation, Wireless
Transmission Waves, Radio
Waves,
06 11 Unguided Transmission media:
Microwaves, Infrared, Omni
B-7.3
directional Antenna,
Unidirectional Antenna
12 Digital to Digital Conversion:
Digital Data, Digital Signals,
Line Coding, Unipolar, Polar,
Bipolar, Techniques B-4.1
NRZ-L, NRZI, Bipolar-AMI,
Pseudoternary, Manchester,
Differential Manchester
07 13 Analog to Digital Conversion: Assignment 2
Analog Data, Digital Signals,
Sampling, Pulse Amplitude
Modulation (PAM), Pulse Code B-4.2
Modulation (PCM), Delta
Modulation (DM)
14 Transmission Modes: Test 2
B-4.3
Parallel Transmission, Serial
Transmission, Asynchronous and
synchronous transmission
6
08 15 Digital to Analog Conversion:
Digital Data, Analog Signals, Bit
Rate and Baud Rate, Techniques,
Amplitude Shift Keying (ASK), B-5.1
Frequency Shift Keying (FSK),
Phase Shift Keying (PSK),
Quadrature Amplitude
Modulation (QAM)
16 Analog to Analog Conversion:
Analog Data, Analog Signals,
B-5.2
Amplitude Modulation,
Frequency Modulation, Phase
Modulation
Mid Term Exam
09 17 Multiplexing and its Types:
Frequency Division Multiplexing,
Time Division Multiplexing, B-6.1
Interleaving and Bit Padding
18 Switching Term Projects Topic
Circuit-Switched Networks Assigned
B-8.1
Datagram Networks
Virtual Circuit Networks B-8.2 B-8.3
10 19
Error Detection:
Types of Errors, Single bit and B-10.1
Burst Error, Parity Check (Single B-10.3
and Block Parity), Cyclic
Redundancy Check (CRC)
20 B-10.3 Assignment 3
Cyclic Redundancy Check (CRC)
, Checksum B-10.4
11 21 Multiplexing and its Types:
Frequency Division Multiplexing,
Time Division Multiplexing, B-6.1
Interleaving and Bit Padding
22 Flow and Error Control: B-11.1
Protocols of Noiseless and Noisy
B-11.2 Test 3
Channels
12 23 Internetworking Devices:
Hubs, Bridges, Switches, Routers
B-17.1
7
24 B-17.1
Internetworking Devices:
Routers, Overview of TCP/IP B-2.4
13 25 Internet Protocol (IP), B-19.1
Comparison of IPv4 and IPv6
Headers
26 IP Addressing:
Internet Address, Class full
Addressing, Classes and Blocks, B-18.3
Masking
B-18.3
14 27 Subnetting: Assignment 4
Subnetting, Classless Addressing,
Variable Length Blocks B-18.3
28 Process-to- Process
Communication:
B-24.1
Addressing at Transport Layer,
Connection Oriented Vs B-24.2
Connectionless Service, Reliable
Vs Unreliable, User Datagram
Protocol (UDP)
Process to Process
Communication B-24.3
29 Test 4
Transmission Control Protocol
15 (TCP)
B-25.1
Application Layer:
30 B-26.1
Client-Server Model , WWW
B-26.3
Application Layer:
31 B-26.6
DNS, Electronic Mail, FTP
16
Network Security Issues:
B-31
32 Basic overview of Cryptography
and Security in Internet
Final Exam
DATA STRUCTRES OUTLINE
8
itle Data Structures
Code IT-209
Credit Hours 4.0
Prerequisite IT-108 (Object Oriented Programming)
Instructor
“An apprentice carpenter may want only hammer and saw,
Aims and but a master craftsman employs many precision tools.
Objectives Computer programming likewise requires sophisticated tools
to cope with complexity of real applications and only practice
with these tools will build skill in their use. (Robert L. Kruse
Data Structure and Program Design)”. This subject deals to
make students convenient in building a memory and time
efficient data structures for the implementation of large-scale
(data intensive) computer systems.
Test Books 1. Classic Data Structures, Prentice Hall 2001, by D.
Samanta
Reference Books 1. Data Structure and Algorithms in C++, Benjamin-
Cummings Publishing Co., by Mark Allen Weiss
Assessment Criteria Sessional 25% Mid Final
25% 50%
Quizzes 5%
Assignments 10%
Presentation 10%
Sixteen-week lecture plan
9
Week Lecture Topic
1 Introduction to Data Structures
1
2 Big-Oh notation, Complexity Analysis
3 Arrays and Pointers
2
4 Abstract Data Types
5 Linked list implementation using pointers
3
6 Elementary data structures: Stack and Queues
7 Elementary data structures: Stack and Queues
4
8 Recursion
9
Trees: Tree Data StructureDefinition and Basic
Terminologies
5
10 Tree Traversal, Expression Trees
11 Binary Search Trees
6
12 AVL Trees
7 13 Huffman Coding
10
14 Red Black Trees
8 15, 16 MID Term Exam
17 B-Trees
9
18
Searching Techniques: Linear Search, Binary Search,
Interpolation Search
19 Hashing: Hash Function, Hash Table
10
20 Application of Hashing
21 Heap: Heap Data Structure, Min and Max Heap
11
22
Binary and Fibonacci Heaps, Priority Queue and Heap
Sort
23
Sorting Techniques: Bubble Sort, Selection Sort,
Insertion Sort
12
Sorting Techniques: Merge Sort, Quick Sort
24
Linear Time Sorting Techniques
25 Graphs: Basic Terminologies and Storing Graphs
13
26 Graphs: Breadth First and Depth First Traversal
27
Graphs: Minimum Spanning Trees (Prim’s and
Kruskal’s Algorithm)
14
28 Graphs: Shortest Path Algorithms
15 29 Graphs: Shortest Path Algorithms
11
30 Graphs: Topological Ordering
16 31,32 Revision of the Course
SOFTWARE REQUIREMENT ENGINEERING
Title Software Requirement Engineering
Code
Instructor
Name
3-0
Theory/week:
Weight 3 Cr. Hrs.
Contact Hours 3 Hrs.
Lectures: 2
Duration 1.5 Hrs.
Credit Hours
Prerequisite
Prerequisite o Students have concepts of computer science.
Skill/ o Students have Clear understanding of software
Knowledge/ development process o Concepts of programming language are
Understanding essential for developing Project.
Category IT-Supportive
1.Describe the requirements engineering process
2.Effectively analyze software requirements for the
development of cost-effective and efficient technical
solutions.
3.Prepare both functional and non-functional requirements
along with validation for a medium-size software system.
4.Document effective requirements in Software
Requirements
Course Goals Specification (SRS) using clear, unambiguous requirements.
12
Analysts and decision-makers in today's dynamic business
environment depend on the benefits of information to
effectively support their decision-making process. This
course provides the knowledge and skills for analysts,
developers and database developers to design and build
Statement of a functioning database application that assembles and
Course Need consolidates enterprise data for information analysis.
1.Describe the requirements engineering process
2.Effectively analyze software requirements for the
development of cost-effective and efficient technical
solutions.
3.Prepare both functional and non-functional requirements
along with validation for a medium-size software system.
4.Document effective requirements in Software
Learning Requirements
Outcomes Specification (SRS) using clear, unambiguous requirements
Introduction to Requirements Engineering, Software
Requirements, classification of requirements, Requirements
process, Levels/layers of requirements, Requirement
characteristics, Analyzing quality requirements, Software
requirements in the context of systems engineering,
Requirement evolution, requirement traceability, requirement
prioritization, trade-off analysis, risk analysis and impact analysis,
Requirement management, interaction between requirement and
architecture, Requirement elicitation, elicitation sources and
techniques, Requirement specification and documentation,
specification sources and techniques, Requirements validation
and techniques, Management of Requirements, Introduction to
Management, Requirements Management Problems , Managing
Requirements in an Acquisition Organization, Supplier
Organizations, Product Organizations, Requirements engineering
Syllabus for agile methods
Software Requirements, Wiegers K. &Beatty J., 3rd Ed. Microsoft
Press, 2013
2. Requirements Engineering, Elizabeth Hull, Ken Jackson and
Jeremy Dick. 3rd Ed, Springer-Verlag London Limited,
Text Book/s 2011.
Reference 3. Requirements Engineering and Management for Software
Books/Material Development Projects, Chemuturi M., Springer New York, 2013.
Instructional Lectures, case studies, Handouts, assignments etc
Aids/Resources
Assessment Sessional Mid Final Total
Criteria 25% 25% 50% 100%
Quizzes Paper: Paper
05 25 50
13
Project
10
Assignment and
Presentations
05
Project is the compulsory part of this Course.
Marks division for sectional or project may vary on the basis of
complexity of project or available time for project execution and
Recommendati documentation.
on s
Frame
work
Wee Lectur Topic (Book Recommendatio
k e - ns for Learning
Chapt Activities
er
No.
Sectio
n
No.)
Database Approach: Distribution of
• Introduction to Software Course Outline
Requirements Engineering Discuss its
• Software Requirements objective
(Non Functional Prerequisite Test
1 Requirements)
• Kinds of Software
• Requirements
(Non Functional, Domain,
Inverse, Design and
Implementation
1 2 Requirements)
Requirements
supplementary topics
Requirements from the
User/Customer’s
Perspective,
Issues Related to System
Contract Requirements
and
3 Requirements Problems
Processes
• Processes, Process Models
and
Requirement Engineering
Process (Cont.)
2 4 • Quality Measurements
14
Actors and Stakeholders in
the
Requirements
Engineering
Process, Process and
Process
Improvement for
Requirements
5 Engineering
Social and Cultural Issues
in
Requirements
3 6 Engineering
Requirements Elicitation
and
Problems During
Elicitation
Techniques, Basics of
Knowledge Acquisition,
Knowledge Acquisition
7 Techniques
Requirements Elicitation
Stages, Knowledge
Structuring Techniques
Recursive Relationship
4 8
Specific Elicitation
Techniques Including the
Interviewing, Scenarios,
9
5
• Prototyping and Participant
Observation
10 • Requirements Analysis,
Incomplete Requirements,
Inconsistent
11 requirements,
Analysis checklists
6 12
• Requirements Analysis and
Negotiation (Interaction
13 Matrices)
• Goal-oriented Requirements
7 14 Engineering
15
Mid Term Exam
• Requirements Validation
Techniques
• Requirements Management,
Stable and Volatile
17 Requirements
• Requirements
• Management,
• Requirements Identification
Techniques,
9 18 • Change Management
Writing Requirements,
Problems in the
Requirements Writing
Activities
19
Requirements Document,
Importance and Contents
of
10 20 Requirements Documents
Quality Attributes of
Requirements Documents
21
• Risk Analysis
• Impact Analysis
22
Use case Modleing
23
Use Cases Modeling (Case
Study)
12 24
• Software Modeling,
• Primary Aim of Modeling,
Modeling Techniques
25
13
16
• Software Modeling
(Cont.), Object-Oriented
Modeling Using UML
26
14
Requirement priorities
27
• Requirement Validation
28 • Validation Techniques
Market-driven and
Bespoke
RE
Requirement Management
29 Techniques
Requirement
15 30 Management Problems
Requirement Engineering
for
Agile Methods
31 Future of RE
16 32 Revision