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
Answers by Learner_jai
0
votes
1
GROUP
does it satisfy for every subset of R?
does it satisfy for every subset of R?
500
views
answered
Jan 14, 2019
Engineering Mathematics
group-theory
discrete-mathematics
set-theory&algebra
abelian-group
engineering-mathematics
+
–
0
votes
2
#madeeasy
bool foo(char *s) { char c[ ]=”correspondence”; int i=0,j=0; While(s[i] && c[j]) { if (s[i] ==c[j]) j++; i++; } if(! c[j]) return true; else return false; } The string ‘response’ and ‘credence' are passed to the above function too one by one and output is observed in each case. book data type return true or false
bool foo(char *s){ char c[ ]=”correspondence”;int i=0,j=0;While(s[i] && c[j]){ if (s[i] ==c[j]) j++;i++;}if(! c[j]) return true;else return false;}The string ‘respo...
455
views
answered
Jan 10, 2019
1
votes
3
made easy
Consider Dijkstra's algorithm in the link state routing protocol at node u,professor Ram first sets the route for each directly connected node v to be the link connecting u to v.Ram then implements the rest of the algorithm correctly,aiming to produce a minimum-cost routes, ... link costs where all routing table entry (other than from u to itself) will be correct. D)Both (A) and (B)
Consider Dijkstra's algorithm in the link state routing protocol at node u,professor Ram first sets the route for each directly connected node v to be the link connecting...
790
views
answered
Jan 7, 2019
20
votes
4
GATE CSE 2017 Set 2 | Question: GA-9
The number of roots of $e^{x}+0.5x^{2}-2=0$ in the range $[-5,5]$ is $0$ $1$ $2$ $3$
The number of roots of $e^{x}+0.5x^{2}-2=0$ in the range $[-5,5]$ is$0$$1$$2$$3$
13.1k
views
answered
Jan 4, 2019
Quantitative Aptitude
gatecse-2017-set2
quantitative-aptitude
normal
maxima-minima
calculus
+
–
1
votes
5
Multicast Addressing
Consider an $IPV4$ addressing system, where at a same time two multicast group are ongoing, by choosing their multicast group address at random.Then the probability they interfere each other is _________________$\times 10^{9}$ how to solve multicast address?
Consider an $IPV4$ addressing system, where at a same time two multicast group are ongoing, by choosing their multicast group address at random.Then the probability they ...
642
views
answered
Dec 31, 2018
Computer Networks
computer-networks
network-addressing
+
–
0
votes
6
Acyclic graph directory structure is more flexible than simple tree structure.
Any resource on that topic will be helpful. :)
Any resource on that topic will be helpful. :)
944
views
answered
Dec 29, 2017
Operating System
file-system
+
–
3
votes
7
largest prime number ?
If N = 15! – 13!, then the largest prime number that divides N is _____________.
If N = 15! – 13!, then the largest prime number that divides N is _____________.
689
views
answered
Dec 13, 2017
1
votes
8
Asymtotic notations
In the context of merge sort, which of the following are true? $1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
In the context of merge sort, which of the following are true?$1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
738
views
answered
Dec 12, 2017
Algorithms
algorithms
asymptotic-notation
time-complexity
+
–
0
votes
9
Probability question on Coupons
Suppose there are M different coupons. All coupons are equally likely to come. You collected your Nth coupon. What is the probability that a) Your current coupon is different than what you had in your hand just before it? (different than all ... ) b) You have all distinct coupons till this time? c) Expected number of different types of coupon you have currently.
Suppose there are M different coupons. All coupons are equally likely to come.You collected your Nth coupon.What is the probability thata) Your current coupon is differen...
415
views
answered
Dec 5, 2017
Probability
probability
+
–
1
votes
10
PRACTICE PAPER
1.Asynchronous mode of transmission is suitable for systems with multiple peripheral devices. a) True b) False 2.The asynhronous BUS mode of transmission allows for a faster mode of data transfer. a) True b) False PLEASE GIVE REASON FOR ANSWER
1.Asynchronous mode of transmission is suitable for systems with multiple peripheral devices.a) Trueb) False2.The asynhronous BUS mode of transmission allows for a faster...
689
views
answered
Nov 24, 2017
CO and Architecture
asynchronous-circuit
+
–
1
votes
11
B Trees
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. B tree index has more levels than B+ tree index for large number of keys. B+ tree index has more levels than B tree index for ... keys. Both B tree B+ tree best for sequential access of records. B+ tree index nodes more than B+ tree for large number of keys.
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.B tree index has more levels than B+ tree ...
2.1k
views
answered
Nov 24, 2017
Databases
databases
b-tree
+
–
1
votes
12
Test by Bikram | Mock GATE | Test 4 | Question: 63
A glass contained a mixture of two different flavoured liquids, $j$ and $k$ in the ratio $4 : 1$. When $10$ litres of the mixture was replaced with liquid $k$, the ratio became $2 : 3$. The volume of liquid $j$ originally present in the jar, therefore, was ________ litres.
A glass contained a mixture of two different flavoured liquids, $j$ and $k$ in the ratio $4 : 1$. When $10$ litres of the mixture was replaced with liquid $k$, the ratio...
610
views
answered
Oct 31, 2017
Quantitative Aptitude
tbb-mockgate-4
numerical-answers
quantitative-aptitude
ratio-proportions
+
–
0
votes
13
UPSC prelim test
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without replacing any of it) to be assured of picking atleast one ball of each colour? a) 15 b) 16 c) 17 d)18
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without repla...
2.8k
views
answered
Aug 14, 2017
Combinatory
pigeonhole-principle
discrete-mathematics
+
–
2
votes
14
Test by Bikram | Programming | Test 2 | Question: 5
#include <stdio.h> void fun() { int p; static int x=1; p = ++x; printf("%d %d", p, x); if(p <= 2) fun(); printf(“%d %d”, p, x); } int main() { fun(); fun(); } In the above code fragment, the total number of times printf statement will be executed is _________.
#include <stdio.h void fun() { int p; static int x=1; p = ++x; printf("%d %d", p, x); if(p <= 2) fun(); printf(“%d %d”, p, x); } int main() { fun(); fun(); }In the ab...
413
views
answered
Jun 12, 2017
Programming in C
tbb-programming-2
numerical-answers
+
–
2
votes
15
Test by Bikram | Programming | Test 2 | Question: 30
Assume that $a[4]$ is a one-dimensional array of $4$ elements, $p$ is a pointer variable and $p = a$ is performed. Now, which among these expressions is illegal? $p == a[0]$ $p == \&a[0]$ $^*p == a[0]$ $p[0] == a[0]$
Assume that $a[4]$ is a one-dimensional array of $4$ elements, $p$ is a pointer variable and $p = a$ is performed. Now, which among these expressions is illegal?$p == a[0...
440
views
answered
Jun 11, 2017
Programming in C
tbb-programming-2
+
–
2
votes
16
Test by Bikram | Programming | Test 2 | Question: 15
Choose the correct operators to fill in the blanks: int i,j,k; i=1;j=2;k=3; printf("%d",i___5___j___2____k); Output is: $2$ + % – + * / – + + % + / * % – /
Choose the correct operators to fill in the blanks:int i,j,k; i=1;j=2;k=3; printf("%d",i___5___j___2____k);Output is: $2$ + % – +* / – ++ % + /* % – /
333
views
answered
Jun 11, 2017
Programming in C
tbb-programming-2
+
–
0
votes
17
In SDT what is the role of array reference in the Arithmetic Expression?
In SDT what is the role of array reference in the Arithmetic Expression please explain
In SDT what is the role of array reference in the Arithmetic Expression please explain
1.1k
views
answered
Apr 30, 2017
Unknown Category
compiler-design
+
–
0
votes
18
C-Output
what is the output of the following program ??
what is the output of the following program ??
563
views
answered
Apr 12, 2017
1
votes
19
ese 2017
rajiv spend 40% of his slary on food ,20%on house rent 10% on conveyance .if his saving at the month are 2000 rupees ,then his montholy slary is .................................
rajiv spend 40% of his slary on food ,20%on house rent 10% on conveyance .if his saving at the month are 2000 rupees ,then his montholy slary is ............................
518
views
answered
Apr 11, 2017
Quantitative Aptitude
general
quantitative-aptitude
+
–
1
votes
20
Important Aloha Numerical please solve
2.0k
views
answered
Apr 11, 2017
Computer Networks
computer-networks
+
–
1
votes
21
C programming - Output ?
#include <stdio.h> int main() { unsigned char a = 5; a |= (1<<((sizeof(char)<<3)-1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); } If the size of a char datatype is 1 Byte, then what will be the output? [Edited]
#include <stdio.h int main() { unsigned char a = 5; a |= (1<<((sizeof(char)<<3)-1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); }If the size of a char data...
2.1k
views
answered
Apr 10, 2017
Programming in C
programming-in-c
+
–
0
votes
22
shift reduce
363
views
answered
Mar 19, 2017
Compiler Design
compiler-design
parsing
lr-parser
test-series
+
–
1
votes
23
Solve the Following Recurrence using Iteration Method
T(n) = 4T $(\frac{n}{3})$ + n2
T(n) = 4T $(\frac{n}{3})$ + n2
827
views
answered
Feb 3, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
0
votes
24
Solve the Recurrence
T(n) =2 T$(\frac{n}{4})$ - n2
T(n) =2 T$(\frac{n}{4})$ - n2
576
views
answered
Feb 1, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
0
votes
25
Algorithms
1.2k
views
answered
Jan 15, 2017
Algorithms
algorithms
time-complexity
+
–
0
votes
26
Simple Doubt in digital
Consider a simple OR gate with 2 inputs A and B, a ouput O which is taken back and reconnected to B as feedback. Now, A=0 and B=0 so O=0. If we give A=1 for like 1 sec , O=1 and now if we turn off the power from the circuit , 1.) will we get a infinite ... it and and O=1 (Assume a case when A=1,B=0 so O=1 , Now i quickly set A=0 , will this not automatically make B=1) ?
Consider a simple OR gate with 2 inputs A and B, a ouput O which is taken back and reconnected to B as feedback.Now, A=0 and B=0 so O=0. If we give A=1 for like 1 sec , O...
697
views
answered
Dec 24, 2016
Digital Logic
digital-logic
combinational-circuit
digital-circuits
circuit-output
+
–
1
votes
27
MadeEasy Test Series: Operating System - Memory Management
Consider a system using segmented paging architecture.The segment is divided into 1K pages.Each page having 128 entries.Segment table is divided into 512 pages and each page having 1024 entries.The size of page table entries are 2 ... answer given is 1024 while I am getting 2048. Can anyone provide a detailed explanation if I am wrong?
Consider a system using segmented paging architecture.The segment is divided into 1K pages.Each page having 128 entries.Segment table is divided into 512 pages and each p...
1.1k
views
answered
Dec 19, 2016
Operating System
made-easy-test-series
operating-system
memory-management
+
–
0
votes
28
ACE test series(OS):
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16$bits. What is the size of outer page table size ? a). $4GB$ b). $8GB$ c). $32MB$ d). $32GB$
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16...
2.5k
views
answered
Dec 16, 2016
Operating System
test-series
operating-system
memory-management
bad-question
+
–
0
votes
29
Madeeasy test series
In a virtual memory system, size of virtual address is 40 bit, size of physical address is 32 bit, page size is 8 kb and size of each page table entry is 40 bit. Assume the main memory to be Byte addressable. The maximum number of bits that can be used for storing protection and other information in each page table entry are ___
In a virtual memory system, size of virtual address is 40 bit, size of physical address is 32 bit, page size is 8 kb and size of each page table entry is 40 bit. Assume t...
1.4k
views
answered
Dec 16, 2016
Operating System
memory
memory-management
+
–
0
votes
30
Poisson Distributions
Customers arrive at a shop according to a Poisson process at rate λ (/min), where they choose to buy either product A (with probability P) or product B (with probability 1 - P), independently. Given that during the first hour 5 customers chose product B, what is the probability ... shop within the first 10 minutes, all bought product A? 60% 70% 30% 40%
Customers arrive at a shop according to a Poisson process at rate λ (/min), where they choose to buy either product A (with probability P) or product B (with probability...
792
views
answered
Dec 13, 2016
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register