Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Discuss the following elements as they relate to the Entity-Relationship Model: Entities, Attributes, Identifiers, and Relationships
You are given a number in binary notation. The goal is to convert it to decimal notation. For example, if the input is "10100" then the output is "20".
Perform a box trace of the recursive binary search function with the array containing the values 1,5,9,12,21,29,31 when searching for each of the following values: 5,13,16
The user submit her/his name to the system, the system will tell the user if he is a boy or a girl or don't know by looking up his name in database of names saved
Write functions to implement the split, merge, and mergesort algorithms for files. Also, write driver programs to test the given functions.
What is the optimal global alignment for MOAT and BOAST? Show all optimal alignments and the corresponding paths under the scoring matrix below and indel penalty
Write pseudocode "to implement a thread-safe CountdownEvent using locks and condition variables by implementing the following methods" (lists 4 methods) and then "implement a Barrier using a Countdown
Analysis of Quicksort with equal array elements
Give an algorithm to decide whether the language recognized by a DFA is empty. Given two DFAs M1 and M2, give an algorithm to decide whether L(M1)subset or equal to L(M2). Given two DFAs M1 and M
After completing this PPC training course, you have been hired as by Mountain View community Hospital. Your first assignment is to work as a team of three persons to develop a high-level E-R diagram f
Give a linear-time algorithm to find an odd-length cycle in a directed graph. You may NOT assume that the graph is strongly connected. (Hint: First solve this problem under the assumption that the gra
We are going on a trip along the Appalachian trail. We have a list of all possible campsites that we can camp in along the way (say n). We want to do this trip in exactly k days, stopping k - 1 nights
Write the business rules that are reflected in the ERD.(Note that the ERD reflects some simplifying assumptions.For example,each book is written by only one author. also remember that the ERD is alway
A salesperson leaves his hom every Monday and returns every Friday. He travels by company car. Each day on the road, the salesperson records the amount of gasoline put in the car.
A more efficient way to sort data would be the Insertion Sort. What makes the Insertion Sort better than the Bubble Sort is that there are fewer comparisons to make; hence the data is ordered quicker.
Construct a data dictionary and draw a hierarchy chart and flowchart or pseudocode for a program that merges three sales files (SALES1, SALES2, and SALES3).
The Director of the University Accommodation Office requires you to design a database to assist with the administration of the office. The requirements collection and analysis phase of the database de
Consider the algorithmic problem Range de ned as follows: Input: a, possibly NULL, node x in a binary search tree; two key values a,b with a less or egual to b; Output: the sequence of entries in the
Use the E-R approach to model the operations of your local community library. The library has books, CDs, tapes, and so forth, which are lent to library patrons
Use the E-R approach to model the operations of your local community library. The library has books, CDs, tapes, and so forth, which are lent to library patrons. The latter have accounts, addresses, a
Write a procedure called Burst that moves the pen to a random location on the screen, moves the pen color forward 256, and then draws a firework burst with a random size and number of rays.
Create a DTD for a small XML data set drawn from the Stanford course catalog. There are multiple departments, each with a department chair, some courses, and professors and/or lecturers who teach cour
Suppose we extend the LoanableItem hierarchy to create new classes for CDs, DVDs and books on tape. CDs and DVDs have several common characteristics.
Describe an algorithm that finds a maximum feasible flow in G. Denote by MF(|V|, |E|) the worst-case running time of an ordinary maximum flow algorithm on a graph with |V| vertices and |E| edges. Anal