Header Linked Lists:
A header linked list is a linked list which always contains a special node, called the header node,
at the beginning of the list.
The following are two kinds of widely used header lists:
A Grounded header list is a header list where
COMPUTER
NETWORK
CEN 345
Ms. Noorah
Alghasham
1
1. Network Operating System.
2. Network Protocols.
3. IP addresses and subnetting.
Lab 2
2
Network Operating System
Unlike operating systems, such as Windows, that are designed for
single users to control o
LAB8:FileTransferProtocol(FTP)
Objectives
Configure FTP Services on Servers
Upload a File to the FTP Server
Download a File from the FTP Server
Part I:
The File Transfer Protocol (FTP) is a standard network protocol used to transfer
computer files from on
LAB 3
Operating Systems and LAN Implementation
Objective
1. Introduction to Windows 7 operating systems.
2. Creating accounts and changing passwords.
3. Manually configure TCP/IP.
4. Use the IPCONFIG utility to view configured IP.
5. Use the PING utility
LAB 4: Introduction to Packet Tracer and Simple 2 PC
network.
Objectives:
Learn Packet Tracer to design and simulate networks.
Learn to create a simple LAN with two PCs using an Ethernet hub and two straight-through
cables to connect the workstations.
LAB 7: Virtual Local Area Network (VLAN)
Objectives:
Create a Virtual LAN (VLAN).
Part I: VLAN
A single network may be partitioned to create multiple distinct broadcast
domains, which are mutually isolated so that the computers in one domain ca
LAB 5: Dynamic Host Control Protocol (DHCP) and Domain
Name System (DNS)
Objectives:
Learn Packet Tracer to design and simulate networks.
Learn to configure DHCP server and a DNS server.
Introduction :
Dynamic Host Control Protocol (DHCP) server is used
COMPUTER
NETWORK
CEN 345
Ms. Noorah
Alghasham
1
Laboratory Assessment:
Overall mark of course laboratory is 20 marks, this marks
distributed as following:
5 marks: lab evaluation.
5 marks: assignment or short quiz.
10 marks: lab quiz.
2
Contact
Email:
LAB 6: Router, Switch and Wireless Network
Objectives:
To become familiar with the switches and routers used in the lab.
Design wired and wireless network.
Connect two networks.
Part I: Router & Switch
Before we start our Lab, please watch this video H
GRAPHIC OUTPUT PRIMITIVES
OUTPUT PRIMITIVES
Output Primitives: Basic geometric
structures (points, straight line segment,
circles and other conic sections, quadric
surfaces, spline curve and surfaces,
polygon color areas, and character
strings)
These pi
BRESENHAMS MID POINT ALGORITHM
MID POINT CIRCLE ALGORITHM
If the points is in the interior
of the circle, the circle function
is negative.
If the point is outside the circle,
the circle function is positive.
To summarize, the relative position of any p
Graphics Hardware
Graphics hardware is used on most PCs now
Dedicated hardware 2D and 3D graphics processing
unit (GPU)
GPUs highly parallel structure : up to 320 stream
processors
Output devices
Stereoscopic viewing glasses: the user wears them to
perce
BRESENHAMS ALGORITHM
BRESENHAMS LINE ALGORITHM
A highly efficient incremental method for scan
converting lines. Using only incremental integer
calculation. The vertical axis shows scan line position
and horizontal axis identify pixel columns. sampling
at
The
purpose of a color model is to allow convenient
specification of colors within some color gamut.
Color Gamut is Range of color that can be produced
on a device
The hardware-oriented color models are RGB (CRT
monitors), YIQ (broadcast TV color system
Computer College, Department of Computer Science, Kingdom of Saudi Arabia
INSTRUCTOR:
Shahid Iqbal Lone
e_mail: [email protected]
COURSE BOOK:
1. Tanenbaum Aaron M, Langsam Yedidyah, Augenstein J Moshe, Data Structures
using C.
LIST OF REFERENCE MATERI
Computer College, Department of Computer Science, Kingdom of Saudi Arabia
INSTRUCTOR:
Shahid Iqbal Lone
e_mail: [email protected]
COURSE BOOK:
1. Seymour Lipschutz, Theory and Problems of data Structures, Schaums
Series, Tata McGraw Hill, 2004.
LIST OF
by
Shahid Iqbal Lone
Lecturer
Qassim University
KINGDOM OF SAUDI ARABIA
Qassim University
College Of Computer
Sr. No.
Description
Page
No.
1
2
3
4
5
6
Lab. Work Objectives
Array, Traversing an Array Algorithm
Insertion into Sorted Linear Array (Algorithm)
Chapter 5
Control Statements
Java How to Program, 9/e
1
Control Structures
All programs can be written in terms of only three
control structures:
1) sequence structure
2) selection structure
3)repetition structure.
2
Control Structures (Cont.)
1) Sequ
Discrete Structure
For Computer Sciences
Ch. 1
Introduction To
Discrete Mathematics
Introduction
Many
concepts and techniques from
mathematics are useful for solving problems
in computer science.
Our purpose in this course is to discuss the
nature of di
Discrete Structure
For Computer Sciences
CH. 3
Functions
Functions
The
subject of this section is special kind of relations called
functions.
A function from set A to set B is a relation F between A and B
satisfying two additional conditions:
a. for all
Discrete Structure
For Computer Sciences
CH. 5
Undirected Graphs
Introduction
In a mathematician's terminology, a graph is a
collection of points and lines connecting some
(possibly empty) subset of them. The points of a
graph are most commonly known as g
Discrete Structure
For Computer Sciences
CH. 5
Directed Graphs
Introduction
In this chapter, we cover the fundamental concepts of directed
graphs or digraphs.
Digraphs are useful models in situation where there is an
ordering between objects say, in time
Discrete Structure
For Computer Sciences
Ch. 2
Logic & Sets
Introduction
Set theory forms the second half of the foundation of our
study of discrete mathematics.
A Set is a collection of objects, which are called the Elements
of the set. Thus, sets are c
Discrete Structure
For Computer Sciences
Ch. 2
Logic & Sets
Introduction
The use of logic is essential in any discipline
that is a formal science.
Logic is directly applicable to the design and
verification of algorithms, to the design
circuits logic cir
Discrete Structure
For Computer Sciences
CH. 3
Relations & Functions
Introduction
Typical comparisons using such words as bigger,
better, and faster are assertions about relationships
between two objects.
This chapter contains a formal treatment of relati
Discrete Structure
For Computer Sciences
Ch. 2 Application
A Look at Knowledge Based System
Introduction
Researchers
in the field of artificial intelligence (AI) within
computer science have long held the hope that computers could
be made to behave more
Discrete Structure
For Computer Sciences
Ch. 1
Introduction To
Discrete Mathematics
Introduction
Many concepts and techniques from
mathematics are useful for solving problems
in computer science.
Our purpose in this course is to discuss the
nature of dis
Discrete Structure
For Computer Sciences
CH. 5
Trees
Introduction
Trees
as data structures are useful for solving a variety of
different kinds of problems. They have many application in
computer areas.
A tree is a special type of a simple graphs which hav