-
data; temp = temp->Next; }}?">
Identify the error in the following example of the use of a displayNodesReverse() member function void displayNodesReverse(){ cout
Skill/Topic: Linked ListA) Syntax of displayNodesReverse() is wrongB) Node*temp should be NULLC) Wrong use of paranthesisD) temp should be equal to temp->previous Explanation: The displayNodesReverse() member function displays the contents of a linked list in reverse order,beginning with the node at the back of the linked list and continuing until the first node is displayed.So Previous should be...
-
Definitions of member functions for the LinkedList class are contained in?
Skill/Topic: Linked ListA) LinkedList.h fileB) LinkedList.cpp fileC) LinkedList.txt fileD) LinkedListDemo.cpp file Explanation: Definitions of member functions for the LinkedList class are contained in the LinkedList.cpp file
-
________ 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.
-
The pop() member function determines if the stack is empty by calling the _____ member function.
Skill/Topic: Stacks using Linked ListA) removeback()B) isEmpty()C) removedfront()Explanation: The pop() member function must determine if the stack is empty, or it will attempt to remove a node that isn’t on the stack. The pop() member function determines if the stack is empty by calling the isEmpty() member function, which you must define as part of the StackLinkedList class.
-
StackLinkedList class inherits the LinkedList class.
Skill/Topic: Stacks using Linked ListA) TrueB) False
-
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
-
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
-
What is the purpose of a left child node and a right child node?
Skill/Topic: TreeA) The left child node has a key that is less than the key of its parent node. The right child node has a key that is greater than the key of its parent node
-
A leaf node does not have any child nodes.
Skill/Topic: TreeA) TrueB) FalseExplanation: A leaf node is the last node on a branch and does not have any child nodes
-
A tree can have a duplicate key.
Skill/Topic: TreeA) TrueB) False
-
What is the total number of spanning trees ?
The total number of spanning trees that can be drawn using five labelled vertices is: A)125 B) 64 C)36 D)16
-
-
Why would you define a getSize() function instead of having the application access the size of the linked list directly?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) You use the getSize() function instead of having the application access the size of the linked list directly to protect the data from inadvertently being changed by the application.Explanation: If the application needs to change the data, then the appropriate function is called and the function changes the data.
-
Creating and using a hashtable in your application is a single-step process[Topic] Hash Table.
Skill/Topic: Hash TableA) TrueB) FalseExplanation: Creating and using a hashtable in your application is a two-step process. The first step is to define a user-defined structure similar to the way you defined nodes in a tree or a linked list. The second step is to define a Hashtable class. The Hashtable class declares an instance of the user-defined structure and defines member data and member functions...
-
Digital Signature Software - Installed or SaaS
Which version of Digital Signature Software - Installed or SaaS is more secured and legally binding?
-
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?
-
What are real time usage of session parameters and variables ?
Where we should use this session parameters and how should use them
-
Efficient Algorithm to print count and possible string combinations of a string by retaining order and length of charactersined
Problem: Given a input string as "0000" and following input scheme for the zeroes, print the possible combinations by retaining order of the characters.
Input Scheme:
A "0"
B "00"
C "000"
D "0000"
Example: "AAAA" is one string with length and order of characters retained
Data Structures Interview Questions
Ans