data structure

CSCI 2021 Project 1: C Programming Last Updated: 2021-09-28 Tue 15:18 CSCI 2021 Project 1: C Programming Due: 11:59pm Mon 10/04/2021 Approximately 4.0% of total grade Submit to Gradescope (Submission Now Open) Projects are individual work: no collaboration with other students is allowed. Seek help from course staff if you get stuck for too long.

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki Worksheet 1 Monday, Aug 30, 2021 1. Compare Growth Rates. Order the following functions by asymptotic growth: (i) f1(n) = 3n (ii) f2(n) = n 1 3 (iii) f3(n) = 12 (iv) f4(n) = 2log2 n (v) f5(n) = √ n (vi)

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki HW 4 Due September 27, 10:00 pm Instructions: You are encouraged to solve the problem sets on your own, or in groups of three to five people, but you must write your solutions strictly by yourself. You must explicitly acknowledge in your

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki Worksheet 4 Monday, September 20, 2021 1. Recurrence Relations Solve the following recurrence relations and give a bound for each of them. Give a short justification for each of your answers. a) T (n) = 4T (n/2)+42n b) T (n) = 2T

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki Worksheet 2 Solution Monday, September 6, 2021 1. Growth Rate. Sort the following functions based by their growth rate. (You may assume all loga- rithms have base 2.) ( √ 2)logn, n2, n!, (logn)!, (32) n, log2 n, n3, log(n!), 22 n

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki Worksheet 3 Monday, September 13, 2021 1. Heap Sort. Please consider the following array A = [1,2,9,5,6,10]. Suppose we remove the element at position 0 of the heap. How does the resulting heap look? Write both the array and tree representation of

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki HW 2 Due September 13, 10:00 pm Instructions: You are encouraged to solve the problem sets on your own, or in groups of three to five people, but you must write your solutions strictly by yourself. You must explicitly acknowledge in your

CMPSC 465 Data Structures & Algorithms Fall 2021 Antonio Blanca and David Koslicki Quiz 1 Recitation Section: Monday, Aug 30, 2021 Student Name: PSU Email ID: 1. (2 pts.) Worst case time complexity of insertion sort where position of the data to be inserted is cal- culated using binary search is: (a) O(n) (b) O(n2)