$$\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

0 votes

1 answer

1281

Linked list
What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n > 8.? Please mention the reason of the answer also.

What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you ma...

Somdatta Sen

849 views

Somdatta Sen asked Feb 13, 2019

0 votes

0 answers

1282

Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);

Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);

Mk Utkarsh

849 views

Mk Utkarsh asked Oct 20, 2018

2 votes

1 answer

1283

Precedence Of Logical Operators in C
#include <stdio.h> #include <iostream> using namespace std; int main() { printf("Hello World"); int a = 10, b = 20, c= 30, d = 40; int e = ++a || ++b || ++c && ++d; // DoubtFull Line cout<<"a = "<<a<< ... final Output should be:- a = 11 b = 20 c = 31 d = 41. but the output is a = 11 b = 20 c = 30 d = 40

#include <stdio.h #include <iostream using namespace std; int main() { printf("Hello World"); int a = 10, b = 20, c= 30, d = 40; int e = ++a || ++b || ++c && ++d; // Doub...

Jason

848 views

Jason asked Mar 1, 2018

1 votes

2 answers

1284

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 1
What will be the output of following? main() { Static int a = 3; Printf(“%d”,a--); If(a) main(); } $3$ $3\;2\;1$ $3\;3\;3$ Program will fall in continuous loop and print $3$

What will be the output of following?main() { Static int a = 3; Printf(“%d”,a ); If(a) main(); }$3$$3\;2\;1$$3\;3\;3$Program will f...

admin

846 views

admin asked Apr 1, 2020

1 votes

1 answer

1285

MadeEasy Test Series 2018: Algorithms - Dynamic Programming

sumit chakraborty

846 views

sumit chakraborty asked Jan 28, 2018

0 votes

1 answer

1286

AckerMann Function
Is there any shortcut to solve the AckerMann function ? e.g. I want to find the value of A(3,1) .https://en.wikipedia.org/wiki/Ackermann_function

Is there any shortcut to solve the AckerMann function ?e.g. I want to find the value of A(3,1).https://en.wikipedia.org/wiki/Ackermann_function

dragonball

846 views

dragonball asked Dec 14, 2017

0 votes

1 answer

1287

Doubt
C is by default row major or column major?

C is by default row major or column major?

Angkit

846 views

Angkit asked Jun 13, 2017

0 votes

1 answer

1288

BigEndian C compiler
Hi, can anyone please suggest me an online site where I can run code in C and test how the code will act under bid endian environment?

Hi, can anyone please suggest me an online site where I can run code in C and test how the code will act under bid endian environment?

yuyutsu

845 views

yuyutsu asked Jul 3, 2022

0 votes

2 answers

1289

Recursion
How 22 ?

How 22 ?

HeadShot

845 views

HeadShot asked Nov 12, 2018

5 votes

3 answers

1290

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

844 views

lovish_bhatia asked Jun 11, 2023

1 votes

1 answer

1291

Array of Pointers-Self Doubt
$1)$ How to access array element with array of pointers? By pointer to an array we can access like this $(*a)[0]$,$(*a)[22]$, .. like this right? but how with array of pointer? $2)$Check these three codes , one of them use array and one of them use ... main(void) { if(*(ptr+5)==*(ptr+3)){ printf("Equal"); } else{ printf("Not Equal"); } return 0; }

$1)$ How to access array element with array of pointers? By pointer to an array we can access like this $(*a)[0]$,$(*a)[22]$,….. like thisright?but how with array of po...

srestha

844 views

srestha asked May 5, 2019

1 votes

3 answers

1292

Made Easy Programming and DS
main() { int i, x=5, y=10; for(i=1;i<=2;i++) { y+=f(x) + g(x); printf("%d", y); } } f(int x) { int y; y=g(x); return (x+y); } g(int x) { static int y=5; y=y+7; return (x+y); } Kindly explain how recursion is working along with the solution.

main(){int i, x=5, y=10;for(i=1;i<=2;i++){y+=f(x) + g(x);printf("%d", y);}}f(int x){int y;y=g(x);return (x+y);}g(int x){static int y=5;y=y+7;return (x+y);} Kindly explain...

Sambhrant Maurya

844 views

Sambhrant Maurya asked Jul 9, 2018

1 votes

2 answers

1293

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

844 views

rahul sharma 5 asked Oct 6, 2017

1 votes

1 answer

1294

#C Recursion Question (A variance of Gate 2018) Question
Consider the following program written in pseudo-code. Assume that x and y are integers. Count (x, y) { if (y !=2 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times ... ================================= My answer is 10220 and I just need someone to verify if it's correct.

Consider the following program written in pseudo-code. Assume that x and y are integers. Count (x, y) { if (y !=2 ) { if (x !=1) { ...

iarnav

843 views

iarnav asked Jun 28, 2018

2 votes

1 answer

1295

c programming
int main() { int i,n; int x = 123456789; void *a = &x; unsigned char *c1 = (unsigned char*)a; for(i=0;i< sizeof a;i++) { printf("%u ",*(c1+i)); } char *c2 = (char*)a; printf("\n %d", *(c2+1)); char *c3 = (char*)a; printf("\n %u \n", *(c3+1)); } Output ?

int main() { int i,n; int x = 123456789; void *a = &x; unsigned char *c1 = (unsigned char*)a; for(i=0;i< sizeof a;i++) { printf("%u ",*(c1+i)); } char *c2 = (char*)a; pri...

843 views

dd asked Aug 11, 2016

1 votes

1 answer

1296

Made easy
What will be the output of following program if we use a) static scoping b) dynamic scoping? int a= 1,b=2; main( ) { int a=20,b=30; Print(a,b); C( ); Print(a,b); D( ); } C( ) { int a= 50; print (a,b); D( ); Print(a,b); } D( ) { Print (a,b); a=3; b=4; Print(a,b); F( ); } F( ) { int b =6; Print( a,b); a=7; b=8; }

What will be the output of following program if we use a) static scoping b) dynamic scoping?int a= 1,b=2; main( ) { int a=20,b=30; Print(a,b); C( ); Print(a,b); D( ); } C...

Gaurangi Katiyar

841 views

Gaurangi Katiyar asked Dec 5, 2018

1 votes

1 answer

1297

Dennis Ritchie book 'THE C PROGRAMMING LANGUAGE' EXERCISE-1-8,PAGE-20,CHAPTER-1.
#include<stdio.h> main() { int c,nb,nt,nn; nb=0; nt=0; nn=0; while((c=getchar())!=EOF) if(c==' ') ++nb; else if(c=='\t') ++nt; else if(c=='\n') ++ ... t%d\t%d",nb,nt,nn); } the program does not show output for corresponding string input in Dev C++.Can anyone please answer this?

#include<stdio.h>main(){ int c,nb,nt,nn; nb=0; nt=0; nn=0; while((c=getchar())!=EOF) if(c==' ') ++nb; else if(c=='\t') ++nt; ...

BIPLAB DAS

841 views

BIPLAB DAS asked Jul 18, 2017

2 votes

2 answers

1298

3 D array with pointers

Kumar123456

841 views

Kumar123456 asked Jun 2, 2017

0 votes

1 answer

1299

Heaps
In a min heap time complexity for 1: Find the 7th smallest element 2: Delete the 7th smallest element

In a min heap time complexity for1: Find the 7th smallest element2: Delete the 7th smallest element

Shiv Gaur

839 views

Shiv Gaur asked Aug 20, 2018

1 votes

3 answers

1300

Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node

A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...

Bikram

839 views

Bikram asked Nov 26, 2016

Page:

« prev
1
...
60
61
62
63
64
65
66
67
68
69
70
...
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