Register
Filter

Answers by gshivam63

2 votes
1
File Indexing
Choose the false statement. a) Internal hashing is implemented through the use of an array of records. b) Multiple hsahing uses two or more hash functions. c) Static hashing provides slow searching of records. d) Extendible hashing provides good performance as file grows
Choose the false statement.a) Internal hashing is implemented through the use of an array of records.b) Multiple hsahing uses two or more hash functions.c) Static hashing...
1 votes
2
File Structure and Indexing
A data dictionary doesn't provide iformation about a)where data is located b)the siz of disk storage c)who owns the data d) how data is used
A data dictionary doesn't provide iformation abouta)where data is locatedb)the siz of disk storagec)who owns the datad) how data is used
0 votes
3
predict the output
1 votes
4
KERALA_PSC Predict content of PC and SP
At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively. What will be the content after CALL E000h?
At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively.What will be the content after CALL E000h?
2 votes
5
KERALA_PSC Predict the accumulator content
Predict the accumulator content after following instructions: XRA A MVI B, F0H SUB B a. F0 H b. 0FH c.01 H d. 10H
Predict the accumulator content after following instructions:XRA AMVI B, F0HSUB B a. F0 Hb. 0FHc.01 Hd. 10H
0 votes
6
Asymptotic Notation
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
3 votes
11
sliding window protocol
pleas help me in this problem
pleas help me in this problem
0 votes
12
Regarding Regular Expression
Please somebody tell from where to study Regular Expression in detail with full-length explanation of it.
Please somebody tell from where to study Regular Expression in detail with full-length explanation of it.
2 votes
14
Time complexity
What is time complexity for given recurrence relation T(n) = √nT(√n) + √n T(2)= 1
What is time complexity for given recurrence relationT(n) = √nT(√n) + √nT(2)= 1
1 votes
17
General doubt
What is the difference between CPU frequency and Clock Cycle? What is the relation between them?
What is the difference between CPU frequency and Clock Cycle? What is the relation between them?
2 votes
19
The Depth First and Breadth First Traversal algorithms visit the nodes
The Depth First and Breadth First Traversal algorithms visit the nodes in exactly the same order in which the following types of graphs Binary tree Linear chain Complete graph None of the above
The Depth First and Breadth First Traversal algorithms visit the nodes in exactly the same order in which the following types of graphsBinary treeLinear chainComplete gra...
0 votes
23
c programming
long fun(char *s) { long r=0; for(; *s; r=(r<<1)|(*s++ - '0')); return r; } what does fun("000001010") return??
long fun(char *s) {long r=0;for(; *s; r=(r<<1)|(*s++ - '0'));return r;}what does fun("000001010") return??
0 votes
25
mov[BX], AL is which kind of addressing mode
0 votes
26
C programming
main() { int a,b,c,d; a=3,b=5; c=a,b; d=(a,b); printf("%d %d",c,d); } Output???
main() {int a,b,c,d;a=3,b=5;c=a,b;d=(a,b);printf("%d %d",c,d);}Output???
1 votes
27
What is the highest address in 48 K memory?
What is the highest address in 48 K memory? (in decimal) a. 49151 b. 49152 c. 64386 d. 64387
What is the highest address in 48 K memory? (in decimal)a. 49151b. 49152c. 64386d. 64387
18 votes
28
ISRO2014-67
What is the time complexity for the following C module? Assume that $n>0$. int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); } $O(n)$ $O(\log n)$ $O(n^2)$ $O(n!)$
What is the time complexity for the following C module? Assume that $n>0$.int module(int n) { if (n == 1) return 1; else return (n + module(n-1)); }$O(n)$$O(\log n)$$O(n^...
10 votes
29
ISRO-2013-14
A processor is fetching instructions at the rate of $1$ MIPS. A DMA module is used to transfer characters to RAM from a device transmitting at $9600$ bps. How much time will the processor be slowed down due to DMA activity? $9.6$ms $4.8$ms $2.4$ms $1.2$ms
A processor is fetching instructions at the rate of $1$ MIPS. A DMA module is used to transfer characters to RAM from a device transmitting at $9600$ bps. How much time w...
Page: