How to Create a Test File in C++ PDF

Running head: COSC2140
COSC2140
Name of the Student
Name of the University
Author Note

COSC2140 1
Table of Contents
Introduction:...............................................................................................................................2
Linked list:.................................................................................................................................2
Binary search tree:......................................................................................................................2
The code:....................................................................................................................................3
Output:........................................................................................................................................4
Output file:.................................................................................................................................5
Hash Map:..................................................................................................................................5
Conclusion:................................................................................................................................6
References:.................................................................................................................................7

COSC2140 2
Introduction:
The purpose of this project is to create a test file in c++. The program will take input
from a text file and it will print that output in another text file.
Linked list:
The Linked list is a linear data structure for storing the data elements. The data
elements that are stored in linked list memory location, are linked contiguously. It consists of
node. Each node acts as the container of the data field and reference links to the next node in
linked list. By using the pointer the data elements are linked together that represents a
sequence. It is the features that gives the allowance for insertion and deletion operation in
efficient manner. The first node of the linked list is known as head. Having no data elements
in the linked list then the value of head is considered as NULL.
It is similar to array. Actually linked list is a dynamic data structure. With the time it
can be shrined. There is no necessity for pre allocating memory. It is beneficial than array
because the insertion and deletion operation is easy without reallocation. Linked list does not
give any allowance for random access.
Binary search tree:
The Binary search tree is also known as ordered binary tree. It acts like a container of
the data items that are stored in data structure. It gives the allowance for first lookup, deletion
and addition. It is also used for the implementation of the dynamic set of data items. It is a
rooted binary tree but it's internal node acts as a container of key. It has two binary sub trees
that are known as right sub tree and left sub tree. It is beneficial for sorting and searching
algorithms for traversal. By using this binary search tree, traversal becomes easy and
efficient. It follows the binary search principle.