Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User amitraj123
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)
answered
in
Programming in C
Apr 13, 2022
310
views
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; }
answered
in
Programming in C
Apr 5, 2022
282
views
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
answered
in
Operating System
Apr 5, 2022
507
views
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)
answered
in
Theory of Computation
Mar 27, 2022
1.1k
views
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?
answered
in
Mathematical Logic
Mar 21, 2022
1.1k
views
discrete-mathematics
propositional-logic
mathematical-logic
engineering-mathematics
kenneth-rosen
1
vote
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.
answered
in
Operating System
Mar 21, 2022
543
views
operating-system
inter-process-communication
self-doubt
1
vote
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
answered
in
Quantitative Aptitude
Feb 24, 2022
431
views
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)
answered
in
Quantitative Aptitude
Feb 24, 2022
525
views
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
answered
in
Mathematical Logic
Feb 23, 2022
893
views
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 ____________ ?
answered
in
Theory of Computation
Feb 23, 2022
164
views
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
answered
in
Mathematical Logic
Feb 23, 2022
580
views
discrete-mathematics
mathematical-logic
propositional-logic
engineering-mathematics
kenneth-rosen
1
vote
12
operating system
can anyone help me to solve this? a little bit confused about 100K and 30K.
answered
in
Operating System
Feb 13, 2022
325
views
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); }
answered
in
Algorithms
Feb 13, 2022
1.3k
views
algorithms
time-complexity
recursion
1
vote
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!
answered
in
Databases
Jan 30, 2022
294
views
databases
made-easy-test-series
0
votes
15
regular languages - TOC
Which of the following languages is/are regular?
answered
in
Theory of Computation
Jan 29, 2022
502
views
regular-language
theory-of-computation
made-easy-test-series
1
vote
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?
answered
in
Operating System
Jan 27, 2022
429
views
operating-system
deadlock-prevention-avoidance-detection
4
votes
17
ACE Test Series
A ) B ) C ) D )
answered
in
DS
Jan 27, 2022
819
views
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.
answered
in
CO and Architecture
Jan 22, 2022
634
views
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
answered
in
Operating System
Jan 22, 2022
714
views
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.
answered
in
Theory of Computation
Jan 22, 2022
416
views
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
answered
in
Operating System
Jan 18, 2022
477
views
operating-system
binary-semaphore
1
vote
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))$
answered
in
Others
Jan 17, 2022
945
views
nielit2021dec-scientista
1
vote
23
SQL - databases
Consider the following relations: How many number of records will be returned by the following query?
answered
in
Databases
Jan 17, 2022
820
views
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:
answered
in
Theory of Computation
Jan 17, 2022
157
views
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.
answered
in
DS
Jan 17, 2022
724
views
data-structures
binary-heap
made-easy-test-series
numerical-answers
1
vote
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?
answered
in
Theory of Computation
Jan 17, 2022
380
views
theory-of-computation
0
votes
27
DBMS made easy test series - bcnf decomposition
$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$
answered
in
Databases
Jan 17, 2022
549
views
databases
bcnf-decomposition
made-easy-test-series
2
votes
28
Testbook test series
Can anyone please solve this?
answered
in
CO and Architecture
Jan 15, 2022
436
views
testbook-test-series
computer-architecture
cache-memory
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...