Which of the following objects can be used in expressions an
Which of the following objects can be used in expressions and scriplets in JSP without explicily declaring them ?
Which of the following objects can be used in expressions and scriplets in JSP without explicily declaring them ?
Nithin K ? Dec 7 '2016 at 23:16
Answer : Session and request only
Explanation:
Implicit objects in JSP are
Session: The session object for the client.
Request: the request triggering the execution of the JSP page.
What is the correct HTML tag for the largest heading ?
Nithin K ? Dec 7 '2016 at 23:15
Answer : h1
Explanation:
The "<h1>" to "<h6>" tags are used to define HTML headings. "<h1>" defines the most important heading. "<h6>" defines the least important heading.
At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be
Nithin K ? Dec 7 '2016 at 22:24
Answer: 18
Explanation:
P means wait ie S:= S-1;
V means signal i.e S= S+1;
Each P operation will decrease the semaphore value by 1 and V operation increases by 1.
So,
7 -> 20p -> Xv = 5
=>7-20+X=5
=> X = 18.
In a paged memory, the page hit ratio is 0-65. Time required to access a page from secondary memory is 100 ns and from the main memory is 10 ns. The average time required to access a page is
Nithin K ? Dec 7 '2016 at 22:22
Answer : 41.5 ns
Explanation:
Time to access page in primary = 0.35*10 =3.5ns.
Miss ratio = (1-0.35) = 0.65
Missed pages will in secondary memory.
Time to access page in secondary memory =Miss ratio*time for secondary memory
\(=(1-0.35)\times100=65.0ns\)
Average time req is= Ts+Tp =65.0ns+3.5ns=68.5ns
Nithin K ? Dec 7 '2016 at 22:3
Answer: 100
Explanation:
From the given set of functional dependencies, it can be observed that B is a candidate key of R.
So all 200 values of B must be unique in R. There is no functional dependency given for S. To get the maximum number of tuples in output, there can be two possibilities for S.
1) All 100 values of B in S are same and there is an entry in R that matches with this value. In this case, we get 100 tuples in output.
2) All 100 values of B in S are different and these values are present in R also. In this case also, we get 100 tuples.
Assume the following relational schema :
Suppliers ( sid ; sname ; city ; street )
Parts ( pid ; pname ; pcolor )
Catalog ( sid ; pid ; cost).
Assume each supplier and each street within the city is unique and ( sname, city ) forms a candidate key. No other functional dependencies, except those implied in the schema exist. Which of the following statements is true ?