Recent questions

0 votes

1 answer

1

Mod 16 Down counter
The initial state of Mod 16 down counter is 0110. After 37 clock pulses the state of the counter will be __________

asked 31 minutes ago in Digital Logic by Ashwani Kumar 2 Loyal (3.2k points) | 4 views

0 votes

0 answers

2

printf
What is the use of %n being used in printf statement

asked 38 minutes ago in Programming by saipriyab (165 points) | 4 views

0 votes

0 answers

3

serial schedules
If total n! serial schedules are possible , will all of them give the same result?

asked 1 hour ago in Databases by Parshu gate (381 points) | 4 views

0 votes

0 answers

4

dfa-finite automata
Let L1 and L2 be the languages L1 = {x ∈ {a, b}∗ | aa is not a substring of x} L2 = {x ∈ {a, b}∗ | x ends with ab} Construct an FA Accepting L1 ∩ L2

asked 1 hour ago in Theory of Computation by set2018 Loyal (3.5k points) | 5 views

0 votes

1 answer

5

DBMS-Decomposition
Which of the following statement is true while decomposition ? 3NF guaranteed dependency preserving 3NF guaranteed lossless property Both of the above None of the above

asked 2 hours ago in Databases by rishu_darkshadow Active (1.9k points) | 6 views

+1 vote

1 answer

6

mock test
Considering size of int as 2 Bytes and size of char as 1 Byte what will be the output int main() { int a=300; char *b=(char *)&a; *==b=2; printf("%d",a); return 0; }

asked 3 hours ago in Programming by saipriyab (165 points) | 12 views

+1 vote

0 answers

7

mutual exclusion
Initial values of S1 ansd S2 are random assigned Method by P1 do { flag[i] = true; S1 = S2; while( flag[j]=true and S1 == S2) critical section flag[i]=false; remainder section }while(1); Method used by P2 do { flag[j]= ... while(flag[i]=true and S1!=S2); criticals ection flag[j]=false; remainder section } while(1); Does this gurantee mutual exclusion?

asked 3 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 4 views

+1 vote

0 answers

8

DMA cycle stealing.
Consider 1 mbps hard-disk is interfaced to the processor in a cycle stealing mode of DMA whenever 64 bytes of data is available in the buffer,then it is transferred to main memory (1 word = 64 bits) and machine cycle time is 2 micro sec. Then, percentage of CPU time consumed for DMA operation is ? Assume BR and BG requests take 5 micro seconds each.

asked 4 hours ago in CO & Architecture by Xylene Loyal (2.9k points) | 5 views

+1 vote

0 answers

9

address translation table
a) What is address translation table?? b) is it converting virtual adress to physical address?? c) if so Then for a system having no virtual memory , will not have aaddress translation table??

asked 4 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 6 views

+1 vote

0 answers

10

UGC NET jUNE 2006 -QN 5
Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is: (A) injective (B) surjective (C) both injective and surjective (D) neither injective nor surjective How it can be both injective and surjective ??

asked 6 hours ago in Mathematical Logic by Aparna Deepak (39 points) | 12 views

0 votes

0 answers

11

"Borrow and Carry are complements of each other"

asked 14 hours ago in Digital Logic by Parimal Paritosh (115 points) | 16 views

+2 votes

1 answer

12

Programming
Please explain the output. #include<stdio.h> int main() { int c; printf("geeks for %ngeeks ", &c); printf("%d", c); getchar(); return 0; }

asked 14 hours ago in Programming by Shubham Kumar Gupta (105 points) | 25 views

+1 vote

1 answer

13

Fragmentation

asked 14 hours ago in Computer Networks by junaid ahmad Loyal (3.7k points) | 29 views

+1 vote

1 answer

14

Bit stuffing

asked 14 hours ago in Computer Networks by junaid ahmad Loyal (3.7k points) | 40 views

0 votes

1 answer

15

2's complement addition of two negative numbers

asked 15 hours ago in Digital Logic by Parimal Paritosh (115 points) | 15 views

+1 vote

2 answers

16

C programming
Does C perform array out of bound checking? What is the output of the following program? int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i]); return 0; }

asked 15 hours ago in Programming by chandra sai (405 points) | 16 views

0 votes

0 answers

17

graph theory
"A planar graph need not to be connected" Can someone plz explain with an example .

asked 16 hours ago in Set Theory & Algebra by Pawan Kumar 2 Junior (557 points) | 16 views

0 votes

1 answer

18

Online test series
#include<stdio.h> int f(int x,int *py,int **ppz){ int y,z; **ppz+=1; z=**ppz; *py+=2; y=*py; x+=3; return(x+y+z); } void main(){ int c,*b,**a; c=4; b=&c; a=&b; printf("%d",f(&c,b,a)); return 0; } Here why doesn't the value of x increment even though the pointers are changed by value? Why is the answer 19 and not 22?

asked 16 hours ago in Programming by Satwik Mishra 1 (97 points) | 22 views

+1 vote

0 answers

19

Online test series
#include<stdio.h> void fun(int arr[]){ int i; int arr_size=sizeof(arr)/sizeof(arr[0]); for(i=0;i<arr_size;i++){ printf("%d\t",arr[i]); } } int main(){ int i; int arr[4]={10,20,30,40}; fun(arr); } Here why doesn't it output 10 20 30 40. The answer given is 10 20. Please explain this.

asked 16 hours ago in Programming by Satwik Mishra 1 (97 points) | 20 views

+1 vote

0 answers

20

Sheldon Ross chapter#3 Qno-45
A set of k coupons, each of which is independently a type j coupon with probability pj , from i=1 to n ∑ pj = 1, is collected. Find the probability that the set contains either a type i or a type j coupon.

asked 16 hours ago in Probability by Warrior Boss (5.4k points) | 7 views

+1 vote

0 answers

21

Corman Algo
if f(n)=n/log n and c=2 Than f*(n)=?

asked 17 hours ago in Algorithms by Nitesh Choudhary Active (2k points) | 11 views

+1 vote

2 answers

22

Differential calculus
If f(x) = |x-1| + |x-2| is not derivable at x = (a) x = 0 (b) x = 1,2 (c) x = 3 (d) none

asked 18 hours ago in Calculus by Dhanraj vishwakarma (165 points) | 17 views

0 votes

0 answers

23

BCNF-decomposition
R(A,B,C,D,E) F={A→BCD,BC→D,D→B Decompose to BCNF.

asked 19 hours ago in Databases by rishu_darkshadow Active (1.9k points) | 11 views

0 votes

1 answer

24

Minimum tables required
1.Minimum number of tables required which satisfies 1NF ? 2.Minimum number of tables required which satisfies 3NF ?

asked 20 hours ago in Databases by Xylene Loyal (2.9k points) | 30 views

0 votes

0 answers

25

#TOC Identify Language
L = {ab3k | k>=0} wel, I think, this L is RL, as it has REGEX as a(bbb)*. Please correct me.

asked 20 hours ago in Theory of Computation by iarnav Loyal (3.4k points) | 22 views

0 votes

1 answer

26

3NF-property
A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R Here, what is the actual meaning of word key ? Does it mean prime attribute or super key or non-prime attribute ? plzz explain...

asked 20 hours ago in Databases by rishu_darkshadow Active (1.9k points) | 19 views

0 votes

0 answers

27

SElf doubt
Virtual memory leads to increase or decrease in context switching overhead? or doesnt it make any difference

asked 21 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 15 views

0 votes

0 answers

28

Self doubt
Incase i get a equation like this 1234 p2 + 459p +657 =0 and i have to find P if value of P is given in choices then i can substitute one by one by find but if nochoices given then any easy way to solve these large numbered equations?

asked 22 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 17 views

+1 vote

1 answer

29

Deadlock
Suppose 10 processes p1 to p10 share 7 identical resource units and release on at a time then max resource req of a process pi is Sp where Sp is greater than 0.The max value of summmation of Sp for all process that ensures deadlock doesnt occur is

asked 22 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 30 views

+2 votes

1 answer

30

Fixed partition
Consider a scenario having fixed partition allocation scheme where each partition is of size 100KB , 500KB , 200Kb , 300KB and 600KB.In these partitions the processes that are needed to be placed are 212KB , 417KB , 112KB and 426KB(in order).How may partitions will remain unallocated after placing the proceses by firstbit approach

asked 22 hours ago in Operating System by A_i_$_h Loyal (4.6k points) | 14 views

Recent questions

Recent Posts

Recent Blog Comments