Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
air1ankit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by air1ankit
0
votes
0
answers
1
made_easy_test_2019 (Algorithms)
explain how to solve the above question !
explain how to solve the above question !
494
views
asked
Dec 11, 2018
Algorithms
algorithms
sorting
+
–
0
votes
0
answers
2
Discrete mathematics
every sublattice of a distributive lattice is also a distributive lattice? explain above line if possible then take an example..!
every sublattice of a distributive lattice is also a distributive lattice?explain above line if possible then take an example..!
211
views
asked
Aug 3, 2018
Mathematical Logic
discrete-mathematics
kenneth-rosen
+
–
0
votes
1
answer
3
doubt_programming
#include<stdio.h> int main() { int i=10; register *a=&i; printf("%d",*a); return 0; } ........................................................................................ ... ; printf("%d",*a); return 0; } my question is register and static both are storage classes so by using register program is executing but why not using static please explain ?
#include<stdio.h>int main(){ int i=10; register *a=&i; printf("%d",*a); return 0;}...............................................................................
373
views
asked
Jul 13, 2018
Programming in C
data-structures
programming-in-c
programming
+
–
0
votes
0
answers
4
programming and data structure
que--Study the following program written in a block structured language. var p, q : integer; begin p:= p+q; q:= p−q; p:= p−q; end; (a) exchanges (p) and (q) (b) doubles (p) and stored in (q) (c) doubles (q) and stores in (p) (d) leaves (p) and (q) unchanged
que Study the following program written in a block structured language.var p, q : integer;begin p:= p+q; q:= p−q; p:= p−q;end;(a) exc...
560
views
asked
Jul 12, 2018
Programming in C
programming-in-c
data-structures
algorithms
+
–
0
votes
1
answer
5
array
anyone please explain me how to find loc in lower triangular matrix , i am getting little bit confuse suppose matrix is 1 2 3 4 1 a11 a12 a13 a14 2 a21 a22 a23 a24 3 a31 a32 a33 a34 4 a41 a42 a43 a44 now i have to find location of a[4] b[3]:- given BA=1000 C=1 =1000+ [(4-1) * ((3)(4))/2 +(3-1)]*1 by this way i we get answer but something wrong please exolplain
anyone please explain me how to find loc in lower triangular matrix , i am getting little bit confuse suppose matrix is ...
663
views
asked
Jul 12, 2018
Programming in C
algorithms
data
data-structures
+
–
0
votes
1
answer
6
graph_doubt
"edge disjoint spanning tree" means ?
"edge disjoint spanning tree" means ?
263
views
asked
Jun 30, 2018
Algorithms
graph-algorithm
algorithms
+
–
0
votes
1
answer
7
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
469
views
asked
Apr 29, 2018
Algorithms
algorithms
minimum-spanning-tree
graph-connectivity
+
–
2
votes
0
answers
8
#self_doubt
Express it in terms of logic, here in question i am confused how i use implications, i am unable to distinguish between option a and b .. need help. ..!
Express it in terms of logic, here in question i am confused how i use implications, i am unable to distinguish between option a and b .. need help. ..!
327
views
asked
Jan 20, 2018
Mathematical Logic
discrete-mathematics
propositional-logic
+
–
0
votes
0
answers
9
#self_doub_DLD
a subcube of 2^m cell is possible if and only if ,in that subcube for every cell m number of cells must be adjacent cell . please explain what is adjacent cell, here ????
a subcube of 2^m cell is possible if and only if ,in that subcube for every cell m number of cells must be adjacent cell .please explain what is adjacent cell, here ??...
154
views
asked
Dec 30, 2017
Digital Logic
digital-logic
k-map
+
–
0
votes
0
answers
10
MadeEasy Test Series: Theory Of Computation - Finite Automata
why c is incorrect ??
why c is incorrect ??
282
views
asked
Dec 12, 2017
Theory of Computation
theory-of-computation
made-easy-test-series
finite-automata
+
–
1
votes
5
answers
11
MadeEasy Test Series: Theory Of Computation - Identify Class Language
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Consider then L1 . L2 wil be a) (ab)^n b) a^n b^n c) b^n a^n d)b^m a^n e) { a^m b^n | m ≥ 0, n ≥ 0 } why answer is d why not b ????
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Considerthen L1 . L2 wil bea) (ab)^nb) a^n b^nc) b^n a^nd)b^m a^ne) { a^m b^n | m ≥ 0, n ≥ 0 }why answer is d w...
793
views
asked
Dec 9, 2017
Theory of Computation
theory-of-computation
made-easy-test-series
identify-class-language
+
–
0
votes
1
answer
12
operating system disk scheduling
any shortcut method for this??
any shortcut method for this??
621
views
asked
Dec 9, 2017
Operating System
operating-system
disk-scheduling
disk
+
–
0
votes
0
answers
13
self_doubt theory of computation
....... how can we solve question by this table need help
.......how can we solve question by this table need help
287
views
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
turing-machine
+
–
0
votes
0
answers
14
self_doubt operating system
what is the work of " logical address " (which is generated by cpu) what is the perfect meaning of the logical address . and same doubt in physical address ..?? please explain with example (if possible)
what is the work of " logical address " (which is generated by cpu) what is the perfect meaning of the logical address .and same doubt in physical address ..??please expl...
241
views
asked
Dec 4, 2017
Operating System
operating-system
+
–
1
votes
1
answer
15
doubt programming
difference between #define and typedef ??? please give logical answer not general answer
difference between #define and typedef ???please give logical answer not general answer
277
views
asked
Nov 23, 2017
Programming in C
programming-in-c
+
–
1
votes
1
answer
16
Operating system process and threads
If a process on a system could issue an i/o request then the process will be placed on which following state .. a)ready state b) running state c)ready queue d)i/o queue // But u think process should be move to suspend and block Explain i/o queue also
If a process on a system could issue an i/o request then the process will be placed on which following state ..a)ready state b) running state c)ready queued)i/o queue //B...
381
views
asked
Nov 13, 2017
Operating System
operating-system
process-scheduling
+
–
0
votes
1
answer
17
Database doubt
Why B or B+ tree is prefer for database indexing rather than AVL tree ????
Why B or B+ tree is prefer for database indexing rather than AVL tree ????
334
views
asked
Oct 28, 2017
Databases
databases
database-normalization
rdbms
+
–
0
votes
0
answers
18
#doubt algo
What is the disadvantage of avl tree over b tree ??
What is the disadvantage of avl tree over b tree ??
187
views
asked
Oct 28, 2017
Algorithms
algorithms
databases
+
–
0
votes
0
answers
19
Database #1NF
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???
460
views
asked
Oct 27, 2017
Databases
databases
data-dependency
rdbms
+
–
2
votes
1
answer
20
Doubt Database
How to remove extraneous attributes ?? Que - find the minimal cover of the functional dependency set A->BCDEF BC->ADEF B->F D->E explain whlole procedure please
How to remove extraneous attributes ??Que - find the minimal cover of the functional dependency setA->BCDEF BC->ADEF B->F D->E explain whlole procedure please
941
views
asked
Oct 27, 2017
Databases
databases
database-normalization
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register