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
Recent questions in Programming and DS
3
votes
2
answers
4891
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
makhdoom ghaya
asked
in
DS
Apr 27, 2016
by
makhdoom ghaya
6.2k
views
isro2013
binary-tree
easy
1
vote
1
answer
4892
Facts about AVL tree
Which of the following is false? A. Maximum height of an AVL tree of n nodes is 1.44 log2n ​B. Insertion of an element into an AVL tree requires at most a double rotation C. Deletion of an element may require O(log n) rotation D. None of these
GateAspirant999
asked
in
DS
Apr 26, 2016
by
GateAspirant999
1.4k
views
data-structures
avl-tree
0
votes
1
answer
4893
What is the notion of k in a k-nary tree? Basically, what is the meaning of a k-nary tree?
MohammedSunasra
asked
in
DS
Apr 26, 2016
by
MohammedSunasra
659
views
9
votes
3
answers
4894
ISRO-2013-9
In an array of $2N$ elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-ordered? $1$ $2$ $N/2$ $2N - 1$
makhdoom ghaya
asked
in
DS
Apr 25, 2016
by
makhdoom ghaya
9.1k
views
isro2013
array
5
votes
2
answers
4895
ISRO-2013-4
The following steps in a linked list p = getnode() info(p) = 10 next (p) = list list = p result in which type of operation? Pop operation in stack Removal of a node Inserting a node Modifying an existing node
makhdoom ghaya
asked
in
DS
Apr 25, 2016
by
makhdoom ghaya
6.6k
views
isro2013
linked-list
10
votes
2
answers
4896
ISRO-2013-2
The number of rotations required to insert a sequence of elements $9, 6, 5, 8, 7, 10$ into an empty $AVL$ tree is? $0$ $1$ $2$ $3$
makhdoom ghaya
asked
in
DS
Apr 25, 2016
by
makhdoom ghaya
8.4k
views
isro2013
data-structures
avl-tree
11
votes
2
answers
4897
ISRO-2013-1
Let $A(1:8, -5:5, -10:5)$ be a three dimensional array. How many elements are there in the array $A$? $1200$ $1408$ $33$ $1050$
makhdoom ghaya
asked
in
DS
Apr 25, 2016
by
makhdoom ghaya
7.8k
views
isro2013
array
easy
0
votes
2
answers
4898
UGC NET CSE | December 2013 | Part 2 | Question: 20
The correct way to round off a floating number x to an integer value is y = (int) (x + 0.5) y = int (x + 0.5) y = (int) x + 0.5 y = (int) ((int)x + 0.5)
Sanjay Sharma
asked
in
Programming in C
Apr 25, 2016
by
Sanjay Sharma
4.5k
views
ugcnetcse-dec2013-paper2
7
votes
1
answer
4899
GATE CSE 1992 | Question: 10b
Show the activation records and the display structure just after the procedures called at lines marked $x$ and $y$ have started their execution. Be sure to indicate which of the two procedures named $A$ you are referring to. Program Test; Procedure A; Procedure B; Procedure A; begin …… end A; begin y: A; end B; begin B; end A; begin x: A; end Test
go_editor
asked
in
Programming in C
Apr 24, 2016
by
go_editor
1.6k
views
gate1992
parameter-passing
programming
runtime-environment
normal
descriptive
1
vote
1
answer
4900
Postorder traversal after creating AVL tree
The tree given is as follows: 30 / \ 12 45 \ 18 Insert: 10,15,40,20,22 Which one of the following is the postorder traversal of the resultant tree? (A) 10,15,13,20,22,30,45,40,18 (B) 10,15,12,20,30,22,45,40,18 (C) 10,15,12,20,30,22,45,18,40 (D) None of these
GateAspirant999
asked
in
DS
Apr 23, 2016
by
GateAspirant999
5.1k
views
data-structures
avl-tree
binary-search-tree
24
votes
3
answers
4901
GATE CSE 2009 | Question: 60
Consider a binary max-heap implemented using an array. What is the content of the array after two delete operations on $\left\{25,14,16,13,10,8,12\right\}$ $\left\{14,13,12,10, 8\right\}$ $\left\{14,12,13,8,10\right\}$ $\left\{14,13,8,12,10\right\}$ $\left\{14,13,12,8,10\right\}$
go_editor
asked
in
DS
Apr 23, 2016
by
go_editor
8.6k
views
gatecse-2009
data-structures
binary-heap
normal
1
vote
4
answers
4902
AVL Tree insertion
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,65,42 in above tree. (A) 2 (B) 3 (C) 4 (D) None of these
GateAspirant999
asked
in
DS
Apr 23, 2016
by
GateAspirant999
3.8k
views
data-structures
avl-tree
73
votes
10
answers
4903
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
go_editor
asked
in
DS
Apr 21, 2016
by
go_editor
27.0k
views
data-structures
hashing
normal
gatecse-2010
46
votes
4
answers
4904
GATE CSE 2012 | Question: 49
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += ++b ... $\begin{array}{ll} \text{4} & \text{2} \\ \text{4} & \text{2} \\ \text{2} & \text{0} \\ \end{array}$
go_editor
asked
in
Programming in C
Apr 21, 2016
by
go_editor
10.1k
views
normal
gatecse-2012
programming-in-c
programming
35
votes
4
answers
4905
GATE CSE 2013 | Question: 51
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$, while their respective replacement characters are supplied in array $newc$. ... will be successful in exposing the flaw in this procedure? None $2$ only $3$ and $4$ only $4$ only
go_editor
asked
in
DS
Apr 21, 2016
by
go_editor
5.3k
views
gatecse-2013
data-structures
array
normal
0
votes
1
answer
4906
What is the problem with this program?
The following program seg-faults (crashes) when user supplies input as ‘freeze’ while it works fine with input ‘zebra’. Why? #include<stdio.h> int main(int argc, char *argv[]) { char *ptr = (char*) ... printf("\n String contains 'z'\n"); // Do some more processing } free(ptr); } return 0; }
shivani2010
asked
in
Programming in C
Apr 21, 2016
by
shivani2010
277
views
programming-in-c
0
votes
1
answer
4907
What is the problem with this code?
#include<stdio.h> int main() { char arr[10]; memset(arr,0,sizeof(arr)); gets(arr); printf("\n The buffer entered is [%s]\n",arr); return 0; }
shivani2010
asked
in
Programming in C
Apr 21, 2016
by
shivani2010
290
views
programming-in-c
31
votes
2
answers
4908
GATE CSE 1991 | Question: 14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case time complexity of your procedure?
Akash Kanase
asked
in
DS
Apr 18, 2016
by
Akash Kanase
3.0k
views
gate1991
normal
data-structures
binary-tree
time-complexity
descriptive
20
votes
3
answers
4909
GATE CSE 1991 | Question: 14,b
Consider the binary tree in the figure below: Give different steps for deleting the node with key $5$ so that the structure is preserved.
Akash Kanase
asked
in
DS
Apr 18, 2016
by
Akash Kanase
3.5k
views
gate1991
data-structures
binary-tree
normal
descriptive
0
votes
2
answers
4910
What will be the output, Please explain?
void f(int n){ if(n <= 1){ printf("%d", n); } else{ f(n/2); printf("%d", n%2); } }
shivani2010
asked
in
Programming in C
Apr 18, 2016
by
shivani2010
509
views
programming-in-c
functions
Page:
« prev
1
...
240
241
242
243
244
245
246
247
248
249
250
...
309
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
Recent 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