Computer Communication & Networks

Slides:



Advertisements
Similar presentations
Introduction MUHAMMAD ALI BUTT Instructor (CIT), GTTI, Gulberg, Lahore, District Lahore Qualification & Experience Graduation from International Islamic.
Advertisements

ECE 355 Introduction to Computer Networks and Data Communications
CS 206 Introduction to Computer Science II 04 / 29 / 2009 Instructor: Michael Eckmann.
Text Classification: An Implementation Project Prerak Sanghvi Computer Science and Engineering Department State University of New York at Buffalo.
CS 206 Introduction to Computer Science II 12 / 10 / 2008 Instructor: Michael Eckmann.
Introduction to Software Engineering CS-300 Fall 2005 Supreeth Venkataraman.
Lossless Compression Multimedia Systems (Module 2 Lesson 3)
Computing Curriculum. 3 main strands: Digital Literacy Information Technology Computer Science.
Introduction CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Computer Networkers ~Connecting the World~ For: Mrs. Holder By: Andy Chmilenko November 2, 2005 TIKO0-A If you can read this, you are too close to the.
Information theory in the Modern Information Society A.J. Han Vinck University of Duisburg/Essen January 2003
CS2910 Week 1, Class 2 Today Announce Prof. Michael Vieau’s S-341 6p Thurs Wk 2 Assignment for tomorrow Data Encoding, Part 1 Parsing Data Muddiest Point.
Checksum Calculations
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Lampel ZIV (LZ) code The Lempel-Ziv algorithm is a variable-to-fixed length code Basically, there are two versions of the algorithm LZ77 and LZ78 are the.
1 Welcome to COE 431: Computer Networks Instructor: Wissam F. Fawaz Office 103, Bassil Bldg. Required.
Data Structures Dr. Abd El-Aziz Ahmed Assistant Professor Institute of Statistical Studies and Research, Cairo University Springer 2015 DS.
 Human language : commonly used to express feeling and understand what other people expression.  Computer language : are a languages by which a user.
 Programming methodology: ◦ is a process of developing programs that involves strategically dividing important tasks into functions to be utilized by.
King William High School. Cyber Security Curriculum 4 year high school curriculum Up to 5 technology certifications upon successful completion of each.
A Basic Computer System
AP Computer Science Principals Course Importance and Overview
CSE 489/589 Modern Networking Concepts
Advanced Computer Systems
Algorithms and Problem Solving
Topic: Programming Languages and their Evolution + Intro to Scratch
Compression & Huffman Codes
CSC 321: Data Structures Fall 2016
NETW 503:Internet Course Instructor : Tallal Elshabrawy
Deep learning David Kauchak CS158 – Fall 2016.
Cyclic Redundancy Check (CRC)
Lecture 7 Data Compression
Data Compression.
INTRODUCTION TO COMPUTERS
The Greedy Method and Text Compression
Slide design: Dr. Mark L. Hornick
Lecture 01: Introduction
Lecture 2 of Computer Science II
Virtual Hands-on Teaching
Introduction CSE 1310 – Introduction to Computers and Programming
Data Compression CS 147 Minh Nguyen.
Information and Communication Unit 5, Lesson 4 Explanation
INFS 2 h13attttttttttttttttttttttttttttt Network and Communications BOUNEDYEN SHANNAQ Room: 11G-3 Phone:
CS 5565 Network Architecture and Protocols
Checksum Calculations
COS 518: Advanced Computer Systems Lecture 12 Mike Freedman
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
Communication Networks NETW 501
Topic 3: Data Compression.
UNIT 3 CHAPTER 1 LESSON 4 Using Simple Commands.
Software Engineering Lecture #13.
CDA 3100 Spring 2010.
Syllabus – what will we cover?
Using Protocols in Computer Networks
Fundamentals of Data Representation
Algorithm Discovery and Design
Algorithms and Problem Solving
Title of Project Joseph Hallahan Computer Systems Lab
ONLINE SECURE DATA SERVICE
Slide design: Dr. Mark L. Hornick
INFS 277 Network and Communications BOUNEDYEN SHANNAQ Room: 11G-3 Phone:
CS2911 Week 2, Class 3 Today Return Lab 2 and Quiz 1
CDA 3100 Fall 2012.
COP3530- Data Structures Introduction
How to Market Yourself in 15 Seconds
Slide design: Dr. Mark L. Hornick
Thesis Presented By Mohammad Abul Kalam Azad C Shabbir Ahmad C Francis Palma Tony C Supervised by S. M. Kamruzzaman Assistant.
COMPUTER ORGANIZATION
William Stallings Computer Organization and Architecture 7th Edition
Getting Started with Microsoft Azure Machine Learning
Presentation transcript:

Computer Communication & Networks Intoduction Computer Communication & Networks Course Instructor: Mr. Asjad Amin Text Book: Computer Networks A Top-Down Approach Featuring Internet 3rd Edition By James F. Kurose && Keith W.Ross

Goals of The Course This course is to provide a combined applied/theoretical background in Data Communications & Networks, focusing the fundamentals of good science and creative engineering

Teaching Goals Prepare and Reward good students because Networks impact quality of life Unskilled practitioners are dangerous ! Skilled practitioners are valuable Improve the student skills in Network design & Analysis Molding the general minds to Engineering cat Amplifying IQ

Non Goals of the Course This course is not intended to Train you as a Network Administrator Focus on the implementation specifics of a particular Vendor Provide Cisco/Alcatel/3com/Novell certification But it may make these things easier to learn once you know the general principles and the “Big Picture”

Text Book Why this Text? In today's time this book is considered as one of the finest equipped with all the modern technology information Seven of the top 10 engineering universities of the world are using Kurose as Text Book

Text Book Stanford University (World Rank # 2) http://www.stanfordcourses.com/CS144 University of Michigan (World Rank # 4) http://irl.eecs.umich.edu/jamin/courses/eecs489/ University of California – Berkeley (World Rank # 5) http://inst.eecs.berkeley.edu/~ee122/fa08/ Harvard University (World Rank # 6) http://www.eecs.harvard.edu/cs143/ Georgia Institute Technology (World Rank # 7) http://www.ece.gatech.edu/academics/courses/course_outline.php?prmCourse=ECE3076 University of Texas – Austin (World Rank # 8) http://www.cs.utexas.edu/users/vin/Classes/CS386M-Fall04/ University of California – San Diego (World Rank # 9) http://ece-classweb.ucsd.edu/winter09/ece158a/info.htm

Slides Courtesy of Kurose & Ross Most of the Slides that will be used during the course are provided by Kurose & Ross

Data Communication Data Communication Data Compression Error Detection & Correction

Data Compression Objective: To reduce the size of data so that the usage of storage hardware could be made efficient There are a hundred of techniques used to achieve the above objective but for our course we will study just two of them. These are the two most commonly used Data Compression techniques

Data Compression These two techniques are Lempel-ZIV Algorithm Run Length Encoding

Lempel-ZIV Algorithm At start prefix = NULL Input = 101011011010101011 Divide the Input string into groups with each group containing A Prefix + one new bit At start prefix = NULL The first bit, a 1, has no predecessors, so it has a NULL prefix and one new bit itself 1,01011011010101011 Same goes for the 0 that follows since it can’t be expressed in terms of the only existing prefix 1,0,1011011010101011

Lempel-ZIV Algorithm Continuing in this way we eventually divide the whole string in groups 1,0,10,11,01,101,010,1011 Since we found 8 phrases, we will use a 3 bit code to label the null prefix & the first seven phrases (000,1) (000,0) (001,0) (001,1) (010,1) (011,1) (101,0) (110,1) Thus the coded version of Input String is Output = 00010000001000110101011110101101

Run Length Encoding Count + A bit Input = 11111111111110000000000000000011111 Divide the Input string into groups with each group containing Count + A bit This can be represented as (13,1) (17,0) (5,1) (01101,1) (10001,0) Output = 011011100010

Thank You