The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged isi2017pcbb
0
votes
0
answers
1
ISI2017PCBB8(b)
Consider a simple code C for error detection and correction. Each codeword in C consists of 2 data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$ ... '+' is a modulo2 addition. Write down all the codewords for C Determine the minimum Hamming distance between any two distinct codewords of C
asked
Apr 8
in
Digital Logic
by
akash.dinkar12
Boss
(
41.3k
points)

27
views
isi2017pcbb
digitallogic
errordetection
programming
descriptive
0
votes
0
answers
2
ISI2017PCBB7(b)
Define a Boolean function $F(X_1, X_2, X_3, X_4, X_5, X_6)$ of six variables such that $\\ \begin{matrix} F & = & \text{1, when three or more input variables are at logic 1} \\ \: & = & \text{0, otherwise} \end{matrix} $ How many essential prime implicants does $F$ have? Justify they are essential.
asked
Apr 8
in
Digital Logic
by
akash.dinkar12
Boss
(
41.3k
points)

25
views
isi2017pcbb
digitallogic
primeimplicants
descriptive
0
votes
0
answers
3
ISI2017PCBB5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and $75$ percent of all pagetable references are ... memory reference time? Assume that finding a pagetable entry in the TLB takes $20$ nanoseconds, if the entry is present.
asked
Apr 8
in
Operating System
by
akash.dinkar12
Boss
(
41.3k
points)

42
views
isi2017pcbb
operatingsystem
paging
tlb
descriptive
0
votes
0
answers
4
ISI2017PCBB3(b)
Consider the following relations: $\text{STD_CHOICES } (\underline{Student\_ID}, \underline{Course\_ID}, Semester)$ and $COURSE\_ASSIGN (\underline{Teacher\_ID}, \underline{Course\_ID}, \underline{Semester})$. The former indicates the choice of courses for ... the ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
asked
Apr 8
in
Databases
by
akash.dinkar12
Boss
(
41.3k
points)

26
views
isi2017pcbb
databases
relationalalgebra
relationalcalculus
descriptive
0
votes
0
answers
5
ISI2017PCBB2(b)
Write a $C$ program to fins all permutations of a string (having at most 6 characters). For example, a string of $3$ characters like $"abc"$ has 6 possible permutations: $”abc", "acb", "bca", "bac", "cab", "cba".$
asked
Apr 8
in
Programming
by
akash.dinkar12
Boss
(
41.3k
points)

45
views
isi2017pcbb
programming
programminginc
descriptive
0
votes
0
answers
6
ISI2017PCBB1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
asked
Apr 8
in
Graph Theory
by
akash.dinkar12
Boss
(
41.3k
points)

42
views
isi2017pcbb
engineeringmathematics
discretemathematics
graphtheory
descriptive
0
votes
0
answers
7
ISI2017PCBB1(a)
Consider an alphabet $\Sigma = \{1, 2, 3\}$.Design a deterministic finitestate automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in nondecreasing sequence, from left to right. For example, the string $1123$ and $222$ would be accepted, whereas $21333$ will not be accepted.
asked
Sep 20, 2018
in
Theory of Computation
by
jothee
Veteran
(
98.5k
points)

36
views
isi2017pcbb
theoryofcomputation
finiteautomata
#dfa
0
votes
0
answers
8
ISI2017PCBB2(a)
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=12345$, then your program should print $s=15$, (2) if $ i=457$, then $s=16$.
asked
Sep 20, 2018
in
Programming
by
jothee
Veteran
(
98.5k
points)

18
views
isi2017pcbb
programming
programminginc
descriptive
0
votes
0
answers
9
ISI2017PCBB3(a)
Let $R(A,B,C)$ be a relation with primary key $(A)$ and $S(A, D, E)$ a relation with primary key $(A, D)$. Each of the relations has $n$ tuples. If the number of tuples in $R \: \text{ natural join } S$ is $m$, then determine the number of tuples in $R$ $\text{ natural left outer join } S$.
asked
Sep 20, 2018
in
Databases
by
jothee
Veteran
(
98.5k
points)

19
views
isi2017pcbb
databases
relationalalgebra
naturaljoin
0
votes
1
answer
10
ISI2017PCBB4
A file $F$ holds the nonzero elements of two large $n \times n$ matrices, $a$ and $B$. The matrix entries are sorted as triplets $(i, j, value)$, where $value$ is the $(i,j)$th element of a matrix. The file first stores the element of ... no, give reasons. If yes, provide a solution. Clearly explain the data structure and how you are going to store, retrieve, and add the elements.
asked
Sep 20, 2018
in
Algorithms
by
jothee
Veteran
(
98.5k
points)

43
views
isi2017pcbb
algorithms
timecomplexity
descriptive
0
votes
0
answers
11
ISI2017PCBB5(a)
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ and\ 10$ respectively. The current resource allocation state is shown below: Process Allocated Resources Maximum Requirements R1 R2 R3 R1 R2 R3 $P_1$ 2 2 3 3 6 ... ? Justify. If process $P_1$ now requests $(1,1,0)$ resources, then what will be the status of the new state?
asked
Sep 20, 2018
in
Operating System
by
jothee
Veteran
(
98.5k
points)

22
views
isi2017pcbb
operatingsystem
bankersalgorithm
descriptive
0
votes
0
answers
12
ISI2017PCBB6
Let $A=(a_1, a_2, \dots , a_n)$ be an array of $n$ distinct numbers. The array may not be sorted. The $first$ element $a_1$ is said to be a $blip$ if $a_1 > a_2$. Similarly, the $last$ element $a_n$ is said to be a $blip$ if $a_n>a_{n1}$. Among ... $O(\log n)$ time algorithm for finding a $blip$ in $A$. Justify the complexity of your algorithm.
asked
Sep 20, 2018
in
Algorithms
by
jothee
Veteran
(
98.5k
points)

14
views
isi2017pcbb
algorithms
timecomplexity
descriptive
0
votes
0
answers
13
ISI2017PCBB7(a)
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
asked
Sep 20, 2018
in
Digital Logic
by
jothee
Veteran
(
98.5k
points)

24
views
isi2017pcbb
digitallogic
functionalcompleteness
descriptive
0
votes
0
answers
14
ISI2017PCBB8(a)
Write the number $(5)^{\frac{1}{2}}$ in single precision IEEE 754 floating point form.
asked
Sep 20, 2018
in
Digital Logic
by
jothee
Veteran
(
98.5k
points)

41
views
isi2017pcbb
digitallogic
ieeerepresentation
descriptive
To see more, click for the
full list of questions
or
popular tags
.
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
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged isi2017pcbb
Recent Blog Comments
Thanks a lot
Please tell me when will the books be back in...
Congrats you deserved it. Best of Luck.
Sorry, that was missed. You'll get it today.
49,833
questions
54,797
answers
189,483
comments
80,677
users