earch ProgramPrior to beginning work on this assignment, read Chapter 1, section

earch ProgramPrior to beginning work on this assignment, read Chapter 1, sections 1.3, 1.6, 1.8, 1.11, 1.14, 1.17, and 1.20 in Data Structures Essentials; Chapter 9 in Data Structures and Algorithm Analysis (Links to an external site.); the Trail: Collections > Algorithms from the Java Tutorials (Links to an external site.); and the Binary Search and Application (Links to an external site.) article.Students: Be sure to download and save a PDF version of your textbook for future reference. It will be used in later courses within your program, including the final, capstone course. Zybooks limits online access to your course textbooks to a 12-month period. (Zybook Download Instructions download)For this assignment, you were just hired as a junior software developer as part of a team of developers for a software contracting company. Your company has just won a big contract to develop a software application for the United States Department of Defense. The team lead has tasked you with developing a Java program that uses a binary search algorithm looking for the numbers 17 and 45 from an array. Because you do not have your secret clearance yet, a senior developer will later take your code and modify it for the requirements of the contract.In this coding assignment you will utilize the Java syntax and techniques you learned while reviewing the required resources for Week 2. Include comments for each section of the program. You may select appropriate variable names as long as proper Java syntax is used. You will also submit your source code.Input:In the input section, you are to create a Java program that uses a binary search looking for the numbers 17 and 45 from an array. Since you are a junior developer, hard code the array as follows:{5,10,15,20,25,30,35,40,45,50,55,60,65,70}Processing:In the processing section, use the appropriate Java syntax to perform the lookup.Output:Your display must include the following:A prompt indicating if 17 was found
A prompt indicating if 45 was found
Your code must include the following as comments:Name of program
Author/student’s name
Course name and number
Instructor’s name
Date submitted
Take a screen shot of the results page and save the image. When you are finished with your Java program, zip the file(s). Next, submit the zip folder that contains the running source code to the Week 2 Zip File Submission page. If you need more guidance, review the Zip File Quick Start Guide download. Be sure that you are sharing the zip folder with your instructor only. Your instructor will run your source code to ensure that the functionality runs correctly.In a Word document, express the various types of algorithms, including searching and sorting used in your Java program in a minimum of 200 words. Paste the image of your results and your source code into the document. Submit your Word document to Waypoint for grading.
Requirements: 200 words   |   .doc file

Question 1 – Graph Algorithm Suppose a CS curriculum consists of n courses, all

Question 1 – Graph Algorithm Suppose a CS curriculum consists of n courses, all of them mandatory. The prerequisite graph G has a node for each course, and an edge from course v to course w if and only if v is a prerequisite for w. Find and algorithm that works directly with this graph representation, and computes the minimum number of semesters necessary to complete the curriculum (Assume that a student can take any number of courses in one semester). The running time of your algorithm should be linear.Using following example to justify your answer:The CS Department requires fifteen one-semester courses with the prerequisites shown below:cs1 cs2 cs3cs4 requires cs2cs5 requires cs4cs6 requires cs1 and cs3cs7 requires cs4cs8 requires cs5 and cs6cs9 requires cs7cs10 requires cs9 cs11 requires cs8cs12 requires cs3cs13 requires cs6cs14 requires cs4 and cs6 cs15 requires cs14Your task is to determine the minimum number of semesters needed to finish the degree.(Hint: Represent the courses and their prerequisites as a DAG. Finding the minimum number of semesters translates to a simple graph problem, e.g., Using adjacency-matrix representation in BFS).Please provide:1. Manually plot the DAG2. Explain the algorithm that you are going to implement by the Pseudo-code, andindicate the minimum number of semesters necessary to finish the degree. 3. Write and run your program to print out the result for verification (i.e., minimumnumber of semesters)Question 2 – Shortest path algorithm design and programming implementation (1)Suppose there are a group of cities, which are modeled by a strongly connected undirected graph G = (V, E) with positive edge weights representing the distances between two cities. A particular city is the capital city a Î V. Give an efficient algorithm for finding shortest paths between all pairs of cities, with the one restriction that these paths must all pass through the capital city. (Note that: we allow one city to be passed more than once if needed).(2) Programming: Implement your designed algorithm, and print out the shortest path from node d to node i via node a using the graph shown below. Suppose the capital city is node “a”Attached the graph for question 2.
Requirements: Doesn’t matter   |   .doc file | Python