Quiz 0
Data Structures, 1999.
June 9, 1999
Total marks: 30
Name:
Student #:
Answer each question in the space provided or on the back of a page with an
indication of where to nd the answer.
Q0 [6]
I have implemented the Function abstract data type with a
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date May 13th, 2016
(1): Preliminaries
Lecture slides courtesy of Prof. Mohamed Shehata PartUnit
(2): Design by Contract
Outline
Design By Co
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date May 25th, 2016
Lecture slides courtesy of Prof. Mohamed Shehata Unit (2): Complexity Analysis
Outline
Complexity measures
Asymptotic co
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date May 20th, 2016
Lecture slides courtesy of Prof. Mohamed Shehata
Unit (1): Preliminaries
Part (4): STL and Vectors
Outline
Review of templ
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date: May 16th, 2016
Lecture slides courtesy of Prof. Mohamed Shehata
Unit (1): Preliminaries
Part (3): Pointers
Whats in Store Today?
Pointer
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date May 25th, 2016
Unit (2) Part 2: Complexity
Lecture slides courtesy of Prof. Mohamed Shehata
Analysis
Outline
Properties of Big-O notatio
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
Date: May 23rd, 2016
Lecture slides courtesy of Prof. Mohamed Shehata
Unit (1): Preliminaries
Part (5): Files and Streams
Whats in Store Today
Engineering 4892: Data Structures
Faculty of Engineering and Applied Science
Memorial University of Newfoundland
May 11th, 2016
(1): Preliminaries
Lecture slides courtesy of Prof. Mohamed ShehataPart Unit
(1): Abstraction and ADT
Topics in this Course
Un
Course Outline
ENGI4892
Spring 2016
Faculty of Engineering and Applied Science
ENGI 4892 Data Structures
Instructor
Andrew House
andrew.w.h.house@mun.ca
864-8952
EN-3026
Office Hours
Mondays 911 AM
Website
Communication
https:/online.mun.ca/
E-mail is the
Lab Assignment 0.
Eng 4892. MUN. Theodore Norvell, 2004
Due Thurs May 13. 11:00 PM.
Programming assignments will be marked according to the following scheme
Correctness . . . . . . . . . . . . . . . 50%
Sensible naming and layout 10%
Sensible use of subro
Lab Assignment 4.
Due July 28, 2004.
Data Structures Engi 4892 2004. T. Norvell
For this assignment, you are to implement the partial function ADT. You are
to use either AVL trees or 2-3 trees to make the add, remove, and at operations
O(log N ) in the wo
Quiz 1 Solution
Engr 4892 Data Structures
13 July 2004
Total marks: 49
When answering complexity questions using big-Theta notation write the
order of complexity as simply as possible; e.g. (N ) rather than (5N + 3).
Q0 [9]
Suppose programs p, q , and r h
Quiz 1 Solutions
Data Structures, 1999.
June 30, 1999
Total marks: 30
Name: Theo Norvell
Student #:
Answer each question in the space provided or on the back of a page with an
indication of where to nd the answer.
Linked lists are represented by pointers
Quiz 2 Solution
Data Structures, 1999.
July 14, 1999
Total marks: 30
Name: Theodore Norvell
Student #:
Answer each question in the space provided or on the back of a page with an
indication of where to nd the answer.
Labelled Binary Trees are represented
Quiz 0
Engi 4892. Data Structures. 2004.
June 3, 2004
Total marks: 37
Name:
Student #:
Answer each question in the space provided or on the back of a page with an indication of
where to nd the answer.
Q0 [8] Recall that the abstract elds of the list ADT c
Final Exam
c
Eng 4892 Data Structures. Theo Norvell.
Aug 8, 1998
Total marks: 145
Name:
Student #:
Answer each question in the space provided or on the last page with a clear indication of
what question you are answering.
Answer questions of complexity us
Lab Assignment 1.
Due Weds May 26 at 11PM. Labs Mon May 17 and Mon May 24.
Data Structures Engr 4892, 2004
0
BigNum
In C+ integers are usually limited to holding values up to around 9 digits (int).
For some applications (notably cryptography) much larger
Lab Assignment 2.
Due Wednesday, June 16, 23:00
Data Structures Engi 4892, 2004. T. Norvell
0
Implementing the Function ADT
Implement the Function ADT described in the course notes using linked lists.
You must ensure that when space is exhausted, the appr
Lab Assignment 3.
Lab Mon June 28. Due Wed Jun 30, 23:00.
Data Structures Engi4892 2004. T. Norvell
0
In-place, linked list, recursive quicksort.
Design, implement, and test a set of subroutines that will rearrange the
nodes in a null-terminated, singly-l
ENGI 4892 Data Structures
Assignment 1
Due Monday, May 30th, 2016 at 11:30 PM
Marking Guidelines
The marking of the solution and the implemented functions for this assignment is done
following this general scheme:
Correctness and logic contribute 60% of