1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Let P(E) denote the probability of the event E. Given P(A) = 1, P(B) = $${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}}$$, the values of $$P\,(A\,\left| {B) \,} \right.$$ and $$P\,(B\,\left| {A) \,} \right.$$ respectively are
A
$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 4$}},\,{\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}}$$
B
$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}},\,{\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 4$}}$$
C
$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}},\,1$$
D
$$1,\,\,{\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}}$$
2
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
The following resolution rule is used in logic programming. Derive clause $$\left( {P \vee Q} \right)$$ from clauses $$\left( {P \vee R} \right)$$, $$\left( {Q \vee \neg R} \right)$$.

Which of the following statements related to this rule is FALSE?

A
$$\left( {\left( {P \vee R} \right) \wedge \left( {Q \vee \neg R} \right)} \right) \Rightarrow \left( {P \vee Q} \right)$$ is logically valid
B
$$\left( {P \vee Q} \right) \Rightarrow \left( {\left( {P \vee R} \right) \wedge \left( {Q \vee \neg R} \right)} \right)$$ is logically valid
C
$$\left( {P \vee Q} \right)$$ is satisfiable if and only if $${\left( {P \vee R} \right) \wedge \left( {Q \vee \neg R} \right)}$$ is satisfiable
D
$$\left( {P \vee Q} \right) \Rightarrow $$ FALSE if and only if both $$P$$ and $$Q$$ are unsatisfiable
3
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statically linked libraries?
A
Smaller sizes of executable files
B
Lesser overall page fault rate in the system
C
Faster program startup
D
Existing programs need not be re-linked to take advantage of newer versions of libraries.
4
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
A processor uses $$2$$-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $$32$$ bits wide. The memory is byte addressable. For virtual to physical address translation, the $$10$$ most significant bits of the virtual address are used as index into the first level page table while the next $$10$$ bits are used as index into the second level page table. The $$12$$ least significant bits of the virtual address are used as offset within thepage. Assume that the page table entries in both levels of page tables are $$4$$ bytes wide. Further, the processor has a translation look-aside buffer (TLB), with a hit rate of $$96$$%. The TLB caches recently used virtual page numbers and the corresponding physical page numbers. The processor also has a physically addressed cache with a hit rate of $$90$$%. Main memory access time is $$10$$ ns, cache access time is $$1$$ ns, and TLB access time is also $$1$$ ns.

Suppose a process has only the following pages in its virtual address space: two contiguous code pages starting at virtual address $$0 \times 00000000,$$ two contiguous data pages starting at virtual address $$0 \times 00400000,$$ and a stack page starting at virtual address $$0 \times FFFFF000.$$ The amount of memory required for storing the page tables of this process is

A
$$8$$ KB
B
$$12$$ KB
C
$$16$$ KB
D
$$20$$ KB
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12