Recent questions and answers in Programming - GATE CSE Doubts

0 votes

0 answers

#self Doubts Cprogramming

asked 3 days ago in Programming by shubham02 (15 points) | 6 views

0 votes

1 answer

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 6 days ago in Programming by mario9876 (17 points) | 9 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) | 46 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) | 38 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 (698 points) | 31 views

0 votes

0 answers

GATE GURU: Pointers

asked Feb 1 in Programming by Debapaul (698 points) | 29 views

0 votes

0 answers

GATE FORUM: HUFFMAN CODING

asked Jan 31 in Programming by Debapaul (698 points) | 16 views

0 votes

0 answers

GATE GURU: STRUCTURES

asked Jan 30 in Programming by Debapaul (698 points) | 20 views

0 votes

0 answers

Self Doubt: Recurrence

asked Jan 29 in Programming by Debapaul (698 points) | 39 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) | 32 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 (679 points) | 25 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) | 28 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 (803 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) | 27 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) | 34 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 (698 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) | 9 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 (698 points) | 18 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) | 7 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) | 21 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) | 116 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 (698 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 (375 points) | 28 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 (40 points) | 8 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) | 28 views

0 votes

1 answer

Self Doubt:Algorithm Time complexity
$If$ $t1(n) = Ο(f(n)),$ $t2(n)= Ο(g(n)).$ $Then$ $t1(n).t2(n)= O(f(n)*g(n))$ $Is$ $the$ $above$ $statement$ $always$ $TRUE?$

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

0 votes

0 answers

GATE GURU: ALGO
Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so your aim is to watch as many complete matches ... right? Ans should be $O(nlogn)$ right as we first need to sort the finishing time? But the ans given is $O(n)$

asked Jan 3 in Programming by Debapaul (698 points) | 20 views

0 votes

0 answers

Full length test -2 ME

asked Jan 3 in Programming by Brij gopal Dixit (34 points) | 20 views

0 votes

0 answers

MADE EASY: CALL BY NAME
Please provide a proper explanation and how call by name works

asked Jan 2 in Programming by Debapaul (698 points) | 4 views

0 votes

0 answers

Made Easy FLT Basic 1
Consider a square matrix of $N * N$ in which the values are stored from $A[1,1]$ to $A[n,n]$. For all $i,j$, $A[i,j] = A[i-1,j-1]$, where $i>1$ and $j>1$. In order to reduce space complexity, we avoid redundant storage. All the elements of the above square matrix are ... X; What is the correct expression for $X$? $B[N+i-j-1]$ $B[2N+i-j-1]$ $B[2N+j-i-1]$ $B[N+j-i-1]$

asked Jan 2 in Programming by Sambhrant Maurya (396 points) | 6 views

0 votes

0 answers

MADE EASY : ALGORITHMS
What does $shift$ $down$ $function$ mean?

asked Jan 2 in Programming by Debapaul (698 points) | 13 views

0 votes

0 answers

Made easy test series programming self doubt
here the function calling will be 2 times or 3 and even i am not getting why void fun is written inside main can we write like this made-easy-test-series [closed]

asked Jan 1 in Programming by akku_126 (6 points) | 17 views

0 votes

0 answers

Applied course test series: Programming
int main() { char *a="appliedcourse.com"; char *b; b= (char *)malloc(80); memset(b,0,80); while(*b++ = *a++); printf("%s",b); return 0; } My doubt for above program is that ,why it giving empty string as output?

asked Jan 1 in Programming by vishal burnwal (135 points) | 25 views

0 votes

0 answers

Handwritten notes from book
Caption

asked Dec 30, 2019 in Programming by rgupta410 (6 points) | 12 views

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

Recent questions and answers in Programming

3,331 questions

1,581 answers

10,281 comments

89,916 users