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.
Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).(Note: It is to be remembered that both the size of Arr and k are unknown.)Array index is starting from 1 not 0 [pseudo code needed]Example:Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …key: 15returned value: 5Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …key: 900returned value: -1
Please use python and python file i/o to solve the problem. Create an input file input3_1.txt as shown below, solve the problem and print the output to output3_1.txt file as shown in the question. Input: The first line contains two integers N and M (1
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.
x <- bubblesort(sample(1:6, size=5, replace=T)) if (x[1]==x[5]){ hand <-"Yahtzee" } else if (x[1]==x[4] ] x[2]==x[5]) { hand <- "4ofKind" } } else { hand <-"Chance" } The above code lays this out for Yahtzee and 4 of a kind. Find statements that work for the rest and put this into a function called get hand , which returns what type of hand was rolled from a sorted roll of five dice. Make sets of rolls and test them to make sure they work. Note that above we use an else if, which allows us to test multiple conditions in an if-else statement.
The following question requires to be done in Python. Thanks in advance
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 this project, you will implement a single linked list structure that represents a list of Tawjihi records and do different operations on the records within that linked list. The inputs for the project will be the two Tawjihi files (One file for West Bank and the other for Gaza records). Each line in those files contains the Tawjihi record of a student (seat number, average, and branch). You may use the code you wrote/implemented during the lectrure to create and store Tawjihi record data into your single Linked List(s). You are free to use as many linked lists as needed. YOU MAY NOT USE ARRAYS IN THIS PROJECT. For good user experience, you will need to implement a user interface. In the user interface there should be a way to select between WestBank or Gaza as well as an option to select between branchs "Literary or Science". According to the previouse selction the following functions will operate in the specfic selected data above: 1. An option to insert new Tawjihi record into the…
PYTHON Given a list of items with a value, and a start and end flag, implement a function that calls another function once you have a full valid set (aka you have each item between start and end). A valid set might look like this:{ val: 0, start: false, end: false }, { val: 1, start: true, end: false }, { val: 3, start: false, end: true }, { val: 2, start: false, end: false }, { val: 7, start: false, end: false } where the valid set only includes items 1, 2, and 3. I used a priority queue for this
please solve B number question with python language
You are tasked to implement an abstract data type class which takes in a given input file called input.txt, and processes, identifies and sorts all unique word instances found in the file. Sample Input Hi hello hi good bye goodbye Bye bye good say Sample Output Bye Hi bye hello hi say The input.txt file is found along with the zip folder where this instructions file also came along with. Note: you are not allowed to use pythonic lists, and its methods and functions, and string methods. However the use of the file handling methods (read readlines and readline) are allowed for this project.
must answwer attach output screenshot