-
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...
-
Array vs Linklist
List out the differences between an array and a linklist data structure.
KS111
- Jun 21st, 2010
1. The allocation of array elements in memory is contiguous. Each element in a Linked list can be placed anywhere in the memory.2. Once defined, array size cannot be modified. In a linked list size ca...
rumesh.cse
- Jun 10th, 2010
In liknked list insertion and deletion can be done anywhere in the structure, since the previous and next elements in the structures are linked to each other.Whereas in arrays, there is no link betwee...
-
The Data type of a declaration statement tells how much _____ to reserve and the kind of ______ that will be stored in that ______ location.
Skill/Topic: Variables and PointersA) Memory, Data, MemoryExplanation: The Data type of a declaration statement tells how much memory to reserve and the kind of data that will be stored in that memory location
-
Why does the StackLinkedList class inherit the LinkedList class?
Skill/Topic: Stacks using Linked ListA) StackLinkedList class uses different attributes and member functions of the LinkedList class.B) StackLinkedList class uses same attributes and member functions of the LinkedList class.
Softwaredeveloper
- Mar 27th, 2010
The StackLinkedList class inherits the LinkedList class because the StackLinkedList class uses attributes and member functions of the LinkedList class
abhirup_ju
- Jan 21st, 2008
Actually the stack class does not inherit linked list class. If inheritence exists then insertbefore() , insertafter(), insertstposition(), deletenode().... these functions will be available in the st...
-
Hierarchical Relationship Between Elements
To represent hierarchical relationship between elements, which data structure is not suitable?a. Dequeb. Priorityc. Treed. All of above
Piyush Verma
- Mar 26th, 2010
Both tree and priority has hierarchical relationship because there is parent child relationship in tree and in priority based higher priority element goes to high level.Dequeue has no hierarchy because traversal is possible in both direction.
saqibja
- Mar 1st, 2010
Only tree has the notion of parent child relationship, other data structures listed here do not have that.
-
Deleting Data Elements
Which data structure allows deleting data elements from front and inserting at rear?a. Stacksb. Queuesc. Dequesd. Binary search tree
gangabyndoor
- Mar 21st, 2010
It is Queues only. In Queues Insertion take place from rear end and deletion take place from front end.
-
Dynamic Inserting and Deleting
Which data structure is used for inserting and deleting dynamically?
stealth
- Mar 2nd, 2010
Dynamic insertion and deletion works well with Lists (like a doubly linked list)(also mentioned in the previous answer)The problem gets incremented this way;Insertion at a particular location; should ...
PPreksha
- Dec 15th, 2009
Linked lists are best suited for Dynamic insertion and deletion.. as an element can be added at any point in the list with O(1).
-
Static Queue Items
Write an algorithm to calculate the number of items in a static queue?
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
- Sep 23rd, 2009
[F=front, R=rear, P= pointer, q[] is the array variable] Algorithm: if F != R P= F count = 0 &...
-
Explain about Linear and Nonlinear data structures
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
- Oct 23rd, 2009
Linear: May not need pointers to access Need more time for searching than non-linear Easier to access Non-linear: &nb...
-
Pointer as Functions
How a value can be accessed through an address?How pointers can be used a funtions?
PPreksha
- Dec 15th, 2009
A value can be accesed through its address by use of pointers..Assigning any element as int x=10;int *p=&x;assigns the address of 'x' to pointer 'p'A pointer can be used as a funct...
-
What does the symbol * signifies?
Skill/Topic: Variables and PointersA) Tells the computer that you are declaring a pointerB) Tells the computer that you are declaring a variableC) Both a) and b)D) None of the aboveExplanation: The symbol * Tells the computer that you are declaring a pointer
Zalmodegikos
- Dec 5th, 2009
Seeing as a pointer is a variable, answer C might be a good bet.However, it's obvious that the question needs clarification.
-
Double Linked List
Make a middle node of doubly link list to the top of the list.
kronos
- Nov 17th, 2009
node *n1,*n2;n1 = n2 = head;while((n2->next) && (n2->next->next)){ n1 = n1->next; n2 = n2->next->next;]// n1 points to the mid...
f2003062
- Aug 19th, 2009
Lets say if the middle node of the doubly linked list is "middle" and the start node is "head".then the code as follows.middle->prev->next = middle->next;middle->next-&...
-
Data Structure - character that repeats itself
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
- 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
- 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 ...
Data Structures Interview Questions
Ans