Recent questions tagged programming - GATE CSE Doubts

0 votes

1 answer

Made easy mcq practice book
In which of the following cases, linked list implementation of sparse matrices consumes the same memory space as the conventional way of storing the entire array? (Assume all data-types need the same amount of storage.) A. 5 x 6 matrix with 9 non-zero entries B. 5 ... with 8 non-zero entries C. 6 x 5 matrix with 8 non-zero entries D. 6 x 5 matrix with 9 non-zero entries

asked Nov 23 in Programming by Jyoti Kumari97 (18 points) | 23 views

0 votes

0 answers

self doubt in programming
Why this thing is true? Any logic to it? Or it has to be remembered only? *(A[0] + 0) = A[0][0]

asked Nov 18 in Programming by `JEET (164 points) | 11 views

0 votes

1 answer

Madeeasy Test Series programming
int print1(void) { static int x = 10; x += 5; return x; } int print2(void) { static int x; x = 10; x += 5; return x; } int main() { int x; x = print1(); x += print1(); x += print2(); x += print2(); printf("%d",x ... (), it will take x = 10, but it should take x = 15, as we know x is static variable ?? and static variable initialized only once in a program.

asked Nov 17 in Programming by MRINMOY_HALDER (37 points) | 19 views

0 votes

0 answers

pointer Assignment
#include<stdio.h> int main() { int a[5]={1,2,3,4,5}; int *ptr=(int*)(&a+1);//why typecasting has done here? printf("%d%d",*(a+1),*(ptr-1)); } output is 25.can someone explain this?

asked Nov 14 in Programming by Arun Rout (6 points) | 25 views

0 votes

0 answers

Programming doubt (GO site)
Write the condition , for which following program will print “Hello World” #include <stdio.h> int main() { if() { printf("Hello "); } else { printf("World\n"); } return 0; }

asked Nov 13 in Programming by srestha (558 points) | 19 views

0 votes

1 answer

uupcl 2014 question
Find the output for the given code #include int main() { char *ptr = 0; *ptr = 'A'; printf("value in pointer ptr is %c\n", *ptr); return 0; } 1) 65 2) compile time error 3) 0 4) Null pointer assignment

asked Nov 2 in Programming by Dharmendra Tiwari (10 points) | 16 views

0 votes

0 answers

TIme complexity Made easy
What is time complexity for this function?

asked Oct 17 in Algorithms by vupadhayayx86 (6 points) | 22 views

0 votes

1 answer

MADE EASY: C programming
Let X and Y denote the number of 0’s and 1’s printed by the above program. Then the value of 2X + Y will be equal to___________

asked Oct 14 in Programming by Debapaul (308 points) | 39 views

0 votes

0 answers

Self Doubt: Programming in C
#include <stdio.h> int main() { long int a = 0x7fffffff * 0x7fffffff; long int b = 0x7fffffff * 0x7fffffffl; printf("a = %ld, b = %ld\n", a, b); return 0; } What will be output if sizeof(int) is 4 and sizeof(long int) is 8. Having trouble with the hexadecimals. :o

asked Oct 12 in Programming by Sambhrant Maurya (289 points) | 11 views

0 votes

0 answers

programming question made easy 2020
Which of the following statements is correct? Void pointers can be used for de-referencing. Arithmetic operations can be applies on void pointers. The default value of extern class of storage is garbage. A particular extern variable can be declared many times, but ... D) , i wanna know if its right or not and if it is then could anyone explain me with an example.

asked Oct 11 in Programming by Priyansh Singh (122 points) | 12 views

0 votes

0 answers

Array increment decrement
Solution are

asked Oct 2 in Programming by amit166 (113 points) | 20 views

0 votes

0 answers

Made Easy Programming and DS test 1

asked Oct 1 in Programming by luc_Bloodstone (27 points) | 19 views

0 votes

0 answers

Array c question

asked Sep 26 in Programming by amit166 (113 points) | 16 views

0 votes

0 answers

Self doubt on ternary operator and expression evaluation

asked Sep 17 in Programming by Sukhbir Singh (8 points) | 14 views

0 votes

0 answers

Doubt regarding time complexity of Heap sort
for a max heapify algo, the space complexity should be O(logn+1)=O(logn) , as for eg in the posted fig in memory stack the max heapify will go for node 1 ,2,4,9 which is always one greater than height of tree

asked Sep 12 in Algorithms by PRANAVCOOL (6 points) | 6 views

0 votes

1 answer

Cisco sytem interview question
Can someone please expain the output of these two programs. #include <iostream> using namespace std; int main() { int x = 1, y = 1; y = ++ x + ++ y; cout << "x = " << x << endl; cout << "y = " < ... for Software Engineer / Developers x = x++ + ++y; y = ++x + ++y; what are the values of x,y after these are executed ?

asked Sep 11 in Programming by `JEET (164 points) | 19 views

0 votes

0 answers

Sequence Points and Side Effects in C-Programming
There was a question asked in gate 2013 I am adding the link here https://gateoverflow.in/60/gate2013-42 there are these concepts called sequence point and side effects so, can anyone please explain these concepts in more detail as I am ... discussed in Dennis Ritchie's C but due to very little explanation I didn't get it at all. Thanks in advance.

asked Sep 7 in Programming by setu bhaskar (7 points) | 14 views

0 votes

3 answers

#ProgrammingInC Tell Output of following question. Self Doubt.

asked Sep 2 in Programming by iarnav (76 points) | 27 views

0 votes

2 answers

Self Doubt in pointer
Suppose, we are subtracting two pointers value(like, p1-p2) and printing it “%d” format. Do we get only number of elements between that two pointers?? Suppose we want to subtract two addresses. Does below line gives the difference between addresses between them?? printf("%p",(p1-p2)); or printf("%x",(p1-p2));

asked Sep 2 in Programming by srestha (558 points) | 18 views

0 votes

0 answers

Self Doubt on GATE question Program
https://gateoverflow.in/302795/gate2019-53 what *(b-i) means?? How it will be 10,8,6,4 like this?? i value is decreasing by 0,1,2 like this Then how it is subtracted from an address b and getting a value?? Suppose, every integer is 4 byte and address of ... $1012??i.e. 8$

asked Sep 1 in Programming by srestha (558 points) | 33 views

0 votes

1 answer

Self Doubt on Programming
Suppose we are passing the address of an array as a parameter Then can we get different result for call by reference, call by name and call by value result?

asked Aug 31 in DS by srestha (558 points) | 19 views

0 votes

0 answers

Self Doubt: Why both Program giving different output?

asked Aug 30 in Programming by srestha (558 points) | 28 views

0 votes

0 answers

Self Doubt on Array
Suppose, there is an unsorted array and we want insert an element $x$ after element $y$ in array. What will be T.C. for it?? See I know it needs time to search the element in $O\left ( n \right )$ time and then Shift every element to make a space for it. But ... $O\left ( n \right )\times O\left ( n \right )$?? Can someone plz clarify it with an algorithm.

asked Aug 30 in Programming by srestha (558 points) | 8 views

0 votes

0 answers

Loop Invariant : Doubt
What is loop invariant exactly check?? I know definition, but while saw this question (https://gateoverflow.in/39578/gate2016-2-35), I checked, here option B) and option C) , both are correct. But, answer is C). Is it because, in option C ... before loop condition and right side of equal to operator checks after loop condition?? But in option B) such thing is not happening??

asked Aug 30 in Programming by srestha (558 points) | 9 views

0 votes

0 answers

Allen Career Institute:Programming Test
#include <stdio.h> void fun(int *p){ if(*p=='\0'){ return 0; } printf("%d",*p); fun(p++); } int main(void) { int a[]={10,20,30,40,50,'\0'}; fun(a); return 0; } Answer given that it will go for infinite loop. Will that mean it will stack overflow?? but why will it give stack overflow

asked Aug 28 in Programming by srestha (558 points) | 31 views

0 votes

0 answers

Made easy programming on while loop
#include<stdio.h> int main () { while(!printf("hello world" )); return0; } Please explain what happen under while condition and why it print hello world

asked Aug 28 in Programming by Praful jha (10 points) | 21 views

0 votes

1 answer

made easy book programming question on for loop
#include<stdio.h> void main() { int i; for(i=0;i<=2;i++) { int i=8; printf("%d",i); } printf("%d",i); } output is 8883 please explain why 3 times 8 and why not onetime 8 than3

asked Aug 28 in Programming by Praful jha (10 points) | 18 views

0 votes

1 answer

self-doubt-code is compiler dependent or not?
https://onlinegdb.com/BkR4b1QBS the output is comiper dependent right? because of this line:the highlited part? for(i=0,printf("%d ",i);i<4;i++,printf("%d\n ",i)) 1st case : the statement is braketised using (i++) ... the entire line (i++),printf("%d\n ",i); is evaluated and hence printf printed the previous value of i.

asked Aug 27 in Programming by Doraemon (89 points) | 26 views

0 votes

0 answers

Doubt on GATE question
Check this GATE question (https://gateoverflow.in/8428/gate2015-3-25) In calculation of total degree, why there is a ‘-1’ Total degree =200+3x+2y−1 Is it for root node?? But root node already included in 2y right??

asked Aug 24 in Programming by srestha (558 points) | 18 views

0 votes

2 answers

Self doubt on GATE Question
Plz check this code int height(treeptr n) { if(n == NULL) return -1;// here we are checking, if tree has no node if(n -> left == NULL)//if n is not NULL, then if left-subtree containing no nodes if(n -> right = ... this GATE question D) more appropriate answer??(https://gateoverflow.in/2163/gate2012-47) Plz. check my analysis in everyline, is there anything wrong??

asked Aug 24 in Programming by srestha (558 points) | 46 views

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

asked Aug 23 in Programming by srestha (558 points) | 38 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?

asked Aug 23 in Programming by srestha (558 points) | 40 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??

asked Aug 23 in Programming by srestha (558 points) | 14 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 Aug 21 in Algorithms by sagar2405 (87 points) | 26 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. ??

asked Aug 20 in Programming by srestha (558 points) | 37 views

0 votes

1 answer

Made easy Algorithm
Which of the following procedure is suitable for finding the longest path from given vertex to any other vertex in a directed acyclic graph(weighted) with few negative weight edge. Divide and conquer Greedy algorithm Dynamic programming All of the above

asked Aug 20 in Algorithms by sagar2405 (87 points) | 17 views

0 votes

1 answer

predict the output
#include <stdio.h> int fun(char *str1) { char *str2 = str1; while(*++str1); return (str1-str2); } int main() { char *str = "altamash"; printf("%d", fun(str)); return 0; } (a) 10 (b) 9 (c) 8 (d) Random Number

asked Aug 20 in Programming by altamash (43 points) | 21 views

0 votes

0 answers

Virtual Gate :Programming question
Assume that there are two lower triangular matrices $A$ and $B$ of size $n*n$. If matrix $A$ and transpose of $B$ are fit into a rectangular matrix $C$ of size $n*(n+1)$, then $B[i,j]=C[i,j+1]$ $B[i,j]=C[j+1,i]$ ... $1$ position in new matrix. right?? So, Ans $2)$ right??

asked Aug 20 in Programming by srestha (558 points) | 14 views

0 votes

0 answers

Made easy test series - Algorithm
How to do find 0/1 knapsack in minimum time?

asked Aug 19 in Algorithms by sagar2405 (87 points) | 20 views

0 votes

1 answer

Programming:Self Doubt
Plz. tell me , why this program will give infinite looping , when we r calling bar(3)?? int bar(int val) { int x = 0; while(val > 0) { x= x + bar(val-1); } return val; } Here, x=0+bar(3)+bar(2)+bar(1), then will it not terminate??

asked Aug 19 in Programming by srestha (558 points) | 55 views

Page:

2,313 questions

1,294 answers

6,587 comments

89,719 users