You have a family tree diagram like the following, very small, sample tree and file. It is stored as a file with the following format (parent: , one line for all people in the tree). Your task is to be able to find the descendants of any person in a family tree, e.g. the descendants of p1 are p4.p5,p7,p8 in O(|PI) time, where P is the set of people in the graph. "Sketching" the approach is fine but you may give full pseudocode, just reuse an algorithm from class, perform some obvious conversion (Adjacency Matrix to/from Array List, etc.) or some combination of these. You may not use depth first search or breadth first search. You may preprocess the input with any polynomial approach and may assume the |P| people in the tree are labelled po, p1, ..p. p0: p4, p5 pl: p4, p5 p2: p6 p3: p6 p4:

You have a family tree diagram like the following, very small, sample tree and file. It is stored as a file with the following format (parent: , one line for all people in the tree). Your task is to be able to find the descendants of any person in a family tree, e.g. the descendants of p1 are p4.p5,p7,p8 in O(|PI) time, where P is the set of people in the graph. "Sketching" the approach is fine but you may give full pseudocode, just reuse an algorithm from class, perform some obvious conversion (Adjacency Matrix to/from Array List, etc.) or some combination of these. You may not use depth first search or breadth first search. You may preprocess the input with any polynomial approach and may assume the |P| people in the tree are labelled po, p1, ..p. p0: p4, p5 pl: p4, p5 p2: p6 p3: p6 p4:

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

In this problem you will implement a function called triangle_countwhich will take as input a graph object G, representing an undirectedgraph G, and will return the number of triangles in G. Do not use anyimports for this problem. To simplify the problem you may assume thateach edge is stored twice in G. That is if an edge goes from u to v then vwill be in u’s collection and u will be in v’s collection. If you would prefer,you may assume that an edge is only stored once. In either case G willneed to be regarded as undirected.
A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.
In this task you will work with the linked list of digits we have created in the lessons up to this point. As before you are provided with some code that you should not modify: A structure definition for the storage of each digit's information. A main() function to test your code. The functions createDigit(), append(), printNumber(), freeNumber(), readNumber() and divisibleByThree() (although you may not need to use all of these). Your task is to write a new function changeThrees() which takes as input a pointer that holds the address of the start of a linked list of digits. Your function should change all of those digits in this linked list that equal 3 to the digit 9, and count how many replacements were made. The function should return this number of replacements. Provided code
In python We have a list (named data) of numbers sorted in ascending order, for example: data = [2, 4, 5, 9, 10, 12, 13, 17, 18, 20] Write a function (named DataVar(data)), which take a list (data) as input parameter and performs the following steps on the list: 1) it finds the mean m of the data (for the given example, it is m = (2 + 4 + 5 + 9 + 10 + 12 + 13 + 17 + 18 + 20)/10 =110/10 = 11). 2) then, it finds the difference of data and m. Essentially, it finds for all data: Diff = data-m For the given example, Diff = [-9, -7, -6, -2, -1, 1, 2, 6, 7, 9]. 3) then, it finds the sum of Diff and 7. Essentially, it finds for all data: Sums = Diff+7 For the given example, Sums = [-2, 0, 1, 5, 6, 8, 9, 13, 14, 16]. 4) then, it finds the square of all the elements of Sums, such that Squares = square of the elements of Sums. For the given example, Squares = [4, 0, 1, 25, 36, 64, 81, 169, 196, 256]. 5) it finds the average of Squares and stores it in result, and returns it. For the given…
Can you help me with a C++ programming task I am trying to complete for myself please: Write a program (in main.cpp) that: Prompts the user for a filename containing node data. Outputs the minimal spanning tree for a given graph. You will need to implement the createSpanningGraph method in minimalSpanTreeType.h to create the graph and the weight matrix. There are a few tabs: main.cpp, graphType.h, linkedList.h, linkedQueue.h, queueADT.h, minimalSpanTreeType.h, and then two data files labeled: CH20_Ex21Data.txt, CH20Ex4Data.txt
we showed you the code#for two versions of binary_search: one using recursion, one#using loops. For this problem, use the recursive one.##In this problem, we want to implement a new version of#binary_search, called binary_search_year. binary_search_year#will take in two parameters: a list of instances of Date,#and a year as an integer. It will return True if any date#in the list occurred within that year, False if not.##For example, imagine if listOfDates had three instances of#date: one for January 1st 2016, one for January 1st 2017,#and one for January 1st 2018. Then:## binary_search_year(listOfDates, 2016) -> True# binary_search_year(listOfDates, 2015) -> False##You should not assume that the list is pre-sorted, but you#should know that the sort() method works on lists of dates.##Instances of the Date class have three attributes: year,#month, and day. You can access them directly, you don't#have to use getters (e.g. myDate.month will access the#month of myDate).##You may…
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
in this assignment i have to remove vowels from a string using a linked list. the linked list and link code is from a textbook and cannot be changed if the code alters the data structure. for some reason when i implement this code it gives me a logical error where the program only removes all instances of the first vowel in a string instead of moving through all vowels of the string and removing each one with all instances. i would appreciate if you could tell me the problem and solution in words and not in code. The code is in java. output please enter a string.researchhcraeserfalseList (first -->last): researchList (first -->last): researchList (first -->last): rsarch CODE MAIN FUNCTION import java.util.Scanner;/*** Write a description of class test here.** @author (your name)* @version (a version number or a date)*/public class test{// instance variables - replace the example below with your ownpublic static void main(String[] args){Scanner input = new…