ENGG1015: Homework 3
|
|
- Allan Bruce
- 5 years ago
- Views:
Transcription
1 ENGG1015: Homework 3 Dr. Kenneth Wong / Dr. Hayden So Due: 5pm, Nov 24, 2010 Turn in your homework at boxes outside Rm712, CYC Building Question 1 Digital Logic 1 Simplify the following Boolean expressions using Boolean theorems. Verify your answer by deducing the Truth Table of the expressions before and after simplifications. You should express your answers in canonical sum-of-product form. (i) AB + A B (ii) A + B(A + B) (iii) (BC + AD)(AB + CD) (iv) A + B + CD + A + B + B + C D + AB + CD Question 2 Digital Logic 2 Simplify the following Boolean expressions using Karnaugh map. Show the K-map and how the cells are circled. Express your answer in canonical sum-of-product form. (i) AB + AB (ii) (A + B)(A + B) (iii) B + BC + ABC + AB + BC + AC (iv) (ABC + ABC + AB)(A B C + ABC)(A B C + ABC) [Hint: you do not need to expand the expression to use a K-map.] Question 3 Digital System Design This question is based on Exercise 2.24 from the textbook Digital design and computer architecture. A circuit has four inputs and two outputs. The inputs, A 3:0, represent a number from 0 to 15. Output P should be TRUE if the number is prime (0 and 1 are not prime, but 2, 3, 5, and so on, are prime). Output D should be TRUE if the number is divisible by 3. In other word, the number eleven is represented when A 3 = 1, A 2 = 0, A 1 = 1, A 0 = 1 is presented in the input. Give simplified Boolean equations and Truth Table for each output. Construct a circuit that takes the 4 inputs (A 3:0 ) and produces the outputs P and D using only 2-input gates. Question 4 Digital Image Transfer Performance You have a digital photo taken from a 10 megapixel digital camera. After some inspections, you found that the picture has an aspect ratio of 16:9 and contains only 9,960,336 pixels.
2 ENGG1015 Homework 3 Question 5 What is the size of the digital photo in the X and Y dimension? Further investigations found that the digital photo is stored as a bitmap file on the computer using 24-bit RGB color encoding. That is, each pixel is stored using 3 bytes, each representing one of the three primrary colors. Furthermore, 128 bytes of header information was stored in the beginning of the file to store meta information such as the colorspace of the image. Given the above information and the information from Part (a), what is the size of the digital photo in terms of number of bytes? You are now sending this picture to your friend over a network. The network has a guranteed throughput of 10 Mbytes/s, and a latency of 10 ms. How long does it take for the first byte to arrive at your friend? How long does it take for the entire file to be transferred over the network? Question 5 Network Performance Two computers, Computer A and Computer B, are connected through a direct network. This network has a maximum bandwidth of 10 Mbps, a fixed packet size of p bytes, and a fixed header size of h bytes. Assume that Computer A and Computer B are physically separated by 1200 km, about the distance from Hong Kong to Shanghai. Using the fact that the speed of light is roughly m/s, how long does it take the first bit of information from Computer A to arrive at Computer B? How long does it take one packet sent by Computer A to arrive completely at Computer B? Will your answer in be changed if Computer A is sending just 1 byte to Computer B? Part(d) What is the latency of the network. Part(e) In a packet switched network, bandwidth must be used up to transmit headers as well as the data payloads. The effective amount of data that can be sent through a network is therefore smaller than its stated bandwidth, and is called its througput. Given this definition, what is the theoretical maximum throughput that this network can transmit data at? Part(f) Your project partner wrote a piece of code that transmits a large file of (10000 p) bytes from Computer A to Computer B. As someone who dares not to make large moves, your project partner wrote the code such that each packet transmits exactly 1 byte of the file. Assuming packets can be transmitted on the network one right after each other, what is the throughput of transmitting the large file. EEE/ENGG1015/2010 Page 2 of 5
3 ENGG1015 Homework 3 Question 6 Part(g) Being someone who always like things big, you rewrote the code such that each packet transmits exactly p bytes. What is the throughput of transmitting the large file in this case? Part(h) There are two main applications planned to run between Computer A and B: (i) a multi-user online game, and (ii) large file transfers. Based on the results from the previous sections, explain how the following factors will affect the performance and user experience in the above two scenarios: p, h, the bandwidth of the network, and the speed of light. Question 6 1. Which of the following statement(s) about circuit switching is (are) correct? (i) Resources allocated for the connection must be shared among users. (ii) Performance is guaranteed for the data using the link. (iii) Connection setup is required before data transmission. B. (ii) and (iii) C. (i) and (iii) 2. Which of the following protocol layer is not needed in a router? A. Physical layer B. Link layer C. Network layer D. Transport layer 3. Which of the following statement(s) about mobile phone base station is(are) true? (i) When a mobile phone is turned on, it must associate itself with a base station. (ii) In a GSM system, adjacent cells usually communicate to mobile phones at different frequency channel. (iii) Base stations are connected to each other with special wireless channels. B. (i) and (ii) only C. (ii) and (iii) only 4. Which of the following layer is not part of the OSI network layer? A. Transport layer B. Presentation layer C. Web layer D. Link layer 5. Which of the following is a not a task of the TCP protocol? A. Provides reliable transmission B. Hides the details of the underlying network protocol from the upper layer. C. Provides state information about a connection D. Decrypt a packet 6. Which of the following information can be extracted from a TCP packet? (i) Ethernet address of the source computer (ii) Destination IP address (iii) HTTP command EEE/ENGG1015/2010 Page 3 of 5
4 ENGG1015 Homework 3 Question 7 A. (i) B. (iii) C. (i) and (ii) 7. Concerning the common wireless LAN standards, which of the following statement(s) is(are) true? (i) It can be considered as an application layer protocol. (ii) It uses a shared medium for physical connection (iii) It exhibits Hidden node and Exposed node problems that are not presented in wired network. B. (ii) only C. (ii) and (iii) 8. Based on the end-to-end argument, which entity in the network connection should be responsible to guarantee reliable communication between two end hosts? A. The end hosts B. The ISP that connects the end hosts to the Internet C. The routers between the hosts D. The end user 9. Which of the following are responsibilities of a network layer? (i) Provides services to the layer above. (ii) Provides services to the layer below. (iii) Utilizes services from the layer above. (iv) Utilizes services from the layer below. A. (i), (iii) B. (i), (iv) C. (ii), (iii) D. (ii), (iv) 10. When two end hosts A and B communicate with each other, the module in layer n in A always communicate with: A. the layers below n in B B. the layers above n in B C. the layer n in B D. any layer in B as long as the users request it. Question 7 Remember: this is an individual homework. You should be answering this question by yourself. What is your project group name? What is your project group number? In less than 200 words, describe how the Rube Goldberg machine you and your partners has built for the course works? Starting from the push button, how does it lead to the final popping of the balloon? In less than 300 words, describe your role in the project. What have you built? Which part of the design was your idea? Also, briefly explain how your group has divided the workload among the group members. EEE/ENGG1015/2010 Page 4 of 5
5 ENGG1015 Homework 3 Question 7 Part(d) Extra Credits Your answer to this question is not mandatory, but your comments will help us shape the future of this course and earn you some extra credits. (i) How do you like the project? (ii) Do you think it has helped you in understanding how basic electronic circuit works? (iii) Did you have fun in the project? (iv) Any suggestion on how the project can be improved in the future? EEE/ENGG1015/2010 Page 5 of 5
Computer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So
Computer Networks ENGG1015 1 st Semester, 2010 Hayden Kwok-Hay So Where are we in the semester? High Level Applications Systems Digital Logic Image & Video Processing Computer & Embedded Systems Computer
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationIntroduction to the Internet. Internet Basics. Back in time ARPANET 11/20/10 ENGG st semester, Hayden Kwok-Hay So
11/20/10 Introduction to the Internet ENGG1015 1st Semester, 2010 Hayden Kwok-Hay So 2 Internet Basics The Internet is a that connects millions of of computing devices throughout the world. The Internet
More informationMidterm Exam CSCE 232: Computer Networks Fall Instructions:
Midterm Exam CSCE 232: Computer Networks Fall 2007 Last Name: First Name: Student ID: Instructions: 1. This is a close-book and close-notes exam. 2. There are seven questions in total. The number of points
More informationA closer look at network structure:
T1: Introduction 1.1 What is computer network? Examples of computer network The Internet Network structure: edge and core 1.2 Why computer networks 1.3 The way networks work 1.4 Performance metrics: Delay,
More informationA graphical method of simplifying logic
4-5 Karnaugh Map Method A graphical method of simplifying logic equations or truth tables. Also called a K map. Theoretically can be used for any number of input variables, but practically limited to 5
More informationCombinational Logic Circuits
Chapter 3 Combinational Logic Circuits 12 Hours 24 Marks 3.1 Standard representation for logical functions Boolean expressions / logic expressions / logical functions are expressed in terms of logical
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 Networking Introduction Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) Computer Networking A background of important areas
More informationCh. 5 : Boolean Algebra &
Ch. 5 : Boolean Algebra & Reduction elektronik@fisika.ui.ac.id Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
More informationChapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic
More informationEEE130 Digital Electronics I Lecture #4_1
EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form
More informationInternet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!
cs10.berkeley.edu CS10 : Beauty and Joy of Computing Internet II!!Senior Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia CS10 L17 Internet II (1)! Why Networks?! Originally sharing I/O devices
More informationGate Level Minimization
Gate Level Minimization By Dr. M. Hebaishy Digital Logic Design Ch- Simplifying Boolean Equations Example : Y = AB + AB Example 2: = B (A + A) T8 = B () T5 = B T Y = A(AB + ABC) = A (AB ( + C ) ) T8 =
More informationIntroduction to the Internet
Introduction to the Internet CCST9015 8 th Sep, 2010 Dr. Hayden Kwok-Hay So Department of Electrical and Electronic Engineering 2 Internet in 2003 3 Internet Basics The Internet is a network that connects
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
More informationSummary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
More informationCombinational Circuits Digital Logic (Materials taken primarily from:
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
More informationBasics of datacommunication
Data communication I Lecture 1 Course Introduction About the course Basics of datacommunication How is information transported between digital devices? Essential data communication protocols Insight into
More informationIntroduction to Information Science and Technology 2017 Networking II. Sören Schwertfeger 师泽仁
II Sören Schwertfeger 师泽仁 Outline Review Network Layer Routing Transport Layer Applications HTTP Demos Internet: Huge network of networks Billions of hosts (computers) Internet Structure Network Edge:
More informationCSCI4211: Introduction to Computer Networks Fall 2017 Homework Assignment 1
CSCI4211: Introduction to Computer Networks Fall 2017 Homework Assignment 1 Due 11:59pm Friday October 6 Instructions: 1. Please submit your homework using the on-line electronic submission system (via
More informationPLEASE READ CAREFULLY BEFORE YOU START
Page 1 of 11 MIDTERM EXAMINATION #1 OCT. 16, 2013 COMPUTER NETWORKS : 03-60-367-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Fall 2013-75 minutes This examination
More informationComputer Networks (Fall 2011) Homework 2
5-744 Computer Networks (Fall 20) Homework 2 Name: Due: Oct. 2th, 20, 3:00PM (in class) Andrew ID: October 2, 20 A Short Questions. Which of the following is true about modern high-speed routers? A. A
More informationOperating Systems CS 571
Computer Networks: Overview Operating Systems CS 571 Network types Range Bandwidth (Mbps) Latency (ms) LAN 1-2 kms 10-1000 1-10 WAN worldwide 0.010-600 100-500 MAN 2-50 kms 1-150 10 Wireless LAN 0.15-1.5
More informationHomework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca
CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?
More informationRouter Router Microprocessor controlled traffic direction home router DSL modem Computer Enterprise routers Core routers
Router Router is a Microprocessor controlled device that forwards data packets across the computer network. It is used to connect two or more data lines from different net works. The function of the router
More informationECS 152A Computer Networks Instructor: Liu. Name: Student ID #: Final Exam: March 17, 2005
ECS 152A Computer Networks Instructor: Liu Name: Student ID #: Final Exam: March 17, 2005 Duration: 120 Minutes 1. The exam is closed book. However, you may refer to one sheet of A4 paper (double sided)
More information(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker
Code No: N0421/R07 Set No. 1 IV B.Tech I Semester Supplementary Examinations, March 2013 COMPUTER NETWORKS ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationDigital Logic Lecture 7 Gate Level Minimization
Digital Logic Lecture 7 Gate Level Minimization By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. K-map principles. Simplification using K-maps. Don t-care
More informationThere are 10 questions in total. Please write your SID on each page.
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 to the Final: 5/20/2005 There are 10 questions in total. Please write
More informationIntroduction to computer networking
edge core Introduction to computer networking Comp Sci 3600 Security Outline edge core 1 2 edge 3 core 4 5 6 The edge core Outline edge core 1 2 edge 3 core 4 5 6 edge core Billions of connected computing
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
More informationprecise rules that govern communication between two parties TCP/IP: the basic Internet protocols IP: Internet protocol (bottom level)
Protocols precise rules that govern communication between two parties TCP/IP: the basic Internet protocols IP: Internet protocol (bottom level) all packets shipped from network to network as IP packets
More informationProblem-1: Solution-1:
Problem-1: olution-1: Tollbooths are 75 km apart, and the cars propagate at 100km/hr. A tollbooth services a car at a rate of one car every 12 seconds. a) There are ten cars. It takes seconds, or 2 minutes,
More informationHomework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15
ECE374: Homework 4 1 Homework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15 Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can
More informationLecture 2: Internet Structure
Lecture 2: Internet Structure COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W. Ross,
More informationQuestion Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100
NAME: Login name: Computer Science 461 Midterm Exam March 10, 2010 3:00-4:20pm This test has five (5) questions. Put your name on every page, and write out and sign the Honor Code pledge before turning
More informationDKT 122/3 DIGITAL SYSTEM 1
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
More informationCSCD 433/533 Advanced Networks
CSCD 433/533 Advanced Networks Lecture 2 Network Review Winter 2017 Reading: Chapter 1 1 Topics Network Topics Some Review from CSCD330 Applications Common Services Architecture OSI Model AS and Routing
More informationCSEN 503 Introduction to Communication Networks
CSEN 503 Introduction to Communication Networks 1-1 Mervat AbuElkheir Hana Medhat Ayman Dayf ** Slides are attributed to J. F. Kurose People and Resources 1-2 Course Name Introduction to Communication
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
More informationSimplification of Boolean Functions
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean
More informationIP Packet Switching. Goals of Todayʼs Lecture. Simple Network: Nodes and a Link. Connectivity Links and nodes Circuit switching Packet switching
IP Packet Switching CS 375: Computer Networks Dr. Thomas C. Bressoud Goals of Todayʼs Lecture Connectivity Links and nodes Circuit switching Packet switching IP service model Best-effort packet delivery
More informationAssignment #1. Csci4211 Spring Due on Feb. 13th, Notes: There are five questions in this assignment. Each question has 10 points.
Assignment #1 Csci4211 Spring 2017 Due on Feb. 13th, 2017 Notes: There are five questions in this assignment. Each question has 10 points. 1. (10 pt.) Describe the special properties of the following transmission
More informationTCP/IP protocol suite
TCP/IP protocol suite The TCP/IP protocol suite was developed prior to the OSI model. Therefore, the layers in the TCP/IP protocol suite do not match exactly with those in the OSI model. The original TCP/IP
More informationDigital Logic Design (3)
Digital Logic Design (3) ENGG1015 1 st Semester, 2010 Dr. Kenneth Wong Dr. Hayden So Department of Electrical and Electronic Engineering Last lecture ll logic functions can be represented as (1) truth
More informationLecture 2. Computer Networks Models. Network Models 1-1
Lecture 2 Computer Networks Models Network Models 1-1 Agenda Introduction to the Internet Reference Models for Computer Networks The OSI Model The TCP/IP Model Network Models 1-2 Announcements Bonus -
More informationAnnouncements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:
Announcements TAs office hours: Mohamed Grissa: grissam@oregonstate.edu Tuesday: 4-5 Friday: 11-12 Mohamed Alkalbani: alkalbmo@oregonstate.edu Wednesday: 11-12 Thursday: 11-12 Lecture slides: Will be posted
More informationEECS 122: Introduction to Communication Networks Final Exam Solutions
EECS 22: Introduction to Communication Networks Final Exam Solutions Problem. (6 points) How long does it take for a 3000-byte IP packet to go from host A to host B in the figure below. Assume the overhead
More informationObjectives: (1) To learn to capture and analyze packets using wireshark. (2) To learn how protocols and layering are represented in packets.
Team Project 1 Due: Beijing 00:01, Friday Nov 7 Language: English Turn-in (via email) a.pdf file. Objectives: (1) To learn to capture and analyze packets using wireshark. (2) To learn how protocols and
More informationClass Overview. CSE 123b Communications Software. Some hints. Some hints (2) Administrativa. Course material. Winter 2002
CSE 123b Communications Software Winter 2002 Lecture1: I ntroducti on & Re vi e w Stefan Savage Class Overview Course Material Class lectures, textbook readings, and handouts Course Assignments Homework
More informationCS321: Computer Networks Introduction to Computer Networks and Internet
CS321: Computer Networks Introduction to Computer Networks and Internet Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in What is Data Communication? Data communications
More informationCOMP 361 Computer Communications Networks. Fall Semester Final Examination: Solution key
COMP 361 Computer Communications Networks all Semester 2003 inal Examination: Solution key Date: Dec 15, 2003, ime 8:30am - 11:30am, venue Rm 3007 Name: Student ID: Email: Instructions: 1. his examination
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationECE 653: Computer Networks Mid Term Exam all
ECE 6: Computer Networks Mid Term Exam 16 November 004. Answer all questions. Always be sure to answer each question concisely but precisely! All questions have points each. 1. What are the different layers
More informationExperiment 3: Logic Simplification
Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions
More information4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)
COP 273, Winter 26 Exercises 2 - combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic
More information5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI UNIT I FUNDAMENTALS AND LINK LAYER PART A
5105: BHARATHIDASAN ENGINEERING COLLEGE NATTARMPALLI 635 854. NAME OF THE STAFF : R.ANBARASAN DESIGNATION & DEPARTMENT : AP/CSE SUBJECT CODE : CS 6551 SUBJECT NAME : COMPUTER NETWORKS UNIT I FUNDAMENTALS
More informationSchool of Engineering Department of Computer and Communication Engineering Semester: Fall Course: CENG415 Communication Networks
School of Engineering Department of Computer and Communication Engineering Semester: Fall 2012 2013 Course: CENG415 Communication Networks Instructors: Mr Houssam Ramlaoui, Dr Majd Ghareeb, Dr Michel Nahas,
More informationComponent 4: Introduction to Information and Computer Science
Component 4: Introduction to Information and Computer Science Unit 7: Networks & Networking (Part 5 of 5) Unit Objectives Understand the history of networks and their evolution. List and describe the various
More informationWelcome to: Computer Science 457 Networking and the Internet. Fall 2014 Dr. Joseph Gersch
Welcome to: Computer Science 457 Networking and the Internet Fall 2014 Dr. Joseph Gersch 1 Administrivia Website: http://www.cs.colostate.edu/~cs457 For both local and remote students Syllabus, Outline,
More information9. Wireshark I: Protocol Stack and Ethernet
Distributed Systems 205/2016 Lab Simon Razniewski/Florian Klement 9. Wireshark I: Protocol Stack and Ethernet Objective To learn how protocols and layering are represented in packets, and to explore the
More informationData & Computer Communication
Basic Networking Concepts A network is a system of computers and other devices (such as printers and modems) that are connected in such a way that they can exchange data. A bridge is a device that connects
More informationSince enrollment is very small this semester, we have flexibilty. Traditional lecture Assigned reading, and then student(s) present during class time
Syllabus You can go to cs.rpi.edu and then Faculty and my website from my profile Or you can go to www.cs.rpi.edu/~holzbh Or to be very direct, you can go to www.cs.rpi.edu/~holzbh/ccn18/index.php 1 Textbook
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationCHAPTER 2 - NETWORK DEVICES
CHAPTER 2 - NETWORK DEVICES TRUE/FALSE 1. Repeaters can reformat, resize, or otherwise manipulate the data packet. F PTS: 1 REF: 30 2. Because active hubs have multiple inbound and outbound connections,
More informationCS 43: Computer Networks The Link Layer. Kevin Webb Swarthmore College November 28, 2017
CS 43: Computer Networks The Link Layer Kevin Webb Swarthmore College November 28, 2017 TCP/IP Protocol Stack host host HTTP Application Layer HTTP TCP Transport Layer TCP router router IP IP Network Layer
More informationHomework 1 50 points. Quantitative Comparison of Packet Switching and Circuit Switching 20 points Consider the two scenarios below:
Homework 1 50 points Quantitative Comparison of Packet Switching and Circuit Switching 20 points Consider the two scenarios below: A circuit-switching scenario in which Ncs users, each requiring a bandwidth
More informationECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8- Terminology For
More informationCOMS Introduction to Computers. Networking
COMS 1001 Introduction to Computers Networking What's Ahead Networking layers Network Speeds Protocols, sockets, client/server Routing, DNS, Ethernet, LANs, wireless What is a Network? Loose definition:
More informationLinks Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame
Links Reading: Chapter 2 CS 375: Computer Networks Thomas Bressoud 1 Goals of Todayʼs Lecture Link-layer services Encoding, framing, and error detection Error correction and flow control Sharing a shared
More informationChapter 3. Gate-Level Minimization. Outlines
Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level
More informationLink Layer and Ethernet
Link Layer and Ethernet 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross traceroute Data Link Layer Multiple
More informationNetworks Homework # 2
ISLAMIC UNIVERSITY OF GAZA COMPUTER ENGINEERING DEPARTMENT Networks Homework # 2 INSTRUCTIONS: 1. Show your work (i.e., how you derived your answer or the reason behind your thinking) in addition to your
More informationModule -7. Karnaugh Maps
1 Module -7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM)
More informationCombinational Logic Circuits Part III -Theoretical Foundations
Combinational Logic Circuits Part III -Theoretical Foundations Overview Simplifying Boolean Functions Algebraic Manipulation Karnaugh Map Manipulation (simplifying functions of 2, 3, 4 variables) Systematic
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 36 I/O : Networks 2008-04-25 TA Brian Zimmer CS61C L36 I/O : Networks (1) inst.eecs/~cs61c-th NASA To Develop Small Satellites NASA has
More informationL1: Introduction. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
L1: Introduction Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 8/15/2016 CSCI 445 Fall 2016 1 Acknowledgements Some pictures used in this presentation
More informationFinite Math - J-term Homework. Section Inverse of a Square Matrix
Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse
More information70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET
70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET one of these packets arrives to a packet switch, what information in the packet does the switch use to determine the link onto which the packet is forwarded?
More informationCSCI 466 Midterm Networks Fall 2011
CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationProblem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.
Problem Set 1 1. Why do we use layering in computer networks? 2. Name the 7 OSI layers and give the corresponding functionalities for each layer. 3. Compare the network performance of the 3 Multiple Access
More informationBOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.
COURSE / CODE DIGITAL SYSTEMS FUNDAMENTAL (ECE 421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE 422) BOOLEAN ALGEBRA Boolean Logic Boolean logic is a complete system for logical operations. It is used in countless
More informationNET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17
CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17 Q1. 2 points Write your NET ID at the top of every page of this test. Q2. X points Name 3 advantages of a circuit network
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 17: Internet architecture Prof. Alan Mislove (amislove@ccs.neu.edu) Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion
More informationLinks. CS125 - mylinks 1 1/22/14
Links 1 Goals of Today s Lecture Link-layer services Encoding, framing, and error detection Error correction and flow control Sharing a shared media Channel partitioning Taking turns Random access Shared
More informationPLEASE READ CAREFULLY BEFORE YOU START
MIDTERM EXAMINATION #1 NETWORKING CONCEPTS 03-60-367-01 U N I V E R S I T Y O F W I N D S O R - S c h o o l o f C o m p u t e r S c i e n c e Intersession 2009 Question Paper NOTE: Students may take this
More informationOperating Systems. 16. Networking. Paul Krzyzanowski. Rutgers University. Spring /6/ Paul Krzyzanowski
Operating Systems 16. Networking Paul Krzyzanowski Rutgers University Spring 2015 1 Local Area Network (LAN) LAN = communications network Small area (building, set of buildings) Same, sometimes shared,
More informationChapter 1 Introduction
Emerging multimedia, high-speed data, and imaging applications are generating a demand for public networks to be able to multiplex and switch simultaneously a wide spectrum of data rates. These networks
More informationCSE3213 Computer Network I
CSE3213 Computer Network I Introduction Course page: http://www.cse.yorku.ca/course/3213 1 Course Contents 3 general areas: data communications, networking, and protocols 1. Data communications: basic
More informationComputer Science 461 Midterm Exam March 14, :00-10:50am
NAME: Login name: Computer Science 461 Midterm Exam March 14, 2012 10:00-10:50am This test has seven (7) questions, each worth ten points. Put your name on every page, and write out and sign the Honor
More informationExample Networks and the Physical Layer. CS158a Chris Pollett Feb 5, 2007.
Example Networks and the Physical Layer CS158a Chris Pollett Feb 5, 2007. Outline Example Networks The Physical Layer Architecture of the Internet Last day, we looked at two network which led up to the
More informationChapter 1. Computer Networks and the Internet
Chapter 1 Computer Networks and the Internet Internet traffic What s the Internet? (hardware) PC server wireless laptop cellular handheld wired links millions of connected computing devices: hosts = end
More informationSpecifying logic functions
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 5 & 6 Minimization with Karnaugh Maps Karnaugh maps lternate way of representing oolean function ll rows
More informationDefining the Internet
Defining the Internet Daniel Zappala CS 460 Computer Communications and Networking Brigham Young University What is the Internet? 2/23 Internet Map, courtesy Barrett Lyon, 2003 What is the Internet? 3/23
More informationModule 2 Overview of Computer Networks
Module 2 Overview of Computer Networks Networks and Communication Give me names of all employees Who earn more than $00,000 ISP intranet backbone satellite link desktop computer: server: network link:
More informationModule 2 Overview of. Computer Networks
Module Overview of Networks and Communication Give me names of all employees Who earn more than $00,000 ISP intranet backbone satellite link desktop computer: server: network link: CS454/654 - Issues How
More informationA B AB CD Objectives:
Objectives:. Four variables maps. 2. Simplification using prime implicants. 3. "on t care" conditions. 4. Summary.. Four variables Karnaugh maps Minterms A A m m m3 m2 A B C m4 C A B C m2 m8 C C m5 C m3
More informationAssignment (3-6) Boolean Algebra and Logic Simplification - General Questions
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
More informationECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ECPE / COMP 177 Fall 2014 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Instructor: Dr. Jeff Shafer Email: jshafer at pacific dot edu Office: Anderson 205 Office hours (posted on
More information