Skill/Topic: Hash TableA) TrueB) FalseExplanation: Hashing results in a hash number that has no real significance beyond it being used as the key for an entry.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

The hash number resulted from hashing is used as the key for an entry.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: The constructor of the Hashtable class initializes data members and creates the hashtable. The size of the array of pointers (tablesize) is passed to the constructor when the application declares an instance of the Hashtable class

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 19th, 2012

The size of the array of pointers (tablesize) is passed to the constructor when the application declares an instance of the Hashtable class and therefore the constructor of the hashtable class initializes data members and creates the hashtable.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) java.util

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

The linkedlist class is defined in the java.util package.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) FalseExplanation: The appendNode() function appends the new node to the list without requiring the programmer to specify where to place the new node in the linked list.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

No,the appendNode() function do append the new node at the programmers specified place instead it appends the new node at the tail of the linked list instead of head.If the likt is empty then it uses reference pointer to change the head pointer.

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) The destructor of the StackLinkedList class is empty because the destructor of the LinkedList class is called prior to the destructor of the StackLinkedList class. This is because the LinkedList class is inherited by the StackLinkedList class.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

The destructor of the LinkedList class is called before the destructor of the StackLinkedList class. The LinkedList class constructor deletes all memory that is associated with the nodes of the linked list. Therefore, the destructor of the StackLinkedList class is empty.

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) The constructor of the StackLinkedList class is empty because the constructor of the LinkedList class is called when an instance of the StackLinkedList class is declared. The constructor of the LinkedList class initializes the node and attributes that are

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

The constructor is empty because the constructor of the LinkedList class is called before the constructor of the StackLinkedList class,we know that the StackLinkedList class inherits the LinkedList cl...

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data members and function members that are necessary to manage the linked list that is used for the queue.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

True,as the linkedlist class contains the functions and data members which are used to manage the linked list which is used for the queues,hence queuelinkedlist class inherit the linkedlist class.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: The Java version of the hashtable application is simpler than the C++ version because the Java version defines the Hashtable class in the Java Collection Classes that are defined in the java.util package

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

The hash table applications of java are simpler then c++ because java defines a class in java collection class called HASHTABLE class which is present in the java.util package.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: The getSize() member function of the Hashtable class reads the size data member of the Hashtable class and returns its value to the statement that calls the getSize() function. If you gave the application direct access to the size data member, statements within the application could assign an incorrect value to size. By controlling access to size to...

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 14th, 2012

True,GetSize() function is used to protect the integrity of the Data by controlling the access to the size parameter, such that only the function members of the hashtable can access the size parameter.

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) FIFO , First In First Out

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 10th, 2012

Queues are first in first out form of data structures.In a FIFO data structure, the first element added to the queue will be the first one to be removed.

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) The node at the front of the queue is removed when the dequeue() member method is called.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 10th, 2012

The dequeue() function is used to remove the node at the front and returns a value, this value is stored in an item.

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) TrueB) FalseExplanation: The pop () member function must determine if the stack is empty

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 10th, 2012

False.
The pop() function determine whether the stack is empty or not by calling the isEmpty() member function..

Answer Question  Select Best Answer

Skill/Topic: TreeA) ValueB) TreeC) KeyD) IndexExplanation: A key is a component of a node that identifies the node. An application searches keys to locate a desired node

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

The data model provides unique keys as a component of the node which identifies the node.

Answer Question  Select Best Answer

Skill/Topic: TreeA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

True, a value is also a component of a node which is used to store data.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) TrueB) FalseExplanation: No. A key entered by the application must be hashed before it can be compared to a key in the hashtable.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

False.
The key entered must be hashed before an application compares it with the hash key table.

Answer Question  Select Best Answer

Skill/Topic: Hash TableA) Hashtable , HashMap class

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

Hashmap and hashtable are the classes which the Java.Util package contains to work with hashtables.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) getSize()B) giveSize()C) seeSize()D) addSize()Explanation: The getSize() function retrieves the value of the size member of the LinkedList class. The getSize() function contains one statement that simply returns the value of the size member

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 8th, 2012

The getsize() function retrieves the value of the size member of the linked list class.

Answer Question  Select Best Answer

Write a C program to print the information from each node in reverse order in doubly linked list, in which pointer to last node is TAIL.

rajesh singh

• May 4th, 2012

By recursion we can achieve this..

Code
span style="color: #ff0000;">"%d        ",ptr->data);
 
}

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

True,the insertnodeat() function specifies the index of where to insert the new node into the linked list.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) The return value of the findNode() function is the index position of the node.

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

The index position of the node is returned by the findnode() function.

Answer Question  Select Best Answer