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

Given a string of characters (let us say there are about 100 characters or more in the string), what is the most efficient method to use for finding out the character that repeats itself the most?Is it possible for us to use some kind of data structure for this?, if this is so,which is the best one that needs to be used?

vinod148

 Profile Answers by vinod148 Questions by vinod148

• Oct 23rd, 2009

There is no way for less that O(n) solution as we have to traverse the string atleast once.By traversing only once we can find the solutionKeep another variable which tracks the current highest occured character.

pvsola

 Profile Answers by pvsola Questions by pvsola

• Apr 3rd, 2008

There is an way to solve this issue with complexity of O(n).1.  MAke an array size of 2562.  Using each charater read from the string as an index incremented the counter ...

Answer Question  Select Best Answer

How will you identify Stack Overflow?

prem waghmare

• Sep 11th, 2018

What is stack overflow and underflow condition with example?

ahatesham ahamed

• Jan 6th, 2018

How to minimize overflow in stack?

Answer Question  Select Best Answer

sureshds

 Profile Answers by sureshds Questions by sureshds

• Dec 26th, 2009

If the elements/nodes have a single successor and predecessor then the list is said to be linear.Stacks and queues are Linear.Linked lists are linear in terms of accessing and non-linear interms of storage.Trees and graphs are pure non-linear.?

vinod148

 Profile Answers by vinod148 Questions by vinod148

• Oct 23rd, 2009

Linear:      May not need pointers to access     Need more time for searching than non-linear     Easier to access Non-linear: &nb...

Answer Question  Select Best Answer

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

Skill/Topic: Variables and PointersA) A user-defined data type is a group of primitive data types defined by the programmer.

bhargavi

• Apr 24th, 2007

It is defined as collection of predefined data types or it can be a single predefined data type

bhargavi

• Apr 24th, 2007

A user defined data type  means collection of predefined data types

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) the new node is placed at the front of the linked list.B) the new node is placed at the back of the linked list.C) the new node is placed at the middle of the linked list.D) No Changes happens

samba.bbs@gmail.com

• Jun 24th, 2023

The new node is placed at the front of the linked list

Softwaredeveloper

 Profile Answers by Softwaredeveloper Questions by Softwaredeveloper

• Mar 27th, 2010

With a linked list Push: Insert at front of list. Pop: Remove from front of list.

Answer Question  Select Best Answer

Write an algorithm to calculate the number of items in a static queue?

rupaliverma.iti

 Profile Answers by rupaliverma.iti Questions by rupaliverma.iti

• Feb 13th, 2010

[F front R rear P pointer q[] is the array variable] Algorithm: if (F != R)P= Fcount =0 while(P <= R) {count count + 1;P P+1; }//Display count which shows number of element

boyanamadhavilatha

 Profile Answers by boyanamadhavilatha Questions by boyanamadhavilatha

• Sep 23rd, 2009

[F=front, R=rear, P= pointer, q[] is the array variable] Algorithm:      if F != R       P= F       count = 0     &...

Answer Question  Select Best Answer

What is the time complexity of adding three matrices of size NXN cell-by-cell?

Manish Yadav

• Oct 15th, 2011

Time Complexity of Adding Three Matrices because there is only two loop are needed for adding the matrix so complexity will be o(n^2), there is no effect for increase the number of matrix. it will be same for n number of matrix.

Code
 

sonia_mehta

 Profile Answers by sonia_mehta Questions by sonia_mehta

• Jul 6th, 2010

Program looks like......for(i=0;i<n;i++){ for(j=0;j<n;j++) {   result[i][j]=a[i][j]+b[i][j]+c[i][j]; }}loop will execute n*n times...and 2 add operations..if 1 add op takes 'c' time, thentotal time= 2*c*n*nthus, time complexity= n*n......

Answer Question  Select Best Answer

Skill/Topic: Linked ListA) by repointing the previous and the next elements of existing nodes to the new nodeB) by repointing only the next elements of existing node to the new nodeC) by repointing only the Previous elements of existing node to the new nodeD) None of the above Explanation: by repointing the previous and the next elements of existing nodes to the new node You can insert a node in the...

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Dec 28th, 2007

1. Identify where to be inserted.2. nxt pointer of the new node to the next node.3. nxt pointer of the previous node to the new node.Do consider spl. cases :1. to insert at the start of the list2. to insert at the end of the list

sri

• Nov 11th, 2007

Firstly,  create a temporary node say "temp"!!!so,    prev->link=temp;         temp->link=next;

Answer Question  Select Best Answer

Skill/Topic: TreeA) 8Explanation: You calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3

Shubh

• Nov 5th, 2018

ANS 8 is correct, 7 is not listed.

durga

• Apr 8th, 2015

But y v shld use 2^n or 2^n-2 formula only can any one give me the explanation

Answer Question  Select Best Answer

Skill/Topic: Memory, Abstract Data Types, and AddressesA) ShortB) IntC) floatD) longExplanation: The integer abstract data type group consists of four abstract data types used to reserve memory to store whole numbers: byte, short, int , and long

Naila

• Jun 2nd, 2017

(C) float

jdoe123

 Profile Answers by jdoe123 Questions by jdoe123

• Aug 6th, 2007

Float

Answer Question  Select Best Answer

Skill/Topic: Memory, Abstract Data Types, and AddressesA) The binary numbering system is used in computing because it contains 2 digits that can be stored by changing the state of a transistor. Off represents 0 and On represents 1.

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

Binary system is used based on 0 - off and 1 - on

mahesh

• Dec 12th, 2006

Because Internally data is stored in transisitor  and it can be turned on or off depending on the voltage level .1-ON0-OffHence data is stored as 1's and 0's

Answer Question  Select Best Answer

Skill/Topic: Variables and PointersA) 1B) 2C) 3D) 4

ahmarshi

 Profile Answers by ahmarshi Questions by ahmarshi

• May 19th, 2007

3 parts.  i. SCOPE (private/public/protected) ii. DATATYPE (int, short, long, byte, string, char, etc...)iii. VARIABLE NAMEe.g.private int id;private string name;

M.Ahmar

• May 19th, 2007

3 Parts.Scope (private/public/protected), DataType (integer, short, byte, string, etc...), Variable nameExamples:private int i;public string name;

Answer Question  Select Best Answer

Gaurav bisht

• Nov 9th, 2011

NULL pointer means- it points to nothing
whereas,void pointer refers to the fact that the pointer has no data type declared with it and it can be used to point variable of any data-type-int,float,etc..
ex-int*(void_ptr)

rohini.nitd

 Profile Answers by rohini.nitd Questions by rohini.nitd

• Aug 17th, 2009

NULL pointer says that it is not pointing to any object, but a VOID pointer says that it can point to any object.

Answer Question  Select Best Answer

Guest

• Jan 17th, 2007

We over load this operator this process is known as cascading

Ram

• Jan 12th, 2007

We can reload increment and decrement operators as we do the other operators. But incase of the preincrement or predecrement we take an argument in the operator definition,?which?identifies?whether?it?is?pre?or?post,?other?thing?are?same.

Answer Question  Select Best Answer

What is Priority Queue? Explain with example.

Suresh-Blore

• Jul 25th, 2011

Waiting queue may not operate on strictly first in first out basis,,but on some complex priority scheme based on such factors as what compiler is being used,the execution time required,number of print lines etc.The resulting queue is called Priority queue.

Vishesh Bibhay

 Profile Answers by Vishesh Bibhay Questions by Vishesh Bibhay

• Jul 9th, 2011

Hello!priority queue is a data structure which exhibits two properties1.structure property2.order propertyStructure property means that the queue will be a complete binary treeOrder property ...

Answer Question  Select Best Answer

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.a. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above

Shilpa chavare

• Sep 12th, 2011

Your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

A.input-restricted queue.

Answer Question  Select Best Answer

Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?

snyder

 Profile Answers by snyder Questions by snyder

• Mar 10th, 2012

Although you have to deal with the complexity but you curb many problems that the users may experience. For eg. imagine how much data is stored in the servers of facebook. . .its massive . . .and ye...

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

Complexity is at the user side in understanding not for the compiler.

data structure is a way of organising and using the memory effectively and efficiently.

Answer Question  Select Best Answer

How will you reverse a single linked list which consists of nodes a to z using recursion?

sasibhushan.m

• Jul 31st, 2011

Node* reverse_recursive(node *root)
{
if(root->link != NULL)
{
reverse_recursive(root->link);
root->link->link = root;
return (root);
}
else
{
head = root;
}
}

ilushka

 Profile Answers by ilushka Questions by ilushka

• Jul 29th, 2011

Lets see...

Code
 

Answer Question  Select Best Answer