Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Debapaul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Debapaul
1
answer
1
Kenneth Rosen Edition 7 Exercise 8.3 Question 13 (Page No. 535)
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function.$f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
538
views
commented
Jul 2, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
0
answers
2
ME GATE 2016
The number of linearly independent eigenvectors of matrix A= $\begin{pmatrix} 2 &1 & 0\\ 0& 2 &0 \\ 0& 0 & 3 \end{pmatrix}$
The number of linearly independent eigenvectors of matrix A= $\begin{pmatrix} 2 &1 & 0\\ 0& 2 &0 \\ 0& 0 & 3 \end{pmatrix}$
1.4k
views
commented
Apr 29, 2020
Linear Algebra
me-gate2016
linear-algebra
+
–
10
answers
3
GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $...
45.0k
views
commented
Feb 19, 2020
Operating System
gatecse-2020
numerical-answers
operating-system
virtual-memory
2-marks
+
–
8
answers
4
GATE CSE 2013 | Question: 16
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b,$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c,$ and $d$; process ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation...
17.0k
views
commented
Jan 21, 2020
Operating System
gatecse-2013
operating-system
resource-allocation
normal
+
–
12
answers
5
ISRO2020-50
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
If every non-key attribute functionally dependent on the primary key, then the relation will be inFirst normal formSecond normal formThird normal formFourth Normal form
8.9k
views
commented
Jan 20, 2020
Databases
isro-2020
databases
database-normalization
easy
+
–
1
answer
6
Test by Bikram | Mock GATE | Test 1 | Question: 13
Match the following: List I List II A Backus Naur form 1 Regular expression B Lex 2 $\left ( I \right )$LALR$ C Yacc 3 $LL$\left ( 1 \right )$ D Recursive descent parsing 4 $CFG's$ ... $A-4; \: B-1 \: ; C-2; \: D-3;$ $A-1; \: B-4; \:C-2; \: D-3;$
Match the following:List IList IIABackus Naur form 1Regular expressionBLex2$\left ( I \right )$$LALR$CYacc3$LL$$\left ( 1 \right )$DRecursive descent parsing 4$CFG's$ $...
381
views
commented
Jan 20, 2020
GATE
tbb-mockgate-1
grammar
compiler-design
+
–
2
answers
7
Segmented Paging
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2 B ,Page size is 2KB.
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2...
1.6k
views
commented
Jan 19, 2020
Operating System
segmentation
+
–
4
answers
8
GATE CSE 2019 | Question: 43
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
Consider the augmented grammar given below:$S’ \rightarrow S$$S \rightarrow \langle L \rangle \mid id$$L \rightarrow L, S \mid S$Let $I_0 = \text{CLOSURE} (\{[S’ \rig...
17.5k
views
commented
Jan 17, 2020
Compiler Design
gatecse-2019
numerical-answers
compiler-design
grammar
2-marks
+
–
2
answers
9
ISRO2020-9
In a $8$-bit ripple carry adder using identical full adders, each full adder takes $34$ ns for computing sum. If the time taken for $8$-bit addition is $90$ ns, find time taken by each full adder to find carry. $6$ ns $7$ ns $10$ ns $8$ ns
In a $8$-bit ripple carry adder using identical full adders, each full adder takes $34$ ns for computing sum. If the time taken for $8$-bit addition is $90$ ns, find time...
3.4k
views
answered
Jan 16, 2020
Digital Logic
isro-2020
digital-logic
combinational-circuit
adder
normal
+
–
4
answers
10
ISRO2020-23
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is $\text{A B C D E F G H I}$ $\text{F B A D C E G I H}$ $\text{F A B C D E G H I}$ $\text{A B D C E F G I H}$
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
18.6k
views
commented
Jan 16, 2020
DS
isro-2020
data-structures
binary-tree
tree-traversal
normal
+
–
1
answer
11
Ace Test series: Databases - Relational Algebra
The solution says that it should return 50 tuples. But I think it should be 10 as the selection query is on the relational algebra. Please need your help to clear this confusion. Thanks in advance.
The solution says that it should return 50 tuples. But I think it should be 10 as the selection query is on the relational algebra.Please need your help to clear this con...
630
views
comment edited
Jan 16, 2020
Databases
databases
relational-algebra
ace-test-series
+
–
2
answers
12
ISRO2020-11
Minimum number of NAND gates required to implement the following binary equation $Y = (\overline{A}+\overline{B})(C+D)$ $4$ $5$ $3$ $6$
Minimum number of NAND gates required to implement the following binary equation$Y = (\overline{A}+\overline{B})(C+D)$$4$$5$$3$$6$
5.3k
views
commented
Jan 13, 2020
Digital Logic
isro-2020
digital-logic
combinational-circuit
circuit-output
normal
+
–
3
answers
13
GATE CSE 2002 | Question: 2.18
The C language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
The C language is:A context free languageA context sensitive languageA regular languageParsable fully only by a Turing machine
10.1k
views
commented
Jan 12, 2020
Programming in C
gatecse-2002
programming
programming-in-c
normal
+
–
4
answers
14
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size i...
21.4k
views
commented
Jan 12, 2020
Operating System
gatecse-2019
operating-system
virtual-memory
2-marks
+
–
5
answers
15
GATE CSE 2019 | Question: 2
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has $16$ address lines denoted by $A_{15}$ to $A_0$. What is the range of address (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal? C800 to CFFF CA00 to CAFF C800 to C8FF DA00 to DFFF
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has $16$ address lines denoted by $A_{15}$ to $A_0$....
12.6k
views
commented
Jan 10, 2020
CO and Architecture
gatecse-2019
co-and-architecture
dram
1-mark
+
–
1
answer
16
Mutual exclusion
Consider the following code:- #define N 2 #define FALSE 0 #define TRUE 1 Int Interested [N]; //initially both are set to FALSE. Void enter(int process) { int other; Other=1-process; Interested[process]=TRUE; While(Interested[other]==TRUE); { ... ; } } Void Leave(int process) { Interested[process]=FALSE; } Find whether progress, mutual exclusion and bounded waiting are satisfied?
Consider the following code:- #define N 2#define FALSE 0#define TRUE 1Int Interested [N]; //initially both are set to FALSE.Void enter(int process){ int other; ...
665
views
commented
Jan 9, 2020
3
answers
17
GATE CSE 2014 Set 1 | Question: GA-9
In a survey, $300$ ...
In a survey, $300$ respondents were asked whether they own a vehicle or not. If yes, they were further asked to mention whether they own a car or scooter or both. Their r...
4.8k
views
commented
Jan 5, 2020
Quantitative Aptitude
gatecse-2014-set1
quantitative-aptitude
normal
numerical-answers
data-interpretation
tabular-data
+
–
2
answers
18
chain multiplication
what is the faster way to calculate in short time
what is the faster way to calculate in short time
482
views
answered
Jan 5, 2020
CO and Architecture
algorithms
+
–
5
answers
19
Which of the following is correct for 3nf and bcnf?
Consider the following statements. If relation R is in 3NF and every key is simple, then R is in BCNF If relation R is in 3NF and R has only one key, then R is in BCNF Both 1 and 2 are true 1 is true but 2 is false 1 is false and 2 is true Both 1 and 2 are false
Consider the following statements.If relation R is in 3NF and every key is simple, then R is in BCNFIf relation R is in 3NF and R has only one key, then R is in BCNFBoth ...
9.2k
views
commented
Jan 5, 2020
Databases
databases
database-normalization
+
–
3
answers
20
UGC NET CSE | Junet 2015 | Part 2 | Question: 49
Which of the following statements is false about weak entity set? Weak entities can be deleted automatically when their strong entity is deleted Weak entity set avoids the data duplication and consequent possible inconsistencies caused by ... a weak entity set are not partitioned according to their relationship with tuples with a strong entity set
Which of the following statements is false about weak entity set?Weak entities can be deleted automatically when their strong entity is deletedWeak entity set avoids the ...
5.6k
views
commented
Jan 3, 2020
Databases
ugcnetcse-june2015-paper2
er-diagram
databases
+
–
1
answer
21
How to make a DFA given a regular grammar ?
A-->aB/bA/b , B-->aC/bB , C-->aA/bC/a what is the approach ?
A >aB/bA/b , B >aC/bB , C >aA/bC/awhat is the approach ?
578
views
commented
Jan 2, 2020
0
answers
22
ACE PreGate vs Made Easy CBT
I only want to appear for one Centre-based mock. I am in a dilemma between Ace PreGate vs Made Easy CBT2. Could anyone please help me decide?
I only want to appear for one Centre-based mock. I am in a dilemma between Ace PreGate vs Made Easy CBT2.Could anyone please help me decide?
1.6k
views
commented
Dec 10, 2019
GATE
general
+
–
4
answers
23
GATE CSE 2018 | Question: GA-9
In the figure below, $\angle DEC + \angle BFC$ is equal to _____ $\angle BCD - \angle BAD$ $\angle BAD + \angle BCF$ $\angle BAD + \angle BCD$ $\angle CBA + \angle ADC$
In the figure below, $\angle DEC + \angle BFC$ is equal to _____$\angle BCD - \angle BAD$$\angle BAD + \angle BCF$$\angle BAD + \angle BCD$$\angle CBA + \angle ADC$
10.6k
views
commented
Nov 9, 2019
Quantitative Aptitude
gatecse-2018
quantitative-aptitude
geometry
normal
triangles
2-marks
+
–
4
answers
24
GATE CSE 2018 | Question: 9
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution. P. The processor pushes the process status of $L$ onto the control stack Q. The processor finishes the execution of the ... based on the interrupt Which of the following is the correct order in which the events above occur? QPTRS PTRSQ TRPQS QTPRS
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution.P. The processor pushes the process status of ...
10.4k
views
commented
Oct 18, 2019
Operating System
gatecse-2018
operating-system
interrupts
normal
1-mark
+
–
2
answers
25
GATE CSE 2015 Set 1 | Question: 50
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously: There exists a statement $S_{j}$ that uses $x$ There is a path from $S_{i}$ to $S_{j}$ in the flow graph corresponding to the program The path ... above control flow graph are $\text{p, s, u}$ $\text{r, s, u}$ $\text{r, u}$ $\text{q, v}$
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously:There exists a statement $S_{j}$ that uses $x$...
26.0k
views
commented
Oct 9, 2019
Compiler Design
gatecse-2015-set1
compiler-design
live-variable-analysis
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register