CS 580 FINAL EXAM. Fall April 29, 2014

Transcription

1 CS 580 FINAL EXAM Fall 201 April 29, 2014 You are to build a range tree for your final exam. A range tree is a tree where each node contains a minimum and a maximum value as well as a linked list to store the data. The linked list for a node will contain all data X, where min X max. This means that if a value to be added falls within the range defined by a leaf s min and max, the value will be added to the head of that node s singly linked list. All values that are less than the min will then be in the left sub-tree of a node. Similarly all values that are greater than the max will be stored in the right sub-tree of a node. If a data element When a new leaf has to be added, then the values of min and max are determined by subtracting and adding a predetermined number from the input value. This predetermined number for the range will be entered in via the command line and read is as a integer number. Once the value is read in the function setrange will be called. The setrange function will set the statically declared value range. You will be responsible for writing the code for each of the structures and the functions that are declared in the following header files. You will also need to create a makefile (including a clean rule) for the final exam as well. You may add as many helper functions as you wish, but you can not alter the structures or the given function declarations in any way. 1

2 The finale will be broken down into sections. The first section is worth 40 points and will be graded based on the functions that are given below. You may complete these functions ahead of time and save them to your H drive. The second section will be worth 50 points and consist of a series of functions that will be of similar difficulty to lab questions The last section will worth 10 points and contain 2 problems that will be more difficult than the previous section. Code for the first part and all other code is to be placed in a folder called Final in your H Drive BEFORE the final exam time. A script will be provided on my class website that you will use to submit your final exam. This script is to be downloaded and placed into the same folder with all of your code BEFORE the final exam. Failure to follow any of these instructions will result in either a loss in overall score or a 0. If any , instant message, or other method of communication are used or even open during the final, you will receive a 0 and be written up for academic dishonesty.. 2

3 1 #ifndef DATATYPE_H_ 2 #define DATATYPE_H_ 4 typedef struct 5 { 6 int v a l ; 7 } data ; 8 // r e s e r v e s space f o r a data element 9 //and s e t s t h e v a l v a r i a b l e 10 data createdata ( int v ) ; 11 // p r i n t s t h e v a l v a r i a b l e 12 // in t h e data element 1 void printdata ( data d ) ; #endif

4 1 / 2 This i s a s i n g l y l i n k e d l i s t / 4 5 #ifndef _LINKLIST_H_ 6 #define _LINKLIST_H_ 7 #include <s t d i o. h> 8 #include <s t d l i b. h> 9 #include " datatype. h" typedef struct nodeptr 1 { 14 struct nodeptr next ; 15 data d ; 16 } node ; typedef struct 19 { 20 node head ; 21 node t a i l ; 22 } l i n k L i s t ; 2 24 // c r e a t e s space f o r L i n k l i s t and i n i t i a l i z e s v a r a i b l e s 25 l i n k L i s t c r e a t e L i n k l i s t ( ) ; 26 // c r e a t e s space f o r a node and i n i t i a l i z e s v a r i a b l e s 27 node createnode ( int v ) ; 28 // i n s e r t s a node i n t o t h e head o f t h e l i s t 29 void i n s e r t L L ( l i n k L i s t l l, int v ) ; 0 // p r i n t s t h e l i n k l i s t 1 void printll ( l i n k L i s t l l ) ; 2 #endif 4

5 1 #ifndef _FINAL_H_ 2 #define _FINAL_H_ 4 #include " l i n k l i s t. h" 5 6 s t a t i c int range ; 7 typedef struct l e a f P t r 8 { 9 int min ; 10 int max ; 11 l i n k L i s t l l ; 12 struct l e a f P t r l e f t ; 1 struct l e a f P t r r i g h t ; 14 } l e a f ; typedef struct 17 { 18 l e a f r o o t ; 19 } t r e e ; // a l l o c a t e space f o r a t r e e and s e t v a l u e s 22 t r e e c r e a t e T r e e ( ) ; 2 // a l l o c a t e space f o r a l e a f and i n i t i a l i z e v a r i a b l e s 24 l e a f c r e a t e L e a f ( int v ) ; 25 // i n s e r t s element i n t o a t r e e based on each nodes range. 26 // i f t h e v a l u e i s l e s s than t h e min t h e branch l e f t 27 // i f t h e v a l u e i s g r e a t e r than t h e max then branch r i g h t. 28 void i n s e r t ( t r e e t, int v ) ; 29 // s e t s t h e s t a t i c v a r i a b l e range e q u a l to v 0 // t h e range must be read in on t h e command l i n e 1 //and t h i s f u n c t i o n run b e f o r e t h e t r e e i s c r e a t e d 2 void setrange ( int v ) ; // t h i s f u n c t i o n s t a k e s t h e name o f to open 4 // you w i l l open t h e f i l e and read i t s 5 // c o n t e n t s i n t o a newly c r e a t e d t r e e. 6 // F i n a l l y r e t u r n t h e t r e e 7 t r e e readtreefromfile ( char f i l e ) ; 8 #endif 5