Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User venkat_sirvisetti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by venkat_sirvisetti
2
answers
1
Carl-Hamacher
A computer system has a main memory consisting 1M 16 bit-words.It also has a 4K-word cache organized in the block-set-associative manner,with 4 blocks per set and 64 words per block. a)assume that the cache is initially empty.Suppose that the processor ... the improvement factor resulting from the use of the cache.Assume that LRU algorithm is used for block replacement. ans is: 2.15
commented
in
CO and Architecture
Jun 9, 2017
4.7k
views
co-and-architecture
carl-hamacher
cache-memory
1
answer
2
Pointer and Array
What is the output of the above program? Explanation: (*(*(*p)[1]-2)) = E (*(*(*p)[0]+1)) = A E - A = 4
commented
in
Programming in C
Jun 3, 2017
623
views
array-of-pointers
0
answers
3
Recursive fork()
The pid_t data type is a signed integer type which is capable of representing a process ID. getpid() returns the process ID of the current process The wait() system call suspends execution of the calling process until one of its children terminates. wait(): on ... } PS : some of the system call and macro definitions are simplified for the sake of the QS as well as for simplicity.
commented
in
Operating System
Jun 2, 2017
2.1k
views
fork-system-call
operating-system
2
answers
4
Cominatroics
There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different books on Economics. Find the number of ways in which one or more than one book can be selected? A. 3421 B. 3111 C. 3327 D. 3201
commented
in
Combinatory
May 31, 2017
4.5k
views
12
answers
5
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
commented
in
Algorithms
May 26, 2017
21.0k
views
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
0
answers
6
Programming Assignment
Write a bubble sort code which should work for any array size up to the memory limit. The program should print the output using a different function, and also must print the number of swaps which took place. Run the code for input sizes, 500, 50000 and ... ---- why rand() should be used in average and worst cases? If without rand() we implement it ,what will be disadvantage
commented
in
Programming in C
May 26, 2017
811
views
programming-in-c
1
answer
7
Percentage
In an election involving two candidates ,68 votes were declare invalid .the wining candidate secure 52 % and wins by 98 votes.the total no. of vote polled is.anyone can help me?
answered
in
Quantitative Aptitude
May 26, 2017
1.6k
views
2
answers
8
Write Through Cache Policy Questions - As per me answer should be 30, Given as 46 ns !
Consider a two level memory hierarchy. L1 (cache) has an accessing time of 10 ns and main memory has an accessing time of 20 ns. Writing or updating contents into their memory takes 20 ns and 30 ns for L1 and ... be 30, as in write Through Main Memory is updated no matter what ! Made Easy FLT 6- Practice Test 14
commented
in
CO and Architecture
May 21, 2017
4.3k
views
write-through
cache-memory
4
answers
9
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
answer edited
in
Algorithms
May 12, 2017
2.3k
views
ugcnetcse-jan2017-paper3
algorithms
red-black-tree
6
answers
10
UGC NET CSE | January 2017 | Part 3 | Question: 39
Consider the following JAVA program: public class First { public static int CBSE (int x) { if (x < 100)x = CBSE (x+10); return (x-1); } public static void main(String[]args){ System.out.print(First.CBSE(60)); } } What does this program print? $59$ $95$ $69$ $99$
commented
in
Object Oriented Programming
May 12, 2017
2.0k
views
ugcnetcse-jan2017-paper3
object-oriented-programming
java
3
answers
11
GATE CSE 2015 Set 2 | Question: 6
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.
commented
in
Databases
May 12, 2017
13.2k
views
gatecse-2015-set2
databases
b-tree
normal
numerical-answers
5
answers
12
ISRO2017-62
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
commented
in
Programming in C
May 11, 2017
8.7k
views
isro2017
programming-in-c
loop
output
4
answers
13
ISI CSB Sample Questions 2017
Station $A$ is sending data to station $B$ over a full duplex error free channel. A sliding window protocol is being used for flow control. The send and receive window size is being used for flow control. The send and receive window sizes ... . The propagation delay over the link is $\text{300 micro sec}$. What is the max achievable throughput in this communication?
answered
in
Computer Networks
May 11, 2017
1.4k
views
isi-2017
computer-networks
sliding-window
numerical-answers
2
answers
14
basic aptitude
Ten different letters of alphabet are given, words with 5 letters are formed from these given letters. Then, the number of words which have at least one letter repeated is: A. 69760 B. 30240 C. 99748 D. 42386 i got ans from the method totol words - no word repeated , ... 10*10*10*10*9*5!/4! + 10*10*10*10*!0 from this getting different ans where is going wrong ? someone verify pls
commented
in
Combinatory
May 10, 2017
967
views
engineering-mathematics
8
answers
15
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
commented
in
Algorithms
May 10, 2017
13.2k
views
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
0
answers
16
#Database#B+Tree
A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of internal nodes in a B+ tree of order 4 with 52 leave??
commented
in
Databases
May 9, 2017
338
views
4
answers
17
Join Number of Tuples
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also has 1001 distinct values. The maximum possible size of the join result is
answered
in
Databases
May 9, 2017
3.7k
views
natural-join
databases
relational-algebra
3
answers
18
ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above
commented
in
Databases
May 7, 2017
5.0k
views
isro2017
databases
transaction-and-concurrency
2
answers
19
ISRO2017-66
Consider the disk system with 100 cylinders. The request to access the cylinders occur in the following sequence. 4, 37, 10,7,19,73,2,15,6,20 Assuming the head is currently at cylinder 50 what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek ime first algorithm is used. 95 ms 119 ms 233 ms 276 ms
answered
in
Operating System
May 7, 2017
7.5k
views
isro2017
operating-system
disk-scheduling
3
answers
20
GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation
commented
in
CO and Architecture
May 6, 2017
14.4k
views
gatecse-2017-set1
co-and-architecture
addressing-modes
3
answers
21
Combination
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played is 9a) 36 (b) 45 (c) 42 (d) 90
answered
in
Combinatory
May 6, 2017
2.5k
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...