-
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 ...
-
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 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
-
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. -
QueueLinkedList class inherit the LinkedList class.
Skill/Topic: Queues Using Linked ListsA) TrueB) False
-
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...
-
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!
-
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
-
-
An array is a way to reference a series of memory locations using the ______.
Skill/Topic: ArrayA) Same nameB) different nameC) Multiple namesD) Unique nameExplanation: An array is a way to reference a series of memory locations using the same name. Each memory location is represented by an array element. An array element is similar to one variable except it is identified by an index value instead of a name.
-
An application iterates the hashtable by calling the ______ and ______ member functions.
Skill/Topic: Hash TableA) hasNext() and getNextKey()Explanation: An application iterates the hashtable by calling the hasNext() and getNextKey() member functions. These two functions are used together with initIterator() to retrieve all the keys from a hashtable
-
Data members of the Hashtable class stored in the private access specifier.
Skill/Topic: Hash TableA) private access specifierB) Public access specifierC) common access specifier
-
How many parts are there in a declaration statement?
Skill/Topic: Variables and PointersA) 1B) 2C) 3D) 4
ahmarshi
- May 19th, 2007
3 parts. i. SCOPE (private/public/protected) ii. DATATYPE (int, short, long, byte, string, char, etc...)iii. VARIABLE NAMEe.g.private int id;private string name;
M.Ahmar
- May 19th, 2007
3 Parts.Scope (private/public/protected), DataType (integer, short, byte, string, etc...), Variable nameExamples:private int i;public string name;
-
What is a user-defined data type?
Skill/Topic: Variables and PointersA) A user-defined data type is a group of primitive data types defined by the programmer.
-
-
A hashtable is a table in which each entry consists of a hashed key and a value.
Skill/Topic: Hash TableA) TrueB) FalseExplanation: The hashed key retrieves entries
noverino
- Feb 23rd, 2007
B) FalseHashtable not always need value, it could contain only key/keys. Example, we use hashtable to keep unique value, then we only need the key/keys right.
-
A stack-linked list is a data structure that uses a ______ to create a stack.
Skill/Topic: Stacks using Linked ListA) Linked ListB) QueueC) Doubly linked list
uttama
- Feb 13th, 2007
Ans to this question is: Linked-list because, queue can be only implemented by FIFO! and doublly link list is used for both ends! hence linked list is correct option!
-
What is a leaf node?
Skill/Topic: TreeA) A leaf node is the last node on a branch
Manish
- Jan 13th, 2007
A leaf node is a node which does not contain any child node.A leaf node have zero or one node is connected to it.
-
The depth of a tree is the _______ of a tree.
Skill/Topic: TreeA) number of nodes on the treeB) number of levels of a treeC) Number of branches
-
Parent Node is also called as _____ Node.
Skill/Topic: TreeA) MainB) RootC) BranchD) Stem
Data Structures Interview Questions
Ans