Recent questions in Programming

+1 vote

0 answers

1

Pointers
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(A+1)-(unsigned)A); printf("%d", (unsigned)(p+1)-(unsigned)p); } What will be the output ?? 1. 42 ,42 2. 42,336 3. 336,42 4. 1,1 [closed]

asked 10 hours ago in Programming by Solarica Palit (153 points) | 13 views

0 votes

1 answer

2

Binary Tree Height
What is the time complexity for finding the height of the binary tree? a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n)

asked 12 hours ago in Programming by pradeepchaudhary (209 points) | 12 views

0 votes

2 answers

3

Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l

asked 12 hours ago in Programming by pradeepchaudhary (209 points) | 15 views

0 votes

0 answers

4

Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list

asked 12 hours ago in Programming by pradeepchaudhary (209 points) | 19 views

0 votes

0 answers

5

Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)

asked 12 hours ago in Programming by pradeepchaudhary (209 points) | 12 views

0 votes

1 answer

6

Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)

asked 12 hours ago in Programming by pradeepchaudhary (209 points) | 7 views

0 votes

0 answers

7

syllabus doubt
although i know that disjoint set is not in the syllabus, but should we need to study it for learning krushkal's and prims, or i should skip disjoint set data structures?

asked 22 hours ago in Programming by aambazinga Junior (669 points) | 8 views

+1 vote

1 answer

8

array
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte of memory.

asked 1 day ago in Programming by turendar (121 points) | 82 views

+1 vote

0 answers

9

Self Doubt on Storage of value
unsigned int n = -2; How this is stored in memory let take integer takes 2 Bytes? A) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 B) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 [closed]

asked 1 day ago in Programming by Shaik Masthan Boss (16.2k points) | 33 views

0 votes

1 answer

10

gate 17 set 1
how the answer is 3 explain??????? [closed]

asked 1 day ago in Programming by Phalkey (31 points) | 60 views

0 votes

1 answer

11

madeeasy test series
How many times made easy is printed? #include <stdio.h> int main() { c(4); return 0; } int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); c(m-i-1); printf("madeeasy") } } }

asked 1 day ago in Programming by ck (307 points) | 40 views

0 votes

0 answers

12

Merge Sort (Code)
why this margeSort program showing time limit exceed ? #include <stdio.h> #include <stdlib.h> #include <time.h> void fillArray(int array[], int n) { time_t t; time(&t);//get current time srand(t);//gives current time as seed ... CLOCKS_PER_SEC; printArray(Array, n); printf("\n \n Time taken for sorting: %f seconds\n\n",cpu_time_used); return 0; }

asked 1 day ago in Programming by srestha Veteran (92.1k points) | 27 views

+1 vote

0 answers

13

gate 15 set-2
int fun(int n) { int x=1,k; if(n==1) return x; for(k=1;k<n;++k) x=x+fun(k)*fun(n-k) return x; } return value of fun(5)??? how to solve this using tree method approach??? [closed]

asked 1 day ago in Programming by Phalkey (31 points) | 23 views

0 votes

1 answer

14

c programming
struct marks{ int p:3; int c:3; int m:2; }; void main(){ struct marks s={2,-6,5}; printf("%d %d %d",s.p,s.c,s.m); } Please explain why result is 221

asked 2 days ago in Programming by manisha11 (197 points) | 52 views

+1 vote

0 answers

15

C programming
Consider 2 cases: 1. Call by value result 2. Call by reference int x = 10 ; main ( ) { P(x); printf (x); } P ( int a) { If ( a ≤ 40 ) { a = a +10; P(a); x=a+10; } } Please explain this in the above referenceIn case ... by value result, the final value of a formal parameter is passed to actual. Any example in which these 2 will differ in output(especially in case of function calls)?

asked 2 days ago in Programming by manisha11 (197 points) | 49 views

0 votes

0 answers

16

Programming With C
Please provide solution [closed]

asked 2 days ago in Programming by rohan.1737 (81 points) | 24 views

0 votes

2 answers

17

Programming

asked 2 days ago in Programming by Shivangi Parashar 2 (41 points) | 63 views

0 votes

1 answer

18

Programming

asked 2 days ago in Programming by Shivangi Parashar 2 (41 points) | 23 views

+1 vote

1 answer

19

Programming

asked 2 days ago in Programming by Shivangi Parashar 2 (41 points) | 22 views

+1 vote

0 answers

20

Virtual gate

asked 2 days ago in Programming by Shivangi Parashar 2 (41 points) | 24 views

0 votes

0 answers

21

Virtual gate

asked 3 days ago in Programming by Divya Parashar (19 points) | 34 views

0 votes

0 answers

22

Code Quick Sort
Why the code is not showing correct sorting ?(here pivot is smaller index element, i.e. arr[low]) #include <stdio.h> #include <stdlib.h> #include <time.h> void fillArray(int array[], int n) { time_t t; time(&t);//get current time srand(t);/ ... ;n); array = malloc(n * sizeof(int)); fillArray(array, n); quickSort(array,low,n); printArray(array, n); return 0; }

asked 3 days ago in Programming by srestha Veteran (92.1k points) | 19 views

0 votes

1 answer

23

Pointer Question
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; } What is output of the program?

asked 5 days ago in Programming by shivamg (47 points) | 53 views

+3 votes

1 answer

24

c programming
what is the output of the c program given below, #include<stdio.h> int main() { char pt[]="Gatelecture"; char qt[]="GATE"; int i=0; for( ;pt[i++]=qt[i++]; ); printf("%s",pt); } a. AeEe b. AaEe c. aAeE d. none of the above

asked 6 days ago in Programming by turendar (121 points) | 144 views

+2 votes

2 answers

25

Test Series
Sum of the value printed by Rec(6)?

asked Aug 13 in Programming by ben10 (149 points) | 40 views

0 votes

0 answers

26

Link List
Option B ? Following is a function Mystery() which takes a list and sorts it. Line 1 and Line 2 are left blank intentionally.

asked Aug 12 in Programming by HeadShot Junior (657 points) | 28 views

0 votes

0 answers

27

Link List

asked Aug 12 in Programming by HeadShot Junior (657 points) | 32 views

0 votes

1 answer

28

Link List

asked Aug 12 in Programming by HeadShot Junior (657 points) | 22 views

0 votes

0 answers

29

GO Classroom(Linked List)
Is my analysis correct? I analyze code that if it will take 1->2->3 and 4->1->2 as input then output will be reverse of 5->3->2 i.e. 2->3->5 Why code is showing runtime error? #include<stdio.h> #include<stdlib.h> ... , 0); reverse( rsum, &sum); printf("The sum is : "); printList(sum); printf("\n"); return 0; }

asked Aug 11 in Programming by srestha Veteran (92.1k points) | 27 views

0 votes

0 answers

30

Stack and Queues

asked Aug 11 in Programming by HeadShot Junior (657 points) | 67 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 in Programming

Recent Posts

Recent Blog Comments