4.SelfOrganizingListsAssignment
Assignment
Implement the three self-organizing list heuristics:
Count Whenever a record is accessed it may move toward the front of the list if its
number of accesses becomes greater than the record(s) in front of it.
Move-
LIBERTY UNIVERSITY
CSIS 215 Algorithms and Data Structures (3 Credit Hours)
Fall Semester 2016
Prof. Terri Sipantzi
[email protected]
434-592-4921
DeMoss Hall 3410F / Office Hours
I. Course Description
Study of data structures such as linked lists, s
CSCI 215 Homework 1 (Chapters 1, 3-6)
75 points total value
1. Define a C+ compliant ADT for the integer domain. Your ADT should consist of the functions that
can be performed on integers and you must come up with at least 5 functions (not counting the
co
i
CSCI 215 Homework 2: Chapters 6-11
100 points total value
1. Write an algorithm to determine if two general trees are identical. Make the algorithms as efficient
as you can. Analyze your algorithms running time.
sameTree(tree1,tree2)
2. Write a postorde
Programming Assignment 3
LRU Buffer Pool
Implement a disk-based buffer pool class based on the LRU buffer pool
replacement strategy.
This assignment comes from Project 8.3 on page 308 of your text. Using the supplied C+ files to
implement an LRU Buffer Po
LIBERTY UNIVERSITY
CSCI 215 Algorithms and Data Structures (3 Credit Hours)
Spring Semester 2014
Prof. Terri Sipantzi
[email protected]
434-592-4921
DeMoss Hall 3410J / Office Hours
I. Course Description
Study of data structures such as linked lists,
ProgrammingAssignment1
BagbasedDictionary
ImplementadictionaryusingaBagProject4.7inthetext(modified)
Use the bag ADT provided to create an array-based (do not use the C+ vector library)
implementation for bags. Then use your bag to implement the dictionar
ProgrammingAssignment3
LRUBufferPool
ImplementadiskbasedbufferpoolclassbasedontheLRUbufferpoolreplacement
strategy.
This assignment comes from Project 8.3 on page 308 of your text. Using the supplied C+ files
to implement an LRU Buffer Pool. I have made t
ProgrammingAssignment2
ThreadedBinaryTree
ImplementaThreadedBinaryTreeandaddinorderandreverseorderprinting
withoutresortingtorecursionProject5.2inthetext
Using the following supplied C+ files implement a right and left threaded binary search tree.
The fil
5. Graph Files and MST Construction
Assignment (Project 11.1 from page 411 of our text)
Design a format for storing graphs in a file. Then implement two functions: one to read a graph from a
file and the other to write a graph to a file. Test your functio