GATE CSE Doubts

0 votes

0 answers

Lagrange Multiplier
The maximum value of the function. $f(x,y,z)=(x−1/3)^{2}+(y−1/3)^{2}+(z−1/3)^{2}$ Subject to the constraints $x+y+z=1, x\geq 0,y\geq 0,z\geq 0$ The question has been asked here but I was trying to solve it ... of maximum value. Can we solve this question using Lagrange Multiplier? The actual answer to this question is 2/3. @ShaikMasthan @srestha mam, please check this out

asked 28 minutes ago in Calculus by Nirmal Gaur (6 points) | 3 views

0 votes

1 answer

Gatebook TS: Calculus
$Q:$ How many distinct values of x satisfy the equation $sinx=\dfrac{x}{3}$ where x is in radians.

answered 3 hours ago in Calculus by pranay562 (457 points) | 12 views

0 votes

0 answers

Ace Compiler design CS_GATE_2020_45
Can anyone tell how to solve the below question?

asked 4 hours ago in Compiler Design by Pratyush Priyam Kuan (212 points) | 8 views

0 votes

1 answer

GATE GURU:LINEAR ALGEBRA

answered 12 hours ago in Mathematical Logic by Verma Ashish (306 points) | 10 views

0 votes

1 answer

TOC questions
Give brief ans

answered 13 hours ago in Theory of Computation by Rudr Pawan (672 points) | 15 views

0 votes

0 answers

Average Access Time of Read on Cache Hit and Cache Miss

asked 15 hours ago in CO & Architecture by goxul (111 points) | 9 views

0 votes

0 answers

Network Security
I am having trouble in learning network security, if someone could provide some resources through which I can learn all the concepts for Gate, it would be a real help.

asked 15 hours ago in Computer Networks by luc_Bloodstone (14 points) | 10 views

0 votes

0 answers

Gatebook: Compiler Design
Consider the context-free grammar G : S → aSbS | bSaS | ε How many parse trees are there for the sentence ababababab ? Doubt: When can Catalan number be used for finding number of parse trees? And what is the general procedure for finding the number of parse trees in a question like this where the number of such trees is large? Answer is 42.

asked 16 hours ago in Compiler Design by Sambhrant Maurya (277 points) | 9 views

0 votes

0 answers

Made easy test sliding window
Suppose station X sends a message with $15$ packets to station B using a sliding window of size $4$, selective repeat in used and every $5^{\mathrm {th}}$ packet is lost, the number of transmissions required to send all $\mathbf {15}$ packets to Y__________. What is the right way to solve this question? [closed]

asked 18 hours ago in Computer Networks by `JEET (157 points) | 19 views

0 votes

1 answer

GATE GURU: LINEAR ALGEBRA TOPIC TEST
The number of distinct possible square matrices of order 2, with each entry 2 (or) 0 (or) -2 is __________________

answered 19 hours ago in Mathematical Logic by Satbir (3.2k points) | 7 views

0 votes

0 answers

Gate limit questions
Find limit of given graph

asked 19 hours ago in Calculus by amit166 (30 points) | 11 views

0 votes

0 answers

#Lattice#Discrete_Mathematics
https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=8018894368000379347 I think 3 is also not lattice. As d and e do not have join semilattice. Am I wrong?

asked 21 hours ago in Set Theory & Algebra by nandani17 (10 points) | 18 views

0 votes

0 answers

input/output organization
In vectored interrupt scheme the interrupting device must send its identification through the data bus. My doubt is which one is true? The device first gains control over the bus then it can send interrupt request and if the processor acknowledges this request then it will ... it uses the data bus(may be!!) so by this reasoning i think 1st point is not true. am i right??

asked 22 hours ago in CO & Architecture by mahabir10 (6 points) | 10 views

0 votes

1 answer

Consider a system having 30 instances of resources R

answered 22 hours ago in Operating System by Satbir (3.2k points) | 5 views

0 votes

0 answers

Made easy DS doubt

asked 23 hours ago in Programming by Priyansh Singh (72 points) | 16 views

0 votes

0 answers

pointer Assignment
#include<stdio.h> int main() { int a[5]={1,2,3,4,5}; int *ptr=(int*)(&a+1);//why typecasting has done here? printf("%d%d",*(a+1),*(ptr-1)); } output is 25.can someone explain this?

asked 1 day ago in Programming by Arun Rout (6 points) | 10 views

0 votes

1 answer

Computer Networks ACE Test Series Fragmentation Doubt

answered 1 day ago in Computer Networks by Skscool007 (9 points) | 14 views

0 votes

0 answers

The solution of the recurrence relation
an=4an-1+3n2n where a0=4.

asked 1 day ago in Mathematical Logic by altamash (43 points) | 8 views

0 votes

0 answers

Made Easy Test Series Compiler Design (topic wise Q.16) [closed]

asked 1 day ago in Compiler Design by arya_stark (6 points) | 19 views

0 votes

1 answer

Operating system self doubt
please help me to fill these table with YES/NO SYNCHRONIZATION MECHANISMS DISABLE INTERRUPTS LOCK VARIABLE STRICT ALTERATION PETERSON SOLUTION TEST AND SET LOCK INSTRUCTION SLEEP AND WAKE UP BINARY SEMAPHORE COUNTING SEMAPHORE MUTUAL EXCLUSION IS ... WAITING PROBLEM ? NO YES YES YES NO SOFTWARE OR HARDWARE BASED IMPLEMENATION ? HARDWARE SOFTWARE SOFTWARE SOFTWARE

answered 1 day ago in Operating System by Shaik Masthan (328 points) | 25 views

0 votes

0 answers

Ace Theory of Computation CSIT_P_26
Can someone please tell how to solve the below question

asked 1 day ago in Theory of Computation by Pratyush Priyam Kuan (212 points) | 11 views

0 votes

0 answers

Self doubts dld
$F(a,b,c)=F(\bar{a},\bar{b},\bar{c})$ no function possible

asked 1 day ago in Digital Logic by amit166 (30 points) | 10 views

0 votes

0 answers

ME test series: OS
My doubt here is can we not use medium term scheduler to swap process in vritual memory to avoid thrashing ?

asked 1 day ago in Operating System by kalra05 (19 points) | 15 views

0 votes

0 answers

TLB with demand paging
Formula 1 EAT with page fault in demand paging = Page fault rate * {Effective Access Time without page fault + Page fault service time} + (1 - Page fault rate) * {Effective Access time without page fault} Where, Effective Access Time without ... while solving questions ? I am getting confused when to apply which formula. According to me we should always use formula 1.

asked 1 day ago in Operating System by Satbir (3.2k points) | 20 views

0 votes

0 answers

Self_Doubt_Computer_Network_TCP_Checksum
TCP has an end-to-end checksum that covers part of IP header and TCP header and data. When the receiver receives packet whose checksum is not matching, then it can do the following things. 1. Discard the segment and send ACK to sender ... bytes its expect to the receiver. 2. Discard the segment and do nothing. Which one of the above actions is preferable?

asked 1 day ago in Computer Networks by nandani17 (10 points) | 7 views

0 votes

0 answers

Decidability -Self Doubt
L={<M>|L(M) is finite}- undecidable. $L=\left \{ L\left ( M \right ) |L\left (M\right )=\Sigma ^{*} \right \}$-undecidable L={<M>|L(M) is recursive}- undecidable. L={<M>|L(M) is PROPER subset of $\Sigma ^{*}$}- undecidable [while, L={<M>|L(M) is subset of $\Sigma ^{*}$}- decidable ] How these four conclusion is correct? Plz. explain

asked 2 days ago in Theory of Computation by srestha (419 points) | 20 views

0 votes

1 answer

Limit best questions
$\lim_{x\rightarrow \infty }2[ \sqrt{n+6} \sqrt{n+10}-n]$ find value

answered 2 days ago in Calculus by pranay562 (457 points) | 6 views

0 votes

1 answer

Math problems limits
$\lim_{x\rightarrow \infty }x^{sinx} find$

answered 2 days ago in Calculus by pranay562 (457 points) | 8 views

0 votes

0 answers

Math questions
$\lim_{x\rightarrow 0^{+}}0^{x}$ find value

asked 2 days ago in Calculus by amit166 (30 points) | 5 views

0 votes

0 answers

Cormen Edition 3 Exercise 22.4 Question 3 (Page No. 615)

asked 2 days ago in Algorithms by Kushagra गुप्ता (102 points) | 11 views

0 votes

0 answers

Programming doubt (GO site)
Write the condition , for which following program will print “Hello World” #include <stdio.h> int main() { if() { printf("Hello "); } else { printf("World\n"); } return 0; }

asked 2 days ago in Programming by srestha (419 points) | 18 views

0 votes

0 answers

Gate previous years question
https://gateoverflow.in/423/gate2008-25 Why we have not done 3rd derivative test..3rd derivative will give different results

asked 2 days ago in Calculus by nandani17 (10 points) | 15 views

0 votes

0 answers

self doubt on memory organization
What is the exact difference between direct access and random access ?

asked 2 days ago in CO & Architecture by chandrikabhuyan8 (104 points) | 9 views

0 votes

0 answers

Engineering Math: Continuity Doubt
Is this function $y=x^{2}$ bounded between $\left [ -1,1 \right ]$? What bounded actually represents?

asked 3 days ago in Mathematical Logic by srestha (419 points) | 5 views

0 votes

0 answers

SELF DOUBT MADE EASY
How to check whether this function is $SURJECTIVE$ or $NOT$?

asked 3 days ago in Mathematical Logic by Debapaul (211 points) | 9 views

0 votes

0 answers

Ace academy doubt toc

asked 3 days ago in Theory of Computation by Priyansh Singh (72 points) | 17 views

0 votes

0 answers

Self doubt on loopback address
Why is 127.x.x.x range reserved for loopback address? Why can't we just put source address and destination address same? Won't it have the same effect? Then why waste an entire IP range for LOOPBACK ADDRESS?

asked 3 days ago in Computer Networks by KINGSLAYER (9 points) | 11 views

0 votes

0 answers

Ace grand subject test 42 Operating system
can some one tell the method to solve the below question? Thank you [closed]

asked 3 days ago in Operating System by Pratyush Priyam Kuan (212 points) | 12 views

0 votes

0 answers

ACE Operating Systems CS_GATE_2020_42
Can someone please tell the method to solve this question Thank you in advance

asked 3 days ago in Operating System by Pratyush Priyam Kuan (212 points) | 8 views

0 votes

1 answer

Mathematical Logic (ACE)
Consider the following arguments ... Which of the following are valid?

answered 4 days ago in Mathematical Logic by Satbir (3.2k points) | 28 views

To see more, click for the full list of questions or popular tags.

Recent questions and answers

1,936 questions

1,183 answers

5,475 comments

89,631 users