Recent activity - GATE CSE Doubts

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 hours ago in NITs by ArnabCS (5 points) | 3 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.

commented 4 hours ago in GATE by Dheera (-22 points) | 50 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 hours ago in Object Oriented Programming by fahad1247 (5 points) | 4 views

0 votes

1 answer

Self Doubt,IP4
Maximum value of fragment offset in IP4

answered 21 hours ago in Computer Networks by rapidxy (9 points) | 11 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 21 hours ago in Databases by rapidxy (9 points) | 26 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 ?

commented 21 hours ago in Probability by rapidxy (9 points) | 6 views

+1 vote

0 answers

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

commented 1 day ago in Databases by zxy123 (3.2k 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; }

commented 1 day ago in Programming by Dheera (-22 points) | 11 views

0 votes

1 answer

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

answered 1 day ago in Graph Theory by Dheera (-22 points) | 10 views

0 votes

0 answers

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

asked 1 day ago in GATE by joker777 (5 points) | 14 views

0 votes

0 answers

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

commented 4 days ago in Databases by Shaik Masthan (1.5k points) | 6 views

0 votes

0 answers

#paging #operatingsystem #gateCSE #gateOperatingSystem

commented 4 days ago in Operating System by Shaik Masthan (1.5k points) | 11 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 4 days ago in Computer Networks by Nihar Ranjan Panda (5 points) | 15 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 4 days ago in Other Colleges by MohanK (5 points) | 5 views

0 votes

0 answers

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

asked 5 days ago 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; }

commented Feb 18 in Programming by Shaik Masthan (1.5k points) | 12 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.

commented Feb 18 in CO & Architecture by zxy123 (3.2k points) | 10 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) | 22 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 ______.

commented Feb 15 in Databases by Enolx.21 (49 points) | 12 views

+1 vote

0 answers

Parsing table
Can we generate different parsing table for grammar

commented Feb 14 in Compiler Design by zxy123 (3.2k 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) | 14 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; }

commented Feb 12 in Algorithms by zxy123 (3.2k points) | 13 views

0 votes

0 answers

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

commented Feb 12 in Digital Logic by zxy123 (3.2k points) | 16 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

commented Feb 12 in Operating System by kalin (155 points) | 24 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?

commented Feb 11 in Compiler Design by zxy123 (3.2k points) | 14 views

0 votes

0 answers

self doubt RAW dependency Computer organanization

commented Feb 11 in CO & Architecture by meivinay (5 points) | 23 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

commented Feb 10 in Compiler Design by Shaik Masthan (1.5k points) | 12 views

0 votes

0 answers

ACE Test Series
What is the minimum no of states in DFA which accepts the language generated by reg exp (0*1)*1(0+1)* ?. Is this binary strings containing 1? Pls Answer.

commented Feb 10 in Theory of Computation by Shaik Masthan (1.5k points) | 26 views

0 votes

1 answer

quest is from compiler design subject BSCS topic errors

answer edited 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?

commented Feb 10 in CO & Architecture by Shaik Masthan (1.5k points) | 17 views

0 votes

1 answer

Selection sort
Can anybody explain me why the number of swaps in selection sort algorithm is (n-1) in worst case ? Let's say the array is {6,5,4,3,2,1} then the number of swaps should be 5. But I think the no of swaps should be 3. Please explain.

commented Feb 10 in Algorithms by zxy123 (3.2k points) | 35 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)

commented Feb 10 in Mathematical Logic by zxy123 (3.2k points) | 15 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

commented Feb 10 in CO & Architecture by zxy123 (3.2k points) | 10 views

0 votes

0 answers

Made Easy Test series
find the total number of subnets available and broadcast address is given mask is 255.255.255.224 and IP is 192.168.0.102?

asked Feb 8 in Computer Networks by arshin jain (5 points) | 11 views

0 votes

0 answers

madeeasy test series
can we apply master theorm for 2T(n/2)+(n/logn) ? answer says no but as i am following extended master theorm it says we can…

commented Feb 8 in Algorithms by eyeamgj (29 points) | 24 views

0 votes

0 answers

Made easy question about sliding window protocol
Options are: 8,4,6,7. This is a multiple correct question. Answer as per key is 8,6,7 Their explanation is this: My doubt: if the window size is 8, then why does the sender wait for acknowledgement after sending 3 packets? It can send more without waiting.

asked Feb 7 in Computer Networks by ytheuyr (2 points) | 11 views

0 votes

1 answer

Context Free Languages (Self Doubt)
I understand that the language L = {a^m b^n c^k|(m=n)or(n=k)} is CFL because it can be represented as the union of L1 = {a^m b^m c^k} and L2 = {a^m b^k c^k} which are both CFL's. But I can't figure out the working of the PDA accepting L. To check ... meaning (m=n) or (m-n) a's or (n-m) b's will remain in the stack meaning (m!=n). How can we check for (n=k) now?

answer selected Feb 7 in Theory of Computation by shantanu4raje (25 points) | 37 views

+3 votes

1 answer

Made Easy Test Series - Algorithms
I understand that S1 is incorrect. But how is S2 correct? In BFS of an undirected graph, there are only cross edges and tree edges. There are neither back edges nor forward edges. Can anyone please clarify? Thanks.

comment moved Feb 7 in Algorithms by Shaik Masthan (1.5k points) | 84 views

0 votes

1 answer

A grammar with production rules { A ->Ba|Cb, B->CA, C->c|ε contains a) left factor b) left recursion c) both d) none

answer selected Feb 7 in Compiler Design by faizalkhan (7 points) | 153 views

0 votes

0 answers

Made easy test
In this question, it is asked to retrieve the name of each employee who has a dependent with the same first name and is the same sex as employee. How Q1 will give the correct result, coz inside IN() the condition Essn=D,Essn is not there. Can anybody explain.

asked Feb 6 in Databases by Ankita87077 (11 points) | 22 views

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

Recent activity

9,095 questions

3,154 answers

14,583 comments

95,939 users