159.342 Final Exam Coverage (2022)
The exam is an Open Book Time-Constrained Assessment and will be conducted online (via our Stream website). No part of the examination may be captured, retained or shared for any purpose other than completing and submitting the questions and answers for marking. Doing so would constitute cheating and appropriate penalties will apply.
To help the class focus their preparation for the exam, I would like to identify some of the topics we have covered, especially those that require computations.
The exam type is a combination of fill-in the blanks and multiple-choice types, and the class will be given 3 hours to complete it.
Copyright By PowCoder代写 加微信 powcoder
Some exam questions will involve hand-simulation of the different protocols and algorithms that we have covered in the course, and so it would be good to do some practice, solving those examples provided in the lectures/tutorials, to prepare for the exam. On the other hand, some questions will involve basic concepts, architectures, and terminologies. No actual programming is required in the exam, but questions may involve socket functions, their purpose and relation to networking technologies and protocols.
To get acquainted with how questions are typically formulated, have a look at the past exams (from 159334 and 159335) posted in this section. Take note that 159.342 contains a selection of topics from 159334 and 159335, but not all of them are covered. The scope of the exam is only up to what was covered in the lectures. Our final exam will be comprised of a combination of multiple-choice and fill-in the blank types of questions. I am providing herewith a list of topics that are within the scope of our exam. I have highlighted (in blue) those topics that involve some algorithms/protocols, thus requiring some computations.
MAIN TOPICS
1. Introduction to Networking
· Packet Switching vs. Circuit Switching
· Network delays, Physical Media
· Protocol Stack
2. Operating Systems Foundation
· Processes, Layout of a process in memory, PCB
· Memory, I/O devices, DMA, Interrupts
· Computer System Organisation
3. Application Layer
· Socket Programming (TCP, UDP)
4. Transport Layer
· Reliable data transfer Protocols – see the interactive applets (https://wps.pearsoned.com/ecs_kurose_compnetw_6/216/55463/14198702.cw/index.html)
i. Stop-and-wait protocol
ii. Go Back N protocol
iii. Selective Repeat protocol
· TCP Sequence numbers and Acknowledgements- see sample computations in our lecture
· TCP Flow Control
· TCP Congestion Control
5. Network Security
· RSA – see sample computations in our lecture
i. Computing for the private and public keys
ii. Euclidean Algorithm
iii. Extended Euclidean Algorithm
· CBC – see sample computations in our lecture
· Denial of Service Attack
· Secure email
6. Memory Management
· Buddy System
· Virtual Memory and Page Replacement – have a look at the examples used in our lecture slides, demonstrating the different page replacement algorithms.
i. First-In-First-Out
ii. Optimal Algorithm
iii. Least Recently Used Algorithm
7. Process Scheduling
Have a look at the examples used in our lecture slides, demonstrating the simulation of the different scheduling algorithms.
· First Come First Served
· Shortest Job First
· Shortest Remaining Time First
· Round Robin
8. Network Layer
· IP addressing, NAT
· IP address allocation – see sample computations in our lecture
· IP fragmentation– see sample computations in our lecture
· Packet forwarding between separate subnets
· Routing algorithm– see sample computations in our lecture
9. Data Link Layer (This topic will NOT be included in the exam anymore)
· Cyclic Redundancy Check
· Packet forwarding between nodes in the same/different subnet
· Switched LANs
Distribution of marks, according to topic:
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com