Other Programming & Computer Science Answers

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 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?

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

R-8.1: The following questions refer to the tree of Figure 8.3 ( http://postimg.org/image/xwijnajxj/ ) in the textbook Data Structures and
Algorithms in Java (Sixth Edition) Goodrich, Tamassia and Goldwasser
1. Which node is the root?
2. What are the internal nodes?
3. How many descendants does node sc016/ have?
4. How many ancestors does node sc016/ have?
5. What are the siblings of node homeworks/?
6. Which nodes are in the subtree rooted at node projects/?
7. What is the depth of node papers/?
8. What is the height of the tree?

1. Suppose an initially empty stack S has performed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which returned null to indicate an empty stack. What is the current size of S?

2. Suppose an initally empty queue Q has performed a total of 32 enqueue operations, 10 first operations, and 15 dequeue operations, 5 of which returned null to indicate an empty queue. What is the current size of Q?

1. Describe a recursive algorithm for finding the maximum element in an array A of n elements. What
is the running time of your algorithm?

2. Draw the recursion trace for the execution of reverseArray(data, 0, 4), on the array data = 4, 3, 6, 2, 6.

3. Give an algorithm for finding the second-to-last node in a singly-linked list ub which the last node is
indicated by a null next reference.

4. Suppose we are maintaining a collection C of elements such that, each time we add a new element
to the collection, we copy the contents of C into a new array list of just the right size. What is the
running time of adding n elements to an initially empty collection C in this case?

The program will ask for a number. Then will display the odd numbers on that number in javascriptv

Does the design pattern play any important role in the development of quality applications by using structured and object oriented paradigm? Justify your answer with logical reasons.

(Software Engineering)
Does the design pattern play any important role in the development of quality applications by using structured and object oriented paradigm? Justify your answer with logical reasons.

Hi,I wanna be a self taught programmer but somehow I lost my confidence few months ago and to be honest I know I can but the question is how I would earn?As I am from India and people over here tend to run for college after finishing school.But I don't want to waste my money and nor I have that much for those teachers who don't teach but only want to earn money.Especially over here the education is becoming a business.When I tell someone that I am learning by myself ,they give me a hell look and after their look it feels like I am a dumb idiot sitting at home because I am a failure.Today two of my classmates came to visit me and after they told me that they have joined a college ,I felt ashamed of myself and also felt bad for my parents that when anyone asks them that what their child is doing they cannot answer much.What should I do?I passed my school last year and don't want to waste more time.Please help me.