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 imple
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 se
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 r
Version 1.1 2008 Feb ruary 29
CSE 2011 Fundamentals of Data Structures Report 1: On Trees Due: Thursday, March 6, 1pm Where: In class If the class has begun your report is late 0 Changes
February 29
Version 1.0 2008 March 13
CSE 2011 Fundamentals of Data Structures Report 3: AVL trees Due: Thursday, April 3, 4pm Where: CSEB 2032 1 Main points
Be sure to r ead and follow all the guidelin es from t
<!DOCTYPE HTML PUBLIC "-/IETF/DTD HTML 2.0/EN">
<html><head>
<title>404 Not Found</title>
</head><body>
<h1>Not Found</h1>
<p>The requested URL /course/2011/Mystery.txt was not found on this server.</
NOTE: As you may have noticed, we use a lot of examples and diagrams in the lectures. So email is not an effective method to answer questions related to course material. Please DO NOT ask how to solve
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
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 imple
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 F
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 F
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 F
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:
Examinatio
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:
Examinatio
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 th
Version 1.1 2008 Janua ry 16
CSE 2011 Fundamentals of Data Structures Report 1: Sparse Matrices Due: Thursday, January 31, 1pm Where: In class If the class has begun your report is late 0 Changes
Jan
Last Updated: 2007 September 15
An Overview of Types of Test Questions
Questions may be based on material up to and including the last class before the test. Students can have a good idea of test ques
A General Lower Bound for Sorting
1
Some Facts
Given a set of n distinct items, how many permutations are there ? n! Given a balanced binary tree with N leaves, the height of the tree is O(logN).
2
1
CSE2011F06/HR - Assignment #2 - Due Oct. 11, 06 Linear Structures and Randomized Algorithms
1. Answer the following questions about the classes MyArrayList and MyLinkedList which were discussed in cla
CSE2011F06/HR - Assignment #3 - Due Oct. 25, 06 Trees
1. Answer the following questions about a non-empty binary tree of N nodes and height H: a. Prove that the number of null links in the tree is N+1
CSE2011F06/HR - Assignment #4 - Due Nov. 8, 06 Hash Tables and Heaps
1. Given the hash function h(x) = x % 10, insert the items: cfw_4371, 1323, 6173, 4199, 4344, 9679, 1989 and show the resulting has
NOTE: As you may have noticed, we use a lot of examples and diagrams in the lectures. So email is not an effective method to answer questions related to course material. Please DO NOT ask how to solve
Assignment 2
Last updated: November 19, 2009.
Test Cases
Tree Drawing Tree Traversal Heaps
This assignment consists of three programming problems.
1. Tree Drawing
We can draw a binary tree T with an a
Assignment 1
Last updated: October 5, 2009. UPDATES: (October 5) When an error occurs, your method should throw an exception and our testing programs will catch it. This is an example of how this work
Makeup Lab Test
This makeup lab test is ONLY for students who submitted "blank" files by mistake when doing the lab test 1 or were absent with a valid reason (e.g., illness).
Time and Date
Thursday, N
Marking Scheme of Lab Test 1
Each program is given 2 pts for successful compilation. The first program has 9 test cases. Each successful test case is given 1 pt. The second program has 12 test cases.
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 th
CSE2011F06/HR - Solution of #1
1. Headers (a) and (b) are clearly not type-safe because invoking compareTo needs a cast and that may crash. Headers (c), (d) and (e) are type-safe but have differing ve
CSE2011F06/HR - Solution of #2
1. Answer the following questions about. a. No, the iterator of MyArrayList is not fail-fast. To make it so, we need to introduce the attribute modCount to the outer cla
CSE2011F06/HR - Solution of #4
1. Given the hash function. a. Depending on implementation, you can insert a colliding item at the front or rear of the list.
b. Here is the resulting hash table:
c. Her