Register
Filter

Recent activity by mohitbawankar

0 answers
4
PROGRAMMING
What is the output of following program? #include<stdio.h> void main() { int i=5; printf("%d %d %d %d %d \n", i, i++, i--, ++i, --i); }
What is the output of following program?#include<stdio.h>void main(){ int i=5; printf("%d %d %d %d %d \n", i, i++, i , ++i, i);}
0 answers
6
doubt regarding BARC Registarion
if i select both ,and if i want to go trough only GATE score ..then its mandatory online test conduct by BARC?
if i select both ,and if i want to go trough only GATE score ..then its mandatory online test conduct by BARC?
0 answers
10
IEEE 754
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is
0 answers
12
programming Q MOCK TEST
Consider the following program along with push and pop operations on stack which can contain atmost The decimal value equivalent to the binary number printed by above code is _______
Consider the following program along with push and pop operations on stack which can contain atmost The decimal value equivalent to the binary number printed by above cod...
1 answer
15
Slop of Curve
please share your solution The maximum slope of the curve -x3+6x2+66x+666
please share your solution The maximum slope of the curve-x3+6x2+66x+666
3 answers
16
multidimensional aaray
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8] by using row order is ______.
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8]...
1 answer
18
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
1 answer
19
MOCK TEST DATA STRUCTURE
Consider a two-dimensional array with elements stored in the form of lower triangular matrix. The elements must be crossed to read A[4, 2] from the array A[–6, ..., + 8, –6,..., + 8] whose base address 1000 is ________. (Assume elements are stored in row major order)
Consider a two-dimensional array with elements stored in the form of lower triangular matrix. The elements must be crossed to read A[4, 2] from the array A[–6, ..., + 8...
0 answers
23
mock test
#include<stdio.h> main ( ) { int new ( ); new ( ); (*new) ( ); } int new ( ) { printf (“Welcome”); } } prints Welcome Welcome prints Welcome results in a run-time error results in a compilation error
#include<stdio.h>main ( ){ int new ( ); new ( ); (*new) ( );}int new ( ){ printf (“Welcome”);}} prints Welcome Welcome prints Welcome results in a run-...
0 answers
24
Mock test
The number of ways possible to form injective function from set A to set B, where set ‘A’ has 3 elements, set ‘B’ has 5 elements such that i^th element of set A should not be matched with i^th element of set B
The number of ways possible to form injective function from set A to set B, where set ‘A’ has 3 elements, set ‘B’ has 5 elements such that i^th element of set A s...
1 answer
27
Digital test question about shift register.
2 answers
28
shift register
A 8-bit left-shift register and a D-flip flop are connected together as shown in the figure below and they are synchronized with the same clock. If the D-flip-flop is initially cleared, then the circuit will act as It will work like b7xor 0 b6 xorb5 b4 xorb3 b2xorb1 ??????? please give explain
A 8-bit left-shift register and a D-flip flop are connected together as shown in the figure below and they are synchronized with the same clock.If the D-flip-flop is init...
1 answer
29
DB lossless join and dependency preserving decomposition
Consider the following relational schema R(ABCDEFG) with FD set {AB → C, BC → A, AC → B, B → D, D → E}. The minimum relations required to decompose R into BCNF which satisfy lossless join and dependency preserving decomposition are ________.
Consider the following relational schema R(ABCDEFG) with FD set {AB → C, BC → A, AC → B, B → D, D → E}. The minimum relations required to decompose R into BCNF ...
4 answers
30
merge sort