Recent questions and answers in Programming

0 votes

0 answers

1

gateforum_test
Can anyone explain how will the second parameter gets passed ?

asked 6 hours ago in Programming by Shivam Kasat Junior (811 points) | 14 views

0 votes

0 answers

2

function on C programming Language
Since we know that In function,the function name itself can act as the address to the function just like it was happening in array. So the given below program is correctly working:- #include<stdio.h> int sum(int x,int y) { return x+y; } int (*fb)( ... sum; or fb=∑ both are equivalent and (*fb)(8,6) and (fb)(8,6) are equivalent. How this is happening?

asked 6 hours ago in Programming by suraj prasad shaw (11 points) | 11 views

+1 vote

1 answer

3

While Loop
How many times does the while loop gets executed if the following function is called as $f(120,13)?$ f(m,n) { ans := 1 while (m - n >= 0) { ans := ans * 2 m := m - n } return(ans) }

answered 20 hours ago in Programming by Lakshman Patel RJIT Boss (20k points) | 31 views

+13 votes

4 answers

4

GATE2008-61
Choose the correct option to fill $?1$ and $?2$ so that the program below prints an input string in reverse order. Assume that the input string is terminated by a new line character. void reverse(void) { int c; if(?1) reverse(); ?2 } main() { printf("Enter text"); printf("\ ... $?2$ is $putchar(c);$ $?1$ is $((c = getchar() ) != '\setminus n')$ $?2$ is $putchar(c);$

answered 21 hours ago in Programming by Gupta731 Active (2.9k points) | 1.3k views

+2 votes

2 answers

5

What is the return value of following function for 484? What does it to in general?

answered 1 day ago in Programming by Shaik Masthan Boss (42.4k points) | 52 views

0 votes

0 answers

6

ME ots stack and heap
Please explain points in short, and intuition behind its working.

asked 1 day ago in Programming by HeadShot Active (3.5k points) | 30 views

+2 votes

2 answers

7

scope of a macro definition
Choose the False statements: (a) The scope of a macro definition need not be the entire program (b) The scope of a macro definition extends from the point of definition to the end of the file (c) A macro definition may go beyond a line (d) None of the above

answered 1 day ago in Programming by Ajay Dangi (11 points) | 238 views

0 votes

1 answer

8

made-easy-test-series
Consider the following C function: void foo(int n) { while(n!=0) { if(!(n&1)) printf("*"); n=n>>1; } } The number of times printf (“*”) statement is executed, when the value $2^{24}$ is passed to the function foo().

answered 1 day ago in Programming by Peeyush Pandey Junior (681 points) | 20 views

0 votes

0 answers

9

ugc net july 2018
What is the output of the following C' program ? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.) #include <stdio.h> #include <stdlib.h> /* Assume short int occupies two bytes of storage */ int main ( ) ... /* end of main */ (1) 5, 2, 1282 (2) 5, 2, 52 (3) 5, 2, 25 (4) 5, 2, 517

asked 1 day ago in Programming by suparna kar (121 points) | 17 views

0 votes

1 answer

10

Made-easy-test-series

answered 2 days ago in Programming by Mk Utkarsh Boss (29.6k points) | 27 views

+1 vote

1 answer

11

Gateforum Test Series
What is the output of the following program? $main()$ { $char *s[]=\left \{ “ice”, “green”, “cone”, “please”\right \};$ $char **ptr[]=\left \{ s+3, s+2, s+1, s\right \};$ $char ***P=ptr;$ $printf(“\%s”,**++P);$ } Ice Green Cone Please I think the answer should be $B$ but $C$ is provided as answer.

answered 2 days ago in Programming by shaz (171 points) | 55 views

0 votes

0 answers

12

++ operator
#include<stdio.h> int main() { int i = 5; int a = ++i + ++i + ++i + ++i; printf("%d",a); return 0; } How is the output 31? and not 30? Shouldn’t it be 6+7+8+9? [closed]

asked 2 days ago in Programming by shaz (171 points) | 11 views

0 votes

1 answer

13

made easy test series
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!

answered 2 days ago in Programming by Devwritt Active (3.9k points) | 54 views

+2 votes

1 answer

14

ME Test Series
Four vertices (A,B,C,D) is given which have only vertex D as a leaf. Total number of binary trees possible when every binary tree has four nodes is ________

answered 2 days ago in Programming by Devwritt Active (3.9k points) | 34 views

–2 votes

1 answer

15

ace test series

answered 2 days ago in Programming by abhishekmehta4u Boss (24.3k points) | 23 views

0 votes

0 answers

16

Self doubt- why isn't -ve int converted to 2's complement when storing in unsigned int.

asked 2 days ago in Programming by shaz (171 points) | 8 views

0 votes

1 answer

17

ME Test Series

answered 2 days ago in Programming by Gupta731 Active (2.9k points) | 35 views

0 votes

1 answer

18

aai question 2018
In a full binary tree of height 10 the number of nodes with degree 0,1 and 2 will be ______ , ______,and _____ respectively Note:-Consider height of a tree as the number of nodes in the longest path from root node to any leaf node. A.- 511, 1 , 511 B.-511 , 0 , 512 C.-512 , 0 , 511 C.-512 , 1, 510

answered 2 days ago in Programming by Devwritt Active (3.9k points) | 10 views

0 votes

0 answers

19

Self Doubt
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______ for quadratic probing H'(k,i) = (h(k) ... only intial hash function given no values for c1 and c2 ?? when should we consider H'(k) = (h(k) + i^2) mod m ??

asked 2 days ago in Programming by jatin khachane 1 Active (3.3k points) | 7 views

0 votes

1 answer

20

Printf
What is the output??

answered 2 days ago in Programming by Things To Know (Thin Active (1.2k points) | 39 views

0 votes

1 answer

21

Doubt : ACE OTS
What if the "||" is replaced with "&&" ? ( What does former condition in "if" results and how ?)

answered 3 days ago in Programming by prashant281188 (323 points) | 25 views

+1 vote

2 answers

22

GATEBOOK-2019-DS2-6
Let $\alpha(G)$ be the size of the largest independent set in a graph $G$, and $\chi(G)$ the chromatic number of $G$. Which of the following statements about a graph is true? $\alpha(G)*\chi(G) \ge |G|$ $\alpha(G) > \chi(G)$ $\alpha(G) < \chi(G)$ $\alpha(G)*\chi(G) \le |G|$

answered 3 days ago in Programming by Shaik Masthan Boss (42.4k points) | 42 views

0 votes

1 answer

23

GATEBOOK-2019-DS1-14
The pseudo code of a function is given below which takes an integer $n$ as its argument, and uses a stack $S$ to process the number. void foo(int n) { stack S; while (n >= 1) { push(&S, n%2); n = n/2; } while (!isEmpty(& ... order Prints binary representation of $n$ Prints the binary value of $\log n$ in reverse order Prints the binary value of $2^n$ in reverse order

answered 4 days ago in Programming by register_user_19 Active (1.2k points) | 47 views

0 votes

1 answer

24

Doubt :ACE OTS
Ans : Option D But array size is 14 then how 15 is printed ? ptr size is 2 but precise answer given was 2.29 , how ?

answered 4 days ago in Programming by kd..... (481 points) | 17 views

+1 vote

2 answers

25

Made easy test
char *a = “MADEEASY”; char *b = “GATECSIT2019”; char *r = a; char *s = b; printf(“%d”, (int) strlen (b+3[r] – 1[s])); return 0; Whats the output? Answer given 8

answered 4 days ago in Programming by kd..... (481 points) | 22 views

+1 vote

2 answers

26

made easy test
main(){ int S[6] = {126,256,512,1024,2048,4096}; int *x=(int *) (&S+1); printf (“%d”,x); } int is 4 bytes; array starts from 2000 . The answer is 2024 I am getting 2004. Please explain the concept. If possible provide a resource.

answered 4 days ago in Programming by kd..... (481 points) | 43 views

0 votes

1 answer

27

Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples

answered 4 days ago in Programming by neeraj33negi Junior (567 points) | 26 views

+1 vote

1 answer

28

Aai it 2018
Which of the following data structure is most suitable for radix sort? 1 .tree 2 . Linked list 3 . Stack 4 . Binary search tree

answered 5 days ago in Programming by twin_123 (139 points) | 107 views

0 votes

0 answers

29

madeeasy test series
Time complexity for Maximum number of edges to be added to a tree so that it stays a Bipartite graph is?? answe given as O(v) using dfs but a option O(v+e) is also there why this cant be answer?

asked 5 days ago in Programming by eyeamgj Loyal (6.3k points) | 23 views

0 votes

1 answer

30

TestBook
consider the following nested recursion. h(n)={ 0 if n=0 n if n>4 h(n+h(2n)) if n<=4} What is the value of h(2) ? The given ans is 12 I am getting 14...

answered 5 days ago in Programming by twin_123 (139 points) | 10 views

0 votes

1 answer

31

Testbook-ds
Assume that p & q are pointers. What will be the output after performing following sets of operations on a given linked list? Struct node { char info; struct node *link; }; Operations are: q = p → link → link ; q → link → link = p → link; printf (“%c”, q → link → link → link → info); the given ans is b but I am getting c.. can anyone plz verify?

answered 5 days ago in Programming by prashant281188 (323 points) | 31 views

0 votes

0 answers

32

Ace test series

asked 5 days ago in Programming by abhishekmehta4u Boss (24.3k points) | 38 views

0 votes

0 answers

33

TestBook-ds
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int anagram (char *a, char *b){ int count [128], j; for (j = 0; j < 128; j++) count[j]=0; j = 0; while (a[j] ... [j]]++ 3 A: count [a[j++]]++ and B: count[b[j]]-- 4 A: count[a[j]]++ and B: count [b[j++]]--

asked 5 days ago in Programming by anjali007 Active (2.9k points) | 10 views

+26 votes

5 answers

34

GATE2017-1-36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x= x + bar( ... will result in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.

answered 5 days ago in Programming by kunal goswami (209 points) | 5.2k views

0 votes

0 answers

35

madeeasy test series
s1 is given as true but dfs on undirected graph does bot have cross edges then how it is true?

asked 5 days ago in Programming by eyeamgj Loyal (6.3k points) | 27 views

0 votes

0 answers

36

madeeasy test series
true or false The number of node in each left subtree is within a factor of 2 of the number of nodes in the corresponding right subtree also a node is allowed to have only one child if that child has no children .This tree has worst case height O(logn) n is number of nodes of tree?

asked 6 days ago in Programming by eyeamgj Loyal (6.3k points) | 10 views

0 votes

1 answer

37

TIFR 2019 C Programming Question
A(int n) { if(n==0) { printf(“x”); } for(int i=0;i<=n-1;++i){ A(n-1); } } A(5) how many time x will print

answered 6 days ago in Programming by Hemanth_13 Active (5.2k points) | 154 views

0 votes

0 answers

38

# c programming questions
AB(int n){ if(n==0){ printf(“x”);} for(i=0;i<=n;++i){ AB(n-1);} } how many time AB(5) printf(x) will execute [closed]

asked 6 days ago in Programming by amit166 Junior (529 points) | 35 views

0 votes

0 answers

39

#c question
A(int n) { if(n==0) { printf(“x”); } for(int i=0;i<=n;++i){ A(n-1); } } A(5) how many time x will print

asked 6 days ago in Programming by amit166 Junior (529 points) | 22 views

0 votes

1 answer

40

made easy test series
what will be the output?

answered 6 days ago in Programming by Aishik Khatua (11 points) | 58 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions and answers in Programming

Recent Posts

Recent Blog Comments