Dark Mode

Answers by anchitjindal07

0 votes

1

ISRO2011-19
If node A has three siblings and B is parent of A, what is the degree of A? 0 3 4 5

answered in DS Nov 22, 2018

6.4k views

0 votes

2

ISRO2018-2
Consider the following declaration : structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &person; Then *$(kd->name + 2)$ can be used instead of: $person.name+2$ $kd-> (name+2)$ $*((*kd).name+2)$ either $A)$ or $B)$ , not $C)$

answered in Programming May 4, 2018

4.7k views

0 votes

3

Gate_2018_Mock_Test
Why its multiplied with 9

answered in Digital Logic Apr 27, 2018

151 views

0 votes

4

MadeEasy Workbook: Digital Logic - Digital Counter
Caption

answered in Digital Logic Apr 26, 2018

213 views

0 votes

5

No comments
Design 4 bit counter that first increments and then decrements and so on

answered in Digital Logic Apr 25, 2018

234 views

0 votes

6

Counters
I didn't understand the concept of Counters well Can anybody provide any online Source or Explain the Concept of Counter which includes Johnson Counter and what is meant by mod 3,mod 6 etc Counters ?

answered in Digital Logic Apr 23, 2018

284 views

1 vote

7

Functionally Complete
Suppose a function F(A,B) = A' + B then to prove it functionally complete.Can we do it like:- F(A,A') = A' ----> Complementation derived F(A',B) = A + B -----> OR Operation Derived So we could conclude that its functionally Complete. Is it the right way if not Please tell the right eay to prove the Function to be Functionally Complete. Thank You in advance

answered in Digital Logic Apr 23, 2018

1.4k views

19 votes

8

GATE CSE 2017 Set 1 | Question: 9
When two $8\text{-bit}$ numbers $A_{7}\cdots A_{0}$ and $B_{7}\cdots B_{0}$ in $2$'s complement representation (with $A_{0}$ and $B_{0}$ as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are $S_{7}\cdots S_{0}$ and ... $1$

answered in Digital Logic Nov 29, 2017

11.1k views

9 votes

9

Test by Bikram | Databases | Test 2 | Question: 4
A relation $R(P,Q,R,S)$ has $\{PQ, QR, RS, PS\}$ as candidate keys. The total number of superkeys possible for relation $R$ is ______

answered in Databases Oct 18, 2017

479 views

0 votes

10

Signed_unsigned bits
How 11010 is -6 ? According to me it should be -10 . Please explain anyone.

answered in Digital Logic May 28, 2017

623 views

0 votes

11

Doubt
If we have F=(0,1,2,3). And F1=(1,2), F2=(0,3). What is F1.F1 ? What does F1.F2 mean?

answered in Digital Logic May 28, 2017

310 views

7 votes

12

GATE CSE 2005 | Question: 1, ISRO2017-55
What does the following C-statement declare? int (*f) (int * ); A function that takes an integer pointer as argument and returns an integer A function that takes an integer as argument and returns an integer pointer A pointer ... pointer as argument and returns an integer A function that takes an integer pointer as argument and returns a function pointer

answered in Programming May 7, 2017

18.3k views

9 votes

13

ISRO-2013-18
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$

answered in Computer Networks Apr 9, 2017

8.4k views