[go: up one dir, main page]

0% found this document useful (0 votes)
34 views10 pages

Net 102

The document outlines the outcomes-based syllabus for Computer Networks 2 (NET 102) at St. Louis College of Bulanao, detailing the vision and mission of the institution and the specific program outcomes for the Bachelor of Information Technology. It includes course outcomes, intended learning outcomes, course content, assessment methods, and references for the course. The syllabus emphasizes the development of both technical skills and ethical values in IT professionals.

Uploaded by

kingsleigh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views10 pages

Net 102

The document outlines the outcomes-based syllabus for Computer Networks 2 (NET 102) at St. Louis College of Bulanao, detailing the vision and mission of the institution and the specific program outcomes for the Bachelor of Information Technology. It includes course outcomes, intended learning outcomes, course content, assessment methods, and references for the course. The syllabus emphasizes the development of both technical skills and ethical values in IT professionals.

Uploaded by

kingsleigh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

ST.

LOUIS COLLEGE OF BULANAO


Bulanao, Tabuk City, Kalinga

COLLEGE OF INFORMATION AND COMPUTING SCIENCES

OUTCOMES-BASED SYLLABUS IN
Computer Networks 2
NET 102

Prepared by: Checked/Approved by:

STEVEN “KING” T. HERNAEZ THERESE GRAIL C. LAWAGAN, Ph.D.


Instructor/ Department Head Dean of Academics

Page 1
I. ST. LOUIS COLLEGE OF BULANAO VISION- MISSION

We, the Louisians, envision ourselves to be a Christ- centered community of PEACE for the good of our people and for the greater glory of God.
Therefore, we commit ourselves to promote:
Peace and Justice Consciousness,
Ecological and Cultural Awareness,
Academic Excellence and competence,
Christian Discipleship and Community Leadership,
Employability

II. INSTITUTION’S VISION AND MISSION

COLLEGE OF INFORMATION AND COMPUTING SCIENCES

The Bachelor of Information Technology program is envisioned as a Christ-centered, academically competent and culture-responsive community of Information Technology Specialist
committed to the formation and training of IT Specialist who are:

P – eace makers and peace builders in the work areas, in the community and in the nation;

E – cological, social and culture-responsive locally, regionally, nationally and globally;

A – cademically competent in the application, installation, operation, development, maintenance and administration, and familiar with hardware installation, operation, and
maintenance.

C – hristian leaders and discipline who are exemplars/ paragon of Christian values; and

E – ducationally and professionally responsible thus can be easily employed.

III. BSIT PROGRAM OUTCOMES


After finishing the BSIT Program the students should be able to:

PROGRAM OUTCOMES PERFORMANCE INDICATORS


KNOWLEDGE

Page 2
1. Define computer networks and describe their purpose
2. Describe network media and data transmissions
3. Explain network design and describe the various network topologies
4. Discuss local area network architectures
5. Discuss network protocols and network software
6. Describe the features of Windows servers
7. Describe the features of NetWare and Linux servers
8. Describe the issues involved in managing a local area network
9. Discuss wide area networks
10. Discuss the Internet and its tools
SKILLS
1. Interpret, design, plan, develop, implement, test and maintain information systems
2. Translate problems into programming language
3. Execute hardware and software installation, maintenance, development and administration.
4. Solve problems in relation to procedural programming
5. Translate manual business rules into automated transactions
ATTITUDE
1. Practice professional, responsible, ethical and inclusive requirement of the IT profession
2. Appreciate the computer programs, organization, architecture and its functions
VALUE
1. Model Christian leadership and discipleship to work areas and to the community.
2. Create an accurate, reliable and honest information system for the development of a business rule

IV. COURSE OUTCOMES

After finishing the course, the students should be able to:

Course Outcomes (CO) PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO13 PO14 PO15 PO16

Page 3
CO1- Define computer networks and
describe their purpose
CO2- Describe network media and data
transmissions

CO3- Explain network design and describe


the various network topologies

CO4- Discuss local area network


architectures

CO5- Discuss network protocols and


network software

CO6- Describe the features of Windows


servers

CO7- Describe the features of NetWare


and Linux servers

CO8- Describe the issues involved in


managing a local area network

CO9- Discuss wide area networks

CO10- Discuss the Internet and its tools

Legend:

L – Learned Outcomes (knowledge, skills, values) achieved in the subject

P – Practiced the learned outcomes (knowledge, skills, values)

Page 4
O – Opportunity to learn and practice knowledge, skills and values but not taught formally.

V. COURSE CODE: COURSE CODE: NSTP – CWTS II


VI. DESCRIPTIVE TITLE: NATIONAL SERVICE TRAINING PROGRAM - CIVIC WELFARE TRAINING SERVICE 1

This course sets the basic framework of service to the community and the Filipino people as the basis for all NSTP component courses. It emphasizes the values of honour and
excellence in the service of the people, and its consistent with the principles embodied in the NSTP IRR.

VII. COURSE CONTENT:


COURSE INTENDED LEARNING OUTCOME/S CONTENT Learning Activities/ ASSESSMENT TASK NUMBER OF Learning Resources/ Reference
(CILO) Strategies to (Main course HOURS Materials
After finishing the lesson, the students Accomplish the requirement & (54 hr/sem)
should be able to: CILO assessment method s/ TIME FRAME
tools)

 be aware of the SLCB Vision, Mission. Orientation:SLCB Vision – Mission; Question and Answer Recitation 1hr  Syllabus
Introduction of the course outline and major
 practice the expectations as presented in the
requirements for the whole semester.
course;

Lecture Quiz 3 hrs  Dix, Chap 1 (Section 1.3-1.4).


 Define what is Computer Computer Networks
Networks Research Written output

 Explain Data Communications Overview of Networking Lecture 2hrs  Read Shneiderman Chap. 6.
 Classify Computer Networks
Research

Page 5
 Describe Network Layered Models Network Models Lecture Recitation 3hrs  Read Shneiderman Chap. 2.
 Differentiate Connection Oriented and And supplemental Dix Chapt
Connectionless Services Demonstration Written output 7.
 Interpret The OSI Reference Model
 Interpret Layers In The OSI Model
 Classify The TCP/IP Reference Model
 Addressing Levels In TCP/IP Hands On activity (Comp.
Laboratory)

 Distinguish Analog and Digital Data Network Data and Signals Lecture 3hrs  Read Shneiderman Chap. 3
 Classify Interpret Periodic Analog
Signals Demonstration Hands On activity (Comp.
 Describe Digital Signals Laboratory)
 Interpret Transmission Impairment
 Identify Data Rate Limits
 Identify Network Performance
 Test Digital Transmission Digital Transmission Modes Lecture 3 hrs  Read Shneiderman Chap. 3
 Differentiate Digital Data Digital Signal
 Classify Modulation and Baud Rate Demonstration
 Identify Analog Data Digital Signal
 Pulse Code Modulation (PCM)
 Delta Modulation (DM)
 Explain Analog Transmission Analog Transmission Modes Lecture Recitation 3 hrs  Shneiderman Chapter 4-4.6
 Interpret Digital Data Analog Signal
 Amplitude Shift Keying (ASK) Demonstration Written output
 Frequency Shift Keying (FSK)
 Phase Shift Keying (PSK)
 Analog Data Analog Signal
 Amplitude Modulation Hands On activity (Comp.
 Frequency Modulation Laboratory)
 Phase Modulation
PRELIMS SUMMATIVE TEST 1hr TEST QUESTIONS FINALS SUMMATIVE TEST
 Explain Why Multiplexing? Multiplexing For Bandwidth Lecture Recitation 3  Read Shneiderman Chapter
 Frequency Division Multiplexing (FDM) Utilization 4.7 onward
 Wavelength Division Multiplexing Demonstration Written output
(WDM)
 Time Division Multiplexing (TDM)
PREVIEW
 Synchronous Time Division Hands On activity (Comp.

Page 6
Multiplexing Laboratory)
 Data Rate Management In TDM
 Statistical Time Division Multiplexing
 Transmission Media and Transmission Media Lecture Recitation 2  Read Chapter 10 in Dix.
Classifications
 Twisted Pair Demonstration Written output
 Coaxial Cable
 Optical Fiber
 Unguided Media
 Antennas
 Microwave Transmissions
 Broadcast Radio Transmissions
 Infrared Transmissions
 Wireless Propagation
 Introduction To Switching Networks Switched Networks Lecture Recitation 3  Read Shneiderman Chapter 8
PREVIEW
 Circuit Switching Networks Demonstration Written output
 Packet Switching Networks
 Datagram Networks
 Virtual Circuit Networks
Hands On activity (Comp.
Laboratory)

 Errors In Data Transmission Error Detection and Correction Lecture Demonstration 2  Read Shneiderman Chapter 8
 Error Detection
 Error Detection With Parity Check Demonstration
 Error Detection With Checksum
 Error Detection With CRC Modulo
 Error Detection With CRC Polynomial
 Error Correction PREVIEW
 Error Detection And Correction With
Hamming Code
 Framing In Data Link Control Data Link Control Lecture Demonstration 2 
 Character Or Byte Stuffing
 Bit Stuffing Demonstration
 Flow Control and Error Control
 Flow Control In Noiseless Channels
 Stop and Wait ARQ Flow Control
 Go Back N ARQ Flow Control
 Selective Retransmission ARQ Flow
Control

Page 7
 Sliding Window Flow Control
 Leaky Bucket Flow Control
 Token Bucket Flow Control
 High Level Data Link Control (HDLC)
 Introduction To Multiple Access Multiple Access Protocol Lecture Recitation 2 
Protocol PREVIEW
 ALOHA Random Access Protocol Demonstration Written output
 CSMA Random Access Protocol
 CSMA/CD Random Access Protocol
 CSMA/CA Random Access Protocol
 Reservation Control Access Protocol
 Polling Control Access Protocol
 Token Passing Control Access
Protocol
 Frequency Division Multiple Access
(TDMA)
 Time Division Multiple Access (TDMA)
 Code Division Multiple Access
(CDMA)
 Network Connecting Devices - Hubs Connecting LANs Lecture Written output 3 
And Repeaters
 Network Connecting Devices - Bridges Demonstration
 Network Connecting Devices -
Routers Hands On activity (Comp.
 Network Connecting Devices - Laboratory)
Gateways
 Backbone Networks
 Virtual LANs
MIDTERMS SUMMATIVE TEST 1hr TEST QUESTIONS FINALS SUMMATIVE TEST
 Satellite Networks Wireless WANs With Satellite Networks Lecture Recitation 2 
 Satellite Categories
Demonstration Written output

 Logical Addressing Using IPV4 Network Layer Logical Addressing Lecture Hands On activity (Comp. 2 
PREVIEW Laboratory)
 IPV4 Classful Addressing Demonstration
 IPV4 Classful Subnetting Demonstration
 IPV4 Classless Addressing
 IPV6 Addresses

Page 8
 Network Layer Routing Protocol Lecture Hands On activity (Comp. 3 
 Fixed and Static Routing Using Laboratory)
Bridges Demonstration
 Dynamic Routing Bellman Ford
Algorithm
 Routing Using Dijkstra’s Algorithm
 Domain Name System Lecture Recitation 3 
 Domain Name System (DNS)
Demonstration Written output

Research

Hands On activity (Comp.


Laboratory)

 Electronic Mail Lecture Recitation 3 


 Electronic Mail
 Simple Mail Transfer Protocol (SMTP) Demonstration Written output

Hands On activity (Comp.


Laboratory)

 Introduction to Cryptography Network Security With Cryptography Lecture Recitation 3 


 Symmetric and Asymmetric Key
Cryptography Demonstration Written output
 Symmetric Key Cryptography - Cipher
 Asymmetric Key Cryptography RSA

Hands On activity (Comp.


Laboratory)

FINALS SUMMATIVE TEST 1hr TEST QUESTIONS


VIII. . COURSE REQUIREMENTS

For the computation of the students’ respective grades, the following bases of evaluation shall be used:
1. Individual outputs
2. Exam
3. Portfolio

Page 9
4. Seeds/ seedlings
5. Attendance and Participation (Field Works)

X. REFERENCES:

Books:
T: Computer Networks, latest ed
by Andrew Tanenbaum. (T3: 3rd ed)

C4: Internetworking with TCP/IP vol 1


Principles, Protocols and Architectures by
Douglas E. Comer, 4th ed

BDC4: Business Data Communications, 4th


ed. by William Stallings

Data and Computer Communications


by William Stallings, 5th ed. (S4: 4th ed)

X. GRADING SYSTEM: Averaging

The grading system as indicated in the Teachers’ and Students’ Handbook is as follows:
PG=PCS + PT MG=MCS + MT MG=FCS + FT FG/Aver. =PG + MG + TGF
2 2 2 3

Legend:
PCS-Preliminary Class Standing MCS=Midterm Class Standing FCS= Final Class Standing
PT-Preliminary Test MT= Midterm Test FT= Final Test
PG-Preliminary Grade MG= Midterm Grade FG= Final Grade

Highest Grade: 100=96 Lowest Grade: 50-72=70

Page 10

You might also like