Recent questions and answers in Programming - GATE CSE Doubts

0 votes

2 answers

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

answered 2 days ago in Programming by shashin (1.2k points) | 31 views

0 votes

0 answers

Ace test series : Programming and Data Structure

asked 3 days ago in Programming by Chirag Shilwant (150 points) | 9 views

0 votes

0 answers

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

asked 5 days ago in Programming by Debapaul (615 points) | 15 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 5 days ago in Programming by Shubhranshu Maurya (8 points) | 6 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 6 days ago in Programming by shashin (1.2k points) | 15 views

+1 vote

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 6 days ago in Programming by shashin (1.2k points) | 108 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 (615 points) | 15 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 (50 points) | 24 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 (363 points) | 26 views

0 votes

0 answers

Made easy test series : Time complexity

asked Jan 6 in Programming by Chirag Shilwant (150 points) | 64 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 (27 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) (634 points) | 27 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) (634 points) | 22 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 (615 points) | 19 views

0 votes

0 answers

Full length test -2 ME

asked Jan 3 in Programming by Brij gopal Dixit (34 points) | 19 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 (615 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 (335 points) | 6 views

0 votes

0 answers

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

asked Jan 2 in Programming by Debapaul (615 points) | 12 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 (117 points) | 22 views

0 votes

0 answers

Handwritten notes from book
Caption

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

0 votes

0 answers

MADEEasy FLT 5 Advance PL
Can anyone help me out to solve this question?

asked Dec 29, 2019 in Programming by zohancs (11 points) | 21 views

0 votes

1 answer

Self doubt-ARRAY
$\text{Consider a lower triangular matrix}$ $a[25….200,25….200]$ $Find\ loc[190][150]=?$ $\text{Using Column major order.}$

answered Dec 29, 2019 in Programming by Kushagra गुप्ता (175 points) | 47 views

0 votes

0 answers

ACE MOCK TEST 2 Q62
What will be the output ?

asked Dec 27, 2019 in Programming by ssap09 (42 points) | 30 views

0 votes

0 answers

ISRO 2014 Computer Science
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is 1111 and the elements of the queue are q[0],q[1], q[10]q[0],q[1], q[10]. The front and rear pointers are initialized ... ICRB says q[1] (even after verification of their keys for this question explicitly) ???????? Anyone Please help me with this

asked Dec 27, 2019 in Programming by dr_Jackal (14 points) | 9 views

0 votes

0 answers

Gatebook test series
#include <stdio.h> int main() { unsigned char arr[2] = {0x01, 0x00}; unsigned short int x = *(unsigned short int *) arr; printf("%d", x); getchar(); return 0; } Output on little endian and big endian respectively? A. 1, 1 B, 256, 1 C. 1, 256 D. None of above

asked Dec 25, 2019 in Programming by neeraj_bhatt (235 points) | 29 views

0 votes

1 answer

ProgrammingLanguageC
#include <stdio.h> int main(void) { void fun(); fun(); fun(); } void fun(){ static int i = 1; auto int j = 5 ; printf("%d",i++); printf("%d",j++); } What will be the output of the code

answered Dec 25, 2019 in Programming by pranay562 (912 points) | 35 views

+1 vote

0 answers

Why this code is printing "0"? #ACE_TEST_Series.
#include <stdio.h> int main() { static int x = 1; if (x--) main(); else printf("%d", x+1); return 0; } 1 0 run time error None of these.

asked Dec 23, 2019 in Programming by `JEET (178 points) | 30 views

0 votes

0 answers

Circular Queue. Please help me understand this,
A circular queue of characters is implemented using a linear array [1...6]. The array currently contains [x,y,-,-,a,b], if one added and one deleted, what would be the position of rear and front pointers? (A) 6,3 (B) 2, 3 (c) 3, 2 (D) 3, 6 I am getting different answers from the options.

asked Dec 23, 2019 in Programming by `JEET (178 points) | 20 views

0 votes

0 answers

Why it is printing 10? According to me the value of "i" should have changed.

asked Dec 23, 2019 in Programming by `JEET (178 points) | 26 views

0 votes

0 answers

Ace academy test. The question looks wrong to me as "rem" is not initialized with 0.

asked Dec 23, 2019 in Programming by `JEET (178 points) | 28 views

0 votes

1 answer

11. Ace Academy Booklet, Array
A $\textbf{square band matrix}\;\mathrm{D_{n,a}}$ is an $\mathrm{n\times n}$ matrix in which all the non-zero terms lie in a band centred around the main diagonal. The band includes the main diagonal and $\mathrm{a-1}$ diagonal below and above the main diagonal. The number of elements in hte band $\mathbf{D_{1000,101}}$_______________.

answered Dec 22, 2019 in Programming by Vimal Patel (817 points) | 11 views

0 votes

0 answers

10. Ace Academy Booklet
An $\mathbf{n\times n}$ matrix $\mathbf{T}$ is a $\textbf{Toeplitz matrix}$ iff $\text{T(i,j) = T(i-1,j-1)}$ for all $\mathrm i$ and $\mathrm j$, $\mathrm{i >1}$ and $\mathrm{j>1}$. If the $\textbf{TOEPLITZ}$ matrix of order $(5,5)$ is stored in one dimensional array, then optimum number of elements stored is ____________________.

asked Dec 22, 2019 in Programming by `JEET (178 points) | 11 views

0 votes

0 answers

12. Array Ace Academy Booklet
Store only the lower diagonal of $\textbf{Symmetric Square Band Matrix}\;\mathrm{ N\times N}$ in the style of diagonal by diagonal, starting from the lowest diagonal, including main diagonal then calculate the retriveing formula (Assume that ... to solve these questions through a proper procedure which I don't know but looking to learn from the community. Thanks.

asked Dec 22, 2019 in Programming by `JEET (178 points) | 19 views

0 votes

0 answers

ACE-Programming test
int DO(struct Node *root){ int res=0; if(root==NULL) return 0; if((root->left==NULL && root->right!=NULL)||(root->left!=NULL&&root->right==NULL)) res++; res+=(DO(root->left)+DO(root->right)); return res; } What does DO() return?

asked Dec 21, 2019 in Programming by srestha (636 points) | 13 views

0 votes

0 answers

ACE-Programming
void main(){ int const *p=5 printf("%d",++(*p)); } Will this program give runtime error or compile time error?Plz explain , how do we know which one will give compile time error and which one runtime error?

asked Dec 21, 2019 in Programming by srestha (636 points) | 14 views

0 votes

0 answers

Ace academy booklet prefix from infix
The $\mathbf{prefix}$ expression for the $\mathbf{infix}$ expression. $\color{darkblue}{\text{a=-b+c*d/e+f^g^h-i*j}}$ My work: I am trying to solve this but all the options that were given, none start with $\mathbf{“a”}$. But I think $\mathbf{“a”}$ should come in the beginning. Can anyone please help me out in this?

asked Dec 19, 2019 in Programming by `JEET (178 points) | 10 views

0 votes

1 answer

Hashing #Ace_Academy_Booklet
Identify valid hash function for storing in the address range $\mathbf{1}$ to $\mathbf{1000}$ $\mathbf{h(x) = x \;mod\;1000}$ $\mathbf{(x+1)\;mod\;1000}$ $\mathbf{h(x) = x \;mod\;(1000+1)}$ $\mathbf{h(x) = (x \;mod\;1000)+1}$ My Work: According to me answer is $\mathbf{1}$ but the given answer is $\mathbf{4}$

answered Dec 19, 2019 in Programming by शिवम जुयाल (195 points) | 16 views

0 votes

0 answers

Self doubt: Programming basic
If we give & in scanf, it will read input given, like this scanf("%d",&x); Now, if we not give & in scanf,then what will it do,? Will it give error?, like this scanf("%d",x);

asked Dec 18, 2019 in Programming by srestha (636 points) | 21 views

0 votes

0 answers

ACE Test Programming
int foo(char *s, int x) { int i=0; if(x==0) return 1; for(i=0;i<strlen(s);i++) { x=x+i; if(x%2)continue; x=foo(s+1,x-1); } return x; } What will be output of foo(“gate”,2)??

asked Dec 17, 2019 in Programming by srestha (636 points) | 14 views

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

Recent questions and answers in Programming

3,008 questions

1,516 answers

8,989 comments

89,815 users