Select one:
O(1+dv)
O(n)
O(1)
O(dv)

Jenny

• May 10th, 2017

O(1+dv)

jagadish dachepalli

• Jun 2nd, 2016

Can you explain it?

Answer Question  Select Best Answer

A multi-way search tree has n items. The number of external nodes is Select one:

a) n2
b) logn
c) n
d) n+1

Jenny

• May 10th, 2017

N+1

Haneesha

• Oct 15th, 2015

N+1

Answer Question  Select Best Answer

n be the number of nodes and m be number of edges in a graph.

The number of edges in any undirected connected graph is at least
Select one:
a) n
b) n-1
c) None of the above
d) n(n-1)/2

Jenny

• May 10th, 2017

N-1

SHABNAM

• Mar 24th, 2016

N-1

Answer Question  Select Best Answer

Select one:
None of the above
5
4
10

Jenny

• May 10th, 2017

None of the above

Babuns

• Sep 9th, 2016

10

Answer Question  Select Best Answer

Let A be an adjacency matrix of a directed graph in G. Then sum of all entries in the matrix is equal to
Select one:

a) twice the number of vertices in G
b) the number of edges in G
c) the number of vertices in G
d) twice the number of edges in G

Jenny

• May 10th, 2017

No. edges in graph G

Piyush Goyal

• Jan 24th, 2016

B) the number of edges in G

Answer Question  Select Best Answer

Skill/Topic: ArrayA) A multidimensional array can be useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an array, a multidimensional array can store memory addresses of data in a pointer array and an array of pointers

jr ternko

• Dec 20th, 2016

It is used to store data in tabular form.

samiksc

 Profile Answers by samiksc Questions by samiksc

• Jan 19th, 2006

Multidimensional arrays are used to store information in a matrix form -- e.g. a railway timetable, schedule cannot be stroed as a single dimensional array.You may want to use a 3-D array for storing height, width and lenght of each room on each floor of a building.

Answer Question  Select Best Answer

Your job is to build a data structure to maintain a set of photographs. Your photograph database should allow you to insert and search for photographs, as well as to designate some of the photographs as favourites by marking them. In more detail, your data structure should support the following operations:

Insert(x, t, m): inserts photograph x that was taken at time t. If m = 1, then the...

neha

• Oct 12th, 2016

We can maintain the photograph database with the help of the binary tree data structure in which each node represents the photograph and to mark the favorite photograph we can use the flag variable which gets incremented on each favorite photograph.

Answer Question  Select Best Answer

Select one:
4
None of the above
5
10

Harsh Gupta

• Feb 20th, 2016

N^2+9n is O(nn), if n^2+9n

sowbarnika

• Feb 10th, 2016

None of the above

Answer Question  Select Best Answer

aahwini m

• Feb 8th, 2016

Quicksort is faster than bubble sort and the main difference is time complexity.

Aqan12

 Profile Answers by Aqan12 Questions by Aqan12

• May 26th, 2010

Bubble sort is a very simple algorithm which compares two neighbouring elements and swaps them if they are not in the right order.   In a worst case scenario when the list is alrea...

Answer Question  Select Best Answer

Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above

keben

• Jun 1st, 2015

C. Queues

Master

• Feb 26th, 2015

C

Answer Question  Select Best Answer

You have a 100-story building and a couple of marbles. You must identify thelowest floor for which a marble will break if you drop it from this floor. How fastcan you find this floor if you are given an infinite supply of marbles? What if youhave only two marbles?

Tyler

• May 20th, 2015

Start at floor 10. If the marble breaks start at 1. If it Doesnt go to 20: repeat for 11-19, and Repeat the process for 30,40,... to 100. Max amount of Drops will be 19: at 91. Up all the way to 100(10 drops) and 9 floors down(9 drops)

lily

• Apr 15th, 2015

With 2 marbles: Go to floor 50. If the marble breaks, go to floor 1 then floor 2 and so on up to floor 49 or until your marble breaks. Then the solution is the previous floor. If the marble doe...

Answer Question  Select Best Answer

Consider the following statements about (2,4) trees

I) height of (2,4) tree storing n items is O(log n)

ii) Fusion operation takes constant time

iii)Deletion operation takes O(n) time
Select one:

> All of them are true
> All of them are false
> i, ii are true and iii is false
> i is true and ii, iii are false

What are the areas in which asynchronous counter and synchronous counter are used.... give atleast one example of each or more

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) OneB) ZeroC) -1D) None of the above

laxmanavasu

• Mar 11th, 2015

B)Zero

Softwaredeveloper

 Profile Answers by Softwaredeveloper Questions by Softwaredeveloper

• Mar 27th, 2010

No, the answer is zero

Answer Question  Select Best Answer

Select one:
O(n)
O(n²)
O(nlog n)
None of the above

dontangryme

• Mar 9th, 2015

O(nlogn)

Answer Question  Select Best Answer

Select one:
O(n)
O(log n)
O(n²)
O(n log n)

B.V. KUMAR

• Feb 10th, 2015

O(n)

Answer Question  Select Best Answer

The following letter sequence was generated by using a postorder traversal of a complete binary tree T. d e b f g c h What is the root of this tree?

Select one:
h
d
None of the above
f

KLA

• Feb 10th, 2015

H

Answer Question  Select Best Answer

Why cant we use associtive array as column values in a table ?

Write a progrm to stimulate timer of an online test. Us special library functions to prompt the reamining time to user and terminate the test after the time expires.