Register
Filter

Questions by A_i_$_h

1 votes
0 answers
81
hufmann
From huffmann encoding how will we find max and min number of comparisons? what will be the max and min comparisons here
From huffmann encoding how will we find max and min number of comparisons? what will be the max and min comparisons here
2 votes
1 answer
82
groowth rate
N log (N2) N1.5 which will grow faster
N log (N2)N1.5which will grow faster
1 votes
1 answer
83
huffman
Let a language L be defined over a character set L= (a,b,c,d,e) . The probabilities of the characters are in the order 1/2L L=1,5 respectively for each character , the average number of bits per character using huffman coding is ___________(2 decimal places)
Let a language L be defined over a character set L= (a,b,c,d,e) . The probabilities of the characters are in the order 1/2LL=1,5 respectively for each character , the ave...
2 votes
1 answer
84
time complexity
Cosider n distinct integers , it is required to determine 3 smallest integers of this array by comparisons.The number of comparisons needed are 1.n+ O(logn) 2.n+O(1) 3.O(n) 4.O(log2n)
Cosider n distinct integers , it is required to determine 3 smallest integers of this array by comparisons.The number of comparisons needed are1.n+ O(logn)2.n+O(1)3.O(n)4...
1 votes
1 answer
86
time complexity
Consider the following functions for large values on n f(n) = n1/root(logn) g(n)=root(logn) h(n)=n1/100 1.g(n)<f(n)<h(n) 2.g(n)<h(n)<f(n)
Consider the following functions for large values on nf(n) = n1/root(logn)g(n)=root(logn)h(n)=n1/1001.g(n)<f(n)<h(n)2.g(n)<h(n)<f(n)
1 votes
1 answer
87
max index blocks
Database file consists of 10,000 records with record size 100 bytes , block size 512 bytes.If sparse B+ tree index built over given database file with serach key size 22B, both block and record pointer size 12B each.Max index blocks req if node order P is defined as pointers per node ________________
Database file consists of 10,000 records with record size 100 bytes , block size 512 bytes.If sparse B+ tree index built over given database file with serach key size 22B...
3 votes
1 answer
89
left recursive- self
Is operator precedence parser the only parser that accepts left recursive grammar?
Is operator precedence parser the only parser that accepts left recursive grammar?
1 votes
1 answer
90
manchester
For a fixed baud rate , manchester communication bits twice as fast as NRZ true or false with explanation please :)
For a fixed baud rate , manchester communication bits twice as fast as NRZtrue or falsewith explanation please :)
2 votes
1 answer
91
throughput
2 processors M1 and M2 implement the same instruction set.Processor 1 uses 5 staged pipeline and uses clock cycle of 10micro sec.Processor M2 uses a 7 staged pipeline and a clock cycle of 7.5micro sec which has better max throughput
2 processors M1 and M2 implement the same instruction set.Processor 1 uses 5 staged pipeline and uses clock cycle of 10micro sec.Processor M2 uses a 7 staged pipeline and...
4 votes
1 answer
92
find output
void foo(int *); main() { int x=30 , *a=&x; foo(a++); } void foo(int *a) { printf("%d", *a); }
void foo(int *); main() { int x=30 , *a=&x; foo(a++); } void foo(int *a) { printf("%d", *a); }
2 votes
1 answer
93
evaluating postfix expression
when evaluating postfix expression if var a nd b are in stack and b is top of stack now divide(/) symbol comes then it will be a/b or b/a? it should always be (b/a) right? depending on bigger number solutions choose either a/b or b/a according to their wish ......is it like that?
when evaluating postfix expressionif var a nd b are in stack and b is top of stacknow divide(/) symbol comesthen it will be a/b or b/a?it should always be (b/a) right?dep...
1 votes
1 answer
94
linked list
a b c d e f / null Assume the above is a singly linked list first is pointing to a what will be the output after this struct node *p; p = first->link->link->link; p->link->link=first->link->link; first->link->link->link=p->link; printf("%c" , first->linl->link->link-link->data);
abcdef / nullAssume the above is a singly linked listfirst is pointing to awhat will be the output after thisstruct node *p;p = first->link->link->link;p->link->link=firs...
1 votes
0 answers
95
binary tree
NUmber of ways in which the numbers 10,20,30,40,50,60,70 can be inserted in an empty binary search tree such that the resulting tree has height 6. Height of tree with single node is 0
NUmber of ways in which the numbers 10,20,30,40,50,60,70 can be inserted in an empty binary search tree such that the resulting tree has height 6. Height of tree with sin...
1 votes
0 answers
96
bias value
in floating point representation we represent exponent as 2E-bias how is this bias value found? some places we use 8 , 16 , 64 etc
in floating point representation we represent exponent as2E-biashow is this bias value found?some places we use 8 , 16 , 64 etc
Page: