Recent questions and answers in Programming - GATE CSE Doubts

0 votes

0 answers

Linked list self doubt

asked 23 hours ago in Programming by Rajeevkr (12 points) | 8 views

0 votes

1 answer

Programming Doubt on C
#include<stdio.h> int x=14; int fun(){ return x--; } int main(){ int sum=0; for(fun();--x;fun()) sum=sum+fun(); printf("%d",sum); return 0; } What will be the output? See , inside for loop , at the time of initialization ... get some sequence point. right? Where will ${\color{Green} {fun()}}$ it get sequence point? Will in this iteration value of sum be 9?

answered 5 days ago in Programming by !KARAN (351 points) | 22 views

0 votes

0 answers

techtud.com c & data structure quiz 2020
G is a graph on n vertices and 2n−2 edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for G? (A)For every subset of k vertices, the induced subgraph has at most ... edge-disjoint paths between every pair of vertices. (D)There are at least 2 vertex-disjoint paths between every pair of vertices.

asked Mar 30 in Programming by Sapan Jain 1 (6 points) | 5 views

0 votes

0 answers

Hashing, Data structure
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving collisions by linear probing is (assume uniform hashing). (A) 2/3 (B) 1/3 (C) 1 (D) 1/6 SOURCE https://gateoverflow.in/168123/data-structure Couldn’t understand the solution given.

asked Mar 27 in Programming by Harshitkmr (10 points) | 4 views

0 votes

0 answers

GATE1987-7a explanation
List the invariant assertions at points $A, B, C,D,$ and $E$ in program given below: Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quotient:integer begin (*(dividend >= 0) AND (divisor > 0)* ... E*) end https://gateoverflow.in/82425/gate1987-7a?show=316413#a316413 Can someone elaborate the answer given by Arjun sir in the above link?

asked Mar 25 in Programming by GATE_aspirant_2021 (7 points) | 5 views

0 votes

1 answer

CIL MT Exam Binay Tree
The following is the sequence of insertion in a binary tree. 45,65,35,40,33,70,60,75,69 How many numbers of nodes in Left Sub Tree (LST) and Right Sub Tree (RST) of Root node. Ans A. LST – 5, RST-3 B. LST – 6, RST-2 C. LST – 2, RST-6 D. LST – 3, RST-5 they have not mentioned BST then how we can get option D

answered Mar 8 in Programming by rjking7403 (27 points) | 37 views

0 votes

2 answers

https://gateoverflow.in/118319/gate2017-1-36
Consider the following code: int bar(int val) { int x=0; while(val>0){ x=x+bar(val-1); } return val; } Where does the difference in the functioning of the code occur when the statement x=x+bar(val-1); in the above code gets replaced by x=x+bar(--val); Please explain the difference between both of them and the way the logic works.

answered Mar 5 in Programming by smsubham (64 points) | 20 views

0 votes

0 answers

coal india 2020: Hashing
In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique – I. Buckets (for contiguous storage) II. Chains (for linked storage) A. Only I B. Only II C. I and II D. None i think Buckets for continuous storage is like arrays so it will use linear probing (open addressing) chains – uses closed addressing.

asked Mar 5 in Programming by rjking7403 (27 points) | 20 views

+1 vote

1 answer

A Question on C-Programming Pointers (Geeks For Geeks)

answered Mar 4 in Programming by Kushagra गुप्ता (297 points) | 15 views

0 votes

1 answer

Self Doubt C Programming
The site is saying, The output will be :- K 75 0.000000 how?

answered Mar 2 in Programming by Kushagra गुप्ता (297 points) | 20 views

0 votes

0 answers

#self Doubts Cprogramming

asked Feb 21 in Programming by shubham02 (20 points) | 13 views

0 votes

0 answers

GATE 2020 CSE paper
If we insert n^2 element to already avl tree of size n then what is its Time Complexity? Theta(n^2) Theta(n^2logn)

asked Feb 9 in Programming by PRG1499 (6 points) | 48 views

0 votes

0 answers

Made easy Mock test
can someone please explain the solution? answer is 26.

asked Feb 5 in Programming by nidhi1604 (7 points) | 43 views

0 votes

0 answers

SELF DOUBT:LINK LiST
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) $O(n)$ and $O(nlogn)$ b) $O(n)$ and $O(n)$ c) $O(nlogn)$ and $O(nlogn)$ d) $O(nlogn)$ and $O(n)$

asked Feb 2 in Programming by Debapaul (699 points) | 33 views

0 votes

0 answers

GATE GURU: Pointers

asked Feb 1 in Programming by Debapaul (699 points) | 35 views

0 votes

0 answers

GATE FORUM: HUFFMAN CODING

asked Jan 31 in Programming by Debapaul (699 points) | 17 views

0 votes

0 answers

GATE GURU: STRUCTURES

asked Jan 30 in Programming by Debapaul (699 points) | 24 views

0 votes

0 answers

Self Doubt: Recurrence

asked Jan 29 in Programming by Debapaul (699 points) | 40 views

0 votes

0 answers

Data Structure can someone tell what is converse and inverse order of pre ,post , inorder travsersal of tree

asked Jan 29 in Programming by Harsh1198 (6 points) | 10 views

0 votes

0 answers

Applied course test series : Pointers
#include <stdio.h> int main() { char str[]="APPLIED"; const char *ptr; ptr=str; ptr++; printf("%s",--ptr); return 0; } In this question my doubt is that since pointer is a constant pointer then why ‘ptr++’ is not giving error?

asked Jan 28 in Programming by vishal burnwal (135 points) | 34 views

0 votes

0 answers

ACE Test FLT-program
What is difference between this program and GATE2019 question(link given below)? In this test question, it is taking value by address, so that is the reason to not returning value to the main? But here https://gateoverflow.in/302830/gate2019-18 just local variable returning the value, Sothe value is intact in main() program too?

asked Jan 28 in Programming by srestha (683 points) | 26 views

0 votes

1 answer

ACE Full length Mock test 11
Please explain the solution along with the concept.

answered Jan 25 in Programming by shashin (1.9k points) | 32 views

0 votes

0 answers

Binary Search Tree
Consider the following set of keys : [K,L,C,R,B,E,L,A,D]. In how many different order these keys can be inserted into BST such that the resultant tree looks like the below given tree:

asked Jan 25 in Programming by zoboknows (6 points) | 32 views

0 votes

0 answers

FULL SYLLABUS TEST-6 (ADVANCE LEVEL) GATE 2020 question 61

asked Jan 25 in Programming by Pratyush Priyam Kuan (804 points) | 25 views

0 votes

0 answers

Finding subarray with k sum
#include<bits/stdc++.h> using namespace std; bool subArrayExist(int a[],int n); int main() { int n; // Size of array cin>>n; int a[n]; for(int i=0;i<n;i++) cin>>a[i]; int k; cin>>k; bool check=subArrayExist(a,n); ... map[sum]==true) return true; map[sum]=true; } return false; } Where I am going wrong ? Please tell me , It will be very helpful.

asked Jan 25 in Programming by ujjwalgupta (6 points) | 8 views

0 votes

0 answers

Made easy test series : C programming
Consider the following program: Which of the following statement is true? I. It results 9 II. Runtime error III. Compilation error Assume all the header files and function definition correctly done. How to identify which error will be generated?

asked Jan 23 in Programming by vishal burnwal (135 points) | 31 views

+1 vote

1 answer

GATE GURU: SPANNING TREE
How to solve this question quickly? Is there any algorithm? I am able to solve it by trying out all the combinations and it has taken me nearly $5+$ $mins$ Any way to solve this quickly. A complete graph can have $n^{n-2}$ spanning trees, and since this graph is nearly complete except one edge can we derive some $shortcut$ from this fact?

answered Jan 22 in Programming by Deepakk Poonia (Dee) (681 points) | 35 views

0 votes

0 answers

MADE EASY MOCK
Isnt number of bits passed is $4$, say when $i=5$ we will pass $0101$ right? and in case of $2$ we will pass $0010$ right?

asked Jan 21 in Programming by Debapaul (699 points) | 20 views

0 votes

2 answers

Made easy FLT 2020
Answer should be O(n^2) …. but they have given it as O(n^3).

answered Jan 17 in Programming by shashin (1.9k points) | 39 views

0 votes

0 answers

Ace test series : Programming and Data Structure

asked Jan 15 in Programming by Chirag Shilwant (180 points) | 11 views

0 votes

0 answers

MADE EASY ADVANCE: DSA
HOW TO APPROACH IN A LESS TIME CONSUMING WAY?

asked Jan 14 in Programming by Debapaul (699 points) | 19 views

0 votes

0 answers

Graph Theory ( Discrete mathematics )
Do minimum degree of a vertex and minimum degree of a region mean same thing in Graph Theory?

asked Jan 14 in Programming by Shubhranshu Maurya (8 points) | 10 views

0 votes

1 answer

gate applied course
in solution they used shortcircuiting but precedence of bracket is highest so shouldn’t it be evaluated first?

answered Jan 12 in Programming by shashin (1.9k points) | 24 views

+2 votes

2 answers

MADE EASY FLT ADVANCE
What is the time complexity? $\theta(n^2)$ $\theta(nlogn)$ $\theta(n)$ $\theta(n^2logn)$ Shouldn’t the ans be $\theta(nlogn)$ as the recurence is nothing but $T(n)=T(n-1)+f(n)$ and f(n) is $\theta(logn)$ right? so $\theta(n*f(n))$ $\theta(nlogn)$

answered Jan 12 in Programming by shashin (1.9k points) | 122 views

0 votes

0 answers

Self Doubt: Row major and Column Major
Say we have a matrix $ A[d1][d2][d3]$ and we need to find the address of $A[x][y][z]$ and the indexing starts from $0$, then is this formulas correct? $Row-major=base+(x*d2*d3+y*d3+z)*size$ $of$ $byte$ ... ? I saw in Made Easy that column major is given as $Column-major=base+(z*d2*d3+y*d2+x)*size$ $of$ $byte$ Which one is right?

asked Jan 11 in Programming by Debapaul (699 points) | 16 views

0 votes

0 answers

made-easy advance test 8
#include <stdio.h> int fun(int,int); typedef int (*pf) (int ,int); int proc (pf, int , int); int main(){ printf(“%d\n”,proc(fun,6,6)); return 0;} int fun(int a,int b){ return (a==b); } int proc(pf P,int a,int b){ return ((*P)(a,b)); } output of program is?

asked Jan 10 in Programming by abhinav649 (67 points) | 26 views

0 votes

1 answer

Ace test series: C output
What is the output? Any reference for these kind of argument passing.

answered Jan 7 in Programming by goxul (377 points) | 29 views

0 votes

0 answers

Made easy test series : Time complexity

asked Jan 6 in Programming by Chirag Shilwant (180 points) | 68 views

0 votes

0 answers

SELF DOUBT ON STORAGE CLASS
WHICH IS THE DEFAULT STORAGE CLASS OF GLOBAL VARIABLE? EXTERN OR STATIC ……..

asked Jan 6 in Programming by eyeamgj (41 points) | 9 views

0 votes

1 answer

Self doubt: Binary trees
A $Full$ Binary Tree can be constructed from $preorder$ and $postorder$ . Now $perfect$ binary trees are also full binary trees.. So does this mean that Perfect Binary trees can also be constructed from $preorder$ and $postorder?$

answered Jan 4 in Programming by Deepakk Poonia (Dee) (681 points) | 29 views

To see more, click for all the questions in this category.

Recent questions and answers in Programming

3,525 questions

1,658 answers

10,465 comments

90,046 users