Recent questions and answers in Programming

0 votes

2 answers

ACE academy digital logic test series 2020
To design “31” i/p NOR gates , minimum number of 2 i/p NOR gates required is ______ ?

answered 2 days ago in Programming by Priyansh Singh (41 points) | 50 views

0 votes

0 answers

#ProgrammingDoubt
Why f1() prints 15 15 , whereas f2() prints 15 20 , what is the differe void f2(){ static int i = 10 ; i = i+5; printf(“%d” , i ); } void f1(){ static int i ; i = 10 ; i = i+5 ; printf("%d" , i) ; } void main() { f1(); f1(); }

asked 5 days ago in Programming by anurag sharma (10 points) | 11 views

0 votes

1 answer

#c #Self doubt,
#include <stdio.h> int main() { int a=10,b=5; a=a + ++a + --a; //line 2 printf("%d",a); return 0; } ///can anyone explain the execution flow in line 2 ?

answered 6 days ago in Programming by Mk Utkarsh (153 points) | 20 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___________

answered 6 days ago in Programming by Priyansh Singh (41 points) | 34 views

0 votes

1 answer

#Cprog #mock_test
What will be the output of following program? #include "stdio.h" int main() { char a[] = { 'P', 'Q', 'R', 'S' }; char* p = &a[0]; *p++; printf("%c %c ", *++p, --*p); } RP b. QR c. PR d.RQ

answered 6 days ago in Programming by GAITONDE (1.2k points) | 18 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 (271 points) | 9 views

0 votes

0 answers

# GATE 2006-57 # Pointer
Consider this C code to swap two integers and these five statements: the code void swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; } S1: will generate a compilation error S2: may generate a ... valid input pointers S5: may add or subtract integers and pointers S1 S2 and S3 S2 and S4 S2 and S5 plz give one example of segmntation error.

asked Oct 11 in Programming by Deepak Kumar 12 (55 points) | 10 views

0 votes

0 answers

programming test series question made easy
[closed]

asked Oct 11 in Programming by Priyansh Singh (41 points) | 22 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 (41 points) | 10 views

0 votes

1 answer

MadeEasy CSE Class Test
Which of the following is not true about linked list implementation of queue? (A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end. (B) In push operation, if new nodes are ... end, then in pop operation, nodes must be removed from the beginning. (C) Both of the above (D) None of the above

answered Oct 8 in Programming by Priyansh Singh (41 points) | 12 views

0 votes

1 answer

different ways of evaluation of i-i++
Can anyone explain what are the different value i can get when the expression is evaluated? i=i++;

answered Oct 8 in Programming by !KARAN (118 points) | 12 views

0 votes

0 answers

how printf(“%d”,’A’) work internally?
Can someone explain to me how printf(“%d”,’A’); would work internally? I mean how is the integer value of A given?

asked Oct 6 in Programming by Doraemon (69 points) | 12 views

0 votes

0 answers

SELF DOUBT-C PROGRAMMING-UNSIGNED NUMBERS
Suppose we have a code like this #include <stdio.h> #include <stdlib.h> int main() { unsigned char a=4; unsigned char b=128; unsigned short int c; c=a*b; printf("%hu",c); return 0; } the output it is giving is ... byte (which is the lower byte (00000000).)will be assigned to c which is an signed int right? what concept am I missing?

asked Oct 6 in Programming by Doraemon (69 points) | 15 views

0 votes

0 answers

Array increment decrement
Solution are [closed]

asked Oct 2 in Programming by amit166 (9 points) | 17 views

0 votes

0 answers

Made Easy Programming and DS test 1

asked Oct 1 in Programming by luc_Bloodstone (11 points) | 15 views

0 votes

1 answer

Increment decrement
[closed]

answered Sep 27 in Programming by Rudr Pawan (577 points) | 14 views

0 votes

0 answers

Array c question
[closed]

asked Sep 26 in Programming by amit166 (9 points) | 13 views

0 votes

1 answer

made easy test series__
Consider the following program. int find(int n) { int a=1; for(int i=1; i<=n; i++) for(int j=1; j<=i; j++) for(int k=1; k<=j; k++) a=a+1; return a; } the value returned by find(9) is ______?

answered Sep 24 in Programming by Sathuri Bharath (34 points) | 19 views

0 votes

0 answers

Made Easy Test Series (Programming).
Consider a two-dimensional array with the elements stored in the form of lower triangular matrix, The elements must be crossed to read A[4,2] from the array A[-6,…..,+8,-6,…..,+8] whose base address 1000 is _________ ? (Assume elements are stored in Row Major Order).

asked Sep 23 in Programming by Priyansh Singh (41 points) | 23 views

0 votes

1 answer

GATE 2009-39 (Re-visited Regarding a doubt)
Say we have an array like this→ [2,4,1,19,6,18,20,5] Here the $(n/4)th$ smallest element is → 2nd smallest element since the array size is 8. In this array the second smallest element is $2$ Now if we divide it according to the pivot we have a recurrence ... T(n)=T(n-1) + O(1) + O(n) So isn't this the worst case where the complexity is $O(n^2)$ ?

answered Sep 19 in Programming by Bikram (1.2k points) | 29 views

0 votes

0 answers

Data structures,recursion
Fib(n)=fib(n-1)+fib(n-2);if n>1 Fib(n)=1;If n=1 Fib(n)=0;If n=0 1) The value of Fibonacci(7)? 2) The no.of calls in Fibonacci(8)?

asked Sep 19 in Programming by Saikiran22 (8 points) | 8 views

0 votes

2 answers

Self Doubt: DSA CLRS
Assume an array A[1...n] has n elements, and there is NO constraint such that every element must be less than n. What is the time complexity to find the majority element?

answered Sep 18 in Programming by Bikram (1.2k points) | 13 views

0 votes

0 answers

book YASWANK KANETKAR
HOW ++A *++A IS EVALUATED FOR ANY INTEGER VALUE OF A. EX.- IF A=2 THEN I GOT 16 AND IF A=3 THEN I GOT VALUE 25. BUT HOW?? PLZ HELP

asked Sep 18 in Programming by sandmuk754 (6 points) | 48 views

0 votes

0 answers

Self doubt on ternary operator and expression evaluation [closed]

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

0 votes

1 answer

MADE EASY DSA 2019
#include<stdio.h> int main() { int p=-1,q=-1,r=-1,s,t; s= ++p && ++q || r++; t= q + p + s++; printf("%d %d",s,t); return 0; } What is the o/p of the program and why?

answered Sep 16 in Programming by Shaik Masthan (227 points) | 20 views

0 votes

1 answer

How to tackle this problem?

answered Sep 16 in Programming by Satbir (2.5k points) | 10 views

0 votes

0 answers

MADE EASY DSA
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B]. I am getting 80039 as ANS. but the ans given is 23699. Which is correct and why?

asked Sep 16 in Programming by GAITONDE (1.2k points) | 7 views

0 votes

0 answers

MADE EASY DSA TOPIC TEST
What is the output of this program?

asked Sep 16 in Programming by GAITONDE (1.2k points) | 11 views

+2 votes

1 answer

gatebook_practices
What is the time complexity to find k th smallest element in a Maxheap with n nodes? (A) O(kLogn) (B) O(n’2 ) (C) O(nlogn) (C) O(Logn) (D) O(n) (E) O(1

answered Sep 15 in Programming by Debapaul (123 points) | 34 views

0 votes

1 answer

Self Doubt - Can a Binary tree be full and complete and the same time?

answered Sep 13 in Programming by Deepak Kumar 12 (55 points) | 14 views

0 votes

1 answer

Made Easy Subject Test- Programming and ds

answered Sep 11 in Programming by Deepak Kumar 12 (55 points) | 131 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 ?

answered Sep 11 in Programming by Vimal Patel (221 points) | 15 views

0 votes

0 answers

Hacker-Rank Problem
https://www.hackerrank.com/challenges/the-birthday-bar/problem how to approach it if it was given that the segments MAY NOT BE CONTIGUOUS?? PS→ my preferred language is c++

asked Sep 8 in Programming by GAITONDE (1.2k points) | 10 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) | 9 views

0 votes

3 answers

#ProgrammingInC Tell Output of following question. Self Doubt.

answered Sep 3 in Programming by Sambhrant Maurya (271 points) | 23 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));

answered Sep 2 in Programming by Bikram (1.2k points) | 13 views

0 votes

0 answers

Why this code gives segmentation fault
THE PROBLEM Code→ #include<iostream> using namespace std; int main() { long int s,t,a,b,m,n; //m=number of apples, n=number of orranges long int ap[m], orr[n]; cin>>s; cin>>t; cin>>a; cin>>b; cin> ... ; } Why does it give Segmentation fault in Hacker Rank and In dev c++ the code stops by saying Windows is looking for a solution.

asked Sep 1 in Programming by GAITONDE (1.2k points) | 26 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 (322 points) | 31 views

0 votes

0 answers

#nesoacademy
void fun2(int n) { if(n<=0) return; printf(“%d”,n); fun2(2*n); printf(“%d”,n); } whether the above program is of tail recursive or non tail recursive?

asked Aug 31 in Programming by Akash purbia (6 points) | 9 views

0 votes

0 answers

Self Doubt: Why both Program giving different output?

asked Aug 30 in Programming by srestha (322 points) | 27 views