menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by VS

2 votes
2 answers
1
Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
asked Jan 31, 2018 in Algorithms 1.4k views
2 votes
1 answer
2
Identify class of the language
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
asked Jan 24, 2018 in Theory of Computation 186 views
1 vote
0 answers
3
Aptitude
asked Jan 24, 2018 in Quantitative Aptitude 151 views
1 vote
0 answers
4
Stack algorithm
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?
asked Jan 23, 2018 in Operating System 337 views
3 votes
2 answers
5
#Conflict Misses
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
asked Jan 21, 2018 in CO and Architecture 561 views
3 votes
0 answers
6
CSL or not ?
L={ (an)m bn | n,m>=1 }
L={ (an)m bn | n,m>=1 }
asked Jan 20, 2018 in Theory of Computation 115 views
1 vote
1 answer
7
Resource Allocation
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
asked Jan 20, 2018 in Operating System 1.4k views
1 vote
0 answers
8
Dynamic programming
Consider the following recursive function which is used by dynamic programming: T(n)= 0 ;if n<1 = 1;if n=1 =T(n-1)+T(n-2)+1 ;if n>1 Assume for every function call T(i) it checks the table first, if its value is already ... of n' so that overflow cannot occur ________. (Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
Consider the following recursive function which is used by dynamic programming: T(n)= 0 ;if n<1 = 1;if n=1 =T(n-1)+T(n-2)+1 ;if n>1 Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves ... value of n' so that overflow cannot occur ________. (Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
asked Jan 20, 2018 in Algorithms 397 views
0 votes
0 answers
9
Min. #Tables
.......
.......
asked Jan 17, 2018 in Databases 216 views
2 votes
0 answers
10
Weighted undirected graph
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are present in the graph, if present then calculate the minimum distance between them?
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are present in the graph, if present then calculate the minimum distance between them?
asked Jan 17, 2018 in Algorithms 530 views
2 votes
1 answer
11
Hamiltonian Graph
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
asked Jan 16, 2018 in Mathematical Logic 519 views
2 votes
0 answers
12
DAG_#Nodes
Consider the basic block given below: b=b+c d=b+d b=b-d e=d+b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
Consider the basic block given below: b=b+c d=b+d b=b-d e=d+b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
asked Jan 16, 2018 in Compiler Design 768 views
4 votes
1 answer
13
Theads
True/False : 1)Several threads can share same physical address space. 2)Several threads can share same virtual address space.
True/False : 1)Several threads can share same physical address space. 2)Several threads can share same virtual address space.
asked Jan 16, 2018 in Operating System 728 views
5 votes
1 answer
14
Balanced binary search tree
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
asked Jan 15, 2018 in Algorithms 368 views
1 vote
0 answers
15
Logical shift
a) Shifting a Unsigned integer right by one bit, and filling from the left with 0, is always equivalent to dividing by 2. (True/False) b) Shifting a Unsigned integer left by one bit, and filling from the right with 0, is always equivalent to multiplying by 2. (True/False)
a) Shifting a Unsigned integer right by one bit, and filling from the left with 0, is always equivalent to dividing by 2. (True/False) b) Shifting a Unsigned integer left by one bit, and filling from the right with 0, is always equivalent to multiplying by 2. (True/False)
asked Jan 13, 2018 in CO and Architecture 235 views
1 vote
1 answer
16
Cartesian Product
Suppose L = { {} } , N = {1, 2, 3}. Now what does the set N × L contain ?
Suppose L = { {} } , N = {1, 2, 3}. Now what does the set N × L contain ?
asked Jan 13, 2018 in Set Theory & Algebra 151 views
2 votes
1 answer
17
Contingency or Not ?
~ $\forall$ x [ P(x) -> (Q(x) v P(x) ) ]
~ $\forall$ x [ P(x) -> (Q(x) v P(x) ) ]
asked Jan 11, 2018 in Mathematical Logic 225 views
1 vote
1 answer
18
Starvation
I am confused with what exactly Starvation mean ? AFAIK Considering Process Scheduling eg SRTF and SJF , Starvation can be considered when some process is getting preempted by other high priority processes and hence not getting a chance to execute on CPU and ... do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
I am confused with what exactly Starvation mean ? AFAIK Considering Process Scheduling eg SRTF and SJF , Starvation can be considered when some process is getting preempted by other high priority processes and hence not getting a chance to execute on CPU and hence ... solving do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
asked Jan 9, 2018 in Operating System 223 views
2 votes
0 answers
19
CSMA/CD
In standard ethernet with transmission rate of 20 Mbps, the length of the cables is 2500 m and the size of frame is 512 bits. The propagation speed of a signal in a cable is 2 × 108 m/s. The percentage of the time channel is idle or not used by a station is _________ (in approximate integer value).
In standard ethernet with transmission rate of 20 Mbps, the length of the cables is 2500 m and the size of frame is 512 bits. The propagation speed of a signal in a cable is 2 × 108 m/s. The percentage of the time channel is idle or not used by a station is _________ (in approximate integer value).
asked Jan 6, 2018 in Computer Networks 1.3k views
3 votes
1 answer
20
TCP Congestion Control
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th transmission what is the congestion window size at the end of 10th transmission?
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th transmission what is the congestion window size at the end of 10th transmission?
asked Jan 6, 2018 in Computer Networks 534 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...