CS 344
CS 344 - Rutgers Study Resources
  • 4 Pages third_practice
    Third_practice

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Practice Questions and Reading Material The nal exam is cumulative and will include problems relating to all the lectures. Please go over all three study guides. The current study guide includ

  • 15 Pages hw_1_sol
    Hw_1_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 1 - Solutions Asymptotic and Number Theoretic Algorithms Part A (20 points) 1 Problem 1: In each of the following situations indicate whether = O(g) or = (g) or = (g): Note: The g n f

  • 7 Pages hw_2_sol
    Hw_2_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2013 Homework 2 Solutions Divide-and-Conquer Algorithms, Sorting Algorithms, Greedy Algorithms Problem 1 [20 points] The more general version of the Master Theorem is the following. Given a recurre

  • 3 Pages hw_2
    Hw_2

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 2 Divide-and-Conquer Algorithms, Sorting Algorithms, Greedy Algorithms Deadline: March 14, 11:59pm. Available points: 110. Perfect score: 100. Homework Instructions: Teams: Homeworks

  • 5 Pages hw_1
    Hw_1

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 1 Asymptotics and Number Theoretic Algorithms Deadline: February 18, 11:59pm. Available points: 120. Perfect score: 100. Homework Instructions: Teams: Homeworks should be completed by

  • 1 Page Homework 5
    Homework 5

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: #5 More comparison stu Farach-Colton Due by 5:00pm, Oct. 11. 1. The mode of an array is the most frequent element of the array. Give an algorithm to nd the mode of an array. Analyze its complexity. As always, the faster the algorithm, th

  • 1 Page Homework 4
    Homework 4

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: #4 Trees and Whatnot Farach-Colton Due by 5:00pm, Oct. 4. 1. Prove that a forest consisting of k trees with a total of n nodes has n k edges. (20 points) 2. Let G = (V, E, W ) be a weighted graph such that no two dierent edges in E have

  • 1 Page Homework 3
    Homework 3

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: #3 Sorting Farach-Colton Due by 5:00pm, Sept. 27. 1. The merge algorithm presented in class was not in place. Assume you are given an array A[1], ., A[n] where A[1], ., A[k ] is one sorted list and A[k + 1], ., A[n] is another sorted lis

  • 2 Pages Homework 2
    Homework 2

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: #1 Math Fundamentals Farach-Colton Due by 5:00pm, Due: Sept. 20. 1. Prove that log(n!) (n log n). (15 points) 2. Let f (n) = 2n , g (n) = 3n . Is f (n) in O(g (n)? Is g (n) in O(f (n)? Prove your answer. (10 points) 3. Let f (n) = n2 , g

  • 4 Pages hw_3_sol
    Hw_3_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2013 Homework 3 Solutions TITLE Part A (20 points) Problem 1: Let Track 1 to have n points and track 2 to have m points. We need two tables, each one for the Euclidean distances between every pair

  • 3 Pages hw_3
    Hw_3

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 3 Dynamic Programming and Graph Search Deadline: April 4, 11:59pm. Available points: 110. Perfect score: 100. Homework Instructions: Teams: Homeworks should be completed by teams of s

  • 4 Pages second_practice
    Second_practice

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Practice Questions and Reading Material Note: The chapters and exercises from the books are provided as supportive references for the material covered during the lectures. Greedy Algorithms: H

  • 4 Pages first_practice
    First_practice

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Practice Questions and Reading Material Note: The material from the books is provided as a supportive reference for the material covered during the lectures. Introduction to Concepts of Algori

  • 6 Pages midterm2_sol
    Midterm2_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Midterm Exam Name: Perfect score: 100 points - Available points: 112. No notes or books are allowed. A. Specify whether the entire following statements are true or false and argue why: - A dyn

  • 6 Pages midterm1_sol
    Midterm1_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Midterm Exam Name: Perfect score: 100 points - Available points: 112. No notes or books are allowed. A. Specify whether the following statements are true or false and argue why: - For any pair

  • 8 Pages hw_5_sol
    Hw_5_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 5 Minimum Spanning Trees, NP-Complete Problems and Approximation Algorithms Deadline: May 6, 11:59pm. Available points: 110. Perfect score: 100. Homework Instructions: Teams: Homework

  • 4 Pages hw_5
    Hw_5

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 5 Minimum Spanning Trees, NP-Complete Problems and Approximation Algorithms Deadline: May 6, 11:59pm. Available points: 110. Perfect score: 100. Homework Instructions: Teams: Homework

  • 7 Pages hw_4_sol
    Hw_4_sol

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 4 - Solutions Problem 1: After Storm Sandy leaves, the small town of New Town is undergoing an electricity power shortage. To recover the electricity service in the town, the local el

  • 4 Pages hw_4
    Hw_4

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    CS 344: DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS SPRING 2014 Homework 4 Searching for Paths on Graphs Deadline: April 20, 11:59pm. Available points: 110. Perfect score: 100. Homework Instructions: Teams: Homeworks should be completed by teams of student

  • 1 Page Homework 1
    Homework 1

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: #1 Math Fundamentals Farach-Colton Due by 5:00pm, Due: Sept. 13. 1. Prove, using the denitions, that loga x = logb x. loga b Prove that log x x = . y log y 2. Prove by induction on k : (Remember these formulas, they may be used later) (a

  • 1 Page Practice questions
    Practice Questions

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 2012 CS 344: Practice Questions Farach-Colton Due by 5:00pm, on . 1. Suppose I take an array A[1, . . . , n] of integers and create a new array B [1, . . . , n+ 1] as follows: First, B [1, . . . , n] = A[1, . . . , n]. Now, I pick some i without tell

  • 1 Page Practice exam 1
    Practice Exam 1

    School: Rutgers

    Course: Design And Analysis Of Algorithms

    Fall 1994 Farach CS 344: (Practice) Exam #1 Books and notebooks may be consulted. Any theorem proven in class or algorithm presented in class can be used. Theorems or algorithms that were mentioned but not presented can only be used if you prove them. 1.

  • 3 Pages Greedy Algorithms
    Greedy Algorithms

    School: Rutgers

    Greedy algorithms are simple and straightforward. They are shortsighted in their approach in the sense that they take decisions on the basis of information at hand without worrying about the effect these decisions may have in the future. They are easy to

  • 5 Pages Graph Algorithms
    Graph Algorithms

    School: Rutgers

    Graph Theory is an area of mathematics that deals with following types of problems Connection problems Scheduling problems Transportation problems Network analysis Games and Puzzles. The Graph Theory has important applications in Critical path analysis, S

  • 7 Pages Dynamic Table
    Dynamic Table

    School: Rutgers

    If the allocated space for the table is not enough, we must copy the table into larger size table. Similarly, if large number of members erased from the table, it is good idea to reallocate the table with a smaller size. Using amortized analysis we shall

  • 5 Pages Dynamic Programming
    Dynamic Programming

    School: Rutgers

    Dynamic programming is a fancy name for using divide-and-conquer technique with a table. As compared to divide-and-conquer, dynamic programming is more powerful and subtle design technique. Let me repeat , it is not a specific algorithm, but it is a meta-

  • 3 Pages Divide and Conquer
    Divide And Conquer

    School: Rutgers

    Divide-and-conquer is a top-down technique for designing algorithms that consists of dividing the problem into smaller subproblems hoping that the solutions of the subproblems are easier to find and then composing the partial solutions into the solution o

  • 10 Pages Binary Search Tree
    Binary Search Tree

    School: Rutgers

    Binary Search tree is a binary tree in which each internal node x stores an element such that the element stored in the left subtree of x are less than or equal to x and elements stored in the right subtree of x are greater than or equal to x. This is cal

  • 1 Page Approximate
    Approximate

    School: Rutgers

    An approximate algorithm is a way of dealing with NP-completeness for optimization problem. This technique does not guarantee the best solution. The goal of an approximation algorithm is to come as close as possible to the optimum value in a reasonable am

  • 13 Pages Graph Algorythms
    Graph Algorythms

    School: Rutgers

    Elementary Graph Algorithms CSE 680 Suggested Reading: Appendix B4, Chapter 22 1 Graphs G(V, E) - V : vertex set; E: edge set. Directed graphs, undirected graphs, weighted graphs. An edge is incident on, incident from, or incident to a vertex.

Back to course listings