Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged isi2011-pcb-cs
4
votes
0
answers
1
ISI2011-PCB-CS-6b
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produces the simplest two-level AND-OR realization. Assume both uncomplemented and complemented inputs are available.
go_editor
asked
in
Digital Logic
Jun 3, 2016
by
go_editor
739
views
digital-logic
descriptive
isi2011-pcb-cs
k-map
9
votes
2
answers
2
ISI2011-PCB-CS-6a
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set. $\text{LOAD}$ and $\text{STORE}$ are indirect memory operations that load and store, using the address stored in the given register operand ... . Design an instruction encoding scheme that allows each of the above instructions (along with operands) to be encoded in $8$ bits.
go_editor
asked
in
CO and Architecture
Jun 3, 2016
by
go_editor
1.3k
views
co-and-architecture
descriptive
isi2011-pcb-cs
machine-instruction
15
votes
2
answers
3
ISI2011-PCB-CS-5c
One of your classmates has suggested the following modified version of a standard scheme for solving the $2$-process critical section problem (CSP). shared char want[2] = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = j; ... instructions executed by two processes $P_0$ and $P_1$. Modify the above scheme so that it becomes a correct solution to the $2$-process CSP.
go_editor
asked
in
Operating System
Jun 3, 2016
by
go_editor
1.2k
views
isi2011-pcb-cs
descriptive
operating-system
process-synchronization
normal
17
votes
4
answers
4
ISI2011-PCB-CS-5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?
go_editor
asked
in
Databases
Jun 3, 2016
by
go_editor
2.1k
views
descriptive
isi2011-pcb-cs
databases
database-normalization
2
votes
2
answers
5
ISI2011-PCB-CS-5a
Consider relations $R(A, B)$ and $S(B, C)$. Find a propositional formula $\phi$ such that the following two relational algebra expressions produce the same answer. $\pi_{A,B}(\sigma_\phi(R \bowtie S))$ $R \cap ({\rho_T(A)}(\pi_C(S)) \times \pi_B(S))$
go_editor
asked
in
Databases
Jun 3, 2016
by
go_editor
734
views
descriptive
isi2011-pcb-cs
databases
relational-algebra
2
votes
0
answers
6
ISI2011-PCB-CS-4c
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a hostname and a domain name. This is followed by an optional path specifier. Some example URLs are ... are the only characters that can be used in a host / domain / file / directory name, write a regular expression for URLs.
go_editor
asked
in
Theory of Computation
Jun 3, 2016
by
go_editor
373
views
descriptive
isi2011-pcb-cs
regular-expression
6
votes
2
answers
7
ISI2011-PCB-CS-4a
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that $L$ is not regular. $L^2$ is regular.
go_editor
asked
in
Theory of Computation
Jun 3, 2016
by
go_editor
970
views
descriptive
isi2011-pcb-cs
theory-of-computation
regular-language
1
vote
2
answers
8
ISI2011-PCB-CS-3c
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
go_editor
asked
in
Graph Theory
Jun 3, 2016
by
go_editor
584
views
descriptive
isi2011-pcb-cs
graph-theory
vertex-cover
2
votes
0
answers
9
ISI2011-PCB-CS-3b
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$. The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$. The $\text{centre } C$ of $T$ is the set of vertices which have minimum eccentricity among all ... centre and centroid, each having two vertices (i.e. $C \cap \mathcal{C} = \not{O}$ and $|C| = |\mathcal{C}| = 2)$.
go_editor
asked
in
Graph Theory
Jun 3, 2016
by
go_editor
590
views
descriptive
isi2011-pcb-cs
graph-theory
graph-connectivity
3
votes
4
answers
10
ISI2011-PCB-CS-3a
Solve the following recurrence ($n$ is a natural number): $T(n) = \begin{cases} 7T(n\div3)+n^2 & ;n>2 \\ 1 & ;n \leq 2. \end{cases}$
go_editor
asked
in
Algorithms
Jun 3, 2016
by
go_editor
736
views
descriptive
isi2011-pcb-cs
algorithms
recurrence-relation
2
votes
2
answers
11
ISI2011-PCB-CS-2
You are given $k$ sorted lists, each containing $m$ integers in ascending order. Assume that (i) the lists are stored as singly-linked lists with one integer in each node, and (ii) the head pointers of these lists are stored in an array. ... if you were permitted to use only constant additional storage? Analyse the time complexity of your algorithm for each of the above two cases.
go_editor
asked
in
Algorithms
Jun 3, 2016
by
go_editor
834
views
descriptive
isi2011-pcb-cs
algorithms
sorting
3
votes
2
answers
12
ISI2011-PCB-CS-1b
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of the line must be accomplished only by successively swapping pairs of adjacent students ... the number of swaps required. Derive an expression for the number of swaps needed by your algorithm in the worst case.
go_editor
asked
in
Algorithms
Jun 3, 2016
by
go_editor
783
views
isi2011-pcb-cs
descriptive
algorithms
sorting
1
vote
0
answers
13
ISI2011-PCB-CS-1a
The function $divby3$ given below is intended to check whether a given number is divisible by 3. It assumes that the argument $(number)$ is a string containing the decimal representation of a positive integer, and returns 1 or 0 depending on whether the ... for all positive integers. note: The smaller the number of ALU operations used by your function, the more marks you will get.
go_editor
asked
in
Digital Logic
Jun 3, 2016
by
go_editor
441
views
descriptive
isi2011-pcb-cs
number-representation
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged isi2011-pcb-cs
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...