-
-
What are the advantages of a database approach compared to a flat file system?
kranth.pothuganti
- Sep 15th, 2009
There are many advantages with database approach compared to a flat file system. Some of them are: 1) It's not possible to implement relationships between files in filesystem.2) Controlled redundancy...
gurjot911
- Mar 5th, 2009
A flat file is a kind of approach to a database system. I think the question should have been advantages of relational system on a flat file system.In that case it would be straight forward as a relat...
-
Signed numbers do not have any impact on the memory .
Skill/Topic: Memory, Abstract Data Types, and AddressesA) TrueB) FalseExplanation: The sign takes up 1 bit of memory that could otherwise be used to represent a value. For example, a byte has 8 bits, all of which can be used to store an unsigned number from 0 to 255. You can store a signed number in the range of –128 to +127.
zzdobrusky
- Sep 9th, 2009
True: signed numbers just use 2's complement format, both signed and 2's complement take the same amount of memory. The information about the sign is just hidden in algorithm of 2's comple...
samiksc
- Jan 19th, 2006
(B) False: Sign of the number is the first bit of the storage allocated for that number. So you get one bit less for storing the number. For example if you are storing an 8-bit number, without sign, t...
-
Boolean Expression
The boolean expression X + XY equals 1. X + Y2. Y + YX3. XY + YX4. None of these
rohini.nitd
- Aug 17th, 2009
X+XY=X(1+Y)from boolean properties we know that 1+Y=Yso X+XY=Xnone of these is answer.
-
Binary Tree Node Data Structure
Explain What is a node data structure Write a function such that the node data structure to visit all of the nodes in a binary tree?
ravi6771
- Aug 12th, 2009
Struct node{int datastruct node *next;}*root;int count=0;void count(struct node *nd){if(nd!=NULL){count(nd->left);count++;count(nd->right);}}call count(root) which give the count in count variable.
-
Elements of an array are stored _______ in memory.
Skill/Topic: ArrayA) PeriodicalB) SequentiallyC) ParallelyD) None of the aboveExplanation: Elements of an array are stored sequentially in memory. For example,First, create an array called letters and assign characters to it, as shown here: char letters[3];letters[0] = 'C';letters[1] = 'B';letters[2] = 'A';In this, each letter appears one after the other in memory. This is because these values are...
bahwesh
- Feb 21st, 2006
basically elements are stored in contineous memory lacations, but as per need we can also store them in chunks of memory. by making use of link list. various other techniques can also be used
-
Memory Reservation
How is memory reserved using a declaration statement?
clickankit4u
- May 31st, 2009
When you delare any variable it is assigned in the data segment.Data Segment (data+bss+heap)stackand this is so memory is reserved.
-
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...
-
Data structures questions
I had following question paper for data structures on 29th Oct, 2007. There were total 10 questions in the engineering paper to be done in 1 hr. I remember only 9 of those:1. A binary search tree was given. Tell the 4th smallest value in it.2. An infix expression was given. Draw a binary tree and write it in prefix/postfix notation.3. A stack has to be implemented. Following methods are given: PUSH[value]...
manishmodgil
- Dec 28th, 2007
First Question's Ans :Create a FIFO list of 4 digits.start from the root of the BST and keep on insrting the nodes in the FIFO till either there is no left subtree of the BST is left and the FIFO ...
-
Polymorphic Data Type
What is Polymorphic Data Type? Give example
gurjot911
- Mar 5th, 2009
Polymorphic data type is implemented using generic pointers that stores a byte address and not the type of data stored in that memory address. so a polymorphic data type can take on any type of value ...
-
_____________ Memory is Volatile.
Skill/Topic: Memory, Abstract Data Types, and AddressesA) CacheB) Random AccessC) VirtualD) MainExplanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.
-
-
The removeNode() requires a reference to the node that is to be removed.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False
vengatesh_26
- Jan 5th, 2009
Yes, We need to change previous pointer value to next node's pointer value.
-
__________ Method removes the value from the top of a stack?
Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: The pop() member method removes the value from the top of a stack, which is then returned by the pop() member method to the statement that calls the pop() member method.
-
Each entry in a linked list is called a _______.
Skill/Topic: Linked ListA) LinkB) NodeC) Data structureExplanation: Each entry in a linked list is called a node. Think of a node as an entry that has three subentries. One subentry contains the data, which may be one attribute or many attributes. Another points to the previous node, and the last points to the next node. When you enter a new item on a linked list, you allocate the new node and then...
-
scanf("%s",&A.name);
printf("Enter your age: ");
scanf("%d",&A.age);
printf("Name=%s Age=%d",A.name,A.age);
}">What would be the output of the following progam?union check{ char name[10]; int age;}A;void main(){ printf("Enter your name: "); scanf("%s",&A.name);printf("Enter your age: "); scanf("%d",&A.age);printf("Name=%s Age=%d",A.name,A.age);}
contact.nidhigupta
- Feb 19th, 2008
Since it is a union so both age and name will share same storage area. output will actually depend which data member was modified last. So in this case, since age is the last to be modified (entered), so name will come as character value of age.
-
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
-
Performance of Algorithm
Explain how performance of algorithm is analysed?
samik mukherjee
- Jul 1st, 2008
The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space com...
-
What is a Register?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) A register is a small amount of memory within the CPU that is used to temporarily store instructions and data.Explanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.
chitraadevi
- Jun 1st, 2008
Register is a storage area.which is represented by the amount of flip flops.
deepak
- Aug 24th, 2007
Register basically a group of flip flop . flip flop is the single bit storage cell or it is the smallest memory? cell .so register is no of flip flop arranged in sequence, if there is 5 flip flop then register is called 5 bit register .
-
Recursive Algorithm
Explain how recursive algorithm is converted into recurrence relation with example.
riteshja88
- Feb 27th, 2009
Say we want to represent the following recursionint recurse(int a){ ? ? ? return a+recurse(a-1);}x={x|x=a(a+1)/2} for all a
Data Structures Interview Questions
Ans