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 souravsaha
3
answers
1
[DBMS] Number of view equal schedules
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
10.7k
views
commented
Jan 30, 2018
Databases
databases
view-serializable
transaction-and-concurrency
+
–
2
answers
2
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
1.7k
views
commented
Jan 16, 2018
Databases
databases
indexing
made-easy-test-series
madeeasy-testseries-2018
+
–
0
answers
3
Cycle stealing
A hard disk with transfer rate of 1 KBps is constantly transferring data to memory using DMA cycle stealing mode. The size of data transfer is 16 bytes. The processor runs at 400 kHz clock frequency. The DMA controller requires 10 cycles for initialization ... takes 2 cycles to transfer one byte of data from device to the memory. Then the transfer time for transfer time ______
A hard disk with transfer rate of 1 KBps is constantly transferring data to memory using DMA cycle stealing mode. The size of data transfer is 16 bytes. The processor run...
1.1k
views
commented
Jan 4, 2018
4
answers
4
NIELIT-DEC 2017 -SET C-65
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold. A)Additively B)Multiplicatively C)Exponentially D) NONE
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold.A)AdditivelyB)MultiplicativelyC)ExponentiallyD) NONE
739
views
answered
Jan 4, 2018
1
answer
5
self doubt
if suppose we have 3 bits for subnet in last octate the 6th subnet is 110 or 101?
if suppose we have 3 bits for subnet in last octate the 6th subnet is 110 or 101?
286
views
answered
Jan 4, 2018
1
answer
6
C programming
244
views
answered
Jan 4, 2018
Programming in C
programming-in-c
+
–
0
answers
7
c programming
#include<stdio.h> int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); }
#include<stdio.h>int main(){char arr[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(arr+1)-(unsigned)arr);printf("%d", (unsigned)(p+1)-(unsigned)p);}
429
views
commented
Jan 4, 2018
5
answers
8
GATE CSE 2017 Set 2 | Question: 45
The read access times and the hit ratios for different caches in a memory hierarchy are as given below: ... and $40\%$ are for memory operand fetch. The average read access time in nanoseconds (up to $2$ decimal places) is _________
The read access times and the hit ratios for different caches in a memory hierarchy are as given below:$$\begin{array}{|l|c|c|} \hline \text {Cache} & \text{Read access ...
30.0k
views
commented
Dec 25, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
6
answers
9
GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \le...
13.7k
views
commented
Dec 9, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
8
answers
10
GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are conn...
18.8k
views
commented
Dec 6, 2017
Databases
gatecse-2015-set1
databases
er-diagram
normal
numerical-answers
+
–
4
answers
11
Made Easy Test series, GATE2018
1.3k
views
answered
Dec 6, 2017
Databases
databases
er-diagram
database-normalization
+
–
4
answers
12
GATE CSE 2017 Set 2 | Question: 50
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$ ... message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$$\begin{array}{|c|c|...
21.2k
views
commented
Oct 23, 2017
Algorithms
gatecse-2017-set2
huffman-code
numerical-answers
algorithms
+
–
1
answer
13
Memory Interfacing problem in Computer Organisation and Architecture
Hi All, I have one doubt regarding avg access time in various levels of memory. There are 2 ways in which the processor is connected to various levels of memory. 2 levels Case 1: (parallel access) T avg = H1 * T1 + ( ... , nothing is mentioned solved via case 1 only. Can anyone please let me know which one should I use. Thank you.
Hi All,I have one doubt regarding avg access time in various levels of memory. There are 2 ways in which the processor is connected to various levels of memory.2 levelsCa...
1.1k
views
commented
Oct 14, 2017
CO and Architecture
co-and-architecture
memory-interfacing
+
–
7
answers
14
GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$
Consider the following expression grammar $G$:$E \rightarrow E-T \mid T$$T \rightarrow T + F \mid F$$F \rightarrow (E) \mid id$Which of the following grammars is not left...
11.0k
views
answered
Oct 9, 2017
Compiler Design
gatecse-2017-set2
grammar
+
–
0
answers
15
Made Easy Test Series :
Can anyone help to find the value of S2. The ans is (B). please help to evaluate the series s2. Thank you in advance.
Can anyone help to find the value of S2. The ans is (B). please help to evaluate the series s2. Thank you in advance.
293
views
asked
Sep 10, 2017
2
answers
16
Which expression is right with respect to carry look header?
(i) Ci +1= Gi+ PiCi (ii) Ci +1= G(i+1) + P(i+1)Ci https://www.youtube.com/watch?v=9lyqSVKbyz8&index=116&list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOm i or ii ?
(i) Ci +1= Gi+ PiCi(ii) Ci +1= G(i+1) + P(i+1)Cihttps://www.youtube.com/watch?v=9lyqSVKbyz8&index=116&list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOmi or ii ?
453
views
answered
Sep 7, 2017
Digital Logic
adder
carry-generator
+
–
12
answers
17
GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.
Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3H...
34.6k
views
commented
Sep 4, 2017
Algorithms
gatecse-2014-set1
algorithms
time-complexity
normal
+
–
2
answers
18
DCFL or NCFL
L = {ai bj ck | i = k or j = k} Is it a DCFL or an NCFL?
L = {ai bj ck | i = k or j = k}Is it a DCFL or an NCFL?
1.0k
views
answered
Aug 10, 2017
Theory of Computation
theory-of-computation
+
–
2
answers
19
Dense index
A block can hold either $12$ records or $42$ key pointers .A database contains $96$ records , then how many blocks are required to hold the data file and the dense Index? a). $10$ b). $12$ c). $11$ d). $13$
A block can hold either $12$ records or $42$ key pointers .A database contains $96$ records , then how many blocks are required to hold the data file and the dense Index?...
596
views
answered
Nov 17, 2015
Databases
databases
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register