Recent questions tagged go-ds-1

4 votes

1 answer

1

GATE Overflow | Data Structures | Test 1 | Question: 30
In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure for finding this? Linked List Array Dynamically growing Array Set

Arjun asked in DS Oct 10, 2016

by Arjun

756 views

1 vote

2 answers

2

GATE Overflow | Data Structures | Test 1 | Question: 29
Which of the following is false? Arrays are better than linked lists for sorting due to better data locality. Asymptotic time complxity for FindMax is same on an unsorted array as that on a singly linked list. A doubly linked list ... as of a singly linked list. Given a fixed maximum size, a circular queue is preferrable to a normal queue

Arjun asked in DS Oct 10, 2016

by Arjun

877 views

2 votes

2 answers

3

GATE Overflow | Data Structures | Test 1 | Question: 28
What would be an appropraite data structure to represent family hierarchy where each node is an individual and there in no requirement to keep "married to" relationship? Binary Tree n-ary Tree Graph Linked List

Arjun asked in DS Oct 10, 2016

by Arjun

720 views

0 votes

3 answers

4

GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______

Arjun asked in DS Oct 10, 2016

by Arjun

643 views

5 votes

1 answer

5

GATE Overflow | Data Structures | Test 1 | Question: 26
Consider a stack with 100 elements present. Suppose in a scenario, we are required to remove the first inserted element in it, which is done by POP operations followed by PUSH operations with intermediate elements ... $10$ such removals, without anyother intermediate PUSH/POP operations, total number of PUSH operations required is ______

Arjun asked in DS Oct 10, 2016

by Arjun

1.1k views

1 vote

2 answers

6

GATE Overflow | Data Structures | Test 1 | Question: 25
Consider the following nested representation of Binary Trees. $(ABC)$ indicates $B$ and $C$ are left and right subtrees of node $A$ respectively. Note that $B$ and $C$ may be NULL or further nested. Which of the following representation is not a valid Binary tree? (1 2 3) (1 (2 3 4) (5 6 7)) (1 (1 (1 1 1) (1 1 1)) (1 1 1)) (1 (2 3) 4)

Arjun asked in DS Oct 10, 2016

by Arjun

480 views

5 votes

3 answers

7

GATE Overflow | Data Structures | Test 1 | Question: 24
You are given a linked list, $L$ of $n$ integers, and another linked list, $P$, of $k$ integers where $k <<< n$. $L$ is sorted in ascending order but $P$ is not necessarily sorted. The operation $\text{print_lots}(L,P)$ will ... space is available) ______________ ? $\Theta(n)$ $\Theta(n \log k)$ $\Theta(n k)$ $\Theta (n k\log k)$

Arjun asked in DS Oct 10, 2016

by Arjun

1.0k views

0 votes

2 answers

8

GATE Overflow | Data Structures | Test 1 | Question: 23
Consider the following declaration of a two dimensional array in C: char a[1000][40]; Assuming that the main memory is byte addressable and that the array is stored starting from address 0, the address of a[40][10] is _____

Arjun asked in DS Oct 10, 2016

by Arjun

535 views

2 votes

2 answers

9

GATE Overflow | Data Structures | Test 1 | Question: 22
A function $f$ defined on stack of integer satisfies the following properties: $f(\{\}) = 1$ and $f(PUSH(S,i)) = \max (f(S),1) * i$ for all stacks $S$ and integer $i$. If a stack $S$ contains the integers $4, -2, 9$ in order from bottom to top, what is $f(S)$?

Arjun asked in DS Oct 10, 2016

by Arjun

749 views

0 votes

2 answers

10

GATE Overflow | Data Structures | Test 1 | Question: 21
A vertex having no incident edge is called --------- pendent vertex end vertex isolated vertex none of these

Arjun asked in DS Oct 10, 2016

by Arjun

577 views

2 votes

3 answers

11

GATE Overflow | Data Structures | Test 1 | Question: 20
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____

Arjun asked in DS Oct 10, 2016

by Arjun

616 views

1 vote

2 answers

12

GATE Overflow | Data Structures | Test 1 | Question: 19
What is the chromatic number of the following graph?

Arjun asked in DS Oct 10, 2016

by Arjun

473 views

3 votes

1 answer

13

GATE Overflow | Data Structures | Test 1 | Question: 18
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___

Arjun asked in DS Oct 10, 2016

by Arjun

519 views

4 votes

2 answers

14

GATE Overflow | Data Structures | Test 1 | Question: 17
In a class examination marks was out of 100 and there were only 1 or 2 mark questions with total 70 questions and pass mark being 36. In order to find the most repeating total mark among passed students, the appropriate data ... An array of 100 numbers An array of 70 numbers An array of 65 numbers A dynamically allocated array of 100 numbers

Arjun asked in DS Oct 10, 2016

by Arjun

518 views

6 votes

5 answers

15

GATE Overflow | Data Structures | Test 1 | Question: 16
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. The worst case time complexity of the program is $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^2 \right)$ $\Theta\left(n^2 \log n \right)$

Arjun asked in DS Oct 10, 2016

by Arjun

1.1k views

0 votes

1 answer

16

GATE Overflow | Data Structures | Test 1 | Question: 15
The following numbers are inserted into an empty binary search tree in the given order: 1000, 452, 131, 15, 85, 75. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

Arjun asked in DS Oct 10, 2016

by Arjun

303 views

0 votes

1 answer

17

GATE Overflow | Data Structures | Test 1 | Question: 14
Consider the array given below: 20 10 9 8 7 6 5 It is a full binary tree in array representation a complete binary tree in array representation a max-heap in array representation all of the above

Arjun asked in DS Oct 10, 2016

by Arjun

289 views

6 votes

1 answer

18

GATE Overflow | Data Structures | Test 1 | Question: 13
When searching for the key value 30 in a binary search tree, nodes containing the key values 10, 20, 25, 35, 70, 80, 90, 100 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root node containing the value 30?

Arjun asked in DS Oct 10, 2016

by Arjun

738 views

1 vote

1 answer

19

GATE Overflow | Data Structures | Test 1 | Question: 12
What is the content of the array after two delete operations on the binary heap 10 5 8 4 3? 5 4 3 5 3 4 10 5 8 8 4 3

Arjun asked in DS Oct 10, 2016

by Arjun

457 views

1 vote

1 answer

20

GATE Overflow | Data Structures | Test 1 | Question: 11
Which one of the following array represents a binary max-heap? 20 13 4 11 3 12 2 20 13 4 12 11 3 2 20 13 4 3 2 12 11 20 13 4 12 3 11 2

Arjun asked in DS Oct 10, 2016

by Arjun

232 views

1 vote

2 answers

21

GATE Overflow | Data Structures | Test 1 | Question: 10
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____

Arjun asked in DS Oct 10, 2016

by Arjun

797 views

2 votes

3 answers

22

GATE Overflow | Data Structures | Test 1 | Question: 9
Which of the following statements is false? A tree with $n$ nodes has $n-1$ edges A labeled rooted binary tree can be uniquely constructed given its in-order and pre-order traversal results. A complete binary tree with $n$ internal nodes has $n+1$ ... tree of height $h$ is $2^{h+1} - 1$ where $h$ is the maximum distance of a node from root.

Arjun asked in DS Oct 10, 2016

by Arjun

1.1k views

0 votes

2 answers

23

GATE Overflow | Data Structures | Test 1 | Question: 3
Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $1, 2, 3, 4$ in that order? 3, 4, 1, 2 4, 3, 1, 2 1, 2, 3, 4 none

Arjun asked in DS Oct 10, 2016

by Arjun

491 views

3 votes

4 answers

24

GATE Overflow | Data Structures | Test 1 | Question: 8
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?

Arjun asked in DS Oct 10, 2016

by Arjun

783 views

2 votes

3 answers

25

GATE Overflow | Data Structures | Test 1 | Question: 7
A $2-3$ tree is a tree such that all internal nodes have either 2 or 3 children all paths from root to the leaves have the same length. The maximum number of nodes of a 2-3 tree having 9 leaves is ___

Arjun asked in DS Oct 10, 2016

by Arjun

1.1k views

0 votes

2 answers

26

GATE Overflow | Data Structures | Test 1 | Question: 6
In an administrative office it is required to keep track of the application requests. An applicant can push his application forward by paying extra money. What would be an appropraite datastructure for storing the applications? Stack Queue Linked Lists Priority Queue

Arjun asked in DS Oct 10, 2016

by Arjun

378 views

5 votes

4 answers

27

GATE Overflow | Data Structures | Test 1 | Question: 5
A stack is used to implement a priority queue where $ENQUEUE(Q, x, p)$ ($p$ denotes priority, higher the better) and $DEQUE(Q)$ are implemented by appropriate PUSH and POP operations such that $DEQUE(Q)$ happens in $O(1)$. ... second element denotes the priority. No. of POP operations required on the given stack for $ENQUEUE(Q, 2, 0)$ is _____

Arjun asked in DS Oct 10, 2016

by Arjun

1.1k views

0 votes

1 answer

28

GATE Overflow | Data Structures | Test 1 | Question: 4
The postfix expression for the infix expression $A + B*C/D +E$ is AB+*CD/E+ ABC*D/+E+ AB+C*D/E+ A+*BCD/E+

Arjun asked in DS Oct 10, 2016

by Arjun

413 views

4 votes

2 answers

29

GATE Overflow | Data Structures | Test 1 | Question: 2
For a singly linked list where each node has a pointer to a data array as well as a next pointer, what would be the worst case time complexity to delete an intermediate node $x$ (given a pointer to it)? $O(n)$ $O(1)$ $\Omega(n)$ $O(\log n)$

Arjun asked in DS Oct 10, 2016

by Arjun

1.5k views

2 votes

1 answer

30

GATE Overflow | Data Structures | Test 1 | Question: 1
The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1,2,3,4,5,6,7 in the given order. What will be the contents of the list after the function completes ... 2,1,3,4,5,6,7 2,1,4,3,6,5,7 1,3,2,5,4,7,6 2,3,4,5,6,7,1

Arjun asked in DS Oct 10, 2016

by Arjun

534 views

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 questions tagged go-ds-1

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Recent questions tagged go-ds-1

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments