$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year} & \textbf{2022}&\textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1 &0&2&1&2&2&1&2&2&1&0&1.4&2
\\\hline\textbf{2 Marks Count} & 2&2&2&1&3&3&4&4&2&2&1&2.5&4
\\\hline\textbf{Total Marks} & 5&4&6&3&8&8&9&10&6&5&\bf{4}&\bf{6.4}&\bf{10}\\\hline
\end{array}}}$$

Most viewed questions in Programming

1 votes

2 answers

1321

Programming and DS ::- BST deletion
What is the time complexity to delete the root node in right skew tree? I knew the three cases of BST deletion:- 0 child,one child,two child. But how can we handle this particular question

What is the time complexity to delete the root node in right skew tree?I knew the three cases of BST deletion:- 0 child,one child,two child.But how can we handle this par...

rahul sharma 5

815 views

rahul sharma 5 asked Oct 6, 2017

0 votes

1 answer

1322

programming
#include<stdio.h> main() { static char *s[]={"black","white","pink","violet"}; char **ptr[]={s+3,s+2,s+1,s},***p; p=ptr; ++p; printf("%s",**p+1); } if i dont use static here , compiler throws error why plz explaain

#include<stdio.h main() { static char *s[]={"black","white","pink","violet"}; char ptr[]={s+3,s+2,s+1,s}, *p; p=ptr; ++p; printf("%s", p+1); }if i dont use static here ,...

sumit goyal 1

815 views

sumit goyal 1 asked Jun 29, 2017

3 votes

4 answers

1323

GATE Overflow | Programming | Test 1 | Question: 26
What will be the output of the following code? #include <stdio.h> int main() { char a = 'A', z = 'Z'; printf("%d", z-a); }

What will be the output of the following code?#include <stdio.h int main() { char a = 'A', z = 'Z'; printf("%d", z-a); }

Arjun

814 views

Arjun asked Oct 18, 2016

0 votes

1 answer

1324

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)

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)...

pradeepchaudhary

813 views

pradeepchaudhary asked Aug 19, 2018

0 votes

0 answers

1325

Linked list
Function to reverse the circular doubly linked list. Why is this function showing an error? head is a global variable. void reverse() { struct node *z; struct node *t = head -> forw; while(t != head) { z=t->back; t->back=t->forw; t->forw=z; t = t -> back; } z=t->back; t->back=t->forw; t->forw=z; head=t->forw; }

Function to reverse the circular doubly linked list.Why is this function showing an error?head is a global variable.void reverse() { struct node *z; struct node *t = h...

rishabhgupta12

813 views

rishabhgupta12 asked Aug 6, 2018

4 votes

2 answers

1326

GATE Overflow | Programming | Test 1 | Question: 10
What will be the output of the following program? #include <stdio.h> void f1(int p1, int *p2, int **p3) { p1 = 20; *p2 = p1; **p3 = *p2; p1 = 10; } int main() { int a = 5, b = 5, *c = &b; f1(a, &b, &c); printf("%d %d %d", a, b, *c); } 5 5 5 5 20 20 10 20 20 20 20 20

What will be the output of the following program?#include <stdio.h void f1(int p1, int *p2, int p3) { p1 = 20; *p2 = p1; p3 = *p2; p1 = 10; } int main() { int a = 5, b ...

Arjun

813 views

Arjun asked Oct 18, 2016

1 votes

2 answers

1327

C Que
main() { unsigned i = 3; if(i > -1) printf("Hell"); else printf("Heaven"); } Here since i is unsigned type....-1 should be converted to unsigned type for comparison..What would -1 be in unsigned ....or with what value should i be compared in if(i > -1).....? Plz explain...

main() { unsigned i = 3; if(i -1) printf("Hell"); else printf("Heaven"); }Here since i is unsigned type....-1 should be converted to unsigned type for comparison..What w...

komal07

813 views

komal07 asked Jul 18, 2015

1 votes

1 answer

1328

C++ oops
Can someone explain the difference between abstraction and encapsulation with programming example?

Can someone explain the difference between abstraction and encapsulation with programming example?

Adiaspirant

811 views

Adiaspirant asked Mar 18, 2017

5 votes

3 answers

1329

Unacademy Weekly Test
Consider the following program, what will be the output? #include<stdio.h> void main() { int a; a = printf("2>5") > printf("2<5") ? printf("2")!=printf("20")?printf("GA"):printf("2022"):10?2!=2>5?!2?40:!2!=3?50:60:70:80; printf("%d",a); } Options: 50 60 70 None of These Answer: b. 50

Consider the following program, what will be the output?#include<stdio.h void main() { int a; a = printf("2>5") printf("2<5") ? printf("2")!=printf("20")?printf("GA"):pr...

lovish_bhatia

810 views

lovish_bhatia asked Jun 11, 2023

1 votes

1 answer

1330

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 6
The question is based on the following program fragment. f(intY[10],int x){ int u,j,k; i=0;j=9; do{ k=(i+j)/2; if(Y[k] < x) i=k; else j=k; } while(Y[k]!=x) && (i<j)); if (Y[k]==x) printf( x is in the array. ); else printf( ... $x>2$ $Y$ is $[2\;4\;6\;8\;10\;12\;14\;16\;18\;20]$ and $2<x<20$ and $'x'$ is even

The question is based on the following program fragment.f(intY[10],int x){ int u,j,k; i=0;j=9; do{ k=(i+j)/2; if(Y[k] < x) i=k; else j=k; } ...

admin

810 views

admin asked Apr 1, 2020

3 votes

2 answers

1331

Character value outout

Anirban Biswas

810 views

Anirban Biswas asked Jan 10, 2017

3 votes

1 answer

1332

trees
1) What is the recurrence relation of the post order traversal of Binary search tree when the in order traversal is sorted? a) T(n)=T(k)+T(n−k−1)+O(1) b) T(n)=T(n/2) +O(n) c) T(n)=T(k)+T(n−k−1)+O(log n) d) T(n)=T(k)+T(n−k−1)+O(n) 2)What is the recurrence relation of the post order traversal of ... k)+T(n−k−1)+O(1) b) T(n)=T(n/2) +O(n) c) T(n)=T(k)+T(n−k−1)+O(log n) d) T(n)=T(k)+T(n−k−1)+O(n)

1) What is the recurrence relation of the post order traversal of Binary search tree when the in order traversal is sorted?a) T(n)=T(k)+T(n−k−1)+O(1)b) T(n)=T(n/2) +O...

Amit puri

810 views

Amit puri asked Oct 2, 2016

1 votes

1 answer

1333

Test by Bikram | Data Structures | Test 2 | Question: 21
Following keys have to be inserted in exact order into the hash table with $9$ slots. $5, 28, 19, 15, 20, 33, 12, 17, 10$ The auxiliary hash functions is $h(k)=K$ mod table size, where table size is $9$ . Which of the following represent the contents of ... $10,28,19,20,12,5,15,33,17$ $33,28,19,20,12,5,15,10,17$ $20,28,19,10,12,5,15,33,17$

Following keys have to be inserted in exact order into the hash table with $9$ slots.$5, 28, 19, 15, 20, 33, 12, 17, 10$The auxiliary hash functions is $h(k)=K$ mod table...

Bikram

809 views

Bikram asked Nov 26, 2016

1 votes

2 answers

1334

c functions
#include <stdio.h> void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } ****************************************************************************** #include <stdio.h> int main() { demo(); return 0; } void demo() { printf("GeeksQuiz "); } will both program same result?

#include <stdio.h void demo() { printf("GeeksQuiz "); } int main() { demo(); return 0; } #include <stdio.h int main() { demo(); re...

hitendra singh

808 views

hitendra singh asked Mar 29, 2019

0 votes

1 answer

1335

Hashing
Can someone explain Secondary Clustering to me? The distance between two successive probes is quadratic. I get it, but how are clusters being formed?

Can someone explain Secondary Clustering to me? The distance between two successive probes is quadratic. I get it, but how are clusters being formed?

Parimal Paritosh

808 views

Parimal Paritosh asked Mar 8, 2018

1 votes

1 answer

1336

New Gradience
Below is the pic of the AVL tree for more clarity. I think answer D is right . I have checked myself by inserting nodes to make it same tree here.https://www.cs.usfca.edu/~galles/visualization/AVLtree.html. Pls someone let me know if answer is incorrect or not and if it is, pls provide explanation.

Below is the pic of the AVL tree for more clarity.I think answer D is right . I have checked myself by inserting nodes to make it same tree here.https://www.cs.usfca.edu/...

mohit chawla

806 views

mohit chawla asked Nov 13, 2016

1 votes

2 answers

1337

Complexity2
An array of size n. Find the time complexity to insert a new value before an element e in the array? a)O(n) b)O(log n) c)O(1)

An array of size n. Find the time complexity to insert a new value before an element e in the array?a)O(n)b)O(log n)c)O(1)

srestha

803 views

srestha asked Aug 6, 2016

6 votes

1 answer

1338

GO Classes Weekly Quiz 2 | Programming in C | Propositional Logic | Question: 9
In $C$ programming, constant integers are considered to be signed integers by default. One way to represent them as an unsigned constant is by appending $U$ as a suffix. For example, $-1$ is signed whereas $-1U$ is unsigned. Which of the following ... $\text{TRUE}$? $-1 > -2$ $-1U > -2$ $-1 > 0U$ $-1 > 0$

In $C$ programming, constant integers are considered to be signed integers by default. One way to represent them as an unsigned constant is by appending $U$ as a suffix. ...

GO Classes

801 views

GO Classes asked May 2, 2022

2 votes

1 answer

1339

Binary Search tree

atul_21

801 views

atul_21 asked Nov 14, 2017

0 votes

1 answer

1340

Delayed Branching
Which of the following is not TRUE about "Delayed Branching" ? S1 : Delayed branding changes the semantic meaning of the original program. S2 : Delayed branching is the problem arrived because of jump instruction. (1) S1 only (2) S2 only (3) Both (1) & (2) (4) None of these Answer:3

Which of the following is not TRUE about "Delayed Branching" ?S1 : Delayed branding changes the semantic meaning of the original program. S2 : Delayed branching is the pr...

vishwa ratna

801 views

vishwa ratna asked Jan 15, 2017

Page:

« prev
1
...
62
63
64
65
66
67
68
69
70
71
72
...
206
next »

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