Problem Description Learn Clojure In this problem, each person in the social network takes a specific time to send the message(time is an integer). A specific newbie in react(let's call him NB) wants to post a question to a ninja(let's call him NJ) on the network. Find out how long a specific message takes to reach NJ from NB. The social network is given as the input as follows. The first line is a number which is the number of people in the social network. The next following lines are the actual members of the social network whose names are written in separate lines. Following that is the number of connections, followed by a new line separated list of connections given as . Then on the next line is the person who wants to send the message(NB's id in our case) and on the next line is the person who is the intended recipient(NJ's id). The output should be a single line consisting of the time it takes to send the message through or -1 if the message can't be sent. INPUT FORMAT total members in ReactCommunity Network memberId1 MemberId2 MemberIdN Total possible edges

Problem Description Learn Clojure In this problem, each person in the social network takes a specific time to send the message(time is an integer). A specific newbie in react(let's call him NB) wants to post a question to a ninja(let's call him NJ) on the network. Find out how long a specific message takes to reach NJ from NB. The social network is given as the input as follows. The first line is a number which is the number of people in the social network. The next following lines are the actual members of the social network whose names are written in separate lines. Following that is the number of connections, followed by a new line separated list of connections given as . Then on the next line is the person who wants to send the message(NB's id in our case) and on the next line is the person who is the intended recipient(NJ's id). The output should be a single line consisting of the time it takes to send the message through or -1 if the message can't be sent. INPUT FORMAT total members in ReactCommunity Network memberId1 MemberId2 MemberIdN Total possible edges

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

An arcade game player wants to climb to the top of the leaderboard and track their ranking. The game uses Dense Ranking, so its leaderboard works like this: The player with the highest score is ranked number on the leaderboard. Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number. Example The ranked players will have ranks , , , and , respectively. If the player's scores are , and , their rankings after each game are , and . Return . Function Description Complete the climbingLeaderboard function in the editor below. climbingLeaderboard has the following parameter(s): int ranked[n]: the leaderboard scores int player[m]: the player's scores Returns int[m]: the player's rank after each new score Input Format The first line contains an integer , the number of players on the leaderboard.The next line contains space-separated integers , the leaderboard scores in decreasing order.The next…
Kingdom of Trolls is celebrating their Kingdom Day and one of the activities that is taking place is a game where a player rolls a magic ball down the hill on a path with spikes. As the ball rolls down, it strikes a spike and bursts open to release a number of smaller balls (in our simulated game, the number of smaller balls is a randomly generated integer between 2 and 6, inclusive). As the smaller balls further roll down, when one strikes a spike, that ball and all its sibling balls burst and each generates another set of smaller balls (using the same random number already generated for the first roll). The balls keep rolling downhill and striking spikes and bursting into smaller balls until a golden ball is released by one of the bursts. At this time, the game is over and the player is told how many balls were generated during the last burst (including the golden ball). The game is played by two players at a time and the player who had the lowest number of balls generated on the…
java - NetBeans
IN JAVA Alice and Bob are playing a board game with a deck of nine cards. For each digit between 1 to 9, there is one card with that digit on it. Alice and Bob each draw two cards after shuffling the cards, and see the digits on their own cards without revealing the digits to each other. Then Alice gives her two cards to Bob. Bob sees the digits on Alice’s cards and lays all the four cards on the table in increasing order by the digits. Cards are laid facing down. Bob tells Alice the positions of her two cards. The goal of Alice is to guess the digits on Bob’s two cards. Can Alice uniquely determine these two digits and guess them correctly? Input The input has two integers p,q (1≤p<q≤9) on the first line, giving the digits on Alice’s cards. The next line has a string containing two ‘A’s and two ‘B’s, giving the positions of Alice’s and Bob’s cards on the table. It is guaranteed that Bob correctly sorts the cards and gives the correct positions of Alice’s cards. Output If Alice can…
Q8 Hive Minds: Migrating Birds You again control a single insect, but there are B birds flying along known paths. Specifically, at time t each bird b will be at position (x¿(t), Yb(t)). The tuple of bird positions repeats with period T. Birds might move up to 3 squares per time step. An example is shown below, but keep in mind that you should answer for a general instance of the problem, not simply the map and path shown below. Your insect can share squares with birds and it can even hitch a ride on them! On any time step that your insect shares a square with a bird, the insect may either move as normal or move directly to the bird's next location (either action has cost 1, even if the bird travels farther than one square).
1.Implement Thirsty problem using semaphore . Scenario:To drink, a thirsty person must have three things; water, ice and a glass.There are three thirsty people, each having a different one (and only one) of the three required items. A fourth person, a server has unlimited supply of all three items. If nobody is drinking, the server places two of the three items (chosen at random) onto table. Thirsty person who can make a drink from those two items will pick them up and drink a glass of ice water. When done, thirsty person will notify the server and the process will repeat.
Please Answer in Java language Admission to college is just beginning and Chef has also just finished his high school. There are N colleges, listed from 11 to N, and listed from 11 to N. Each college has only one seat left. To apply for a college, each student must submit the same examination, the result of which determines their future, that is, the best student (the highest scorer) gets the first choice of college. Each student has a list of favourite colleges. They will want to get to the top ranked college on their list. If they can't get into it, they'll want to get into a second-ranked college in the middle of their list, and so on. If one vacant college seat is filled, that year's admission closes at that college. Then, people who have applied for that college should look for a lower college in their preferred list as long as it still has vacancies. Looking at the information about MM students, about their exam scores (given as standards) and the college IDs they apply for, find…
Random walk. A Java programmer begins walking aimlessly. At each time step, she takes one step in a random direction (either north, east, south, or west), each with probability 25%. She stops once she is at Manhattan distance r from the starting point. How many steps will the random walker take? This process is known as a two- dimensional random walk.
Not as previous code :-.
Q2: Secret Courses Dan’s recently announced that he’s teaching n top-secretcourses nextsemester. Instead of enrolling in them through ACORN, students need to email Dan to express theirinterests. These courses are numbered from 1 to n in some arbitrary order. In particular, if a student named s is interested in taking a course c, they need to send an email to Dan containing the message c s. Note that if a student is interested in taking multiple courses, they need to send multiple emails, one per course. Upon receiving a message c s, Dan looks at the list of students already enrolled in course c. If there’s already a student on the list whose name is too similar to s, Dan assumes s is the same student and ignores the message. Otherwise, he enrolls s in the course. Dan considers two names too similar if and only if they have the same length and differin at most one letter(note that“a” and “A” are considered the same letter). For example, “Josh” and “Josh” are too similar. “Sam” and “CaM”…
A Rajesh teaches a cooking class. The course is attended by NN students, numbered 11 to NN. The cook must participate in the presence before each class, i.e. call out the names of the students one by one and indicate which students are present. Each student has a first and last name. To save time, Rajesh only wants to call up students' first names. However, if there are multiple students with the same first name, the Rajesh must call out the full names (first and last names) of all those students. For any student who does not share a first name with any other student, the cook can still only call that student's first name. Help the Rajesh decide for each student whether to call that student's full name or just their first name. Note: Please Answer in java language only. Input 1 1 hasan jaddouh Output hasan
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. anglers have recently gotten back from a fishing excursion. The I-th angler has gotten a fish of weight man-made intelligence. Anglers will flaunt the fish they got to one another. To do as such, they initially pick a request where they show their fish (every angler shows his fish precisely once, in this way, officially, the request for showing fish is a stage of integers from 1 to n). Then, at that point, they show the fish they discovered by the picked request. At the point when an angler shows his fish, he may either become glad, become dismal, or stay content. Assume an angler shows a fish of weight x, and the most extreme load of a formerly shown fish is y (y=0 if that angler is quick to show his fish). Then, at that point: in the event that x≥2y, the angler becomes cheerful; in the event that 2x≤y, the angler becomes miserable; in the event that none of these two…