Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ramakrishna
1
answer
1
L= {ap ∣ p is a prime }
L= {ap ∣ p is a prime } Is this a CSL ? Plx Explain
L= {ap ∣ p is a prime }Is this a CSL ? Plx Explain
17.5k
views
commented
Oct 28, 2019
5
answers
2
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
9.7k
views
answered
Feb 14, 2017
Compiler Design
gatecse-2017-set2
compiler-design
match-the-following
compilation-phases
easy
+
–
2
answers
3
Toc-Recursively Ennumerable
A is a decision problem. If A is recursively ennumerable then there exists an algorithm which halts on every string in A. True or false.Cite with reasons.
A is a decision problem. If A is recursively ennumerable then there exists an algorithm which halts on every string in A.True or false.Cite with reasons.
1.3k
views
answered
Feb 10, 2017
Theory of Computation
recursive-and-recursively-enumerable-languages
theory-of-computation
+
–
2
answers
4
GATE CSE 2010 | Question: 7
The main memory unit with a capacity of $4$ $\text{megabytes}$ is built using $1\text{M} \times \text{1-bit}$ DRAM chips. Each DRAM chip has $1\text{K}$ rows of cells with $1\text{K}$ cells in each row. The time taken for a single ... in the memory unit is $100$ nanoseconds $100\times 2^{10}$ nanoseconds $100\times 2^{20}$ nanoseconds $3200\times 2^{20}$ nanoseconds
The main memory unit with a capacity of $4$ $\text{megabytes}$ is built using $1\text{M} \times \text{1-bit}$ DRAM chips. Each DRAM chip has $1\text{K}$ rows of cells wit...
19.0k
views
commented
Feb 5, 2017
Digital Logic
gatecse-2010
digital-logic
memory-interfacing
normal
+
–
2
answers
5
Routing Tables Network Layer
Please tell me which interface will be selected for the above IP address
Please tell me which interface will be selected for the above IP address
1.2k
views
answer selected
Feb 3, 2017
Computer Networks
network
network-layering
+
–
2
answers
6
recurrance relation
Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2, where c is a positive constant. What is the asymptotic growth of T(n)? $\Theta(n)$ $\Theta(n \log n)$ $\Theta (n^2)$ $\Theta \left(n^{\log_{\frac{3}{4}}n}\right)$
Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2,...
896
views
answered
Feb 3, 2017
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
4
answers
7
paging
Q. Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?
Q.Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire pro...
6.9k
views
answer edited
Dec 30, 2016
Operating System
paging
operating-system
memory-management
virtual-memory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register