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
Questions by indrajeet
3
votes
1
answer
1
output type question
Ans given is D.I want to know the logic behind
Ans given is D.I want to know the logic behind
551
views
asked
Oct 8, 2017
Programming in C
programming-in-c
output
+
–
4
votes
3
answers
2
Kenneth Rosen Edition 6th Exercise 5.3 Question 37 (Page No. 362)
How many bit strings of length 10 contain at least three 1s and at least three 0s? My Approach:-> using product rule There are 3 subtask following (filling 3 ones in 10 places) = (filling 3 zeros in remaing 7 places) = ... greater than (total number of string). Now , i want to know what is wrong in my apporach. please explain..
How many bit strings of length 10 contain at least three 1s and at least three 0s?My Approach:->using product rule There are 3 subtask following (filling 3 ones in 10 pla...
1.8k
views
asked
Jul 11, 2017
Combinatory
discrete-mathematics
combinatory
kenneth-rosen
+
–
0
votes
0
answers
3
Post Gate
Will IIT HYDERABAD selects student based on gate score for MTECH ?? if yes,then what is selection processs(DIRECT or INTERVIEW based)??
Will IIT HYDERABAD selects student based on gate score for MTECH ??if yes,then what is selection processs(DIRECT or INTERVIEW based)??
258
views
asked
Mar 21, 2017
Written Exam
admission-gate2017
iit-hyderabad
+
–
1
votes
1
answer
4
Virtual Gate Test Series: Theory Of Computation - Regular Languages
Which one of the following languages over the alphabet ${0, 1}$ is regular$?$ $(A)$ The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively $(B)$ The language of palindromes, i.e., bit strings $x$ ... The kleene closure $L^{*},$ where $L$ is the language in $(C)$ above Ans is $D$ please explain$?$
Which one of the following languages over the alphabet ${0, 1}$ is regular$?$$(A)$ The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively$...
901
views
asked
Feb 5, 2017
Theory of Computation
theory-of-computation
regular-language
finite-automata
virtual-gate
+
–
0
votes
0
answers
5
B+ tree
Consider the B+ tree shown in Figure What is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change from its current value (of 1) to 3? please explain??
Consider the B+ tree shown in FigureWhat is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change ...
561
views
asked
Feb 2, 2017
Databases
databases
b-tree
gatebook-mt1
+
–
1
votes
0
answers
6
set theory
Let S = {1, 2,......,10 }. The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don’t distinguish the pair A,B and B,A)
Let S = {1, 2,......,10 }.The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don&...
381
views
asked
Feb 1, 2017
Mathematical Logic
discrete-mathematics
set-theory&algebra
combinatory
+
–
6
votes
2
answers
7
recurrance relation
Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2, where c is a positive constant. What is the asymptotic growth of T(n)? $\Theta(n)$ $\Theta(n \log n)$ $\Theta (n^2)$ $\Theta \left(n^{\log_{\frac{3}{4}}n}\right)$
Let T(n) be defined by T(0) = T(1) = 4 and $T(n) = T(\left \lfloor \frac{n}{2} \right \rfloor) +T(\left \lfloor \frac{n}{4} \right \rfloor) + cn$ for all integers n >=2,...
887
views
asked
Feb 1, 2017
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
0
votes
1
answer
8
tcp frame
Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose the first ten frames arrive at times 0, 1.2, 1.99, 4.17, 4.01, 5.03, 8.05, 7.50, 8.90, 8.99, all in seconds. Which frames reach the client too late for playout? (A) 7 (B) 3 (C) 6 (D) 5
Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose ...
699
views
asked
Jan 25, 2017
Computer Networks
computer-networks
tcp
time-out
+
–
0
votes
1
answer
9
B-tree Insertion
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted in...
989
views
asked
Jan 18, 2017
Databases
databases
b-tree
+
–
1
votes
0
answers
10
view serializable
S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
S1: R(A) W(A) W(B)S2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(D) 3
496
views
asked
Dec 25, 2016
Databases
databases
transaction-and-concurrency
view-serializable
+
–
1
votes
0
answers
11
LR(1) parser
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
641
views
asked
Dec 2, 2016
Compiler Design
compiler-design
parsing
regular-language
+
–
3
votes
1
answer
12
fork() system call
MY QUESTION IS 1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS 2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE RUN A PROGRAM MANY TIMES Consider the following code fragment: if (fork() = ... process and virtual address of a' doesn't change in child process. Therefore, we get same addresses in both parent and child.
MY QUESTION IS1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE ...
1.9k
views
asked
Nov 20, 2016
Operating System
operating-system
fork-system-call
programming-in-c
+
–
0
votes
0
answers
13
time complexity
time complexity of given function fun(int n){ for(int i = 0;i<n;i++) for(int j=i;j<i*i;j++) if(j%i==0){ for(int k =0;k<j;k++) printf("*"); } }
time complexity of given functionfun(int n){for(int i = 0;i<n;i++) for(int j=i;j<i*i;j++) if(j%i==0){ for(int k =0;k<j;k++) printf("*"); ...
1.3k
views
asked
Nov 11, 2016
Algorithms
algorithms
time-complexity
+
–
2
votes
2
answers
14
Er Diagram
Consider the following entity relation diagram If A has 50 entities,B has 20 entities and C has 200 entities. what is the maximum number of triples of entities that could be in the relationship Set R ? (A) 50 (B) 100 (C) 1000 (D) 10,000 ans is A,C(given) please explain how??
Consider the following entity relation diagramIf A has 50 entities,B has 20 entities and C has 200 entities. what is the maximum number of triples of entities that could ...
3.3k
views
asked
Sep 23, 2016
Databases
databases
er-diagram
test-series
gatebook-dbms
+
–
6
votes
1
answer
15
sql query
Consider the following table Mystery Mystery A B 1 Null 2 4 3 5 Null 6 select count() from Mystery where A not in( select B from Mystery) (A) 1 (B) 0 (C) 4 (D) 3 ans is B given please explain how??
Consider the following table MysteryMysteryAB1Null2435Null6select count() from Mysterywhere A not in( select B from Mystery)(A) 1(B) 0(C) 4(D) 3ans is B givenplease expla...
790
views
asked
Sep 22, 2016
Databases
databases
sql
gatebook-dbms
+
–
4
votes
3
answers
16
Sql Query
Let R(a,b) be a schema and Q1 and Q2 are queries on R. Q1: SELECT * FROM R; Q2: (SELECT * FROM R) INTERSECT (SELECT * FROM R); Which of the following statements is true? (A) Q1 and Q2 produce the same answer. (B) The answer to Q1 is always ... The answer to Q2 is always contained in the answer to Q1. (D) Q1 and Q2 produce different answers. ans = C given please explain the logic behind
Let R(a,b) be a schema and Q1 and Q2 are queries on R.Q1: SELECT * FROM R;Q2: (SELECT * FROM R) INTERSECT (SELECT * FROM R);Which of the following statements is true?(A) ...
2.2k
views
asked
Sep 22, 2016
Databases
databases
sql
gatebook-dbms
+
–
4
votes
3
answers
17
relational algebra
In the following relational algebra expressions, assume union and difference are multi set operators and the relations R(x),S(x) and T(x) are multi sets. Q1:(R U S)-T Q2:(R - T)U(S - T) (A) Q1 and Q2 produce the same answer (B) ... answer to Q2 is always contained in the answer to Q1 (D) They produce complete different answers what is the answer ,please explain or give example.
In the following relational algebra expressions, assume union and difference are multi set operators and the relations R(x),S(x) and T(x) are multi sets.Q1:(R U S)-TQ2:(R...
1.5k
views
asked
Sep 20, 2016
Databases
databases
relational-algebra
test-series
gatebook-dbms
+
–
1
votes
0
answers
18
no of balanced paraenthesis
The no of different balanced parenthesizes possible with n pairs of parenthesis? A. B. C. (2n)! D. n! please explain the answer.
The no of different balanced parenthesizes possible with n pairs of parenthesis?A. B. C. (2n)!D. n!please explain the answer.
417
views
asked
Sep 18, 2016
Programming in C
data-structures
gatebook
+
–
3
votes
2
answers
19
limits
what is the value of $\textstyle \lim_{x \to 2}\frac{x-2}{\log(x-1)}$
what is the value of$\textstyle \lim_{x \to 2}\frac{x-2}{\log(x-1)}$
623
views
asked
Aug 21, 2016
Calculus
engineering-mathematics
calculus
limits
+
–
2
votes
1
answer
20
eigen vector
Let A be the matrix [3112][3112]. What is the maximum value of xT Ax where the maximum is taken over all x that are the unit eigenvectors of A? A) 3 B) (5 + √5)/2 C) 3 D) (5 - √5)/2 PLEASE EXPLAIN THE MEANING OF UNIT EIGENVECTORS OF A
Let A be the matrix [3112][3112]. What is the maximum value of xT Ax where the maximum is taken over all x that are the unit eigenvectors of A?A)3B)(5 + √5)/2C)3D)(...
613
views
asked
Aug 19, 2016
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register