Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
neelesh_007
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by neelesh_007
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.4k
views
commented
Jun 4, 2021
Databases
databases
view-serializable
transaction-and-concurrency
+
–
2
answers
2
NIELIT 2017 DEC Scientist B - Section B: 44
If $x$ is a one dimensional array, then $^*(x+i)$ is same as $^*(\&x[i])$ $\&x[i]$ is same as $x+i-1$ $^*(x+i)$ is same as $^*x[i]$ $^*(x+i)$ is same as $^*x+i$
If $x$ is a one dimensional array, then$^*(x+i)$ is same as $^*(\&x[i])$$\&x[i]$ is same as $x+i-1$$^*(x+i)$ is same as $^*x[i]$$^*(x+i)$ is same as $^*x+i$
1.7k
views
commented
Jun 3, 2021
Programming in C
nielit2017dec-scientistb
programming-in-c
array-of-pointers
+
–
4
answers
3
GATE CSE 2006 | Question: 50
A set $X$ can be represented by an array $x[n]$ as follows: $x\left [ i \right ]=\begin {cases} 1 & \text{if } i \in X \\ 0 & \text{otherwise} \end{cases}$ Consider the following algorithm in which $x$, $y$, and $z$ are Boolean arrays of size $n$: algorithm zzz ... set $Z$ computed by the algorithm is: $(X\cup Y)$ $(X\cap Y)$ $(X-Y)\cap (Y-X)$ $(X-Y)\cup (Y-X)$
A set $X$ can be represented by an array $x[n]$ as follows: $x\left [ i \right ]=\begin {cases} 1 & \text{if } i \in X \\ 0 & \text{otherwise} \end{cases}$Consider the ...
5.0k
views
commented
Feb 6, 2021
Algorithms
gatecse-2006
algorithms
identify-function
normal
+
–
4
answers
4
GATE CSE 1997 | Question: 4.4
A polynomial $p(x)$ is such that $p(0) = 5, p(1) = 4, p(2) = 9$ and $p(3) = 20$. The minimum degree it should have is $1$ $2$ $3$ $4$
A polynomial $p(x)$ is such that $p(0) = 5, p(1) = 4, p(2) = 9$ and $p(3) = 20$. The minimum degree it should have is$1$$2$$3$$4$
6.7k
views
commented
Jan 18, 2021
Set Theory & Algebra
gate1997
set-theory&algebra
normal
polynomials
+
–
2
answers
5
GATE CSE 2014 Set 3 | Question: GA-10
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$. $1634$ $1737$ $3142$ $3162$
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$.$1634$$1737$$3142$$3162$
5.4k
views
commented
Jan 16, 2021
Quantitative Aptitude
gatecse-2014-set3
quantitative-aptitude
number-theory
normal
digital-logic
+
–
6
answers
6
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the...
18.9k
views
commented
Nov 7, 2020
Algorithms
gatecse-2018
algorithms
dynamic-programming
2-marks
+
–
9
answers
7
GATE CSE 2014 Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this $6$-stage pipeline, the speedup achieved with respect to non-pipelined execution if $25$% of the instructions incur $2$ pipeline stall cycles is ____________
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
19.8k
views
commented
May 17, 2020
CO and Architecture
gatecse-2014-set1
co-and-architecture
pipelining
numerical-answers
normal
+
–
4
answers
8
GATE CSE 2016 Set 2 | Question: 31
Consider a processor with $64$ registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and twelve-bit immediate value. Each ... program has $100$ instructions, the amount of memory (in bytes) consumed by the program text is _________.
Consider a processor with $64$ registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers...
20.9k
views
commented
May 5, 2020
CO and Architecture
gatecse-2016-set2
instruction-format
machine-instruction
co-and-architecture
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register