Recent activity - GATE CSE Doubts

0 votes

0 answers

Virtual Gate: Programming (Array)
Consider the following declaration in two dimensional array in C. char arr[100][100]; Assuming the main memory is byte addressable and the array is stored starting from memory address $0.$ ... $4050$ Why they have not calculated it in row-major order?? Why they put it in direct multiplication??

commented 4 hours ago in Programming by Shaik Masthan (104 points) | 18 views

+1 vote

0 answers

Virtual Gate Test Series:Programming test 2015
int main(){ int *ptr; ptr=(int*)malloc(100); printf("%d",sizeof(ptr)); return 0; } Consider the memory allocated by integer pointer $4B$. What will be output of the program?

commented 4 hours ago in Programming by Verma Ashish (305 points) | 9 views

0 votes

1 answer

Decidability Problem (Rice University pdf)
For the following language, state whether language is (I) recursive, (II) recursively enumerable but not recursive, or (III) not recursively enumerable. Prove your answer. $L_{11} = \{<M_{1}, M_2> | \text{ M}_1 \text{and M}_2 \text{ are two TMs}, \text{and } \epsilon \in L(M_1) \backslash L(M_2) \}$

answer edited 5 hours ago in Digital Logic by Arjun (114 points) | 29 views

0 votes

1 answer

Self Doubt: Parsers
Consider the following two grammars G1: A → A1 | 0A1 | 01 G2: A → 0A | 1 Which of the following is True regarding above grammars? (a) L1 is LR(k) (b) L2 is LR(k) (c) Both L1 and L2 is LR(k) (d) None is LR(k)

answer selected 6 hours ago in Compiler Design by Bikram (187 points) | 11 views

0 votes

1 answer

Is hypercube graph is another name of regular graph??

answered 6 hours ago in Mathematical Logic by Bikram (187 points) | 11 views

0 votes

1 answer

What is maximal independent set(MIS)?

answered 6 hours ago in Mathematical Logic by Bikram (187 points) | 6 views

0 votes

0 answers

Gateoverflow question on B+ tree - Self Doubt
https://gateoverflow.in/258022/dbms-basic-test1 Int the above question, as per the diagram, the leaves are supposed to be in level 4 and so the number of children in level 3 which equals to 27 as per calculation means the number of child pointers to level 4 that is the leaf node level is actually 27. Am I correct ?

asked 8 hours ago in Databases by user2525 (1.6k points) | 6 views

0 votes

0 answers

A draws 2 cards at random from a pack of 52 cards.

commented 8 hours ago in Probability by srestha (247 points) | 14 views

0 votes

0 answers

B tree and B+ tree - Made Easy / Gateoverflow
For the below question, https://gateoverflow.in/285557/madeeasy-test-series-databases-b-tree Can anyone explain option B and option D ? I mean what they actually mean to say ?

asked 9 hours ago in Databases by user2525 (1.6k points) | 4 views

0 votes

0 answers

Virtual Gate Test Series:Programming
union u1{ int x; struct s1{ char ch1; union u2{ char ch2; short int var; }u3; }s2; }u4; Assume that object of type char , short int and int takes $1B,2B,4B$ respectively. The memory required for variable $u4$ is ________ Bytes. See here memory ... (2B) So total memory created will be 4+1+2=7B, isnot it?? But answer given 4B , Plz tell me where am I missing??

commented 12 hours ago in Programming by Arjun (114 points) | 7 views

0 votes

0 answers

Binary String with 5 0's and 6 1's possible, where all 0's are together.

asked 12 hours ago in Combinatory by Abhinav993 (173 points) | 6 views

0 votes

1 answer

What is the difference between computer architecture and computer organization? Help me with good examples.

answered 13 hours ago in CO & Architecture by Abhinav993 (173 points) | 10 views

0 votes

1 answer

Gatebook Floating Point
Consider the 16-bit floating-point format which has 9 rightmost bits for the mantissa and 6 bits for the excess-31 exponent in the middle and most significant bit stands for sign of the float number. Which of the following represents the difference between the largest and eighth largest normalized positive float value in this system? $2^{22}$ $2^{23}$ $2^{24}$ $2^{25}$

commented 15 hours ago in Digital Logic by Arjun (114 points) | 37 views

0 votes

0 answers

Which chapters should I study from the standard textbooks?

commented 16 hours ago in Puzzles by Mk Utkarsh (111 points) | 17 views

0 votes

0 answers

ACE TEST SERIES: DBMS
The number of serial schedules which are view equal to schedule(s) but not conflict equal to schedule(s) are ________.

asked 16 hours ago in Databases by Abhinav999 (106 points) | 5 views

0 votes

0 answers

iGate Bhillai Test: DBMS

asked 16 hours ago in Databases by Abhinav999 (106 points) | 3 views

0 votes

0 answers

iGate Bhilai Test 2020:dbms

asked 16 hours ago in Databases by Abhinav999 (106 points) | 4 views

+1 vote

1 answer

Foreign key - Self Doubt
When it comes to inserting something in a foreign key table, we cant put null values. But when it comes to deleting something from referenced table, we can perform ON DELETE SET NULL operation and make the foreign key value in a particular tuple as NULL. So, a foreign key can’t remain null while inserting but it can be null while deletion. Is my approach correct ?

commented 20 hours ago in Databases by user2525 (1.6k points) | 39 views

0 votes

0 answers

Express it using logic. "There are exactly two systems that monitor every re mote server"

asked 22 hours ago in Mathematical Logic by Bhunesh_Singh (102 points) | 6 views

0 votes

0 answers

Self doubt regarding error control
Is 2D parity scheme for error control techniques in GATE CSE 2020 Syllabus? Because in 2008 IT paper it was asked? Do i need to practice the questions related to the concept of 2D parity??

commented 1 day ago in Computer Networks by Debapaul (100 points) | 6 views

0 votes

0 answers

Do process and threads (belong to that process) share same address space ? If yes, How?

asked 1 day ago in Operating System by Neelam_$ingh_222 (102 points) | 2 views

0 votes

2 answers

Is my NFA correct for the question given below?if not then what will be [closed]

commented 1 day ago in Theory of Computation by shaktisingh (104 points) | 13 views

0 votes

0 answers

Algorithms - Time Complexity analysis
1 .Let P be the problem. Suppose that the worst case asymptotic running time complexity of P is in O($n^2$lgn) and is also in Ω(n). Now let A be an algorithm that solves P. Which of the following is correct about A: A has worst-case time ... time case complexity of an algorithm is θ(n). The Algorithm executes in time T(n) = Ω($n^2$) for every input data.

commented 1 day ago in Algorithms by sagar2405 (192 points) | 10 views

0 votes

0 answers

Self Doubt: BST and Heap
What is the time required to Deletion of the smallest element from a balanced binary search tree Insertion an element in heap Will it be O(log n) or O(1) for 1st one and O(n) or O(logn) for 2nd one??

commented 1 day ago in DS by Satbir (1k points) | 30 views

0 votes

1 answer

GATEBOOK Floating point 16 bit
Consider the 16 bit floating-point format which has 9 rightmost bits for the mantissa and 6 bits for the excess-31 exponent in the middle and most significant bit stands for sign of the float number. Which of the following represents the difference between the smallest and third ... positive float value in this system? $2^{-39}$ $2^{-40}$ $2^{-38}$ $2^{-37}$

commented 1 day ago in Digital Logic by Mk Utkarsh (111 points) | 19 views

0 votes

0 answers

Algorithms - Time complexity
1 .Solve the recurrence: $T(n) = 2T(\sqrt n) + log\ n$ $T(n) = T(\frac{n}{2}) + 2T(\frac{n}{4}) +n$ 2 .$f(n) = n^{1.01}$ and $g(n) = n(log\ n)^2$ then which one is true $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ $f(n) = \Theta(g(n))$ 3 . $f(n) = n^{\frac{1}{2}}, g(n) = 1$, then is it correct $g(n) = o(fn)$ {$o$ = small o Not big $O$} Please solve the above questions.

edited 1 day ago in Algorithms by sagar2405 (192 points) | 11 views

0 votes

1 answer

Gateforum Test Series: Compiler Design
The least number of total variables needed to create a three address code in static single assignment form for the following code segment is: q=3 r=10 s=q+r t=2*r+s t=q u=q+r v=q+t t=3+x

comment edited 1 day ago in Compiler Design by Sambhrant Maurya (281 points) | 27 views

0 votes

0 answers

Recursive descent parser
Consider the following statements: 1. Recursive descent parser can use left recursive grammar. 2. Leaf nodes of tree is synthesized attribute . Which of the above statement is correct? Given ans : both 1 and 2. My doubt is Top down parser cannot parse the left recursive Grammar and Recursive descent parser is Top down parser so is 1 statement true ?

comment edited 1 day ago in Compiler Design by Brij gopal Dixit (130 points) | 8 views

0 votes

1 answer

Self Doubt in Parsers
“Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter” True or False? What about LR(0) for the same?

comment edited 1 day ago in Compiler Design by Sambhrant Maurya (281 points) | 16 views

0 votes

0 answers

What is the grammar for generating strings like a=b=c?

comment edited 2 days ago in Compiler Design by Satbir (1k points) | 8 views

0 votes

0 answers

MADE EASY 2020 CD
The number of tokens in the following C-code ________.

comment moved 2 days ago in Compiler Design by Satbir (1k points) | 64 views

0 votes

1 answer

Ace test series-LL1
Is there any difference between left factoring and left factored?? Why I am asking this is as per my knowledge LL1 grammar should be : No ambiguous, No left factoring, No left recursion but in Ace : option no ambiguous , no left recursion ,Left factored is right no ambiguous , no left recursion ,no Left factored is wrong

answer selected 2 days ago in Compiler Design by Satbir (1k points) | 10 views

0 votes

0 answers

Programming : Self doubt
1)void main(int n){ if(n==0) return; main(--n); printf("%d",n); //return n; this line maynot exists } 2)void main(int n){ if(n==0) return; main(n--); printf("%d",n); //return n; this line maynot exists } Suppose when $n=4$ Here, 2nd program will print infinite loop. right?? What 1st program will print 1,2,3 or 1,1,1. ??

edited 2 days ago in Programming by srestha (247 points) | 26 views

0 votes

0 answers

Gate overflow doubt made easy cache stalls
Suppose that in 500 memory references there are 50 misses in the first level cache and 20 misses in the second level cache.Assume miss penalty from the L2 cache to memory is 100 cycles.The hit time of L2 cache is 20 cycle.The ... cache is 10 cycles. If there are 2.5 memory references per instruction.How many average stall cycles per instructions are there? [closed]

closed 2 days ago in CO & Architecture by Ram Swaroop (171 points) | 5 views

0 votes

0 answers

Sorting algorithm
An unsorted array of n elements is given to you and you have to print largest 10% of them. This can be done on time O(1) O(n) O(logn) O(nlogn)

asked 2 days ago in Algorithms by sagar2405 (192 points) | 20 views

0 votes

0 answers

Why T=2*t-pd In the answer and total no: of gate is not odd also!

asked 2 days ago in Digital Logic by kalra05 (112 points) | 11 views

0 votes

0 answers

It is CFL or not
It is CFL or not $\{wa^n w^r |\ w\ \in (a+b)^*, n>=0 \}$

asked 2 days ago in Theory of Computation by Sandeep Verma (102 points) | 17 views

0 votes

0 answers

Should I cover HDL for gate exam?

asked 2 days ago in Digital Logic by Hyp209 (102 points) | 6 views

0 votes

0 answers

What is the difference between Computer organization and Computer Architecture?

asked 2 days ago in CO & Architecture by commenter commenter (126 points) | 4 views

0 votes

0 answers

f(m,n) { ans = 1; count = 0; while (ans <= m) { count = count + 1; ans = ans * n; } return(count) }

asked 2 days ago in Algorithms by Karlasravani (102 points) | 10 views