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 Shreya kumari
990
views
1
answers
Time complexity (Advance Level)
The difference of time Complexity between given functions can be represented by:void fun1(int n){ for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) ...
990
views
commented
Jan 10, 2019
Algorithms
time-complexity
asymptotic-notation
algorithms
+
–
826
views
0
answers
MadeEasy Test Series: Computer Networks - Congestion Control
I am getting answer as 9, someone please post their solution stepwise, that would be of great help to identify the mistake.
826
views
commented
Dec 27, 2018
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
937
views
1
answers
IP Address allocation
64,12832,1632,12864,32
937
views
commented
Dec 22, 2018
Computer Networks
computer-networks
ip-addressing
subnetting
+
–
1.7k
views
1
answers
Relation Decomposition
Decompose below relation into 2NF,3NF and BCNF with lossless join and Dependency Preserving.$R(ABCDE)$$F=\{AB\rightarrow C,DE \rightarrow C,B \rightarrow D\}$ According t...
1.7k
views
commented
Dec 21, 2018
Databases
databases
database-normalization
+
–
1.1k
views
0
answers
Process Management
Consider the following process scheduling data:Process Arrival Time Processing TimeA 0.000 3B 1.001 ...
1.1k
views
commented
Dec 13, 2018
Operating System
operating-system
process-scheduling
+
–
2.8k
views
1
answers
Ace Test Series: Compiler Design - Left Factoring
2.8k
views
commented
Nov 17, 2018
Compiler Design
compiler-design
parsing
ace-test-series
+
–
6.6k
views
3
answers
Self doubt
The number of tables required in SELF-REFERENTIAL relation when different mappings(1: M, M:1, 1:1, M: N) are used with different participation (Partial Participation at b...
6.6k
views
commented
Oct 9, 2018
Databases
databases
er-diagram
+
–
1.9k
views
1
answers
made easy work book
1:N relationship in E-R diagram is implemented in relation model as a)foreign keys are added on both sides.b)relation corresponding to '1' side is modified to include for...
1.9k
views
commented
Oct 7, 2018
896
views
1
answers
made easy
Which of the following descriptions is incorrect?(a) Data dictionary is a repository of information describing the data in the database.(b) Constraints is a rule that is ...
896
views
comment reshown
Oct 6, 2018
330
views
2
answers
Computer Networks Sub Netwoks
Consider an organization with a class-C IP network address of 195.37.5.0, they wish to divide the network into different sub networks. The subnet mask is 255.255.255.192Q...
330
views
answered
Oct 3, 2018
1.9k
views
2
answers
masters theorem
Solution using back substitution methodT(n) = 2T(n/2) + nlogn ?detailed solution please.ans is nlognlogn or n(logn)^2
1.9k
views
answered
Aug 14, 2018
Algorithms
time-complexity
algorithms
master-theorem
asymptotic-notation
recurrence-relation
+
–
359
views
1
answers
ace test series
is something missing in this question? if not please solve
359
views
commented
Dec 27, 2017
473
views
1
answers
normalization
473
views
commented
Dec 22, 2017
Databases
database-normalization
+
–
1.0k
views
0
answers
DBMS schedules
S:- r1(a) , w2(a) c2 w1(a) c1 w3(a) c3Is this strict recoverable and serializable ? c1 means commit of transaction T1
1.0k
views
commented
Dec 22, 2017
Databases
databases
transaction-and-concurrency
strict-schedule
+
–
1.1k
views
1
answers
MadeEasy Workbook: Digital Logic - Flip Flop
Explain this question Plz
1.1k
views
commented
Dec 20, 2017
Digital Logic
made-easy-test-series
digital-logic
flip-flop
made-easy-booklet
+
–
897
views
2
answers
Latch
The number of D-latches present in edge-triggered D-flip flop is :-(A) 4(B) 1(C) 2(D) 3
897
views
commented
Dec 20, 2017
Digital Logic
digital-logic
flip-flop
+
–
426
views
1
answers
MadeEasy Test Series: Computer Networks - Network Security
s1 onlys1 and s2s2,s3,s4none of these
426
views
answered
Dec 18, 2017
Computer Networks
made-easy-test-series
computer-networks
network-security
rsa-security-networks
+
–
463
views
1
answers
Transactions Serializable schedule and Unserializable Schedule
Some where I have read, that WR, RW, WW problem occurs only in un-serializable schedule, and Irrecoverable problem, cascade less rollback problem and lost update problems...
463
views
answered
Dec 13, 2017
Databases
databases
transaction-and-concurrency
concurrency
+
–
2.1k
views
1
answers
LR Parsers
Which of the following is true with respect to LR parsers?S1 : LR(1) requires less space for its parsing tableS2 : LALR(1) requires less space for its parsing tableS3 : S...
2.1k
views
answered
Dec 12, 2017
Compiler Design
compiler-design
lr-parser
+
–
1.6k
views
3
answers
M.E test
Let G be a grammar with the following productions.If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
1.6k
views
answered
Dec 10, 2017
Compiler Design
compiler-design
parsing
lr-parser
made-easy-test-series
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register