-
-
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
-
The node in a single linked list can reference the previous node in the linked list.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A single linked list is a linked list consisting of nodes that have only the next element and not the previous element. This links the node to only the next node in the linked list. There is no way for the node to reference the previous node in the linked list
Vikram.N
- Sep 3rd, 2007
True: Only in the case of a circular linked list with two elements!
-
What is the use of fflush() function?
mswaroop
- Sep 5th, 2007
Suppose we read a sentence using scanf e.g. "My name is ABC" in a string.Printing this string using a printf statement prints "My".Go for another successive scanf.It...
-
QueueLinkedList class inherit the LinkedList class.
Skill/Topic: Queues Using Linked ListsA) TrueB) False
-
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. -
The benefit of using a stack-linked list is that the number of nodes on the stack can increase or decrease as needed while the program runs.
Skill/Topic: Stacks using Linked ListA) TrueB) False
manisha.somavanshi
- Dec 17th, 2007
If we use stack as an array there is limitation of size. but if we use stack as linked list we can dynamically store elements on the stack.
Pushpa
- Nov 7th, 2007
True
-
How can a node be inserted in the middle of a linked list?
Skill/Topic: Linked ListA) by repointing the previous and the next elements of existing nodes to the new nodeB) by repointing only the next elements of existing node to the new nodeC) by repointing only the Previous elements of existing node to the new nodeD) None of the above Explanation: by repointing the previous and the next elements of existing nodes to the new node You can insert a node in the...
manishmodgil
- Dec 28th, 2007
1. Identify where to be inserted.2. nxt pointer of the new node to the next node.3. nxt pointer of the previous node to the new node.Do consider spl. cases :1. to insert at the start of the list2. to insert at the end of the list
sri
- Nov 11th, 2007
Firstly, create a temporary node say "temp"!!!so, prev->link=temp; temp->link=next;
-
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 ...
-
What is nonvolatile memory?
manishmodgil
- Dec 28th, 2007
On the contrary the volatile memory is the one which get washed off when power is swithched off eg. RAM.
Rani
- Oct 4th, 2007
It is a type of computer memory which retains stored information even when the power is off. Also known as secondary memory. Eg. of such devices are flash drives, hard disk etc.
-
An _________ data type is a keyword of a programming language that specifies the amount of memory needed to store data and the kind of data that will be stored in that memory location.
Skill/Topic: Memory, Abstract Data Types, and AddressesA) abstract
manishmodgil
- Dec 28th, 2007
Its ABSTRACT .The answer is conceptual and remains same for all the programming languages so this is the same answer even in case of C++ or .net
-
Link list does not have any advantage when compared to an Array.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A linked list can grow and shrink in size dynamically at runtime, whereas an array is set to a fixed size at compile time.
manishmodgil
- Dec 28th, 2007
FALSEAdvantages of linked list :1. Insertion and deletion are less costly.2. Dynamic addition of new elements is possible.3. Sorting is less costly.
Vikram.N
- Sep 3rd, 2007
False: In linked list, items can be inserted anywhere with O(1), while in an array you need to shift certain elements, i.e O(n). Same applies to deletion. Also every node can contain multiple values.
-
A Linked list can grow and shrink in size dynamically at _______.
Skill/Topic: Linked ListA) BeginningB) Run timeC) EndingD) None of the above
manishmodgil
- Dec 28th, 2007
Runtime.The node deleted could be freed.Memory for the new node could be allocated at run time , so size of the linked-list is only limited to the physical memory available.
-
Why is it necessary to hash?
Skill/Topic: Hash TableA) Hashing assures that the format of keys is uniform and unique
manishmodgil
- Dec 28th, 2007
It is one of the data structures and could prove to be useful in situation depending upon the domain.Hashing is a technique to organize the data according to some function f(x) applied on the individu...
-
What is hashing?
Skill/Topic: Hash TableA) Hashing is the technique of scrambling bits of a key into a hash number.
manishmodgil
- Jan 2nd, 2008
You could cateogorize hashing as one of the heuristic techniques. Its an important term w.r.t. searching.Hashing uses a has function f(x) to find key which lies in some pre-known domain. here x is the...
-
How is memory reserved using a declaration statement?
Skill/Topic: Variables and PointersA) Memory is reserved by using a data type in a declaration statement.Explanation: The form of a declaration statement varies depending on the programming language you use. For example, here is a declaration statement for C, C++, and Java:int myVariable;
as_hmr
- Mar 11th, 2008
Just to add on.in Cint i; // it is both declaratoin and definationextern int i; // this is only declaration
manishmodgil
- Dec 28th, 2007
In C if we write int a; this statement does both viz. declaration and definition. It first created a variable named a and then defines it be of type int and allocated memory. Although we have not spec...
-
Data Structures declared as Volatile and Const
What does it mean when a data structure is declared volatile?
What does it mean when a data structure is declared Const?pvsola
- Apr 3rd, 2008
Volatile - you are asking compiler to not to optimise the data structure as well as to reload to CPU registers whenever it is in use. Not a good idea for Data structure, will waste lot of CPU time in loading long data structures.
as_hmr
- Mar 11th, 2008
If we declare a data structure const means after declration that data structure is read only.Declaring a data structure Volatile is a order to compiler not to perform optimization on that data structure.
-
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
-
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 .
-
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...
Data Structures Interview Questions
Ans