Recent questions in Algorithms

0 votes

0 answers

1

ArjunS-1
What would be the worst case time complexity to build binary search tree with given arbitrary $n$ elements? $O(n \log n)$ $O(n)$ $O(n^{2})$ $O( \log n)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

2

ArjunS-2
An array of size $N$ contains $0’s$ followed by $1’s$. What is the worst case time complexity of best algorithm to find whether there are more number of $0’s$ or more number of $1’s$? $O(n \log n)$ $O(\log n)$ $O(n)$ $O(1)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

3

ArjunS-3
Consider the following exponential search algorithm(ES). The array of $n$ elements have to be searched is divided in to $ \log n$ parts. The $i^{th}$ part is from index $2^{i-1}$ to $2^{i}$. to search an element search all the parts one by one from left to right using ... case complexity of above searching algorithm? $\Theta(n \log n )$ $\Theta( \log n)^{2}$ $\Theta(\log n)$ $\Theta(n)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

4

ArjunS-4
Which of the following cannot be the intermediate sequence if we apply quick sort on $9,8,7,6,5,4,3,2,1$ ? Assume the pivot is always the first element $1,8,7,6,5,4,3,2,9$ $1,2,3,6,5,4,7,8,9$ $1,2,7,6,5,4,3,8,9$ $1,2,3,5,4,6,7,8,9$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

5

ArjunS-5
Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this: $2 \quad 5 \quad 1 \quad 7 \quad 9 \quad 12 \quad 11 \quad 10$. Which statement is correct? The pivot could be either the $7$ or ... not the $9$. The pivot is not the $7$, but it could be the $9$. Neither the $7$ nor the $9$ is the pivot.

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

6

ArjunS-6
What are minimum and maximum number nodes in a heap tree of height $h$? $2^{h}$ to $2^{h+1}$ $2^{h-1} +1$ to $2^{h}$ $2^{h}$ to $2^{h+1} -1$ $2^{h-1}$ to $2^{h+1}$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

7

ArjunS-7
int f(int n) { if (n == 0) return 1; return f(n-1) - n + f(n-1) + 2; } what is the output if $f(5)$ is called? $37$ $11$ $20$ $33$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

8

ArjunS-8
What is the time that is required to check whether given tree is binary search tree or not? $O(n)$ $O(nlogn)$ $O(logn)$ $O(n^2)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

9

ArjunS-9
Given an array of integers what is the worst case time complexity that would find pair of integers which are same? $O(n \log n)$ $O(n)$ $O(n^2)$ $O(n \log \log n)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

10

ArjunS-10
void main(){ char p[] = "GATEBOOK"; p=p+1; printf("%s",p); } What is the output of the program? It generates runtime error It generates compile time error $GATEBOOK$ $ATEBOOK$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

11

ArjunS-11
The no of different balanced parenthesizes possible with $n$ pairs of parenthesis? $\dfrac{^{2n}C_{n}}{n+1}$ $\dfrac{^{2(n-1)}C_{n-1}}{n}$ $(2n)!$ $n!$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

12

ArjunS-12
#include <stdio.h> typedef struct node { char data; struct node* next; } Node; Node* mystery(Node* root) { Node* new_root = 0; while (root) { Node* next = root->next; root->next = new_root; new_root = ... of the single linked list? list will remain same every two consecutive nodes from left to right are swapped reverses the linked list none of the above

asked Nov 18 in Algorithms by Counsellor (307 points) | 3 views

0 votes

0 answers

13

ArjunS-13
Given a binary tree what is the time complexity of finding height of the tree. Where $ \text{n = no of nodes}$ and $\text{h= height of the tree}$ $O(n)$ $O(h)$ $O(nh)$ $O( \log n)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

14

ArjunS-14
Suppose that an application have a huge number of insert operations, but only few delete max operations. Which priority-queue implementation would be most effective: $\text{Max heap}$ $\text{Unordered array}$ $\text{Ordered array}$ $\text{Binary search tree}$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

15

ArjunS-15
Suppose that a certain BST has keys that are integers between $1$ and $10$, and we search for $5$. Which sequence below cannot be the sequence of keys examined? $10, 9, 8, 7, 6, 5$ $1, 10, 2, 9, 3, 8, 4, 7, 6, 5$ $2, 7, 3, 8, 4, 5$ $1, 2, 10, 4, 8, 5$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

16

ArjunS-16
The number of binary search trees with $2n+1$ keys where median is the root? $\left (\dfrac{^{2n}C_n}{n+1}\right)^{2}$ $(n!)^{2}$ $(2n+1)!$ it depends on the values of the keys

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

17

ArjunS-17
If $T(0)=0$ and $T(1)=1$, each of the following recurrences for $n \geq 2$ defines a function $T$ on the nonnegative integers. Which of the following CANNOT be bounded by a polynomial function? $T(n) = 3T(\frac{n}{2})+n^2$ $T(n) = 4T(\frac{n}{2})+ n$ $T(n) = 2T(n-2) + 1$ $T(n) = T(n-1)+ n^2$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

18

ArjunS-18
int f () { int k, result; result = 0; for ( k = 0; k < 5; k++ ) { if ( ( k % 3 ) == 1 ) result = result + k; else result = result + 1; } return result; } What value is returned as a result of the call $f ()$ ? $5$ $6$ $7$ $8$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

19

ArjunS-19
Consider the following pseudocode program. int i; main () { i = 3; S (); R (); } void S () { print i; // prints the value of i on the current line of output print " " // prints a blank space on the current line of output } void R () { int i; i = 2; S (); } What is ... Dynamic scoping $3 \quad 2 : 3 \quad 2$ $3 \quad 3 : 2 \quad 2$ $3 \quad 3 : 2 \quad 3$ $3 \quad 3 : 3 \quad 2$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

20

ArjunS-20
void P1 (int x, int y, int z) { if ((x != 0) && ((y / x) == z)) z = z + 1; printf("x = %d" " y = %d" " z = %d",x,y,z ); } public void P2 (int x, int y, int z) { if (((y / x) == z) && (x != 0)) z = ... $P2(x, y, z)$ behave differently. For all $x$ and $z$, there exists $y$ such that $P1(x, y, z)$ and $P2(x, y, z)$ behave differently.

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

21

ArjunS-21
Consider the following directed graph. Which of the following is the time complexity of topological sort of a graph $G(V,E)$ $O(V+E)$ $O(V)$ $O(V+E)\log V$ $O(VE)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

22

ArjunS-22
if the expression $((2+3)* 4+5*(6+7)*8)+9$ is evaluated with $*$ having precedence over $+$ then the value obtained is the same as the value of the which of the following expressions? $+ + * + 2 3 4 * * 5 + 6 7 8 9$ $+ * + + 2 3 4 * * 5 + 6 7 8 9$ $* + + 2 3 4 * * 5 + + 6 7 8 9$ $* + + + 2 3 4 * * 5 + 6 7 8 9$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

23

ArjunS-23
Which of the following problem cannot be computed by DFS? finding connected components in directed graph finding shortest path in unweighted graph finding directed cycle in directed graph Finding a path from a source vertex to all other reachable vertices in directed graph

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

24

ArjunS-24
A dynamically growing array is implemented using fixed size array by following method. Initially $k$ element array is created using $malloc$ and then once it is full $2*k$ size array is created using $malloc$ and values in previously allocated array are copied in to new array and previously ... copy from previous array to new array is $\Theta(n)$ $\Theta(2^n)$ $\Theta(n!)$ $\Theta(n^2)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 views

0 votes

0 answers

25

ArjunS-25
int foo(int a, int b) { if (a%b == 0) return b; else return foo(b, a%b); } What is the output given by $foo(17, 3)$? $3$ $17$ $51$ $1$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

26

ArjunS-26
Closest pair of an array of integers is two values whose difference is no greater than the difference of any other pair in the array. The best algorithm to compute closest pair in the worst case is $\Theta(n)$ $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^3)$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

27

ArjunS-27
Maximum height an AVL tree can have with $77$ nodes $8$ $9$ $6$ $7$

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

28

ArjunS-28
A hash function $h$ maps $16-bit$ inputs to $8-bit$ hash values. What is the largest $k$ such that in any set of $1,000$ inputs, there are at least $k$ inputs that h maps to the same hash value? $3$ $4$ $10$ $64$

asked Nov 18 in Algorithms by Counsellor (307 points) | 0 views

0 votes

0 answers

29

ArjunS-29
A thief faces $0/1$ KNAPSACK problem. There are $7$ items to be packed into the knapsack, each with value $V_{i}$ and weight $W_{i}$ ...

asked Nov 18 in Algorithms by Counsellor (307 points) | 1 view

0 votes

0 answers

30

ArjunS-30
Consider messages made up entirely of vowels $(A, E, I, O, U)$ ... $100$ vowels? $225$ $300$ $250$ $232$

asked Nov 18 in Algorithms by Counsellor (307 points) | 2 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 in Algorithms

Recent Posts

Recent Blog Comments