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 Sandeep_ranweer
5
answers
1
GATE CSE 1997 | Question: 3.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable?Set of all strings over $\Sigma$Set of all languages over $\Sigma$Set of all regular languages ov...
12.4k
views
commented
Jan 27, 2021
Theory of Computation
gate1997
theory-of-computation
normal
countable-uncountable-set
+
–
3
answers
2
TIFR CSE 2011 | Part B | Question: 23
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of non-empty subsets of a universe $U.$ Note that the sets in this collection need not be distinct. Consider the following basic step to be performed on this sequence. While there exist ... finite universe $U$ and a choice of $S_{i}$ and $S_{j}$ in each step such that the process does not terminate
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of non-empty subsets of a universe $U.$ Note that the sets in this collection need not be distinct. Consider ...
2.1k
views
commented
Sep 26, 2020
Set Theory & Algebra
tifr2011
set-theory&algebra
set-theory
+
–
1
answer
3
paging
Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page ... purpose? < 2, 12, 12, 12 > <10,14,14,14> <4,14,14,14> <10,12,14,14>
Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies...
1.4k
views
commented
Aug 22, 2020
Operating System
paging
operating-system
memory-management
multilevel
+
–
5
answers
4
GATE CSE 2003 | Question: 67
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A single-source shortest path ... edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows.$$w(e) = \begin{cases} 0 \text{, if } e \in E_...
20.1k
views
commented
Jun 25, 2020
Algorithms
gatecse-2003
algorithms
graph-algorithms
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register