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
All Blogs
Recent activity by neeraj33negi
1
answer
1
Applied Course | Mock GATE | Test 1 | Question: 64
Let us consider a scenario of sending real-time voice from Host A to Host B over a packet-switched network. Host A converts analog voice to a digital $32$ kbps bit stream on the fly. Host A then groups the bits into $44$-byte packets. There is one link ... bit is decoded (as part of the analog signal at Host B)? $11$ ms $88$ ms $30$ ms $30.088$ ms
Let us consider a scenario of sending real-time voice from Host A to Host B over a packet-switched network. Host A converts analog voice to a digital $32$ kbps bit stream...
786
views
commented
Jan 19, 2019
Computer Networks
applied-course-2019-mock1
network-switching
computer-networks
+
–
3
answers
2
GATE Overflow | Mock GATE | Test 1 | Question: 65
Consider the following operators used in an arbitrary regular expression parsing. (In all the below statements, capital letters denote the operator. Ignore quotes.) 'xPy' denotes a double occurrence of either x or y. ... Which of the following strings does not belong to the above given regular expression? bbaaabba baaabb bbbaaaa baabbaaaa
Consider the following operators used in an arbitrary regular expression parsing.(In all the below statements, capital letters denote the operator. Ignore quotes.)'xPy' d...
1.2k
views
answered
Jan 15, 2019
Theory of Computation
go-mockgate-1
theory-of-computation
regular-expression
+
–
1
answer
3
me test
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above? (given ans is 128 but i am getting 288)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing.The nu...
1.0k
views
commented
Jan 13, 2019
Programming in C
data-structures
hashing
+
–
1
answer
4
ME MOCK 2: COA
which addressing mode is faster and why? indirect or relative?
which addressing mode is faster and why? indirect or relative?
1.1k
views
commented
Jan 10, 2019
CO and Architecture
co-and-architecture
+
–
2
answers
5
ME TEST SERIES
250
views
answered
Jan 10, 2019
Algorithms
sorting
made-easy-test-series
+
–
1
answer
6
Zeal Test Series 2019: Mathematical Logic - Propositional Logic
Isn’t the 3) statement is wrong it should be [(p->r)^(q->r)]->[(p∨q)->r] \
Isn’t the 3) statement is wrong it should be [(p->r)^(q->r)]->[(p∨q)->r]\
705
views
commented
Jan 7, 2019
Mathematical Logic
zeal
discrete-mathematics
mathematical-logic
propositional-logic
zeal2019
+
–
3
answers
7
CMI2011-B-06a
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... or $\text{chapatis}$ between two big spoons and flipping the stack.) Give an algorithm for sorting the disks using this operation.
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We wa...
1.8k
views
answered
Jan 6, 2019
Algorithms
cmi2011
descriptive
algorithms
sorting
+
–
2
answers
8
Zeal Test Series 2019: Set Theory & Algebra - Relations
The Number of Relations, Which are both Reflexive and Symmetric but not Anti-Symmetric, on a set with 6 elements, are ____________? i got 32768 plz check
The Number of Relations, Which are both Reflexive and Symmetric but not Anti-Symmetric, on aset with 6 elements, are ____________?i got 32768 plz check
607
views
commented
Jan 2, 2019
Set Theory & Algebra
zeal
discrete-mathematics
set-theory&algebra
relations
zeal2019
+
–
1
answer
9
GATE IT 2006 | Question: 30
Which of the following statements about regular languages is NOT true ? Every language has a regular superset Every language has a regular subset Every subset of a regular language is regular Every subset of a finite language is regular
Which of the following statements about regular languages is NOT true ?Every language has a regular supersetEvery language has a regular subsetEvery subset of a regular l...
8.0k
views
commented
Dec 29, 2018
Theory of Computation
gateit-2006
theory-of-computation
easy
regular-language
+
–
0
answers
10
cache memory
A two-way set-associative cache memory uses blocks of four words. The cache can accommodate a total of 2048 words from the main memory. The main memory size is 32 x 128K. What is the word length of cache memory? (1) 39 bits (2) 14 bits (3) 69 bits (4) 78 bits
A two-way set-associative cache memory uses blocks of four words. The cache can accommodate a total of 2048 words from the main memory. The main memory size is 32 x 128K....
414
views
commented
Dec 27, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
0
answers
11
Multi-level paging-doubt
Consider a system which has 2 level paging.The page table is divided into 2K pages and each page is having 4K entries.Memory is word addressable and Physical address space is 64MW which is divided into 16K frames.Page table entry size is 2 words. (A)Length ... with result what I am getting. Is question poor or I am poor at multi-level paging?(Please tell where I went wrong)
Consider a system which has 2 level paging.The page table is divided into 2K pages and each page is having 4K entries.Memory is word addressable and Physical address spac...
1.8k
views
commented
Dec 24, 2018
Operating System
operating-system
memory-management
multilevel-paging
+
–
1
answer
12
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
If two stack is growing two opposite end of array. Then which logic works and how?
1.5k
views
commented
Dec 24, 2018
DS
stack
data-structures
+
–
0
answers
13
#poset #lattice
Let A = {$2^n | n$ is a positive integer}. A relation R on A is defined by $a^Rb$ $\iff$ a is a divisor of b. Then the set A with respect to R is_________. (A) a poset but not a lattice (B) a lattice but not a distributive lattice (C) a distributive lattice but not bounded lattice (D) not a poset.
Let A = {$2^n | n$ is a positive integer}. A relation R on A is defined by $a^Rb$ $\iff$ a is a divisor of b.Then the set A with respect to R is_________.(A) a poset but ...
331
views
commented
Dec 24, 2018
0
answers
14
selfsoubt ME OTS
consider a paged virtual memory management system having 32 bit virtual addresses with page size 1 KB .each page table entry required 32 bits.It is desired to limit the page table size into one page .if Suresh uses smaller page size at the first level of page table hierarchy ,then the number of pages needed are _?? answer given as 65793 my answer -16449. please verify
consider a paged virtual memory management system having 32 bit virtual addresses with page size 1 KB .each page table entry required 32 bits.It is desired to limit the p...
510
views
commented
Dec 14, 2018
Operating System
paging
+
–
1
answer
15
MadeEasy Subject Test 2019: Operating System - Virtual Memory
484
views
commented
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
+
–
1
answer
16
Seek Time
According to the specification of a particular hard disk seek time takes 3 milliseconds between adjacent tracks. If the disk has 100 tracks how long will it take for the head to move from the innermost cylinder to the outermost cylinder?
According to the specification of a particular hard disk seek time takes 3 milliseconds between adjacent tracks. If the disk has 100 tracks how long will it take for the ...
598
views
commented
Dec 13, 2018
CO and Architecture
co-and-architecture
disk
+
–
1
answer
17
MadeEasy Subject Test 2019: Operating System - Translation Lookaside Buffer
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference takes 500 nanoseconds; TLB (Translation Look aside Buffer) reference ... EMAT using TLB ==> 640ns EMAT wthout TLB ==> 1000ns how to calculate speed Up.?
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference take...
883
views
commented
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
translation-lookaside-buffer
+
–
1
answer
18
operating system
State TRUE or FALSE and give reasons please? DMA is a mechanism for allowing an I/O device to transfer data to and from memory without involving the CPU in the transfer. An advantage of implementing threads in user space is that they don't incur ... be accomplished without executing OS code in kernel mode. 4.A TLB miss could occur even though the requested page was in memory.
State TRUE or FALSE and give reasons please?DMA is a mechanism for allowing an I/O device to transfer data to and from memory without involving the CPU in the transfer.An...
1.6k
views
commented
Dec 13, 2018
Operating System
operating-system
+
–
2
answers
19
MadeEasy Subject Test 2019: Operating System - Disk Scheduling
I got LOOK ==> 260 CSCAN ==> 383
I got LOOK == 260CSCAN == 383
1.2k
views
commented
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
2
answers
20
Countable set
If power set of natural number is uncountable , and that is why non RE, then how is it possible set of natural number is countable and RE?------give some reason
If power set of natural number is uncountable , and that is why non RE,then how is it possible set of natural number is countable and RE? give some reason
765
views
answered
Dec 13, 2018
Theory of Computation
theory-of-computation
+
–
0
answers
21
Madeeasy-Test-series
consider a RISC processor with an ideal CPI, where 25% of total instructions are Load and Store instructions. The time to access the main memory is 100 clock cycles and accessing of the cache memory required 2 clock cycles. if the cache miss rate is 2%, then the effective CPI for the system with the cache is __.{up to 2 decimal}.
consider a RISC processor with an ideal CPI, where 25% of total instructions are Load and Store instructions. The time to access the main memory is 100 clock cycles and a...
1.8k
views
commented
Dec 12, 2018
CO and Architecture
co-and-architecture
made-easy-test-series
+
–
2
answers
22
MadeEasy Subject Test 2019: Programming & DS - Programming In C
main(){ int S[6] = {126,256,512,1024,2048,4096}; int *x=(int *) (&S+1); printf (“%d”,x); } int is 4 bytes; array starts from 2000 . The answer is 2024 I am getting 2004. Please explain the concept. If possible provide a resource.
main(){ int S[6] = {126,256,512,1024,2048,4096}; int *x=(int *) (&S+1); printf (“%d”,x); }int is 4 bytes; array starts from 2000 .The answer is 2024 I am getting 2004...
769
views
comment edited
Dec 11, 2018
Programming in C
made-easy-test-series
programming
programming-in-c
array
+
–
2
answers
23
Doubt ACE ots 3
Why 50 * 3 and not 50+3 ? Does every Byte requires different instruction ?
Why 50 * 3 and not 50+3 ?Does every Byte requires different instruction ?
373
views
answered
Dec 11, 2018
CO and Architecture
co-and-architecture
+
–
0
answers
24
Doubt : ACE ots 2
Answer : Option C Please explain ( Why do we need to assume that there were seperate tables related to customer and store ? )
Answer : Option C Please explain ( Why do we need to assume that there were seperate tables related to customer and store ? )
351
views
commented
Dec 11, 2018
2
answers
25
Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples
Every recursive program uses strictly more stack space compared to its iterative equivalent.This statement is false. Please explain with examples
723
views
commented
Dec 11, 2018
Programming in C
stack
data-structures
+
–
0
answers
26
selfdoubt madeeasy-Test-Series
consider the following two function P and Q which shares two common variable A and B : P() Q() { A=A+5; { A=B+6; B=A-3; B=A-2; } } if P and Q executing concurrently ,initial value of A=2 and B=3 then sum of all ... individual function.But i dont think that is correct because we can consider value of B when we execute both function. please help me if i am wrong.
consider the following two function P and Q which shares two common variable A and B :P() Q(){ A=A+5; ...
288
views
commented
Dec 10, 2018
2
answers
27
Who is responsible for changing the mode bit in CPU ?
When we switch from user mode to kernel mode , via an interrupt it is done , Now is this a privileged instruction or a non-priviledged instruction which changes the mode bit . Also we say that while switching from kernel mode ... mode and change the mode bit . Also is it the kernel which triggers this unprivileged instruction to change its bit .
When we switch from user mode to kernel mode , via an interrupt it is done , Now is this a privileged instruction or a non-priviledged instruction which changes the mode ...
2.0k
views
answered
Aug 9, 2018
Operating System
operating-system
+
–
0
answers
28
Virtual Memory
How we can improve size of virtual memory?
How we can improve size of virtual memory?
589
views
commented
Aug 1, 2018
Operating System
virtual-memory
operating-system
+
–
1
answer
29
Made Easy aptitude
A does half as much work as B in three-fourths of the time. If together they take 18 days to complete a work, how much time shall A take to do it?
A does half as much work as B in three-fourths of the time. If together they take 18 days to complete a work, how much time shall A take to do it?
336
views
commented
Aug 1, 2018
2
answers
30
Uniform Random variable-Self Doubt
I was reading the uniform random variable from sheldon ross it is given that X is a uniform random variable on the interval $(\alpha,\beta)$ ... My query is how they derived the distribution function from the density function?
I was reading the uniform random variable from sheldon rossit is given that X is a uniform random variable on the interval $(\alpha,\beta)$ if the probability density fun...
725
views
answered
Jul 8, 2018
Probability
random-variable
probability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register