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
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged isi2017pcbcs
0
votes
0
answers
1
ISI2017PCBCS8b
Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$ ... . Write down all the codewords for $\mathcal{C}$ Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$
asked
Apr 8
in
Digital Logic
by
akash.dinkar12
Boss
(
41.8k
points)

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

30
views
isi2017pcbcs
digitallogic
primeimplicants
descriptive
0
votes
0
answers
3
ISI2017PCBCS5(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.8k
points)

56
views
isi2017pcbcs
operatingsystem
paging
tlb
descriptive
0
votes
0
answers
4
ISI2017PCBCS3b
Consider the following relations: $\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and $\text{COURSE_ASSIGN} (\underline{\text{Teacher_ID}}, \underline{\text{Course_ID}}, \underline{\text{Semester}})$. The ... 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.8k
points)

43
views
isi2017pcbcs
databases
relationalalgebra
relationalcalculus
descriptive
0
votes
1
answer
5
ISI2017PCBCS2(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.8k
points)

60
views
isi2017pcbcs
programming
programminginc
descriptive
0
votes
0
answers
6
ISI2017PCBCS1(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.8k
points)

47
views
isi2017pcbcs
engineeringmathematics
discretemathematics
graphtheory
descriptive
0
votes
1
answer
7
ISI2017PCBCS1(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
(
104k
points)

46
views
isi2017pcbcs
theoryofcomputation
finiteautomata
#dfa
0
votes
1
answer
8
ISI2017PCBCS2(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
(
104k
points)

23
views
isi2017pcbcs
programming
programminginc
descriptive
0
votes
1
answer
9
ISI2017PCBCS3a
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
(
104k
points)

28
views
isi2017pcbcs
databases
relationalalgebra
naturaljoin
0
votes
1
answer
10
ISI2017PCBCS4
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, \text{value})$, where $\text{value}$ is the $(i,j)$th element of a matrix. The file first ... If 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
(
104k
points)

49
views
isi2017pcbcs
algorithms
timecomplexity
descriptive
+1
vote
0
answers
11
ISI2017PCBCS5(a)
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ ... safe? 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
(
104k
points)

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

19
views
isi2017pcbcs
algorithms
timecomplexity
descriptive
0
votes
0
answers
13
ISI2017PCBCS7a
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
(
104k
points)

29
views
isi2017pcbcs
digitallogic
functionalcompleteness
descriptive
0
votes
0
answers
14
ISI2017PCBCS8a
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
(
104k
points)

44
views
isi2017pcbcs
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
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Follow @csegate
Recent questions tagged isi2017pcbcs
Recent Blog Comments
What region behind page not found in gate...
Sir can you please suggest some way like how can...
I think it's been refactored...
@ankitgupta.1729 options after JEST for...
@ankitgupta.1729 @arjun sir There is no...
50,651
questions
56,214
answers
194,177
comments
95,439
users