-
Arrays Vs Linked List
Among arrays and linked list, which one is easiest to imlement and why?
-
How to find the loop in singly linked list
If we are having the singly linked list then last node of the list is linked with middle (or) any node in the list then it causes the loop then how to find the loop with less time complexity
Rahul_Sharma
- Sep 4th, 2011
Method 1.check the node pointed to by the outer loop, with every node of the inner loop. Method2. Have a visited flag in each node of the linked list. Flag it as visited when you reach the node. When...
prasanjeet
- Aug 25th, 2011
Take 2 pointers (say p & q) pointing to the start of the list. Increment p by one and q by 2 till p and q points to the same node (in case of loop) or one of them reaches the end (in case of no loop).
-
What is the difference between declaration and definition?
ashok reddy chenikala
- Aug 31st, 2011
Declaration means just identify the datatype and some memory allocation. If we print the value it gives garbage value.
Definition means declaration and assign some value to that variable. i.e. definition = declaration + initialization.jontyrodes
- May 9th, 2008
Definitionint * ii is definitionsince we can store a address without allocating memory*i is definition since we can assign *i = 4 ;Definitionchar *cc is definition since it can store a address of a ch...
-
Each entry in a link list is called a node TRUE or FALSE ?
shiksha
- Aug 28th, 2011
Yes each entry in a link list is called node and this node consist of two parts-info, and next add.
-
What are the various kinds of sorting techniques? Which is has least worst case?
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
akshay
- Aug 25th, 2011
BUBBLE SORT:
Code- BUBBLE SORT:
- #include<iostream.h>
- #include<string.h>
- #include<math.h>
- #include<stdlib.h>
- "Enter number of elements:""Enter no's: ""Sorted list is:"
vinod148
- Oct 23rd, 2009
HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave
Without using /,% and * operators. write a function to divide a number by 3.
Alok Mishra
- Aug 4th, 2011
"c #include #include void main() { int i,n; float m,j=0; clrscr(); printf("enter the no"); scanf("%d",&n); if(n==1) { m=0.3333; printf("%f",m); } if(n==2) { m=0....
Satish Anjaneyappa
- Apr 8th, 2011
Int quoitent=-1, rem=0;int number;while(number>=0){ rem=number; quoitent +=1; //quoitent= quoitent+1; number -=3; //number=number-3;}
Reverse Single Linked List
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;
}
}Sorting algorithms
Which is the best sorting algorithm and why? I know again that it depends on the implementation but how do you select that a particular one is the best one to implement. In other words what are the factors for selecting a sorting algorithm?
Shrima Baskar
- Jul 26th, 2011
the best sorting algorithm is quick sort as it is O(nlogn) and will be able to process the input data fast even in case of very large n. In case of small n ,insertion sort is best and when the range o...
Priority Queue
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
- 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 ...
What are real time usage of session parameters and variables ?
Where we should use this session parameters and how should use them
DS Trees
Is it possible to implement trees using arrays ? If yes, how?
hrshksh
- May 9th, 2010
This questions is ambigious. There are a lot of differences between a tree, k ordered tree, binary tree. There is no harm for any implementation to have array or list as the desired mode of implementa...
What is the total number of spanning trees ?
The total number of spanning trees that can be drawn using five labelled vertices is: A)125 B) 64 C)36 D)16
Linked List
Write a program of Linked List using pointers.
sid0812
- Nov 11th, 2010
import java.io.*;class node { public int info; node next; }class link { node head; public void initialize() { n...
Function f(x) is continuous
The function f(x) is continuous in [0,1], such that f(0)=-1, f(1/2)=1 and f(1)=-1, We can conclude that 1. f attains the value zero at least twice in [0,1] 2. f attains the value zero exactly once in [0,1] 3. f is non-zero in [0,1] 4. f attains the value zero exactly twice in [0,1]
zeptov
- Nov 7th, 2010
Colloquially, "continuous" means that you can graph it without picking up your pencil. What you can't tell is whether f(x) crosses the axis lots, or just twice.If the function were disco...
Ashish.Shekhar
- Feb 24th, 2008
Another way to look at the solution would be to just draw a mental plot of the given values on x and y axis and it would be easy to see that the graph would cut the x axis twice hence two zero's
Which of the following is not primitive recursive but computable ?
which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded function 4. Ackermann function
What is a void pointer?
maheshnarala
- Jul 10th, 2010
A void pointer is a pointer that points nothing,it is also called generic pointer as we can type cast it to any pointer type.
bputhal
- Mar 25th, 2009
Void is generic pointer.Example void * vp;int *ip;char * cp;vp = ip;//okvp = cp;But viceversa not allowed.ie ip = vp; not allowed
What are the different Abstract Data Type Groups?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) Integer, Floating-Type, Character & Boolean are the four different data type groupsExplanation: You determine the amount of memory to reserve by determining the appropriate abstract data type group to use and then deciding which abstract data type within the group is right for the data. The different abstract data type groups are Integer, Floating-Type,...
sonia_mehta
- Jul 6th, 2010
Well.. lets differentiate ADT and data structures.....ADT is logical description.. like, interger.. We only know type of operations it can perform (+, *, -, +....).. we dont know anything about implem...
What is the difference between function templates and function overloading?
prabhuvinoth
- Jun 29th, 2010
Function templates makes the function to performs the same task for different data type.Function overloading makes the function to performs different task for different parameters you are passing.
sureshds
- Dec 26th, 2009
In both cases function name is same.But, during function overloading, the function signature is different. Signature is like type of arguments, number of arguments and orderof arguments.For templates the signature is same and ready to accept any kind of data. There is no restriction on type of data.
Lint
What is Lint a) a compiler b) a interactive debuggerc) a cinterpreter d) a tool for analysing C++ program
sanket.ashu
- Jun 28th, 2010
Lint is a computer programming tool that performs the lexical and syntactic portions of the compilation with substantial additional checks, noting when variables had been used before being set, when t...
Equivalent Pointer Expression
What is the equivalent pointer expression for referring the same element a[i][j][k][l]
KS111
- Jun 21st, 2010
Similar to what Shekhar has already mentioned, with a small correction:To print the value of a[i][j][k][l], we need to use *(*(*(*(a+i) + j) + k) + l).Explanation:Let us first take a simple example of...
Ans