Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isi2017-pcb-cs
0
votes
1
answer
1
ISI2017-PCB-CS-8-b
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}$
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_...
akash.dinkar12
778
views
akash.dinkar12
asked
Apr 8, 2019
Digital Logic
isi2017-pcb-cs
digital-logic
error-detection
programming
descriptive
+
–
1
votes
1
answer
2
ISI2017-PCB-CS-7-b
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.
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 a...
akash.dinkar12
646
views
akash.dinkar12
asked
Apr 8, 2019
Digital Logic
isi2017-pcb-cs
digital-logic
prime-implicants
descriptive
+
–
1
votes
1
answer
3
ISI2017-PCB-CS-5(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 page-table references are ... memory reference time? Assume that finding a page-table entry in the TLB takes $20$ nanoseconds, if the entry is present.
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 Tra...
akash.dinkar12
8.4k
views
akash.dinkar12
asked
Apr 8, 2019
Operating System
isi2017-pcb-cs
operating-system
paging
translation-lookaside-buffer
descriptive
+
–
0
votes
0
answers
4
ISI2017-PCB-CS-3-b
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.
Consider the following relations:$\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and$\text{COURSE_ASSIGN} (\underline...
akash.dinkar12
767
views
akash.dinkar12
asked
Apr 8, 2019
Databases
isi2017-pcb-cs
databases
relational-algebra
relational-calculus
descriptive
+
–
1
votes
1
answer
5
ISI2017-PCB-CS-2(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".$
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...
akash.dinkar12
510
views
akash.dinkar12
asked
Apr 8, 2019
Programming in C
isi2017-pcb-cs
programming
programming-in-c
descriptive
+
–
1
votes
1
answer
6
ISI2017-PCB-CS-1(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$.
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$.
akash.dinkar12
893
views
akash.dinkar12
asked
Apr 8, 2019
Graph Theory
isi2017-pcb-cs
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
descriptive
+
–
1
votes
1
answer
7
ISI2017-PCB-CS-1(a)
Consider an alphabet $\Sigma = \{1, 2, 3\}.$ Design a deterministic finite-state automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in non-decreasing sequence, from left to right. For example, the string $1123$ and $222$ would be accepted, whereas $21333$ will not be accepted.
Consider an alphabet $\Sigma = \{1, 2, 3\}.$ Design a deterministic finite-state automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in non-...
go_editor
716
views
go_editor
asked
Sep 20, 2018
Theory of Computation
isi2017-pcb-cs
theory-of-computation
finite-automata
+
–
0
votes
2
answers
8
ISI2017-PCB-CS-2(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$.
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=123...
go_editor
408
views
go_editor
asked
Sep 20, 2018
Programming in C
isi2017-pcb-cs
programming
programming-in-c
descriptive
+
–
1
votes
2
answers
9
ISI2017-PCB-CS-3-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$.
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 i...
go_editor
501
views
go_editor
asked
Sep 20, 2018
Databases
isi2017-pcb-cs
databases
relational-algebra
natural-join
+
–
0
votes
1
answer
10
ISI2017-PCB-CS-4
A file $F$ holds the non-zero 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.
A file $F$ holds the non-zero elements of two large $n \times n$ matrices, $a$ and $B$. The matrix entries are sorted as triplets $(i, j, \text{value})$, where $\text{val...
go_editor
611
views
go_editor
asked
Sep 20, 2018
Algorithms
isi2017-pcb-cs
algorithms
time-complexity
descriptive
+
–
1
votes
1
answer
11
ISI2017-PCB-CS-5(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?
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ respectively. The current resource allocati...
go_editor
1.6k
views
go_editor
asked
Sep 20, 2018
Operating System
isi2017-pcb-cs
operating-system
bankers-algorithm
descriptive
+
–
0
votes
0
answers
12
ISI2017-PCB-CS-6
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.
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 ...
go_editor
449
views
go_editor
asked
Sep 20, 2018
Algorithms
isi2017-pcb-cs
algorithms
time-complexity
descriptive
+
–
1
votes
1
answer
13
ISI2017-PCB-CS-7-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.
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.
go_editor
444
views
go_editor
asked
Sep 20, 2018
Digital Logic
isi2017-pcb-cs
digital-logic
functional-completeness
descriptive
+
–
0
votes
1
answer
14
ISI2017-PCB-CS-8-a
Write the number $(-5)^{\frac{1}{2}}$ in single precision IEEE 754 floating point form.
Write the number $(-5)^{\frac{1}{2}}$ in single precision IEEE 754 floating point form.
go_editor
722
views
go_editor
asked
Sep 20, 2018
Digital Logic
isi2017-pcb-cs
digital-logic
ieee-representation
descriptive
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register