GATE CSE Doubts

+1 vote

1 answer

Aptitude question self doubt
The greatest number that divides 215,167 and 135 so as to leave the same remainder in each case What is the approach to solve such questions #gate2022

answered 11 hours ago in Numerical Ability by zxy123 (3.2k points) | 7 views

0 votes

0 answers

Will IIIT H provide stipend if applied through PGEE

asked 18 hours ago in Written Exam by mk_007 (5 points) | 8 views

+1 vote

0 answers

Unambiguous Grammar
I am no able to prove if the following grammar is ambiguous. G=({S,A,B},{A,B},P,S} P: S->aAB|bBA A->bS|a B->aS|b Can some one help me prove it?

asked 18 hours ago in Theory of Computation by ritikagupta8734 (9 points) | 7 views

0 votes

0 answers

What are pros and cons of selecting integrated PhD

asked 1 day ago in Written Exam by ankit_thawal (5 points) | 9 views

+1 vote

0 answers

TIFR 2020 Question 1 Computer Science section
Consider the following Boolean valued function on n Boolean variables: f(x1, ,xn)=x1+⋯+xn(mod 2), where addition is over integers, mapping FALSE' to 0 and TRUE' to 1. Consider Boolean circuits (with no feedback) that use only logical AND and OR gates, and ... 2^o(logn) n^c, for some fixed constant c n^ω(1), but n^O(logn) 2^Θ(n) None of the others

asked 1 day ago in Digital Logic by harleenkaur (9 points) | 12 views

0 votes

1 answer

#self doubt #Algorithm #Spanning tree
True/False 1) Multiplying all edge weight by a positive number might change the graph MST. 2) If all edge in a graph have distinct weight than the shortest path between two vertices is unique. Please answer with reason. Thanks

answered 2 days ago in Algorithms by Deepakk Poonia (Dee) (1.5k points) | 13 views

0 votes

0 answers

GO pyq book hard copy detail
how to get GO pyq book or GO any book because it is not available on amazon

asked 2 days ago in Study Resources by chinmay_rajpurohit (5 points) | 5 views

+1 vote

0 answers

#self doubt #Time complexity #tree
1) Time complexity to construct a Binary tree when inorder and preorder/postorder traversal of the tree is given. a) if inorder sorted b) if inorder is not sorted. 2) If construct Binary tree when pre-order and postorder to the tree is given. .....… My answer: 1 a) O( nlogn) 1 b) O(nlogn) 2) O(2^n) Please check and correct Thanks

asked 3 days ago in Algorithms by Hradesh patel (9 points) | 11 views

0 votes

0 answers

exam queries regarding DRDO
What is gate score cut off for DRDO sc B last year (Gen) ?

asked 3 days ago in Job Queries by GATE2021_ayush (5 points) | 5 views

0 votes

0 answers

Data base management system
Hello sir/mam, Today I've been told by our sir that we can write into ROM. Is that specified for mobile ROM or Computer ones or none of them please do clarify my doubt!

asked 3 days ago in Databases by Sai Manognya (5 points) | 9 views

0 votes

0 answers

I got 42.33 marks in gate computer science in set 2 without normalization.What colles can I get for M.Tech ?

asked 4 days ago in NITs by ArnabCS (5 points) | 9 views

0 votes

0 answers

Autocomplete package for C++ in Sublime Text 3
I was trying to install an auto-complete package for c++ in sublime text 3 but was unable to do so if anyone has any prior experience please help me….

asked 4 days ago in Object Oriented Programming by fahad1247 (5 points) | 5 views

0 votes

1 answer

Self Doubt,IP4
Maximum value of fragment offset in IP4

answered 4 days ago in Computer Networks by rapidxy (9 points) | 14 views

+3 votes

2 answers

Made easy self dought
Q. R(A,B,C,D,E,F) with {A,BC,CD} candidate keys.How many super keys possible?

answered 4 days ago in Databases by rapidxy (9 points) | 33 views

+1 vote

0 answers

DRDO 2020 computer science descriptive exam
Consider a binomial experiment of flipping a biased coin five times with probability of head ,p=0.75 and probability of tail q=0.25 in each flip. What is the probability that last two flips will be heads if the first three flips are known to be tails ?

asked 4 days ago in Probability by rapidxy (9 points) | 11 views

0 votes

1 answer

Dominating set and Independent set.
Please explain the basic difference between Independent set and Dominating Set?

answered 5 days ago in Graph Theory by Dheera (-20 points) | 14 views

0 votes

0 answers

I am getting 60 marks in GATE CSE 2021 SET 2(not normalised), what all colleges can I get for MTECH CSE?

asked 5 days ago in GATE by joker777 (5 points) | 18 views

+1 vote

0 answers

Self Doubt regarding ER diagram
What is degree of Self Referential Relationship? Unary or Binary?

asked 5 days ago in Databases by adas7099 (9 points) | 5 views

0 votes

0 answers

#pointer properties
#include<stdio.h> int main() { char *s[] = { "knowledge","is","power"}; char **p; p = s; printf("%s ", ++*p); printf("%s ", *p++); printf("%s ", ++*p); return 0; }

asked Feb 21 in Programming by Sur_1611 (5 points) | 15 views

0 votes

0 answers

#paging #operatingsystem #gateCSE #gateOperatingSystem

asked Feb 21 in Operating System by cheNavya (5 points) | 12 views

0 votes

0 answers

How to convert this problem statement to ER model
Can Somebody know how to design ER Diagram from this ?

asked Feb 21 in Databases by ghostman23111 (5 points) | 7 views

0 votes

1 answer

Goldman Sachs Test
Consider a file of 3MB that needs to be transmitted over a 1Gbps link with RTT of 80ms, What is the effective throughput? A)36.2 Mbps B)9.26Mbps C)9.9 Mbps D)28.85 Mbps

answered Feb 21 in Computer Networks by Nihar Ranjan Panda (5 points) | 18 views

0 votes

0 answers

Admissions Related
Hi friends, I am a GATE 2021 Aspirant. My Gate exam didn't go as expected. I am planning of taking admission in Anna University(AU)/Madras Institute of Technology(MIT) both of them in Chennai. They both accept Gate score in addition to their own exam for M.Tech ... to get the TANCET PYQ's of recent years as I couldn't get recent years pyq's like 2020.2019 etc. Thanks in advance.

asked Feb 21 in Other Colleges by MohanK (5 points) | 8 views

0 votes

0 answers

BOOKNAME : GRAPH THEORY, CHAPTER: CONNECTEDNESS COMPLETE, REGULAR AND BIPARTITE GRAPHS

asked Feb 20 in Study Resources by chssktejaswini (5 points) | 7 views

0 votes

0 answers

#operators_pointers_string
#include <stdio.h> #define VAL 32 int main() { char arr[] = "geeksquiz"; *(arr + 0) &= ~VAL; *(arr + 5) &= ~VAL; printf("%s", arr); return 0; }

asked Feb 18 in Programming by Sur_1611 (5 points) | 14 views

0 votes

0 answers

Where to read Cache Memory concept ?
Hi, my concepts regarding cache memory is weak. Please let me know that where (book or online source) to read Cache memory concepts ? If you have any knowledge about it please share ? Please try to share only standard sources.

asked Feb 17 in CO & Architecture by beta (5 points) | 12 views

+1 vote

0 answers

How to prepare for GATE 2022 using standard text books only (and NPTEL) to score close to 100% marks within 12 months.

asked Feb 17 in GATE by Shinichi_Kudo (13 points) | 66 views

0 votes

0 answers

Admissions to Research Oriented Programs
Can anyone give the preparation guides or strategies for the following interviews ( Gate 2021) 1. IISC Mtech Research CSA and CDS 2. IITM MS exam/interview 3. IITB MS / RA I just want to know which subjects we have to prepare and some resources ... but I don't want to sit idle for a long time 😅. Any links to correct guides will also be appreciated. Thanks!

asked Feb 15 in IISc/IITs by keshavvinayakjha (5 points) | 24 views

+1 vote

0 answers

Parsing table
Can we generate different parsing table for grammar

asked Feb 14 in Compiler Design by SHWETA RAO (9 points) | 17 views

0 votes

1 answer

Made easy workbook, Data interpretation
The GDP in Rupees grew at 7% during 2012-13.For international comparison, the GDP is compared in US Dollars after conversion based on the market exchange rate. During the period 2012-13 the ₹ 50aUSD to ₹ 60USD. India's GDP in USD during the period 2012-13 a- increased by 5% b- decreased by 13% c- decreased by 20% d- decreased by 11%

answered Feb 14 in Numerical Ability by zxy123 (3.2k points) | 15 views

+1 vote

0 answers

Gate 2020 question
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million ... each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ______.

asked Feb 13 in Databases by Enolx.21 (49 points) | 16 views

0 votes

0 answers

while solving a flip flop question i came around this situation.

asked Feb 12 in Digital Logic by Arpit Somani (5 points) | 16 views

0 votes

0 answers

Time Complexity
What is the time complexity of the following code? #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct{ char data; unsigned int freq; unsigned int parent, leftChild, rightChild; }HTNode, *HuffmanTree; typedef char** HuffmanCode; void ... HC; HuffmanTree HT; HuffmanCoding(HT, HC, word, c, len); PrintHuffmanCode(HC, word, c, len); return 0; }

asked Feb 12 in Algorithms by byebey (5 points) | 14 views

0 votes

0 answers

self doubt compiler design
char c = ‘a’; How many tokens the above statement has. My doubt is about the single quote.'a' is taken as 1 token or 3?

asked Feb 11 in Compiler Design by rahul65 (5 points) | 14 views

+1 vote

0 answers

Gate Applied Course
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of the pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? ... update the TLB, the page table, and the frame table (if needed) is negligible. A 15106 ns B 76000 ns C 15200 ns D 75110 ns

asked Feb 11 in Operating System by GopiChand (9 points) | 33 views

0 votes

0 answers

compiler construction self doubt
Consider the following grammar S → S ; T | T T → s Construct DFA of LR(1) Items Show the parsing stack for the input string s;s;s

asked Feb 10 in Compiler Design by ruqyya (5 points) | 12 views

0 votes

1 answer

quest is from compiler design subject BSCS topic errors

answered Feb 10 in Compiler Design by zxy123 (3.2k points) | 29 views

0 votes

0 answers

Self doubt COA
How to know when to use simultaneous average time formula and when to use hierarchical average time formula for the calculation of tavg questions?

asked Feb 10 in CO & Architecture by Abhipsa (17 points) | 19 views

0 votes

0 answers

SELF DOUBT IN IMPLICATIONS
Can anybody please make me understand what's the relationship among implications in proposition logic and statements such as 1. Necessarily but not sufficient 2. Sufficient but not necessary 3. Sufficient as well as necessary 4. Neither sufficient nor necessary ( although I am ... <--> q If p is neither sufficient nor necessary is the same as ! (p <--> q)

asked Feb 9 in Mathematical Logic by s_dr_13 (15 points) | 16 views

+1 vote

0 answers

MADEEASY TEST SERIES
https://gateoverflow.in/3622/gate2006-it-78 with reference to the concept used in previous year question the answer for the true data dependencies in the following question should be 5 ?? but solution is given as 3... M[100<-r1 r2<-M[700] r1<-r2 / r1 r2<-r1+r2 M[500]<-r2 M[200]<-r1

asked Feb 9 in CO & Architecture by eyeamgj (29 points) | 10 views

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

Recent questions and answers

9,105 questions

3,156 answers

14,594 comments

95,955 users