-
Why is the binary numbering system used in computing?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) The binary numbering system is used in computing because it contains 2 digits that can be stored by changing the state of a transistor. Off represents 0 and On represents 1.
mahesh
- Dec 12th, 2006
Because Internally data is stored in transisitor and it can be turned on or off depending on the voltage level .1-ON0-OffHence data is stored as 1's and 0's
-
The size of a structure is determines by the Product of sizes of all primitive data types within the structure?
Skill/Topic: Variables and PointersA) TrueB) FalseExplanation: The size of a structure is the sum of the sizes of all the primitive data types within the structure
Chantigd
- Jan 1st, 2007
There is concept called as "Padding" which is completely Operating system dependend.ex:struct a{ int a; int b; char c; int d;}Answer : 2 + 2 + 1 + 2 (bytes) = 7Bytes (not correct always) can be 8byte...
-
-
A pointer to a pointer is a variable whose value is an ________ of another _______ variable.
Skill/Topic: Variables and PointersA) Address, PointerExplanation: A pointer to a pointer is a variable whose value is an address of another pointer variable
ratish
- Dec 26th, 2006
Address,pointer
-
The destroyList() member function deletes the contents of the linked list and ________________.
Skill/Topic: Linked ListA) does not delete the linked list itselfB) delete the linked list itselfC) adds the linked list itselfD) None of the aboveExplanation: The destructor is a member function called when the instance of the LinkedList class is deleted using the delete operator. In the example shown next, the destructor contains one statement that calls the destroyList() member function.The destroyList()...
Prabhakar
- Dec 20th, 2006
(B).
-
Design and develop database to track incoming and outgoing hard copy letters
Design and develop a database to track incoming and outgoing hard copy letters for a division with 35 employees are expected to use the database, ranging from clerical to managerial staff. Based on the information provided.What steps would you take to complete the assignment?Describe three or more exceptional features that you would design as part of the database?
-
_____ is the common programming technique used for hashing in all hashing functions.
Skill/Topic: Hash TableA) Bit Shifting
-
How to reverse all the no using a single link list?
csabill
- Nov 2nd, 2006
void reverse() { Node < T > *currentNode = head, *nextNode = currentNode->next; while(nextNode) { Node < T > *newNextNode = nextNode->next; nextNode->next = currentNode; cur...
f2003062
- Oct 30th, 2006
A quite different way..! but same as the previous logic written by Rohit..!struct linkedlist { int x; struct linkedlist* next;}*head;Assume that "head" contains some nos ...example: 1->2->3->4...
-
Why would you use a structure?
Skill/Topic: Variables and PointersA) You use a structure to access parts of a dataB) You use a structure to group together related data.C) You use a structure to declare an instance of data groupExplanation: Structure is used to group all related data together
-
Node on a queue linked list have more than one data element.
Skill/Topic: Queues Using Linked ListsA) TrueB) False
-
Why is the constructor of the QueueLinkedList class empty?
Skill/Topic: Queues Using Linked ListsA) because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class.B) because initialization of data members of the LinkedList class is performed by the destructor of the LinkedList class.C) because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList...
-
119 Let’s say that you need to access a particular node on a linked list, but you don’t know the reference to the node or the position the node has on the linked list, although you do know the data is stored in the node. You can locate the node by calling the _____ function.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) insertNode()B) giveNode()C) findNode()D) cannot locate the node at all
-
Astack is a data structure that organizes data similar to how you organize dishes in a stack on your kitchen counter.
Skill/Topic: Stacks using Linked ListA) TrueB) False
Venkateswara Rao
- Sep 5th, 2006
True: Stack follows Last In First Out
-
________ is the maximum number of nodes that you can have on a stack-linked list.
Skill/Topic: Stacks using Linked ListA) ZeroB) Same as linked listC) Any NumbersExplanation: There can be a nearly unlimited number of nodes on a stack-linked list, restricted only by the amount of available memory in the computer.
-
What is the most efficient way of finding a loop in linklist?
Traversing the link list with two pointers, both traversing at different speed.
-
The keyword ___________ means that the attribute or member method is accessible only by a member method.
Skill/Topic: Stacks using an ArrayA) PrivateB) PublicC) Both a) and b)D) Neither a) nor b)Explanation: The keyword private means that the attribute or member method is accessible only by a member method. The instance of the class cannot directly access a private member of the class.
-
Char *ptGrade;Which is the data type in this declaration?
Skill/Topic: Variables and PointersA) The data type in this is CharExplanation: The data type of the memory address stored in the pointer is of Character type
s
- Jun 18th, 2006
The datatype is char * type that is the variable points to a location(stores the address of the location) which contains character type data
-
A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Skill/Topic: Queues Using Linked ListsA) queue linked listB) stacks linked listC) both of themD) neither of themExplanation: A queue linked list is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Amish Kumar Aman
- Jun 5th, 2006
A:) be the Ans.
-
What is the benefit of using a queue linked list?
Skill/Topic: Queues Using Linked ListsA) A queue linked list can expand and shrink in size when an application runs, depending on the needs of the application
-
A tree can have a duplicate key.
Skill/Topic: TreeA) TrueB) False
Data Structures Interview Questions
Ans