1. Order the following running time bounds by asymptotic growth rate in nondescending order. Indicate equality, if any. N2, 2N, 25, Nlg(lgN), Nlg(N2), N2lgN, N3, NlgN, and N!. 2. Solve the following recurrences by obtaining a bound for T(N) given that T(1
Review Questions
No solutions will be posted. We will solve a subset of the following problems in the lecture on December 8. NOTE: As you may have noticed, we used a lot of examples and diagrams in the lectures. So email is not an effective method to answ
Department of Computer Science and Engineering
CSE 2011: Fundamentals of Data Structures
Winter 2009, Section Z Instructor: N. Vlajic Date: April 14, 2009
Midterm Examination
Instructions:
Examination time: 75 min. Print your name and CS student number i
Department of Computer Science and Engineering
CSE 2011: Fundamentals of Data Structures
Winter 2009, Section Z Instructor: N. Vlajic Date: April 14, 2009
Midterm Examination
Instructions:
Examination time: 75 min. Print your name and CS student number i
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 3
Due Date - Saturday, May 23, 7pm!
Question 1
3-ary Tree
[35 points]
Let T be a full 3-ary tree (see Figure 1); that is, each parent has exactly 3 children.
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 3
Due Date - Saturday, May 23, 7pm!
Question 1
3-ary Tree
[35 points]
Let T be a full 3-ary tree (see Figure 1); that is, each parent has exactly 3 children.
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 3
Due Date - Saturday, May 23, 7pm!
Question 1
3-ary Tree
[35 points]
Let T be a full 3-ary tree (see Figure 1); that is, each parent has exactly 3 children.
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 2
Due Date - Friday, May 11, by Noon !
Question 1
Binary Tree Traversal
[15 points]
The recursive implementations of Preorder and Inorder Traversal on a binar
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 2
Due Date - Monday, May 11, by Noon !
Question 1
Binary Tree Traversal
[15 points]
The recursive implementations of Preorder and Inorder Traversal on a binar
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 1
Due Date - Monday, April 13, by Noon !
Question 1 Algorithm Design
[2 points]
Assume an arbitrary set of n distinct numbers (S). Devise an algorithm for out
Department of Computer Science and Engineering York University, Winter 2009
CSE 2011: Assignment 1
Due Date - Monday, April 13, by Noon !
Question 1
Algorithm Design
[10 points]
Assume an arbitrary set of n distinct numbers (S) distributed over an interva