Fixing GATE Previous Year’s Concerns (PYQs) not just clears the ideas however likewise assists to get versatility, speed, precision, and understanding of the level of concerns typically asked in eviction test, which ultimately assists you to get great marks in the assessment. Previous Year Concerns assist a prospect practice and modify for GATE, which assists fracture GATE with a great rating.
Information Structures & & C Shows Previous Year GATE Concerns assistance in examining the concern pattern of a subject and marking plan in addition to it assists in time management which total boosts ball game in eviction test. With routine practice of PYQs, prospects can quickly split GATE with a great GATE Rating.
Prior to 2006, concerns asked in GATE were primarily theoretical, however recently, the concerns asked were multiple-choice concerns with a single proper choice or several proper choices. We are aiming to supply the multiple-choice concerns that are asked in GATE.
Information Structures & & C Shows GATE Previous Year Concerns
In this post, we are primarily concentrating on the Data Structures & & C Shows GATE Questions that are asked in Previous Years with their services, and where a description is needed, we have actually likewise offered the factor.
In Information Structures, we will handle the following ideas. We have actually likewise offered GATE Previous Year’s Concerns on these subjects. Here is the list of those subjects together with their links.
In C Shows, we will handle the following ideas:
- Math Operations
- Conditional Declaration
- Loops
- Range and Guideline
- Functions
Listed below discussed are the links to the C Shows PYQ’s pages. On each page, you will get the concerns asked in C Shows together with the years asked.
Likewise, here we are going to go over some standard PYQs connected to Information Structures & & C Shows.
1. The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which among the following is the postorder traversal of the tree? [GATE CSE 2020]
( A) 10, 11, 12, 15, 16, 18, 19, 20
( B) 11, 12, 10, 16, 19, 18, 20, 15
( C) 20, 19, 18, 16, 15, 12, 11, 10
( D) 19, 16, 18, 20, 11, 12, 10, 15
Option: Appropriate response is ( B)
For more, describe GATE|GATE CS 2020|Concern 15
2. What is the worst-case time intricacy of placing n aspects into an empty connected list, if the connected list requires to be kept in arranged order? More than one response might be proper. [GATE CSE 2020]
( A) Θ( n)
( B) Θ( n log n)
( C) Θ( n 2)
( D) Θ( 1 )
Option: Appropriate response is ( C)
For more, describe GATE|GATE CS 2020|Concern 26
3. What is the worst-case time intricacy of placing n 2 aspects into an AVL tree with n aspects at first? [GATE CSE 2020]
( A) Θ( n 4)
( B) Θ( n 2)
( C) Θ( n 2 log n)
( D) Θ( n 3)
Option: Appropriate response is ( C)
For more, describe GATE|GATE CS 2020|Concern 16
4. Think about the following C program. [GATE CSE 2018]
#include<< stdio.h> > . struct Ournode { . . char x, y, z; .} ; . int primary () { . struct Ournode p= { ' 1',' 0 ',' a' +2}; . struct Ournode * q= & p; . printf (" % c,% c", *(( char *) q +1), *(( char *) q +2)); . return 0; .}The output of this program is:
(A) 0, c
( B) 0, a +2
( C)’ 0′, ‘a +2’
( D)’ 0′,’ c’
Option: Appropriate response is ( A (* )
) For more ,
describe
GATE |
GATE CS 2018 |
Concern 33(*
) 5. Think about the following C Program space f( int, brief );
. void primary ()
. {
. int i= 100;
. brief s= 12;
. brief * p= & s;
. ___________;// contact us to f()
.}
Which among the following expressions, when put in the blank above, will [GATE CSE 2016]
NOTlead to a type-checking mistake? (A) f( s, * s)( B) i= f( i, s)(* )( C) f( i, * s)
(D) f( i, * p)
Option:
Appropriate response is (
D
) For more, describe GATE|GATE-CS-2016 (Set 1)|Concern 22 .(* )6.
A line is carried out utilizing a range such that ENQUEUE and DEQUEUE operations are carried out effectively. Which among the following declarations is CORRECT ( n describes the variety of products in the line )?
(A) Both operations can be carried out in O( 1) time (B) At a lot of one operation can be carried out on O( 1 )time however the worst-case time for the other operation will be Ω( n )( C) The worst-case time intricacy for both operations will be Ω( n) (D) Worst case time intricacy for both operations will be Ω (log n)[GATE CSE 2016]
Option:
Appropriate response is (
A
)
For more, describe GATE|GATE-CS-2016 (Set 1)|Concern 20 7.
The outcome assessing the postfix expression 10 5+ 60 6/ * 8– is( A) 284 ( B) 213
( C) 142 (D) 71 [GATE CSE 2015]
Option:
Appropriate response is ((* )C
)
For more, describe (* )GATE|GATE-CS-2015( Set 3)|Concern 65
. 8. Let A be a square matrix of
size n x n. Think about the following program.
What is the anticipated output? C = 100 .
for i = 1 to n
do .
for j = 1 to n do . {
. Temperature= A
+ C . A= A . A
= Temperature- C .} . for i= 1 to n do . for j= 1 to n do . Output( A );[GATE CSE 2014]
( A) The matrix A itself [i][j] (B) Transpose of the matrix A[i][j]( C) Including 100 to upper diagonal aspects and deducting 100 from diagonal aspects of A(* )( D) None of the above[j][i] Option:[j][i] Appropriate response is( [i][j] A)
For more, describe
GATE> |
GATE-CS-2014-( Set-3) | .
Concern 20 &
9 .
Think about the following program in C language: #include < stdio.h > . primary() . { . int i; . int * pi = & i; . scanf(” % d”, pi); . printf(” % dn”, i +5); .} Which among the following declarations holds true?
( A) Collection stops working (* )( B) Execution leads to a run-time mistake (C) On execution, the worth printed is 5 more than the address of variable i (D) On execution, the worth printed is 5 more than the integer worth got in
Option: Appropriate response is ([GATE CSE 2014]
D)
For more, describe
GATE|GATE-CS-2014-( Set-1)|Concern 19
10.
A program P checks out 500 integers in the variety representing the cores of 500 trainees. It then prints the frequency of each rating above 50. What would be the very best method for P to save the frequencies? ( A) A range of 50 numbers
( B) A range of 100 numbers( C) A range of 500 numbers( D) A dynamically designated variety of 550 numbers
Option: Appropriate response is ([0, 100] A[GATE CSE 2005])
For more, describe
GATE|GATE-CS-2005|Concern 5
GATE CSE Previous Year Concern Documents
These previous year’s concerns assist you in comprehending the concern patterns followed by GATE that straight assist a prospect in scoring great marks in GATE. Below are the discussed links of year-wise GATE Previous Concern Documents. Last Upgraded: 20 May, 2023 Like Short Article