CIS 121: Data Structures and Algorithms Course Lecture Notes Steven Bursztyn, Rajiv Gandhi, and John Geyer ∗ Draft of: April 14, 2020 University of Pennsylvania ∗ see acknowledgments on next page Goal There is no one book that covers everything that we want to cover in CIS 121. The goal of these notes is for […]
Assigned: March 15, 2020 Due: March 30, 2020 CIS 121 — Data Structures and Algorithms Homework Assignment 6 Note: The homework is due electronically on Gradescope on March 30, 2020 by 11:59 pm ET. For late submissions, please refer to the Late Submission Policy on the course webpage. You may submit this assignment up to
程序代写代做 go data structure algorithm graph Assigned: March 15, 2020 Read More »
CIS 121—Data Structures and Algorithms—Spring 2020 Topological Sort, Strongly Connected Components—Monday, March 23 / Tuesday, March 24 Readings • Lecture Notes Chapter 18: DAGs and Topological Sort • Lecture Notes Chapter 19: Strongly Connected Components Problems Problem 1 1. (True/False) Every DAG has exactly one topological ordering. Solution. False. Take for example, a graph with
Assigned: February 25th, 2020 Due: March 5th, 2020 CIS 121 ¡ª Data Structures and Algorithms Homework Assignment 5 Note: The homework is due electronically on Gradescope on March 5th, 2020 by 11:59 pm ET. For late submissions, please refer to the Late Submission Policy on the course webpage. You may submit this assignment up to
程序代写代做 go data structure algorithm Assigned: February 25th, 2020 Read More »
Assigned: February 10, 2020 Due: February 17, 2020 CIS 121 — Data Structures and Algorithms Homework Assignment 4 Note: The homework is due electronically on Gradescope on February 17, 2020 by 11:59 pm ET. For late submissions, please refer to the Late Submission Policy on the course webpage. You may submit this assignment up to
程序代写代做 go data structure C algorithm Assigned: February 10, 2020 Read More »
Huffman & Intro to Graphs—Monday, February 24/Tuesday, February 25 Readings • Lecture Notes Chapter 15: Huffman Coding • Lecture Notes Chapter 16: Graph Representations & BFS Problems Problem 1 What are pros and cons of Huffman Coding? Solution Pros: Huffman encodings represents only the characters that are contained in the text, without wasting space in
CIS 121—Data Structures and Algorithms—Spring 2020 Dijkstra’s and Minimum Spanning Trees—Monday, March 30 / Tuesday, March 31 Readings • Lecture Notes Chapter 20: Dijkstra’s Algorithm • Lecture Notes Chapter 21: Minimum Spanning Trees Problems Problem 1 1. True or false: Dijkstra’s algorithm will not terminate if run on a graph with negative edge weights. Solution:
程序代写代做 data structure algorithm graph CIS 121—Data Structures and Algorithms—Spring 2020 Read More »
Readings CIS 121—Data Structures and Algorithms—Spring 2020 Hashing—Monday, April 13 / Tuesday, April 14 • Lecture Notes Chapter 23: Hashing Problems Problem 1 With n distinct balls in m distinct bins what is the probability that no bucket has more than 1 ball? You may assume that n ≤ m. Solution We will treat this
程序代写代做 data structure algorithm Readings Read More »
Readings CIS 121—Data Structures and Algorithms—Spring 2020 Stacks, Queues & Heaps—Monday, February 17/Tuesday, February 18 Solution Set • Lecture Notes Chapter 13: Stacks & Queues • Lecture Notes Chapter 14: Binary Heaps & Heapsort Problems Problem 1 Consider an indefinitely long stream of unsorted integers. We are interested in knowing the median (in sorted order)
程序代写代做 data structure algorithm Readings Read More »
Recurrence Relations, Code Snippets—Monday, February 3/Tuesday, February 4 Readings • Lecture Notes Chapter 6: Analyzing Runtime of Code Snippets • Lecture Notes Chapter 7: Divide & Conquer and Recurrence Relations Problems: Recurrences Problem 1 [Solve the Following Recurrences] Solution Set CIS 121—Data Structures and Algorithms—Spring 2020 Problem 1 a Solution. T(n) = T(n−1)+n n≥1 1