GeekInterview.com
  I am new, Sign me up!
 
GeekInterview.com  >  Interview Questions  >  Concepts  >  Data Structures
Go To First  |  Previous Question  |  Next Question 
 Data Structures  |  Question 68 of 202    Print  
Linked list C++ application is organized into three files.They are _____, ______ and _____.
Skill/Topic: Linked List
A) header file , source code file , application file
Explanation: The first file is the header file that contains the definition of the NODE structure and the LinkedList class definition. The second file is a source code file containing the implementation of member functions of the LinkedList class. The last file is the application file that contains code that creates and uses the LinkedList class



  
Total Answers and Comments: 2 Last Update: February 06, 2007   
  
 Sponsored Links

 
 Best Rated Answer

No best answer available. Please pick the good answer available or submit your answer.
January 23, 2006 07:31:03   #1  
samiksc Member Since: October 2005   Contribution: 233    

RE: Linked list C++ application is organized into thre...

The answer is actually a linked list app CAN BE organized into a header file source file and main application file. It can be organized in different ways also like declaration definition can be combined into one source file linked with the main file. All functionality can be implemented in one source file. We also may have different header files for node class and the list class separate source files implementing these classes and a main application file which uses these classes.


 
Is this answer useful? Yes | No
February 06, 2007 06:53:30   #2  
sivanesh.a Member Since: December 2006   Contribution: 189    

RE: Linked list C++ application is organized into thre...
header file source file and application file.
 
Is this answer useful? Yes | No

 Related Questions

The Data type of a declaration statement tells how much _____ to reserve and the kind of ______ that will be stored in that ______ location.
Skill/Topic: Variables and PointersA) Memory, Data, MemoryExplanation: The Data type of a declaration statement tells how much memory to reserve and the kind of data that will be stored in that memory 

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 
Latest Answer : A) Same name. ...

Skill/Topic: ArrayA) Two or MoreExplanation: A multidimensional array consists of two or more arrays defined by sets of array element.Each set of array elements is an array. The first set of array elements 

Skill/Topic: QueueA) TrueB) FalseExplanation: A priority queue is similar to a simple queue in that items are organized in a line and processed sequentially. However, items on a priority queue can jump 
Latest Answer : True ...

Skill/Topic: Linked ListA) LinkB) NodeC) Data structureExplanation: Each entry in a linked list is called a node. Think of a node as an entry that has three subentries. One subentry contains the data, 
Latest Answer : Each element in link list is called LINK ...

Skill/Topic: Linked ListA) A linked list is a data structure consisting of elements called nodes. Each node points to the next and the previous node, thereby linking nodes together to form a linked list. 
Latest Answer : linked list is a data structure consisting of elements called nodes. ...

Skill/Topic: Linked ListA) Join togetherExplanation: The benefit of using a linked list is to join together large amounts of data and manipulate the data without having to rearrange data in memory  

Skill/Topic: Linked ListA) NoneB) OneC) TwoD) ThreeExplanation: A node has three elements. These are the current data and pointers to the previous node and the next node on the linked list 
Latest Answer : At least 2 or 3. A singly linked list will have at least one data element and a pointer. A doubly linked list will have at least one data element and 2 pointers. ...

Skill/Topic: Linked ListA) TrueB) FalseExplanation: A linked list can grow and shrink in size dynamically at runtime, whereas an array is set to a fixed size at compile time. 
Latest Answer : FALSEAdvantages of linked list :1. Insertion and deletion are less costly.2. Dynamic addition of new elements is possible.3. Sorting is less costly. ...

Skill/Topic: Linked ListA) BeginningB) Run timeC) EndingD) None of the above 
Latest Answer : Runtime.The node deleted could be freed.Memory for the new node could be allocated at run time , so size of the linked-list is only limited to the physical memory available. ...


 Sponsored Links

 
Related Articles

Breaking up XML into Relational Data

Breaking up XML into Relational Data While the preceding example shows how to construct an XML representation over relational data the example in this section illustrates how you can shred XML data back into relational data This reverse operation can be useful if your application works with relation
 

Querying Data with Oracle XQuery

Querying Data with Oracle XQuery Starting with Oracle Database 10g Release 2 you can take advantage of a full featured native XQuery engine integrated with the database With Oracle XQuery you can accomplish various tasks involved in developing PHP Oracle XML applications operating on any kind of dat
 

Retrieving XML Data

Retrieving XML DataTo retrieve XML data from an XMLType table you can use a SELECT SQL statement just as you would if you had to query a relational table For example to select the employee with the id set to 100 from the employees XMLType table discussed in the preceding section you might issue the
 

Using XMLType for Handling XML Data in the Database

Using XMLType for Handling XML Data in the Database Being an object type XMLType can not only be used to store XML data in the database but also to operate on that data via its built in methods Regardless of the storage model you choose XMLType provides a set of XML specific methods to operate on XM
 

Using Oracle Database for Storing, Modifying, and Retrieving XML Data

Using Oracle Database for Storing Modifying and Retrieving XML Data With Oracle XML DB you have various XML storage and XML processing options allowing you to achieve the required level of performance and scalability One of the most interesting things about Oracle XML DB is that it allows you to per
 

ODP.NET - Techniques to Improve Performance while Retrieving Data

ODP NET Techniques to Improve Performance while Retrieving Data Performance tuning is a great subject in Oracle Volumes of books would not be enough to cover every aspect of performance tuning in Oracle However in this section we will only discuss the fundamental performance techniques while working
 

ODP.NET - Populating a Dataset with a Single Data Table

ODP NET Populating a Dataset with a Single Data Table A dataset is simply a group of data tables These data tables can be identified with their own unique names within a dataset You can also add relations between data tables available in a dataset mosgoogle The following code gives you the details o
 

ODP.NET - Retrieving Typed Data

ODP NET Retrieving Typed Data While retrieving values from OracleDataReader we can extract information available in individual columns of a particular row either by using column ordinal position values or column names mosgoogle Retrieving Typed Data Using Ordinals ODP NET provides data specific enum
 

ODP.NET - Retrieving Data Using OracleDataReader

ODP NET Retrieving Data Using OracleDataReader OracleDataReader is simply a read only and forward only result set It works only if the database connection is open and it makes sure that the connection is open while you are retrieving data As the data that it retrieves is read only it is a bit faster
 

ODP.NET - Fundamental ODP.NET Classes to Retrieve Data

ODP NET Fundamental ODP NET Classes to Retrieve Data To retrieve data from an Oracle database using ODP NET we need to work with a few of the ODP NET classes At this point we will discuss the most fundamental classes available in ODP NET for retrieving data mosgoogle The following is the list of fun
 

About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape