Seach the website
Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
Answers by gshivam63
518
views
2
votes
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...
answered
Nov 5, 2016
265
views
1
votes
File Structure and Indexing
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
answered
Nov 5, 2016
605
views
0
votes
predict the output
answered
Jul 8, 2016
Programming in C
programming-in-c
+
–
1.6k
views
1
votes
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?
answered
Jul 8, 2016
2.5k
views
2
votes
KERALA_PSC Predict the accumulator content
Predict the accumulator content after following instructions:XRA AMVI B, F0HSUB B a. F0 Hb. 0FHc.01 Hd. 10H
answered
Jul 8, 2016
Unknown Category
microprogramming
kerala-psc
+
–
736
views
0
votes
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) ?
answered
Jul 6, 2016
Algorithms
algorithms
asymptotic-notation
+
–
400
views
0
votes
Imp doubt
Can any one tell ? How should i prepare programs for Linked list addind nodes their deletion.I used to learn the programs its not that i dint understand but still i had t...
answered
Jul 6, 2016
3.2k
views
1
votes
UGC NET CSE | June 2012 | Part 3 | Question: 16
Given the following statements:The power of deterministic finite state machine and non- deterministic finite state machine are same.The power of deterministic pushdown au...
answered
Jul 6, 2016
Theory of Computation
ugcnetcse-june2012-paper3
theory-of-computation
finite-automata
+
–
2.3k
views
0
votes
UGC NET CSE | June 2012 | Part 3 | Question: 1
Consider the following Pseudo-code segment:k:=0for $i_1$:=1 to nfor $i_2$ := 1 to $i_1$:::for $i_m$:=1 to $i_{m-1}$k:=k+1The value of k after the execution of this code s...
answered
Jul 6, 2016
Programming in C
ugcnetcse-june2012-paper3
programming
algorithms
+
–
9.1k
views
1
votes
UGC NET CSE | June 2012 | Part 3 | Question: 3
The concept of pipelining is a most effective in improving performance in the tasks being performed in different stages:require different amount of timerequire about the ...
answered
Jul 6, 2016
CO and Architecture
ugcnetcse-june2012-paper3
co-and-architecture
pipelining
+
–
1.2k
views
3
votes
sliding window protocol
pleas help me in this problem
answered
Jul 6, 2016
585
views
0
votes
Regarding Regular Expression
Please somebody tell from where to study Regular Expression in detail with full-length explanation of it.
answered
Jul 6, 2016
2.6k
views
–2
votes
If the packet size is 1200 byte and speed is 70% of speed of light find throughput in stop and wat protocol for a. 12km
answered
Jul 5, 2016
Computer Networks
stop-and-wait
+
–
835
views
2
votes
Time complexity
What is time complexity for given recurrence relationT(n) = √nT(√n) + √nT(2)= 1
answered
Jul 5, 2016
Algorithms
recurrence-relation
time-complexity
+
–
1.5k
views
5
votes
can some1 plz tell about sender utilization,efficiency,link utilization,throughput, BW utilization..in network
answered
Jul 5, 2016
6.1k
views
0
votes
ISRO2016-19
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processo...
answered
Jul 4, 2016
CO and Architecture
co-and-architecture
pipelining
isro2016
+
–
317
views
1
votes
General doubt
What is the difference between CPU frequency and Clock Cycle? What is the relation between them?
answered
Jul 4, 2016
1.3k
views
0
votes
if list is almost sorted and largest element is wrongly placed
A list of integers is almost sorted with only the largest number being out of place. If this information is not known to the algorithm, then which of the following algori...
answered
Jul 2, 2016
Algorithms
algorithms
sorting
+
–
1.0k
views
2
votes
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 graphsBinary treeLinear chainComplete gra...
answered
Jul 2, 2016
4.3k
views
2
votes
Average access time, Made Easy- Psus Book
Two level memory contains cache and main memory. Cache access time is 20ns and main memory access time is 120ns/word.The size of block is 4 words. Main memory is referred...
answered
Jul 2, 2016
CO and Architecture
co-and-architecture
psu
+
–
1.0k
views
4
votes
network 200.20.11.144/27 , Which of the following languages are context free
In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is____Which of the following language...
answered
Jul 2, 2016
Theory of Computation
context-free-language
+
–
1.0k
views
2
votes
network 200.20.11.144/27 , Which of the following languages are context free
In the network 200.20.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is____Which of the following language...
answered
Jul 2, 2016
Theory of Computation
context-free-language
+
–
463
views
0
votes
c programming
long fun(char *s) {long r=0;for(; *s; r=(r<<1)|(*s++ - '0'));return r;}what does fun("000001010") return??
answered
Jul 1, 2016
662
views
0
votes
some1 plz explain why the time complexity of Prims algorithm using arrays is O(v^2+2E)...thanks in advance
answered
Jul 1, 2016
Algorithms
prims-algorithm
time-complexity
+
–
1.8k
views
0
votes
mov[BX], AL is which kind of addressing mode
answered
Jul 1, 2016
3.1k
views
0
votes
C programming
main() {int a,b,c,d;a=3,b=5;c=a,b;d=(a,b);printf("%d %d",c,d);}Output???
answered
Jul 1, 2016
2.1k
views
1
votes
What is the highest address in 48 K memory?
What is the highest address in 48 K memory? (in decimal)a. 49151b. 49152c. 64386d. 64387
answered
Jul 1, 2016
4.9k
views
18
votes
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^...
answered
Jul 1, 2016
Algorithms
isro2014
algorithms
time-complexity
+
–
7.2k
views
10
votes
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 w...
answered
Jul 1, 2016
CO and Architecture
isro2013
dma
+
–
15.9k
views
16
votes
ISRO2014-49
Consider a single linked list where $F$ and $L$ are pointers to the first and last elements respectively of the linked list. The time for performing which of the given op...
answered
Jul 1, 2016
DS
isro2014
data-structures
linked-list
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register