Q&A Categories

Data-Structures

Why is the isEmpty() member method called?

Why is the isEmpty() member method called? Skill/Topic: QueueA) The isEmpty() member method is called within the dequeue process to determine if there is an item in the queue to be removed.'

Answers No Answers In: Data-Structures By: claire [1 Grey Star Level] Sep 6, 2010

Why do we Use a Multidimensional Array?

Why do we Use a Multidimensional Array? Skill/Topic: ArrayA) A multidimensional array can be useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an...

Answers No Answers In: Data-Structures By: samir [ Grey Star Level] Sep 6, 2010

Why does QueueLinkedList class inherit the LinkedList class?

Why does QueueLinkedList class inherit the LinkedList class? Skill/Topic: Queues Using Linked ListsA) The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data...

Answers No Answers In: Data-Structures By: rakesh [ Grey Star Level] Sep 6, 2010

Why does the StackLinkedList class inherit the LinkedList class?

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)...

Answers No Answers In: Data-Structures By: samir [ Grey Star Level] Sep 6, 2010

Why are data members of the Hashtable class stored in the private access specifier?

Why are data members of the Hashtable class stored in the private access specifier? Skill/Topic: Hash TableA) Data members of the Hashtable class are stored in the private access specifier to ensure the...

Answers No Answers In: Data-Structures By: vikas [ Grey Star Level] Sep 6, 2010

Which of the following is not primitive recursive but computable ?

Which of the following is not primitive recursive but computable ? which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded...

Answers No Answers In: Data-Structures By: jes [ Grey Star Level] Sep 5, 2010

Which of the following symbol table implementation is based on the property of locality of reference

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'

Answers No Answers In: Data-Structures By: pooja [ Grey Star Level] Sep 5, 2010

Which node is removed from the queue when the dequeue() member method is called?

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

Answers No Answers In: Data-Structures By: ravi [ Grey Star Level] Sep 4, 2010

Which of the following abstract data types are NOT used by Integer Abstract Data type group?

Which of the following abstract data types are NOT used by Integer Abstract Data type group? Skill/Topic: Memory, Abstract Data Types, and AddressesA) ShortB) IntC) floatD) longExplanation: The integer...

Answers No Answers In: Data-Structures By: raju1587 [1 Grey Star Level] Sep 4, 2010

What would be the output of the following progam?union check{ char name[10]; int age;}A;void main(){

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: ");...

Answers No Answers In: Data-Structures By: shoeb [ Grey Star Level] Sep 2, 2010

Didn't find what you were looking for?

Add your Question to the site.

You must be Logged In to Add a Question.

Not a member yet? Sign Up Now »

Star Points Scale

Earn points for Asking and Answering Questions!

Grey Sta Levelr [1 - 25 Grey Star Level]
Green Star Level [26 - 50 Green Star Level]
Blue Star Level [51 - 500 Blue Star Level]
Orange Star Level [501 - 5000 Orange Star Level]
Red Star Level [5001 - 25000 Red Star Level]
Black Star Level [25001+ Black Star Level]