A disk drive has 24 cylinders (0-23). Initially, the head points to cylinder 8 (moving towards cylinder 0). For C-SCAN and C-LOOK, requests are serviced while the head is moving from inner cylinder (0) to outer cylinder (23). You must count also the cylinders when the head is moving without servicing. The following requests are in the queue (where the requests arrival is from left to right): 11 - 3- 17 - 4 - 10 - 12 - 8 - 9 - 22 - 13. What is the total head movements using the following scheduling algorithms: a) FCFS: b) C-SCAN: c) SSTF: d) C-LOOK:

Suppose a queue has performed a total of 35 enqueue operations, 10 front operations, and 15 dequeue operations. What is the possible current size of the queue? (a)20 (b)35 (c)5 (d)25

There are many problems in which one activity cannot be started before another onehas been completed. One such problem is determining the order in which you can take courses. Some courses have prerequisite. Furthermore, the prerequisites may have prerequisites. The Directed Acyclic Graph (DAG), (Figure 2) above shows the courses and prerequisites of a computer science program at a university.6 Implementation: Use the Graph above, (Figure 2) to answer the following questions. 1. What is a Directed Acyclic Graph? 2. Perform a Breath First Search (BSF) on the above Graph. (Figure 2). Show the necessary steps using the sample table below.Perform a Depth First Search (DSF) on the above Graph. (Figure 2). Show the necessary steps using the sample table below. Vertex being Visited  Contents after Visit  Visit Sequence

Implement c# program to Retrieving a value using its associated key can be accomplished using an indexer, which works just like an indexer for an array. A key is passed in as the index value, and the value associated with the key is returned, unless the key doesn’t exist, in which a null is returned. you can use an indexer along with the Keys method to retrieve all the data stored in a hash table

Graph Theory: Graph theory in computer science uses a graphical matrix with nodes and edges to describe a data structure. These can be used for search trees, game theory, shortest path, and many other applications in math and computer science. An example of an application of a graph in computer science is the data structure used to hole the moves for a checkers game program. Each move can be represented by a node. The edges connecting the nodes are determined by the rules of the game, basically how to get to the node. This is a directed graph, because a player cannot take a move back. So the flow is always in one direction towards the end of the game. Cycles in a graph is when a node can go back to itself. This is not possible in this graph, because a move can only go to another position on the board. The only case where this would be correct is if a player were allowed to skip his turn, or move to the same spot that he is already in. A graph is said to be connected if there is a path…

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color; this is called a vertex coloring. The chromatic number of a graph is the least mumber of colors required to do a coloring of a graph. Example Here in this graph the chromatic number is 3 since we used 3 colors The degree of a vertex v in a graph (without loops) is the number of edges at v. If there are loops at v each loop contributes 2 to the valence of v. A graph is connected if for any pair of vertices u and v one can get from u to v by moving along the edges of the graph. Such routes that move along edges are known by different names: edge progressions, paths, simple paths, walks, trails, circuits, cycles, etc. a. Write down the degree of the 16 vertices in the graph below: 14…

Assume you are to write a program to analyze the social connection between students in MTSU. Each student is a node in a undirected graph. An edge is added between two nodes if these two students have close social connections, i.e., in the same club, or in the same department. Which would be a better representation for this graph?   Question 45 options:   adjacency matrix representation   adjacency list representation

Consider the following sequence of queue operations: enqueue(d), enqueue(h), dequeue(), enqueue(f), enqueue(s), dequeue(), dequeue(). enqueue(m) Assume the queue is initially empty, what is the final state of queue? a) Front: dhf: end b) Front i dhfsmi end e) Front:sm: end d) Front : msfh d: end

Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts…