-
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 ...
-
-
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 Interview Questions
Ans