GATE CS 2025 Set-1 - Complete Analysis | Most Accurate & Reliable Analysis
HTML-код
- Опубликовано: 10 фев 2025
- Set - 2 Paper Complete Analysis: ruclips.net/user/li...
GATE CSE 2025 Exam Playlist: • GATE CS 2025 Exam | Co...
Crack GATE Computer Science Exam with the Best Course.
➤ Join "GO Classes #GateCSE Complete Course": www.goclasses....
➤ Join "GATE CSE+DA Combined Course": www.goclasses....
➤ Join "GO Classes #GateDA Complete Course": www.goclasses....
➤ TEST Series for GATE CSE: gateoverflow.i...
➤ Download GO Classes Android APP: play.google.co...
➤ GO Classes GATE DA RUclips Channel: / @goclassesforgateda
----------------------------------------------------
#GoClasses Website : www.goclasses.in/
#GoClasses ALL Links : linktr.ee/gocl...
➤ Join GATEOverflow + GoClasses Combined GATE CSE TEST SERIES for Best Quality questions for GATE CSE Preparation, Here: gateoverflow.i...
----------------------------------------------------
➤Join GATE Overflow & GO Classes Telegram Groups for GATE CSE Doubt Discussions:
1. t.me/GoClasses...
2. t.me/GATECSE_G...
3. t.me/gateoverf...
----------------------------------------------------
➤ Watch Complete Discrete Mathematics and Complete Engineering Mathematics Courses on GO Classes( FREE for ALL learners) : www.goclasses....
Complete #Discrete_Mathematics Course(FREE) Link :
www.goclasses....
Complete #Engineering_Mathematics Course(FREE) Link :
www.goclasses....
Download GATEOverflow GATE Previous Years Questions(GATE CSE PYQs) Books here:
github.com/GAT...
----------------------------------------------------
Feel free to Contact Us for any query.
➤ GO Classes Contact :
(+91)63025 36274
(+91)9468930964
GO Classes Mail ID :
contact@goclasses.in
#gate2025 #goclasses #computerscience #gateda #gatecs #computer_science #gatecse
19:57 this was so easy, even anyone who has not studied this topic before and just watched sir's videos(2-3 hrs only) on cache, you can very very easily solve this questions
Please take a live session for set 1 sir.. Last year you guys did great analysis for both sets.. In set 1 many questions are remaining
Thankyou very much go classes your mock aimt as and lecture help a lot.....
Direct copy pst question from standard book
I just used 9-10 page of scribble pad and was thinking I am not solving enough.. There were many questions for which you dont have to pick your pen
GO CLASSES @ 47:22
CAN YOU RECHECK THE answer please?? Because there are many other sayings that the answer is 11.85 .. ( they applied parallel searching because in question it was mentioned that time of L2= 20ns ( including miss penalty of l1).. and time of main memory= 200ns( including miss penalty of l1 and l2) so they applied parallel searching.. so can you confirm me ?
yes you are correct. The formula sir is applying only works when the access times are independently given.
That's where I was confused but I didn't study COA.. So I applied the standard formula
Yes I also got 11.85
7:57 For MST question , i think d1(u,v)>= d2(u,v) will also correct , lets say in your example take 20 as the distance between A and B .
@@jaikeerthiu1456 no you are wrong buddy
D1
Bhai fsm wale ka kya ans tha 6 yaa 7@@_S-os3uu
@@muskaanthakur2902 5. Ques taken from morris mano. Answer is 5
Morris Mano ka ques hai. Answer is 5 for fsm question
The max. Length of path from root to any other node is n-1. It should be false bcz it is saying from root to any other node it should be atmost n-1 na sachin sir
if they had mentioned atleast or exactly then the option would be false but they asked atmost so oit is correct
Sir at 1:29:50 answers should be B,D right ? @GO Classes
@9:09 the questions was actually that edge BC is included in every MST from every node so what is maximum value of x
Ring counter me bola tha how many distinct states BEFORE it reaches the initial state so ans should be 7
Exactly, ppl are misinterpreting that question
Yes bro, wait for the official answer key
bhai initial state bhi to distinct hi hua
Yes it should be 7
yes it should be 7
English chalk comprehension and fsm vala NAT
58:51 sir ye question bayes theorem se tha shyd. iska i think ans 0.8 ara tha mera..
Yes
@@uniquegaming4734 naa bhai 0.5 a raha hai uska
@@muskaanthakur2902 0.8 ha
@uniquegaming4734 dekhte hai aabhi bahut questions may dicy hai
@@muskaanthakur2902 tum konsa batch sa ho
Shift 2 was tough
Very I must say
Jisme shift me mera hota hai whi tough aa jati hai😢😢😢I was like 😩
@@adityakushwaha3550 bro if I am not wrong from digital logic there was 5 questions in set 2 ..just think and I haven't studied digital logic 🙃
@@shovonmalik7930 questions are fine but, they were very time consuming indeed
@@shovonmalik7930 Booth's algorithm question came which i never studied, had to minimize expressions in almost 3 Questions with them being MSQs😢😢
What rank can be expectef at 70 marks
so what was the highest mark that anyone could score in set1.. def it is from GO class student only
Difficulty leval of the second shift was moderate to difficult.
Very very esy
Good
Also in the bst question the statement was maximum distance from root to any node is n-1 which should be false
Yes
No it can be skewed right
@@PriyaPriya-no9rd Yes it can be skewed but still it won't be n-1 from root to any node, it can be lesser also. in the question it was written maximum distance from any node, not 'a' node. This is what I think.
@@tirthanrti801 that's what I also think🥺
It will be false
Can anyone also tell the answer for the bfs question with minimum distance 30 I don't correcty remember the exact question but i marked exactly 30
Atleast 15. Root node wasn’t mentioned so any root you can start bfs.
Diameter of graph was mentioned that was given as 30. I hope you know meaning of diameter.
Can anyone tell what was the answer for the icecream question where we had to choose 3 out 4
64
But 64 wasn't given in the options I remember correctly
Isn't it 4C3
@@GAC-vt6ks was the answer 4?
@@GAC-vt6ks i also did the same
Esy
1,1 and 1-1 eign value of a^13
64_/2
64√2,-64√2
Anyone who attempt hashing table question??
Ans 10
@oasis7gaming yess correct
10
10
Page fault ka yaad hai kisiko ?
@@ashwarytripathi 6 tha answer
@predator-ut7rl aur fsm vale ka ?
@@ashwarytripathi Woh attempt nhi kr paya, vaise B+ tree wala 1 ka tha ya 2 marks ka
6
6
Avg marks of class 30.8. A value 24 mistakenly taken as 42. New avg is 31.4. Find number of students
@@annaveen65 30
30 aaya tha
Yes 30, very simple
@@ashwani8721 Yeah
30
"aa", "bb", "cc" wale ka kya tha 195 or 1944?
195...1944 possible hi nahi hai... maximum 5 length string hi only 243 possible hai
@@dibyanshgupta_cse_1290 what I did was take the "aa" as single character so the string is now 4 characters. Now it can be "aa", "bb", or "cc" so 3 choices and the reset 3 characters have 3 choices each => 3(aa,bb,cc) * 3^3 = 3^4. Now these 4 characters can be arranged in 4! ways => 3^4 * 4! = 1944
@@destroyerYT-d4s see you are making a mistake here, you are doing 3⁴ i.e. for each place you have 3 options which a or b or c then why you are again multiplying it with 4! .....we have 5 places and each place has 3 options so total no. Of possible combinations is 3⁵ which is 243
195
195
Number of basic Blocks wale ka ans yaad hai kisi ko??
6
Or 8
6
6 hai uska
@@madhavdwivedi5146 6