Learn more about our help with Assignments: Programming & Computer Science
Search & Filtering
Design the database for a programming support environment. In this environment programmers produce programs, which are written in given programming languages. Each program is written by a given programmer, can call other programs, and can be used by given users. Users are recognized by their log-in names. Programmers are recognized by their log-in name and by their code. Programs have compound names that include the program’s name, the extension and the programmer’s code. Programs have a version number, a date and a short description; some programs interact with DBMSs. Each DBMS maintains stored data in the form of relations, with several attributes and one primary key. Each database is defined by a database administrator, who is a programmer specialized in data management. State clearly any assumptions you make.
Required
(a) Construct an ER diagram from the description above.
Required
(a) Construct an ER diagram from the description above.
real life examples of single inheritance ,multiple ,multilevel,hierarchical, hybrid inheritance
Divide 0001010001001001 (BCD) by (1001)2 and express the result in octal equivalent .
In demand paging 200ns is required to satisfy a memory request if the page is in the memory. If the page is not in memory it takes 7ms if free frame is available, 15ms if page to be swapped. Calculate the Effective Access time if page fault rate is 5% and 60% of time the page has to be replaced.
Consider a set 4 processes (P1,P2,P3,P4) with 3 units of R1, 4 units of R2, 3 units of R3 and 2 units of R4. Further, P1 holds 2 units of R1 and waits for 1 unit of R2. P2 waits for 2 units of R1 and holds 1 unit of R2, P3 holds 2 units of R3 and waits for 1 unit of R4, P4 holds 2 units of R3 and waits for 1 unit of R4. Construct the wait-for graph. Does the system have a deadlock? Justify your answer
Consider the logical address of an instruction in a program memory is 7632 and the contents
of relocation register are 2500. To which location in the memory will this address be
mapped?
of relocation register are 2500. To which location in the memory will this address be
mapped?
what is the best data structure to solve this problem ? ( I will use Scala )
Your job is to read an arbitrary number of words from the standard input and keep track how many times each word occurs in the input. After the end of the input is reached, print how many times each unique word has occurred (in no particular word order or numerical order
For example, if the input is
hello hello
world goodbye hello
world
then one possible output is
world 2
goodbye 1
hello 3
Your job is to read an arbitrary number of words from the standard input and keep track how many times each word occurs in the input. After the end of the input is reached, print how many times each unique word has occurred (in no particular word order or numerical order
For example, if the input is
hello hello
world goodbye hello
world
then one possible output is
world 2
goodbye 1
hello 3
1. What is an Abstract Data Type (ADT) for? Illustrate answer with any particular ADT.
2. write out in pseudocode an algorithm to perform a depth-first search for a directed, unweighted graph.
3. Describe two ways in which a graph might be implemented, and explain the main differences between them. Also discuss the circumstances in which you would choose each one.
2. write out in pseudocode an algorithm to perform a depth-first search for a directed, unweighted graph.
3. Describe two ways in which a graph might be implemented, and explain the main differences between them. Also discuss the circumstances in which you would choose each one.
can database be created in MS Excel?
i) Describe in detail (using pseudocode) the implementation of a priority queue based on a sorted
array. Show that your implementation achieves O(1) for operations min and removeMin, and O(n)
for insertions.
ii) Explain in a high-level way as well as in pseudo code how the removeMin operation works in
a min-heap.
iii). Explain in a high-level way and also using pseudo-code how to insert a key into a hash
table that uses linear probing for collisions. Assume the hash table is implemented using an array.
array. Show that your implementation achieves O(1) for operations min and removeMin, and O(n)
for insertions.
ii) Explain in a high-level way as well as in pseudo code how the removeMin operation works in
a min-heap.
iii). Explain in a high-level way and also using pseudo-code how to insert a key into a hash
table that uses linear probing for collisions. Assume the hash table is implemented using an array.
