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 Ankit pipaliya
8
answers
1
GATE CSE 2019 | Question: 17
The following C program is executed on a Unix/Linux system : #include<unistd.h> int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; } The total number of child processes created is ________________ .
The following C program is executed on a Unix/Linux system :#include<unistd.h int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; }The total number of ...
17.6k
views
answered
Feb 4, 2020
Operating System
gatecse-2019
numerical-answers
operating-system
fork-system-call
1-mark
+
–
5
answers
2
GATE IT 2006 | Question: 71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[...
13.9k
views
comment edited
Feb 1, 2020
DS
gateit-2006
data-structures
binary-tree
normal
+
–
3
answers
3
GATE CSE 2015 Set 1 | Question: 21
Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N - 1})$ others using symmetric Key cryptographic system. The communication between any two person should not be decodable by the others in the group. The numbers of keys required ... satisfy the confidentiality requirement is $2N$ $N(N-1)$ $\dfrac{N(N-1)}{2}$ $(N-1)^{2}$
Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N - 1})$ others using symmetric Key cryptographic system. The communication ...
7.8k
views
commented
Jan 22, 2020
Computer Networks
gatecse-2015-set1
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
6
answers
4
GATE CSE 1998 | Question: 1.4
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function is continuous and differentiable continuous but not differentiable differentiable but not continuous neither continuous nor differentiable
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
5.5k
views
answered
Apr 7, 2018
Calculus
gate1998
calculus
continuity
differentiation
easy
+
–
4
answers
5
GATE CSE 2018 | Question: 38
Consider the following parse tree for the expression a#b$\$c$\$d#e#f, involving two binary operators $\$ ... has higher precedence and is right associative; # is left associative
Consider the following parse tree for the expression a#b$\$$c$\$$d#e#f, involving two binary operators $\$$ and #.Which one of the following is correct for the given par...
9.5k
views
commented
Feb 4, 2018
Compiler Design
gatecse-2018
compiler-design
parsing
normal
2-marks
+
–
3
answers
6
GATE IT 2004 | Question: 47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... output of $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop:for (i = 1; i < = 1000; i++) {I1, I2, I3, I4}where the time taken (in ns...
12.7k
views
answered
Jan 23, 2018
CO and Architecture
gateit-2004
co-and-architecture
pipelining
normal
+
–
2
answers
7
MadeEasy Subject Test: Theory of Computation - Turing Machine
Consider the following statements: S1: Turing machine can write the blank symbol on its tape. S2: Tape alphabet Γ can never be same as input alphabet Σ. S3: Turing machine's head can ever be in the same location ... . S4: Turing machine contain atleast two states. How many of the above statements are correct? Please give explanation too
Consider the following statements:S1: Turing machine can write the blank symbol on its tape.S2: Tape alphabet Γ can never be same as input alphabet Σ.S3: Turing machine...
3.9k
views
answered
Jan 15, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
turing-machine
+
–
2
answers
8
GATE IT 2006 | Question: 35
The boolean function for a combinational circuit with four inputs is represented by the following Karnaugh map. Which of the product terms given below is an essential prime implicant of the function? $\text{QRS}$ $\text{PQS}$ $\text{PQ'S'}$ $\text{Q'S'}$
The boolean function for a combinational circuit with four inputs is represented by the following Karnaugh map.Which of the product terms given below is an essential prim...
6.1k
views
answered
Nov 30, 2017
Digital Logic
gateit-2006
digital-logic
k-map
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register