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 amitraj123
0
votes
1
Applied Root Test Series
Let C(X) be the number of leaves in a binary tree rooted at T. Assume that IsLeaf(T) returns I if T is a leaf. Which of the following observations leads to a recursive implementation? C(T)=C(T.Left) +C(T.Right) C(T):C(T.Left)+C(T.Right)+1 C(T)=C(T.Left]+C(T.right)+Isleaf(T)
Let C(X) be the number of leaves in a binary tree rooted at T. Assume that IsLeaf(T) returns I if T is a leaf. Which of the following observations leads to a recursive im...
310
views
answered
Apr 13, 2022
Programming in C
recursion
programming-in-c
+
–
0
votes
2
What will be the output and Why?
#include<stdio.h> int main() { char num = '\011'; printf("%d",num); return 0; }
#include<stdio.h int main() { char num = '\011'; printf("%d",num); return 0; }
275
views
answered
Apr 5, 2022
Programming in C
programming-in-c
+
–
2
votes
3
BARC 2022
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no deadlock? A) X B) Y - X C) Y - X + 1 D) [Y/2] + 1
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no ...
502
views
answered
Apr 5, 2022
Operating System
barc-2022
operating-system
process-synchronization
+
–
3
votes
4
Peter Linz Exercise 3.2 Question 2
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
1.2k
views
answered
Mar 27, 2022
Theory of Computation
peter-linz
theory-of-computation
regular-expression
+
–
0
votes
5
kenneth h rosen chapter 1 excercise 1.4 predicates ad quantifiers question 59 symbolic logic
Let P (x), Q(x), and R(x) be the statements x is a professor, x is ignorant, and x is vain, respectively. Express each of these statements using quantifiers; logical connectives; and P (x), Q(x), and ... c) follow from (a) and (b) what is the soution of d) cause i did not understand what the d) says?
Let P (x), Q(x), and R(x) be the statements“x is a professor,” “x is ignorant,” and “x is vain,” respectively.Express each of these statements using quantifie...
1.2k
views
answered
Mar 21, 2022
Mathematical Logic
discrete-mathematics
propositional-logic
mathematical-logic
engineering-mathematics
kenneth-rosen
+
–
1
votes
6
Producer Consumer, if buffer is empty in begining(self doubt)?
I am confused in understanding the complete flow of producer-consumer problem in following schenerio. Let currently buffer in empty and there is no data in there,and let some how consumer starts executing and will make F = ... the counting semaphore helping consumer to determine if there is even a single buffer full to consume from it.
I am confused in understanding the complete flow of producer-consumer problem in following schenerio.Let currently buffer in empty and there is no data in there,and let s...
564
views
answered
Mar 21, 2022
Operating System
operating-system
inter-process-communication
self-doubt
+
–
1
votes
7
TIFR 2017
A car 'X' in Pune starts towards Mumbai at 40 Km/hr. Fifteen minutes later, a car 'Y' in Mumbai starts towards Pune which is 150 Km away, at 55 Km/hr. Which car is nearer to Pune when they meet? (A) X is nearer (B) Y is nearer (C) Both are at equal distance (D) Not sufficient information to compute answer
A car 'X' in Pune starts towards Mumbai at 40 Km/hr. Fifteen minutes later, a car 'Y' in Mumbai starts towards Pune which is 150 Km away, at 55 Km/hr. Which car is nearer...
460
views
answered
Feb 24, 2022
Quantitative Aptitude
easy
+
–
0
votes
8
TIFR 2017
For 12L85M to be divisible by 8 and 9, (L, M) should be (A) (2, 8) (B) (5, 6) (C) (3, 4) (D) (1, 8)
For 12L85M to be divisible by 8 and 9, (L, M) should be(A) (2, 8)(B) (5, 6)(C) (3, 4)(D) (1, 8)
530
views
answered
Feb 24, 2022
Quantitative Aptitude
logical-reasoning
+
–
0
votes
9
Kenneth h rosen chapter 1 excercise 1.3 question 16
Each of Exercises 16-28 asks you to show that two compound propositions are logically equivalent. To do this, either show that both sides are true, or that both sides are false, for exactly the same combinations ... combinations of truth values of the propositional variables in these expressions i didnt understand what statement says please tell
Each of Exercises 16–28 asks you to show that two compoundpropositions are logically equivalent. To do this, either showthat both sides are true, or that both sides are...
941
views
answered
Feb 23, 2022
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
engineering-mathematics
kenneth-rosen
+
–
0
votes
10
(Theory of Computation Concept GATE2020: Previous GATE (1))
Complement of an undecidable problem is undecidable. Complement of decidable problem is ____________ ?
Complement of an undecidable problem is undecidable.Complement of decidable problem is ____________ ?
158
views
answered
Feb 23, 2022
Theory of Computation
theory-of-computation
+
–
0
votes
11
kenneth h rosen chapter 1 excercise 1.3
Show that (p → q) ∧ (q → r) and (p → r) is a logically equivalent to each other
Show that (p → q) ∧ (q → r) and (p → r) is a logically equivalent to each other
595
views
answered
Feb 23, 2022
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
engineering-mathematics
kenneth-rosen
+
–
1
votes
12
operating system
can anyone help me to solve this? a little bit confused about 100K and 30K.
can anyone help me to solve this? a little bit confused about 100K and 30K.
330
views
answered
Feb 13, 2022
3
votes
13
Time complexity calculation
A complete binary tree is a binary tree whose all levels except the last level are completely filled and all the leaves in the last level are all to the left side. for example: Now, assume that, each of the nodes in this tree is represented by a structure struct node { ... R = R->right; } if(Lcnt == Rcnt) return 0; return func(root->left) + func(root->right); }
A complete binary tree is a binary tree whose all levels except the last level are completely filled and all the leaves in the last level are all to the left side.for exa...
1.3k
views
answered
Feb 13, 2022
Algorithms
algorithms
time-complexity
recursion
+
–
1
votes
14
MADE-EASY FULL LENGHT TEST
what would be the output for this query? inner query returns NULL, right? as S.E > 10 won’t be satisfied. so for every outer tuple of R it shouldn’t produce any result? and so the output should be 0? atleast that’s what i think. but, it says the output is 3(i am assuming number of tuples of R), and i can’t figure out why. any help would be appreciated! thanks!
what would be the output for this query?inner query returns NULL, right? as S.E 10 won’t be satisfied. so for every outer tuple of R it shouldn’t produce any result?...
296
views
answered
Jan 30, 2022
Databases
databases
made-easy-test-series
+
–
0
votes
15
regular languages - TOC
Which of the following languages is/are regular?
Which of the following languages is/are regular?
487
views
answered
Jan 29, 2022
Theory of Computation
regular-language
theory-of-computation
made-easy-test-series
+
–
1
votes
16
OS Applied Test Series
Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 P2 ... ... Request 80Mb; Request 70Mb; ... ... Request 60Mb; Request 80Mb; Consider ... requests 70 Mb. This is a deadlock. Statement 2: There is no possibility of a deadlock. Which of the above statements are correct?
Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 ...
430
views
answered
Jan 27, 2022
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
4
votes
17
ACE Test Series
A ) B ) C ) D )
A ) B ) C ) D )
823
views
answered
Jan 27, 2022
DS
data-structures
binary-heap
ace-test-series
+
–
2
votes
18
MADE-EASY Full Length Test
Options were: 823 55 223 31 Please give detailed solution.
Options were:8235522331Please give detailed solution.
632
views
answered
Jan 22, 2022
CO and Architecture
co-and-architecture
control-unit
made-easy-test-series
+
–
0
votes
19
Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will ...
685
views
answered
Jan 22, 2022
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
20
Made Easy Test Series
Consider L = {w011w | w ∈ (o+1)*}. Find minimum number of states that are required in DFA (L). Found this question in Made Easy Test Series and I think the question is incorrect, as the language is not regular. The solution of this question given by Made Easy ... the given solution to be true L should be, L = {w011x | w,x ∈ (o+1)*}. Request you all to provide your comments.
“Consider L = {w011w | w ∈ (o+1)*}.Find minimum number of states that are required in DFA (L).”Found this question in Made Easy Test Series and I think the question...
437
views
answered
Jan 22, 2022
Theory of Computation
made-easy-test-series
theory-of-computation
+
–
0
votes
21
Applied Gate Full Length Test
Let S be the binary semaphore variable initialized to zero. If no blocked processes exist in the system then consider the execution of the following signal (V), wait (P) operation. The number of blocked processes at the end are _________. 4 P, 6 V, 9 P, 13 V, 14 P
Let S be the binary semaphore variable initialized to zero. If no blocked processes exist in the system then consider the execution of the following signal (V), wait (P) ...
474
views
answered
Jan 18, 2022
Operating System
operating-system
binary-semaphore
+
–
1
votes
22
NIELIT 2021 Dec Scientist A - Section B: 43
Let the predicates $D(x,y)$ mean team $x$ defeated team $y$ and $P(x,y)$ mean team $x$ has played team $y$ ... $ \forall y \exists x (P(x,y) \rightarrow D(x,y))$ $\exists x \forall y (D(x,y) \rightarrow P(x,y))$
Let the predicates $D(x,y)$ mean “team $x$ defeated team $y$” and $P(x,y)$ mean “team $x$ has played team $y$”. The quantified formula for the statement that ther...
944
views
answered
Jan 17, 2022
Others
nielit2021dec-scientista
+
–
1
votes
23
SQL - databases
Consider the following relations: How many number of records will be returned by the following query?
Consider the following relations:How many number of records will be returned by the following query?
828
views
answered
Jan 17, 2022
Databases
databases
sql
made-easy-test-series
+
–
0
votes
24
Applied mock test question
Number of states in a minimal Deterministic Finite Automata that accepts the set of strings over the alphabet {a, b} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted);are_____ ... find what is wrong in my diagram and why it cannot be used as a minimal DFA diagram My diagram: Given Answer:
Number of states in a minimal Deterministic Finite Automata that accepts the set of strings over the alphabet {a, b} containing at least three occurrences of three consec...
172
views
answered
Jan 17, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
25
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
Consider the following graph:Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the ...
718
views
answered
Jan 17, 2022
DS
data-structures
binary-heap
made-easy-test-series
numerical-answers
+
–
1
votes
26
Gate Zeal Test Series
G(V,T,P,S) V={S,A,B} T={a,b,c,d} S->aAb/bB A->b/cA B->cB/d. Is the above grammar Regular?
G(V,T,P,S) V={S,A,B} T={a,b,c,d} S->aAb/bB A->b/cA B->cB/d. Is the above grammar Regular?
382
views
answered
Jan 17, 2022
Theory of Computation
theory-of-computation
+
–
0
votes
27
DBMS made easy test series - bcnf decomposition
$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$
$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$
550
views
answered
Jan 17, 2022
Databases
databases
bcnf-decomposition
made-easy-test-series
+
–
2
votes
28
Testbook test series
Can anyone please solve this?
Can anyone please solve this?
429
views
answered
Jan 15, 2022
CO and Architecture
testbook-test-series
co-and-architecture
cache-memory
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register