Categories
Algorithms & Data Structures

data will be provided in excel format. all instructions on what exactly needs to

data will be provided in excel format. all instructions on what exactly needs to be done step by step will also be provided. Tutor will need access to tableau. I am pretty sure there is a free trial to sign up for.

Categories
Algorithms & Data Structures

Do not copy/paste or type the text in your own text editor.cycle0.txt

Provided files:
Grading Criteria
Unix.zip – zipped folder with all data files. For convenience below are direct links to individual files. To download individual files, use right click and Save As. Do NOT copy/paste or type the text in your own text editor.cycle0.txt
data0.txt
data0_rev.txt
data1.txt – like data0.txt but the order of the prerequisite courses is modified on line 2.
slides.txt (graph image) – courses given in such a way that they produce the same graph as in the image. (The last digit in the course number is the same as the vertex corresponding to it in the drawn graph. You can also see this in the vertex-to-course name correspondence in the sample run for this file.)
run.html
data0_easy.txt – If you cannot handle the above file format, this is an easier file format that you can use, but there will be 15 points lost in this case. More details about this situation are given in Part 3.
Specifications:You can use structs, macros, typedef.
All the code must be in C (not C++, or any other language)
Code that does not compile receives 0 credit.
Global or static variables are NOT allowed. The exception is using macros to define constants for the size limits (e.g. instead of using 30 for the max course name size).
E.g. #define MAX_ARRAY_LENGTH 20
You can use static memory (on the frame stack) or dynamic memory. (Do not confuse static memory with static variables.)
The program must read from the user a filename. The filename (as given by the user) will include the extension, but NOT the path. E.g.: data0.txt
You can open and close the file however many times you want.
File format:Unix file. It will have the Unix EOL (end-of-line).
Size limits:The file name will be at most 30 characters.
A course name will be at most 30 characters
A line in the file will be at most 1000 characters.
The file ends with an empty new line. See empty line image
Each line (except for the empty line) has one or more course names.
Each course name is a single word (without any spaces). E.g. CSE1310 (with no space between CSE and 1310).
There is no empty space at the end of the line.
There is exactly one empty space between any two consecutive courses on the same line. (You do not need to worry about having tabs or more than one empty space between 2 courses.)
The first course name on each line is the course being described and the following courses are the prerequisites for it. E.g.CSE2315 CSE1310 MATH1426
ENGL1301
The first line describes course CSE2315 and it indicates that CSE2315 has 2 prerequisite courses, namely: CSE1310 and MATH1426.
The second line describes course ENG1301 and it indicates that ENG1301 has no prerequisites.
You can assume that there is exactly one line for every course, even for those that do not have prerequisites (see ENGL1301 above). Count the number of lines in the file to get the total number of courses.
The courses are not given in any specific order in the file.
You must create a directed graph corresponding to the data in the file.The graph will have as many vertices as different courses listed in the file.
You can represent the vertices and edges however you want.
You do NOT have to use a graph struct. If you can do all the work with just the 2D table (the adjacency matrix) that is fine. You HAVE TO implement the topological sorting covered in class (as this assignment is on Graphs), but you can organize, represent and store the data however you want.
For the edges, you can use either the adjacency matrix representation or the adjacency list. If you use the adjacency list, keep the nodes in the list sorted in increasing order.
For each course that has prerequisites, there is an edge, from each prerequisite to that course. The direction of the edge indicates the dependency. The actual edge will be between the vertices in the graph corresponding to these courses.
E.g. file data0.txt has:c100
c300 c200 c100
c200 c100
Meaning:c100—–> c200
|
|
|
|
|
|
V V
c300
(The above drawing is provided here to give a picture of how the data in the file should be interpreted and the graph that represents this data.
Your program should not print this drawing. See the sample run for expected program output.)
From this data you should create the correspondence:vertex 0 – c100
vertex 1 – c300
vertex 2 – c200
and you can represent the graph using adjacency matrix (the row and column indexes are provided for convenience): | 0 1 2
—————–
0| 0 1 1
1| 0 0 0
2| 0 1 0
e.g. E[0][1] is 1 because vertex 0 corresponds to c100 and vertex 1 corresponds to c300 and c300 has c100 as a prerequisite. Notice that E[1][0] is not 1.
If you use the adjacency list representation, print the adjacency list. The list must be sorted in increasing order (e.g. see the list for 0). It should show the corresponding node numbers. E.g. for the above example the adjacency list will be:0: 1, 2,
1:
2: 1,
You must use the correspondence given here: vertex 0 for the course on the first line, vertex 1 for the course on the second line, etc.Print the courses in topological sorted order. This should be done using the topological sorting covered in class, including the DFS covered in class.
There is no topological order if there is a cycle in the graph; in this case print an error message.
If in DFV-visit when looking at the (u,v) edge, the color of v is GRAY then there is a cycle in the graph (and therefore topological sorting is not possible). See the Lecture on topological sorting.
(6 points) create and submit 1 test file. It must cover a special case. Indicate what special case you are covering (e.g. no course has any prerequisite). At the top of the file indicate what makes it a special case. Save this file as special.txt. It should be in Unix EOL format.
Part 2: Suggestions for improvements (not for grade)
CSE Advisors point out to students the “longest path through the degree”. That is the longest chain of course prerequisites (e.g. CSE1310 —> CSE1320 –> CSE3318 –>…). It gives a lower bound on the number of semesters needed until graduation. Can you find this path? Can you calculate for each course the LONGEST chain ending with it? E.g. in the above example, there are 2 chains ending with c300 (size 2: just c100–>c300, size 3: c100–>c200–>c300) and you want to show longest path 3 for c300. Can you calculate this number for each course?
Allow the user to the enter a list of courses taken so far (from the user or from file) and print a list of the courses they can take (they have all the prerequisites for).
Ask the user to enter a desired number of courses per semester and suggest a schedule (by semester).
Part 3: Implementation suggestions
Reading from file:(15 points) For each line in the file, the code can extract the first course and the prerequisites for it.
If you cannot process each line in the file correctly, you can use a modified input file that shows on each line, the number of courses, but you will lose the 15 points dedicated to line processing. If your program works with the “easy files”, in order to make it easy for the TAs to know which file to provide, please name your C program courses_graph_easy.c. Here is the modification shown for a new example. Instead ofc100
c300 c200 c100
c200
the file would have:1 c100
3 c300 c200 c100
1 c200
that way the first data on each line is a number that tells how many courses (strings) are after it on that line. Everything is separated by exactly one space. All the other specifications are the same as for the original file (empty line at the end, no space at the end of any line, length of words, etc). Here is data0_easy.txt
Make a direct correspondence between vertex numbers and course names. E.g.the **first** course name on the first line corresponds to vertex 0,
the **first** course name on the second line corresponds to vertex 1,
etc…
To add an edge in the graph you will need to find the vertex number corresponding to a given course name. E.g. find that c300 corresponds to vertex 1 and c200 corresponds to vertex 2. Now you can set E[2][1] to be 1. (With the adjacency list, add node 1 in the adjacency list at index 2 and keep the lists sorted.)
To help with this, write a function that takes as arguments the list/array of [unique] course names and one course name and returns the index of that course in the list. You can use that index as the vertex number. (This is like the indexOf() method in Java.)
To see all the non-printable characters that may be in a file, find an editor that shows them. E.g. in Notepad++ : open the file, go to View -> Show symbol -> Show all characters. YOU SHOULD TRY THIS!
In general, not necessarily for this homework, if you make the text editor show the white spaces, you will know if what you see as 4 empty spaces comes from 4 spaces or from one tab or show other hidden characters. This can help when you tokenize. E.g. here I am using Notepad++ to see the EOL for files saved with Unix/Mac/Windows EOL (see the CR/LF/CRLF at the end of each line): EOL_Mac_Unix_Windows.png

Categories
Algorithms & Data Structures

Can you calculate this number for each course?

Provided files:
Grading Criteria
Unix.zip – zipped folder with all data files. For convenience below are direct links to individual files. To download individual files, use right click and Save As. Do NOT copy/paste or type the text in your own text editor.cycle0.txt
data0.txt
data0_rev.txt
data1.txt – like data0.txt but the order of the prerequisite courses is modified on line 2.
slides.txt (graph image) – courses given in such a way that they produce the same graph as in the image. (The last digit in the course number is the same as the vertex corresponding to it in the drawn graph. You can also see this in the vertex-to-course name correspondence in the sample run for this file.)
run.html
data0_easy.txt – If you cannot handle the above file format, this is an easier file format that you can use, but there will be 15 points lost in this case. More details about this situation are given in Part 3.
Specifications:You can use structs, macros, typedef.
All the code must be in C (not C++, or any other language)
Code that does not compile receives 0 credit.
Global or static variables are NOT allowed. The exception is using macros to define constants for the size limits (e.g. instead of using 30 for the max course name size).
E.g. #define MAX_ARRAY_LENGTH 20
You can use static memory (on the frame stack) or dynamic memory. (Do not confuse static memory with static variables.)
The program must read from the user a filename. The filename (as given by the user) will include the extension, but NOT the path. E.g.: data0.txt
You can open and close the file however many times you want.
File format:Unix file. It will have the Unix EOL (end-of-line).
Size limits:The file name will be at most 30 characters.
A course name will be at most 30 characters
A line in the file will be at most 1000 characters.
The file ends with an empty new line. See empty line image
Each line (except for the empty line) has one or more course names.
Each course name is a single word (without any spaces). E.g. CSE1310 (with no space between CSE and 1310).
There is no empty space at the end of the line.
There is exactly one empty space between any two consecutive courses on the same line. (You do not need to worry about having tabs or more than one empty space between 2 courses.)
The first course name on each line is the course being described and the following courses are the prerequisites for it. E.g.CSE2315 CSE1310 MATH1426
ENGL1301
The first line describes course CSE2315 and it indicates that CSE2315 has 2 prerequisite courses, namely: CSE1310 and MATH1426.
The second line describes course ENG1301 and it indicates that ENG1301 has no prerequisites.
You can assume that there is exactly one line for every course, even for those that do not have prerequisites (see ENGL1301 above). Count the number of lines in the file to get the total number of courses.
The courses are not given in any specific order in the file.
You must create a directed graph corresponding to the data in the file.The graph will have as many vertices as different courses listed in the file.
You can represent the vertices and edges however you want.
You do NOT have to use a graph struct. If you can do all the work with just the 2D table (the adjacency matrix) that is fine. You HAVE TO implement the topological sorting covered in class (as this assignment is on Graphs), but you can organize, represent and store the data however you want.
For the edges, you can use either the adjacency matrix representation or the adjacency list. If you use the adjacency list, keep the nodes in the list sorted in increasing order.
For each course that has prerequisites, there is an edge, from each prerequisite to that course. The direction of the edge indicates the dependency. The actual edge will be between the vertices in the graph corresponding to these courses.
E.g. file data0.txt has:c100
c300 c200 c100
c200 c100
Meaning:c100—–> c200
|
|
|
|
|
|
V V
c300
(The above drawing is provided here to give a picture of how the data in the file should be interpreted and the graph that represents this data. Your program should not print this drawing. See the sample run for expected program output.)
From this data you should create the correspondence:vertex 0 – c100
vertex 1 – c300
vertex 2 – c200
and you can represent the graph using adjacency matrix (the row and column indexes are provided for convenience): | 0 1 2
—————–
0| 0 1 1
1| 0 0 0
2| 0 1 0
e.g. E[0][1] is 1 because vertex 0 corresponds to c100 and vertex 1 corresponds to c300 and c300 has c100 as a prerequisite. Notice that E[1][0] is not 1.
If you use the adjacency list representation, print the adjacency list. The list must be sorted in increasing order (e.g. see the list for 0). It should show the corresponding node numbers. E.g. for the above example the adjacency list will be:0: 1, 2,
1: 2: 1,
You must use the correspondence given here: vertex 0 for the course on the first line, vertex 1 for the course on the second line, etc.Print the courses in topological sorted order. This should be done using the topological sorting covered in class, including the DFS covered in class.
There is no topological order if there is a cycle in the graph; in this case print an error message.
If in DFV-visit when looking at the (u,v) edge, the color of v is GRAY then there is a cycle in the graph (and therefore topological sorting is not possible). See the Lecture on topological sorting.
(6 points) create and submit 1 test file. It must cover a special case. Indicate what special case you are covering (e.g. no course has any prerequisite). At the top of the file indicate what makes it a special case. Save this file as special.txt. It should be in Unix EOL format.
Part 2: Suggestions for improvements (not for grade)
CSE Advisors point out to students the “longest path through the degree”. That is the longest chain of course prerequisites (e.g. CSE1310 —> CSE1320 –> CSE3318 –>…). It gives a lower bound on the number of semesters needed until graduation. Can you find this path? Can you calculate for each course the LONGEST chain ending with it? E.g. in the above example, there are 2 chains ending with c300 (size 2: just c100–>c300, size 3: c100–>c200–>c300) and you want to show longest path 3 for c300. Can you calculate this number for each course?
Allow the user to the enter a list of courses taken so far (from the user or from file) and print a list of the courses they can take (they have all the prerequisites for).
Ask the user to enter a desired number of courses per semester and suggest a schedule (by semester).
Part 3: Implementation suggestions
Reading from file:(15 points) For each line in the file, the code can extract the first course and the prerequisites for it.
If you cannot process each line in the file correctly, you can use a modified input file that shows on each line, the number of courses, but you will lose the 15 points dedicated to line processing. If your program works with the “easy files”, in order to make it easy for the TAs to know which file to provide, please name your C program courses_graph_easy.c. Here is the modification shown for a new example. Instead ofc100
c300 c200 c100
c200 the file would have:1 c100
3 c300 c200 c100
1 c200 that way the first data on each line is a number that tells how many courses (strings) are after it on that line. Everything is separated by exactly one space. All the other specifications are the same as for the original file (empty line at the end, no space at the end of any line, length of words, etc). Here is data0_easy.txt
Make a direct correspondence between vertex numbers and course names. E.g.the **first** course name on the first line corresponds to vertex 0,
the **first** course name on the second line corresponds to vertex 1, etc…
To add an edge in the graph you will need to find the vertex number corresponding to a given course name. E.g. find that c300 corresponds to vertex 1 and c200 corresponds to vertex 2. Now you can set E[2][1] to be 1. (With the adjacency list, add node 1 in the adjacency list at index 2 and keep the lists sorted.)
To help with this, write a function that takes as arguments the list/array of [unique] course names and one course name and returns the index of that course in the list. You can use that index as the vertex number. (This is like the indexOf() method in Java.)
To see all the non-printable characters that may be in a file, find an editor that shows them. E.g. in Notepad++ : open the file, go to View -> Show symbol -> Show all characters. YOU SHOULD TRY THIS!
In general, not necessarily for this homework, if you make the text editor show the white spaces, you will know if what you see as 4 empty spaces comes from 4 spaces or from one tab or show other hidden characters. This can help when you tokenize. E.g. here I am using Notepad++ to see the EOL for files saved with Unix/Mac/Windows EOL (see the CR/LF/CRLF at the end of each line): EOL_Mac_Unix_Windows.png

Categories
Algorithms & Data Structures

When you create your “top folder” (called “folder0”), you can specify the depth of the hierarchy that you want.

Review the Code
Review the Folder and File classes in the homework files. These are similar to those we used in the recursion module.
Review the printFolderContentsRecursive method in the driver. This method prints a tree-like hierarchy of all of the files and folders in a top level folder.
Use Stacks to Replace Recursion
One use of stacks is to replace recursion. Write a method that accomplishes the same task as the recursive printFolderContentsRecursive method, but using stacks instead.
I’ve started the method for you, you will complete the code.
Think about how you can use a stack. The approach of recursion is to do a small piece of the problem now and then combine that with the “rest of the solution” later on. You get that “rest of the solution” with your recursive call. For stacks, you can do the same thing. The difference is that instead of using a recursive call, you can use the stack to store the “solve later” part.
Testing the Code: Building the Folder Hierarchy
I have helper methods in the driver that build the folder hierarchy.
When you create your “top folder” (called “Folder0”), you can specify the depth of the hierarchy that you want.
I recommend starting your testing with a small number (1 or 2). Then increase the number once your code is working.
When the hierarchy is built, the methods randomly decide how many subfolders and files will be included at each level of the hierarchy.
This will allow you to make sure your code is robust.
Because randomization is used, be sure to test multiple times for each depth!
I’ve included a picture of an example hierarchy.
If you have questions about the hierarchy that is being created, please post to the discussion board!
For Full Credit
Use only the stack methods push, pop, peek, and isEmpty.
Do not use other data structures.
You can create local variables of type Stack.
You can use the returned List and List objects.
But do not create any new lists, arrays, etc.!
Formatting (5/25 points)
Match the indentation formatting of the recursive method.
You can invoke the recursive method with and without formatting to compare outputs to the outputs from your stack.
My recommendation is to get the contents of the print correct first and only once that is working, then work on the indentation.
Again, use only local variables and stacks. Do not use any data structure other than a stack to get the proper formatting.

Categories
Algorithms & Data Structures

Do not use other data structures.

Review the Code
Review the Folder and File classes in the homework files. These are similar to those we used in the recursion module. Review the printFolderContentsRecursive method in the driver. This method prints a tree-like hierarchy of all of the files and folders in a top level folder.
Use Stacks to Replace Recursion
One use of stacks is to replace recursion. Write a method that accomplishes the same task as the recursive printFolderContentsRecursive method, but using stacks instead.
I’ve started the method for you, you will complete the code.
Think about how you can use a stack. The approach of recursion is to do a small piece of the problem now and then combine that with the “rest of the solution” later on. You get that “rest of the solution” with your recursive call. For stacks, you can do the same thing. The difference is that instead of using a recursive call, you can use the stack to store the “solve later” part.
Testing the Code: Building the Folder Hierarchy
I have helper methods in the driver that build the folder hierarchy. When you create your “top folder” (called “Folder0”), you can specify the depth of the hierarchy that you want.
I recommend starting your testing with a small number (1 or 2). Then increase the number once your code is working.
When the hierarchy is built, the methods randomly decide how many subfolders and files will be included at each level of the hierarchy.
This will allow you to make sure your code is robust.
Because randomization is used, be sure to test multiple times for each depth!
I’ve included a picture of an example hierarchy.
If you have questions about the hierarchy that is being created, please post to the discussion board!
For Full Credit
Use only the stack methods push, pop, peek, and isEmpty.
Do not use other data structures.
You can create local variables of type Stack.
You can use the returned List and List objects.
But do not create any new lists, arrays, etc.!
Formatting (5/25 points)
Match the indentation formatting of the recursive method.
You can invoke the recursive method with and without formatting to compare outputs to the outputs from your stack.
My recommendation is to get the contents of the print correct first and only once that is working, then work on the indentation.
Again, use only local variables and stacks. Do not use any data structure other than a stack to get the proper formatting.

Categories
Algorithms & Data Structures

Can you help solve this hash problem, need solution and short analysis report and markdown cells that explain code for me to understand.

can you help solve this hash problem, need solution and short analysis report and markdown cells that explain code for me to understand.

Categories
Algorithms & Data Structures

A grid.

DFS and BFS traversal knowledge is needed to answer the question. a grid. Both questions are about this topic.

Categories
Algorithms & Data Structures

– insert keys in 2 node and to a 3 node and into a 4 node.

The question is about a Left–Leaning Red–Black.
– You will have to draw a red-black tree for a 2-3-4 and vice versa.
– Insert keys in 2 node and to a 3 node and into a 4 node. Rules for insertion operation is given.

Categories
Algorithms & Data Structures

You do not need to consider the other methods from the arraylist class that can modify the list.

Derive a SortedArrayList class as a subclass of the java.util.ArrayList class in such a way
that the items of a sorted ArrayList are sorted in ascending order. This subclass of the
ArrayList class will be needed to complete Task 2 (see Additional Assumptions (2) below).
You only need to provide your new insertion method in the SortedArrayList class. You do
not need to consider the other methods from the ArrayList class that can modify the list.
You are asked to write a program to help a Holiday Resort ticket office clerk in their work. The
Holiday Resort offers various activities to its customers. Customers can book tickets to take
part in activities, but the number of tickets available for each activity is limited.

Categories
Algorithms & Data Structures

• 0-1 and fractional knapsack problems

Objectives
• Characterize greedy algorithms
• Solve optimization problems using greedy algorithms
Key Ideas
• Greedy algorithms
• Activity selection problems
• 0-1 and fractional knapsack problems
• Huffman codes