### Write operations for binary file operations

Assignment Help Data Structure & Algorithms
##### Reference no: EM13317214

Exam will be comprehensive so you MUST study earlier material again (in particular review previous study guides). However, the exam will focus most heavily on material covered since Test 2. Not sure right now the exact percentage split, but assume 60-70% of questions will be on reading and materials covered since Test 2. This handout documents only that material! As always, if I wrote it on the board you are likely to see it again.

Review resources
• Handouts / class notes: binary files, direct access C++ code.
• Assigned Readings since Test 2:hashing techniques, heaps and binary files, graphs
• Programming assignments

Terms to be definedor explain/discuss/give examples of: Greedy algorithm (like Kruskal'sor Prim's for finding Minimum Spanning Tree or Stable Marriage Algorithm), divide and conquer algorithms (like quick sort and merge sort that use recursion), text files versus binary files (pros and cons of each), sequential access, direct (random) access,hash table packing factor, hash function, collisions, mid-square hashing function, hashing function based on folding, secondary hashing, priority queue (and operations on it), complete tree, heap, heap operations[be able to pseudo code add/remove an item to/from a max/min heap], possible implementations of a priority queue, possible implementations of a heap (one via an array based tree technique with children/parent addresses computable), collision resolution mechanisms [linear probing, quadratic probing], tombstones, chaining with separate lists, complexity classes associated with various search/add/delete operations on a wide variety of data structures, b-trees in particular: contents? How to add/remove an item for a b-tree?, graphs, vertices (nodes), edges, directed graphs, acyclic graphs, DAGs, weighted graphs, possible representations for a graph (adjacency matrix and adjacency lists) - how would operations of various kinds on graphs be "achieved" on each of the two main representations? - for example, for each possible representation how would we find all of the nodes adjacent to a particular node?Depth first and breadth first traversal/searches from a given starting node (definition and algorithm). How would these differ depending on which representation of a graph you were using?

Specific algorithms to know: heap sort, breadth and depth first traversal/search algorithms, shortest path algorithm from source to destination (unweighted graphs - based on using a breadth first traversal), Dijkstra's shortest path algorithm (weighted graphs - this uses a priority queue), Prim's and Kruskal'sminimum spanning tree algorithms[greedy algorithms]. And of course algorithms to add/delete from linked lists and BSTs - algorithms to traverse both of those and do/count/observe something at each node in the structure - use of recursion to process BSTs.Merge Sort vs Quick Sort vs Heap sort.

C++: templates, char arrays and their null terminated representation, sizeof operator, seekp, seekg, read and write operations for binary file operations, eof() function, proper opening and closing of files with different arguments, code to process a linked list or a BST.

General Data Structures: given a set of conditions, tell which DS to use, and state why using Big O Notation.

#### Explain pros and cons of algorithm

You can start by taking 3-4 schemes for example and then show each step of the GA based algorithm numerically. Explain each step (selection, cross-over, mutation) in detail.

#### Using a backtracking algorithm

If the backtracking algorithm finds a dead end, it retraces its path until it reaches a position from which there is an untried path. The backtracking algorithm always tries

#### Propose an efficient data structure

Propose an efficient data structure that may hold the tour operator's data using a normalization process. Describe each step of the process that will enable you to have a 2n

#### Calculate the total weights and values of each subset

Use the decrease-by-one technique to generate the power set and calculate the total weights and values of each subset, then find the largest value that fits into the knapsac

#### Implement a method to delete every node from your bst

Implement a method to delete every node from your BST that contains a word that is 3 or fewer letters long (note that you must explicitly make these deletions, not fail to i

#### Implement a method to delete every node

Call the structure for the nodes of the tree WordNode, and call the references in this structure left and right. Use Strings to store words in the tree. Call the class imp

#### Use the string input by the user as an argument to open file

One of these must use preorder traversal, one must use inorder traversal, and one must use postorder traversal. You must decide which to use for each method, but use commen

#### Define how to building a binary search tree

Three of these operations (all but add) must visit every node in the tree. One of these must use preorder traversal, one must use inorder traversal, and one must use postor