-
Data Structures Link Conversion
How do you convert doubly linked list to single without using structures?
piyushbeli
- Apr 13th, 2009
Saynode{infonode lptr,rptr}main{node p;p=start;q=p->rptr;while(p!=Null){q->lptr=Null;p=q;q=p->rptr;}}
rama.sit07
- Nov 1st, 2008
Suppose you are given doubly linked list with starting adress as p, then program for converting doubly linked list into singly list is (this is not a program just an algorithm)?node structure is defi...
-
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...
-
What is the total number of equivalent relations that
What is the total number of equivalent relations that can be defined on the set (1,2,3)? 1. 8 2. 64 3. 5 4. 3
rajani_vaddepalli15
- Aug 7th, 2008
Equivalent relation = {(x,y)/x,y belong to the set and,x=y}The ans is 3,i.e,three equivalent sets
-
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
-
The process of transforming one bit pattern into
The process of transforming one bit pattern into another by bit-wise operations is called 1. masking 2. pruning 3. biting 4. chopping
manishmodgil
- Dec 28th, 2007
1. masking is AND operation to convert a preknown number of digits to 0 if these are the bits 101100110 and if 4 LSBs are to masked AND it with ...
-
Which of the following symbol table implementation is based on the property of locality of reference ?
1. Linear list 2. search tree 3. Hash table 4. self-organization list
-
-
-
If a function y=f ( x ) has an inverse function, then f ( x ) cannot be 1. symmetric about x-axis 2. an odd function 3. symmetric about y-axis 4. an even function
picop
- Dec 3rd, 2007
3. symmetric about y-axis
4. an even function
an even function is symmetric with y-axis. If this function is symmetric with y-axis, each y value has two corresponding x values. A function can only has its inverse function when each y value just correspond to only one x value. -
Fuzzy logic system rely on
1. Crisp binary choices
2. Ambiguous data
3. Decision makers
4. All of themSandhya.Kishan
- Jun 13th, 2012
Fuzzy logic system relays on all Crisp binary data, ambiguous data and on decision makers.
-
-
">
How to reverse a linked list without usinf any pointer of c?
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...
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
A Pointer is a Variable.
Skill/Topic: Variables and PointersA) FalseB) TrueExplanation: A pointer is a variable and can be used as an element of a structure and as an attribute of a class in some programming languages such as C++, but not Java. However, the contents of a pointer is a memory address of another location of memory, which is usually the memory address of another variable, element of a structure, or attribute of...
warisha
- Mar 18th, 2006
Yeh, we can call pointer as a variable .it is used in some languages which supports its use.the datatype of pointer is of ptr,and not of datatype of the variable to which it is pointing.
samiksc
- Jan 19th, 2006
Yes in the languages which support use of pointers, a pointer is a variable used to hold address of a memory location.
Char *ptGrade;Which is the data type in this declaration?
Skill/Topic: Variables and PointersA) The data type in this is CharExplanation: The data type of the memory address stored in the pointer is of Character type
s
- Jun 18th, 2006
The datatype is char * type that is the variable points to a location(stores the address of the location) which contains character type data
What is the purpose of the isEmpty() member method?
Skill/Topic: Stacks using an ArrayA) The isEmpty() member method determines if a value is at the top of the stack and is called before an attempt is made to remove the value
sivanesh.a
- Feb 6th, 2007
To check whether the stack is empty or not...if yes returns 1 else returns 0.
The keyword ___________ means that the attribute or member method is accessible only by a member method.
Skill/Topic: Stacks using an ArrayA) PrivateB) PublicC) Both a) and b)D) Neither a) nor b)Explanation: The keyword private means that the attribute or member method is accessible only by a member method. The instance of the class cannot directly access a private member of the class.
The ~Queue() member function is the Constructor ?
Skill/Topic: QueueA) TrueB) FalseExplanation: The ~Queue() member function is the destructor.It uses the delete operator to remove the array from memory when the instance of the Queue class goes out of scope.
What is the formula used to calculate the back of the queue?
Skill/Topic: QueueA) The back of the queue is calculated by using the following formula:back = (back+1) % size
Sandhya.Kishan
- Mar 26th, 2012
Back = (back+1) % size is the formula to calculate the back of the queue.
Ans