Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Previous GATE Questions in Programming and DS
62
votes
4
answers
141
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
16.2k
views
gatecse-2015-set2
data-structures
binary-heap
normal
41
votes
4
answers
142
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
go_editor
asked
in
Programming in C
Feb 12, 2015
by
go_editor
14.4k
views
gatecse-2015-set2
programming
programming-in-c
normal
recursion
35
votes
12
answers
143
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
30.1k
views
gatecse-2015-set2
data-structures
binary-tree
normal
numerical-answers
3
votes
1
answer
144
GATE CSE 1996 | Question: 19
Consider the following program in pseudo-Pascal syntax. What is printed by the program if parameter $a$ in procedure $\text{test1}$ is passed as call-by-reference parameter call-by-value-result parameter program Example (input, output) var b: integer; procedure test2: begin b ... ', a, b); end begin (*Example*) b:=3; test1(b); writeln('point3: ', b); end
Kathleen
asked
in
Programming in C
Oct 9, 2014
by
Kathleen
1.5k
views
gate1996
programming
parameter-passing
normal
out-of-syllabus-now
24
votes
4
answers
145
GATE CSE 1996 | Question: 15
Insert the characters of the string $K \ R \ P \ C \ S \ N \ Y \ T \ J \ M$ into a hash table of size $10$. Use the hash function $h(x)=( ord (x) – ord (\text{“}a\text{”}) + 1) \mod 10$ and linear probing to resolve collisions. Which insertions cause collisions? Display the final hash table.
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
6.3k
views
gate1996
data-structures
hashing
normal
descriptive
54
votes
7
answers
146
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
22.8k
views
gate1996
data-structures
binary-search-tree
normal
descriptive
26
votes
5
answers
147
GATE CSE 1996 | Question: 2.14
A binary search tree is generated by inserting in order the following integers: $50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$ The number of nodes in the left subtree and right subtree of the root respectively is $(4, 7)$ $(7, 4)$ $(8, 3)$ $(3, 8)$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
30.5k
views
gate1996
data-structures
binary-search-tree
easy
28
votes
3
answers
148
GATE CSE 1996 | Question: 2.11
The minimum number of interchanges needed to convert the array into a max-heap is $89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$ $0$ $1$ $2$ $3$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
13.5k
views
gate1996
data-structures
binary-heap
easy
21
votes
3
answers
149
GATE CSE 1996 | Question: 1.15
Which of the following sequences denotes the post order traversal sequence of the below tree? $f\; e\; g\; c\; d\; b\; a$ $g\; c\; b\; d\; a\; f\; e$ $g\; c\; d\; b\; f\; e\; a$ $f\; e\; d\; g\; c\; b \;a$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
4.3k
views
gate1996
data-structures
binary-tree
easy
29
votes
3
answers
150
GATE CSE 1996 | Question: 1.14
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? $1$ $3$ $7$ $8$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
12.1k
views
gate1996
data-structures
binary-tree
normal
39
votes
6
answers
151
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
13.7k
views
gate1996
data-structures
hashing
normal
33
votes
4
answers
152
GATE CSE 1996 | Question: 1.12
Consider the following statements: First-in-first out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. Implementing QUEUES on a circular array is more ... $(ii)$ are true $(iii)$ and $(iv)$ are true $(ii)$ and $(iv)$ are true
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
14.8k
views
gate1996
data-structures
easy
queue
stack
linked-list
25
votes
3
answers
153
GATE CSE 1995 | Question: 6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
Kathleen
asked
in
DS
Oct 8, 2014
by
Kathleen
3.7k
views
gate1995
data-structures
binary-tree
normal
descriptive
21
votes
3
answers
154
GATE CSE 1995 | Question: 3
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segment. The values of the variables $A$ and $B$ are $5CH$ and $92H$, respectively. Also indicate error conditions if ... integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;
Kathleen
asked
in
Programming in C
Oct 8, 2014
by
Kathleen
5.3k
views
gate1995
programming
identify-function
descriptive
26
votes
3
answers
155
GATE CSE 1995 | Question: 2.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
Kathleen
asked
in
DS
Oct 8, 2014
by
Kathleen
11.4k
views
gate1995
data-structures
linked-list
hashing
49
votes
7
answers
156
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
Kathleen
asked
in
DS
Oct 8, 2014
by
Kathleen
38.2k
views
gate1995
data-structures
stack
easy
43
votes
6
answers
157
GATE CSE 1995 | Question: 1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n-1$ $n$ $2^n$
Kathleen
asked
in
DS
Oct 8, 2014
by
Kathleen
36.0k
views
gate1995
data-structures
binary-tree
normal
32
votes
3
answers
158
GATE CSE 1994 | Question: 26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.
Kathleen
asked
in
DS
Oct 5, 2014
by
Kathleen
7.4k
views
gate1994
data-structures
queue
stack
normal
descriptive
29
votes
6
answers
159
GATE CSE 1994 | Question: 25
An array $A$ contains $n$ integers in non-decreasing order, $A[1] \leq A[2] \leq \cdots \leq A[n]$. Describe, using Pascal like pseudo code, a linear time algorithm to find $i, j,$ such that $A[i]+A[j]=a$ given integer $M$, if such $i, j$ exist.
Kathleen
asked
in
DS
Oct 5, 2014
by
Kathleen
5.0k
views
gate1994
data-structures
array
normal
descriptive
1
vote
1
answer
160
GATE CSE 1994 | Question: 22
Consider the program below: Program main: var r:integer; procedure two: begin write (r); end procedure one: var r:integer; begin r:=5; two; end begin r:=2; two; one; two; end What is printed by the above program if Static scoping is assumed for all variables; Dynamic scoping is assumed for all variables. Give reasons for your answer.
Kathleen
asked
in
Programming in C
Oct 5, 2014
by
Kathleen
1.8k
views
gate1994
programming
variable-binding
normal
out-of-gate-syllabus
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
16
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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 Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Programming
(4.1k)
DS
(2.0k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Previous GATE Questions in Programming and DS
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow