Dark Mode

Questions without answers in Programming in C

0 votes

0 answers

1

GATE CSE SET-1 2024
My question is that can we use command line arguments without use of main function's parameters argc and *argv?

RahulVerma3 asked in Programming in C Mar 22

33 views

0 votes

0 answers

2

GATE 2024 CSE1
I have a question that can we use command line arguments without main function arguments? int main(int argc, char **argv){ }

RahulVerma3 asked in Programming in C Mar 16

99 views

0 votes

0 answers

3

class question self doubt
#include<stdio.h> #include<conio.h> int main(){ int a[][3]={ {4,14,24},{5,15,25},{6,16,26}}; int *p[3]; int **ptr=p; p[0]=a; p[1]=a+1; p[2]=a+2; ++*p; ++p[0]; ++**ptr; ++*p[0]; ++ptr; ++*ptr; --*p[1]; --*ptr; ++ptr; --p[ ... ("\n%d,%d,%d",a[0][2],a[1][1],a[2][0]); printf("\n%d,%d,%d",*p[0],*p[1],*p[2]); } what is the output of above program

Emankashyap asked in Programming in C Mar 1

119 views

1 vote

0 answers

4

I have purchased the IIIT Hyderabad 2024 test series but i can't find the test series anywhere

Khushbu Chaudhary asked in Programming in C Feb 25

by Khushbu Chaudhary

85 views

4 votes

0 answers

5

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 19
What will be the output of the following program? #include <stdio.h> int main() { int a[2][2] = { {1, 2}, {3, 4} }; int (*p)[2][2]; p = &a; printf("%d", (*p)[0][1]); return 0; } $1$ $2$ $3$ $4$

GO Classes asked in Programming in C Jan 28

297 views

0 votes

0 answers

6

Testbook Test Series: Programming & DS - Programming In C

Rock asked in Programming in C Mar 25, 2017

by Rock

361 views

0 votes

0 answers

7

most powerful language paradigm

Sanjay Sharma asked in Programming in C Mar 1, 2017

by Sanjay Sharma

242 views

0 votes

0 answers

8

byron gottfried programming in c (schaum's outline) pageno:302 and 303
i wanted to intialize a 2d array using pointers to pointers and i wrote the following code i know the below code is lot of hardcoding but as i am a beginner to pointers i want to do it this way,please help me ... )+s)); } printf("\n"); } return 0; } https://gateoverflow.in/?qa=blob&qa_blobid=17604332813334679423

abhijeeth asked in Programming in C Feb 8, 2017

584 views

0 votes

0 answers

9

Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G? a. 2 b. 3 c. 4 d. 5 Explain...how??

shraddha_gami asked in Programming in C Feb 8, 2017

by shraddha_gami

1.1k views

1 vote

0 answers

10

True/False
Consider the following statements : S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? Only S1 Only S2 Both S1 and S2 None of the above

reena_kandari asked in Programming in C Feb 6, 2017

by reena_kandari

222 views

0 votes

0 answers

11

How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices - 2nC2 No of Simple Undirected Graph with labelled vertices - ? No of Simple Undirected Connected Graph with unablled vertices - ? No of Simple Undirected Connected Graph with labelled vertices - ?

yg92 asked in Programming in C Feb 5, 2017

by yg92

445 views

0 votes

0 answers

12

GRAPH TRAVERSALS
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??

sushmita asked in Programming in C Feb 3, 2017

279 views

0 votes

0 answers

13

question
In a binary tree with n nodes every node has an odd no. of descendants. Every node is considered to be its own descendant. What is the no. of nodes in the tree that has exactly one child?

RAJESHWAR YADAV asked in Programming in C Feb 3, 2017

by RAJESHWAR YADAV

258 views

0 votes

0 answers

14

S Ram asked in Programming in C Feb 2, 2017

by S Ram

173 views

1 vote

0 answers

15

gatebook
How option D?? It will be 1* log2 *log4 * log8 How it is equal to (lg(n))!

Niharika 1 asked in Programming in C Feb 2, 2017

204 views

3 votes

0 answers

16

TestBook TestSeries
in a binary search tree, the key with value 5 was searched after traversing nodes with values 1, 3, 4, 6, 7, 8, 9 not necessarily in this order. Lets P is the probability that 3rd element on the search path beginning from root is either 3 or 8, ... are the number of different orders possible in which given nodes can be traversed before finding node with value 5. Find N ∕ 10 + P

vnc asked in Programming in C Jan 29, 2017

by vnc

458 views

0 votes

0 answers

17

Hashing Question
Why 4 is multiplied in part. In the solution.

Tendua asked in Programming in C Jan 26, 2017

by Tendua

838 views

0 votes

0 answers

18

ukn asked in Programming in C Jan 24, 2017

by ukn

173 views

1 vote

0 answers

19

Loop invariants [GateBook]

biranchi asked in Programming in C Jan 24, 2017

517 views

1 vote

0 answers

20

ukn asked in Programming in C Jan 23, 2017

by ukn

410 views

1 vote

0 answers

21

Testbook C
How?

Jason_Roy asked in Programming in C Jan 23, 2017

483 views

0 votes

0 answers

22

ukn asked in Programming in C Jan 23, 2017

by ukn

215 views

0 votes

0 answers

23

madeeasytestseries#ds
Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies minheap property. What is the time taken to convert the given tree ‘T’ to a max heap ? a. Ο(log n) b. Ο(n) c. Ο(n log n) d. Ο(n2)

shefali1 asked in Programming in C Jan 23, 2017

411 views

0 votes

0 answers

24

thor asked in Programming in C Jan 22, 2017

by thor

304 views

0 votes

0 answers

25

thor asked in Programming in C Jan 22, 2017

by thor

377 views

5 votes

0 answers

26

Evaluation order in return statement
//Consider the following C program #include <stdio.h> int f(int *a,int *b,int c) { if(c == 0) return 1; else { *b = *b-1; *a = *a+1; c = c - 1; return *a + f(a,b,c) + *b; } } int main() { int ... ,c)); return 0; } Doubts : Is there any undefined behaviour according to C language? if NO, then what will be the output ? Please explain with proper explanation.

dd asked in Programming in C Jan 21, 2017

by dd

1.5k views

1 vote

0 answers

27

vaishali jhalani asked in Programming in C Jan 20, 2017

by vaishali jhalani

210 views

0 votes

0 answers

28

testboook
i take m=4 and n=3? and after doing recursive calls i get 10 answer so how D) option will be correct ??

focus _GATE asked in Programming in C Jan 18, 2017

326 views

0 votes

0 answers

29

@arjun sir plz c thiz http://gateoverflow.in/104305/is-thiz-valid-code?show=104658#c104658 only last comment

Wanted asked in Programming in C Jan 18, 2017

by Wanted

271 views

1 vote

0 answers

30

doubt
char ** array [12][12][12]; Consider array, defined above. Which one of the following definitions and initializations of p is valid? (a) char ** (* p) [12][12] = array; (b) char ***** p = array; (c) char * (* p) [12][12][12] = array; (d) const char ** p [12][12][12] = array; (e) char (** p) [12][12] = array;

Prateek kumar asked in Programming in C Jan 16, 2017

by Prateek kumar

963 views

To see more, click for the full list of questions or popular tags.

Questions without answers in Programming in C