Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
satendra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by satendra
0
votes
0
answers
1
Generic Query
Has anyone applied to IIT hyderabad mtech RA (3-years course) 2019?Has anyone gotten the call?
Has anyone applied to IIT hyderabad mtech RA (3-years course) 2019?Has anyone gotten the call?
162
views
asked
Nov 19, 2018
Written Exam
admissions
+
–
0
votes
0
answers
2
Self-Doubt
How many number of ways are there to arrange the letters of the word "ARRANGEMENT" such that (i)there are exactly two pairs of consecutively identical letters? (ii)there are atleast three pairs of consecutively identical letters?
How many number of ways are there to arrange the letters of the word "ARRANGEMENT" such that(i)there are exactly two pairs of consecutively identical letters?(ii)there ar...
485
views
asked
Nov 12, 2018
Others
discrete-mathematics
+
–
0
votes
0
answers
3
Self-doubt
Is this recurrence relation valid: N(h)=N(h-1)+1+(N(h-1)-2) where N(h) denotes minimum no. of nodes in a binary tree of height h. N(h-1) is used for left subtree and N(h-1)-2 is used for right subtree. This is in reference to this question: https://gateoverflow.in/3811/gate2005-it-50
Is this recurrence relation valid:N(h)=N(h-1)+1+(N(h-1)-2) where N(h) denotes minimum no. of nodes in a binary tree of height h.N(h-1) is used for left subtree and N(h-1)...
256
views
asked
Oct 27, 2018
Programming in C
data-structures
+
–
0
votes
0
answers
4
Self-doubt
How many indexes of each of the following type can be present at maximum in a relation and why? i)Primary Indexing ii)Clustering indexing iii)Secondary Indexing
How many indexes of each of the following type can be present at maximum in a relation and why?i)Primary Indexingii)Clustering indexingiii)Secondary Indexing
131
views
asked
Oct 16, 2018
Databases
databases
+
–
1
votes
1
answer
5
Self-Doubt
We say every bcnf is 3nf also but suppose in a bcnf relation the dependency is not preserved then how can we say that it is in 3nf since every 3nf must be dependency preserving.
We say every bcnf is 3nf also but suppose in a bcnf relation the dependency is not preserved then how can we say that it is in 3nf since every 3nf must be dependency pres...
285
views
asked
Oct 16, 2018
Databases
database-normalization
+
–
0
votes
0
answers
6
Gate2017
In the below question ,it is not mentioned as to how the relation R is associated with A and B.If i take A(M)---R---(1)B(A is related to B using many to one ) and A has total participation then option 3 is correct .If i take B(1)---R--- ... partial Relationship R is many-to-one and the participation of A in R is total Relationship R is many-to-one and the participation of A in R is partial
In the below question ,it is not mentioned as to how the relation R is associated with A and B.If i take A(M) -R -(1)B(A is related to B using many to one ) and A has tot...
285
views
asked
Oct 15, 2018
Databases
databases
+
–
0
votes
0
answers
7
Self Doubt
Start T; Write(A); Checkpoint; Commit; System Crash; Consider the above transaction T. Suppose the system crashes after the performing the above transaction.Will the recovery manager keep the above transaction into Redo-list ,if yes then what statement will be kept into redo-list?
Start T;Write(A);Checkpoint;Commit;System Crash;Consider the above transaction T. Suppose the system crashes after the performing the above transaction.Will the recovery ...
342
views
asked
Oct 13, 2018
Databases
databases
+
–
0
votes
0
answers
8
Self-Doubt
In B+ trees ,after splitting a node we copy the splitted key in the right subtree(leaf node) as per the standard procedure.Is it valid to copy the splitted key to left subtree(leaf node) instead of right subtree(leaf) ? Reference:https://gateoverflow.in/1330/gate2009-44
In B+ trees ,after splitting a node we copy the splitted key in the right subtree(leaf node) as per the standard procedure.Is it valid to copy the splitted key to left su...
165
views
asked
Oct 12, 2018
Databases
databases
+
–
0
votes
0
answers
9
Self Doubt
What is the difference between synchronous series counter and synchronous parallel counter? I searched everywhere but nowhere found any term like "synchronous series counter" . What i found was that the synchronous counter is known as parallel counter. If this is true, then how is the following question solved? Please help. https://gateoverflow.in/86195/me-test
What is the difference between synchronous series counter and synchronous parallel counter? I searched everywhere but nowhere found any term like "synchronous series coun...
275
views
asked
Sep 25, 2018
Digital Logic
digital-logic-counters
+
–
3
votes
1
answer
10
Computer Architecture-Secondary Memory
Susheel is setting up a website. He bought a fancy new hard disk which advertises: an 8 ms average seek time. 10000 RPM or roughly 6 ms per rotation. a2 ms overhead for each disk operation. a transfer speed of 10,000,000 bytes per ... have an average size of 8000 bytes. How much time will it take on an average to read a random HTML file from the disk?
Susheel is setting up a website. He bought a fancy new hard disk which advertises:• an 8 ms average seek time.• 10000 RPM or roughly 6 ms per rotation.• a2 ms overh...
663
views
asked
Apr 10, 2018
CO and Architecture
co-and-architecture
secondary-memory
+
–
2
votes
0
answers
11
Operating System By Harris
Assume the amount of memory on a system is inversely proportional to page fault rate. Each time when memory doubles the page fault rate is reduced by third. Currently system has 32mb of memory and page fault rate is 2% the main memory access time is ... is 300 μ sec. if the main memory is increased to 128 mb, then what would be the overall effective access time________.
Assume the amount of memory on a system is inversely proportional to page fault rate. Each time when memory doubles the page fault rate is reduced by third. Currently sys...
1.8k
views
asked
Apr 8, 2018
Operating System
operating-system
virtual-memory
+
–
0
votes
1
answer
12
Cache-Memory
If it takes 50ns to search associative registers and also about 100ns to get access to main memory then find out the % of slowdown in memory access time?(Given hit ratio 90%)- A)60 B)75 C)20 D)90
If it takes 50ns to search associative registers and also about 100ns to get access to main memory then find out the % of slowdown in memory access time?(Given hit ratio ...
1.3k
views
asked
Mar 3, 2018
CO and Architecture
cache-memory
co-and-architecture
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register