Data Structures and Algorithms Implementation: A C# Task Queue

Desklib provides past papers and solved assignments for students. This project focuses on data structures and algorithms.

DATA STRUCTURES AND ALGORITHMS

Contents
Introduction:...............................................................................................................................4
LO1 Examine abstract data types, concrete data structure and algorithms:..............................5
P1 Create a design specification for data structure explaining the valid operations that can
be carried out on the structure:...............................................................................................5
P2 Determine the operations of a memory stack and how it is used to implement function
calls in a computer:................................................................................................................6
LO2 Specify abstract data types and algorithms in a formal notation:......................................7
P3 Using an imperative definition, specify the abstract data types for a software stack:......7
LO3 Implement complex data structures and algorithms:.........................................................8
P4 Implement a complex ADT and algorithm in an executable programming language to
solve a well-defined problem:................................................................................................8
P5 Implement error handling and report test results:...........................................................13
LO4 Assess the effectiveness of the data structure and algorithms:........................................15
P6 Discuss how asymptotic analysis can be used to access the effectiveness of an
algorithm:.............................................................................................................................15
P7 Determine two ways in which the efficiency of an algorithm can be measured,
illustrating your answer with an example:...........................................................................16
Conclusion:..............................................................................................................................17
References:...............................................................................................................................18

List of image:
Figure 1: Add a new task...........................................................................................................8
Figure 2: Remove task from the queue......................................................................................9
Figure 3: Add other task...........................................................................................................10
Figure 4: Total number of job..................................................................................................10
Figure 5: Check available jobs.................................................................................................11
Figure 6: Clear a queue............................................................................................................11
Figure 7: Add task....................................................................................................................12
Figure 8: Add value in the queue.............................................................................................12
Figure 9: Error handling...........................................................................................................13

Introduction:
A way to collect and organise various kind of data to perform the different operation is
known as data structure and algorithm. Design and implement data in a proper way to reduce
complexity with increased efficiency is also a part of data structure and algorithm. Organise
the data into the table format with using sorting and array operations can be possible with
using data structure.
Develop algorithms and design abstract data types to manage data for the Creative Direct
Limited (CDL), that is a software organisation and develop IoT programs with portable
devices. The company required developing devices that have enough memory with good
processing speed using programming language C#. The first section includes a concrete data
structure with abstract data types and algorithms. The next section is about the algorithms in a
formal notation with specifying abstract data types. Implementation of the different data
structure includes in the third section with the effectiveness of data structure and algorithm in
the last section.

LO1 Examine abstract data types, concrete data structure and
algorithms:
P1 Create a design specification for data structure explaining the valid
operations that can be carried out on the structure:
The data structure is the collection of different data and records that used to manage and store
in the database using different operations like, array and stack. The data structure has two
types to manage data these are, logical and mathematical. Computation techniques are used to
retrieve data from the database and data can divide into a different structure like, linear and
non-linear. The linear structure found data in a sequence with different memory locations as
well as non-linear data use the hierarchical relationship to represent data into tree and graph
form (Polikarpova, 2013 ).
The database has different terms that used to store data like, linked list, stack, queue and
array. Use stack and queue implementation in the current scenario in which queue follow
FIFO (first in first out) operation. The common examples of queue operations are like, CPU
scheduling, disk scheduling and others. Some more operations can be performed in the queue
like Enqueue, Dequeue, isEmpty, isFull, capacity and head.
Use any element in the queue operation using Enqueue() and remove an element with
Dequeue(). Get the size of the element with the size() as well as use capacity() to know the
capacity of the elements. isEmpty() is used to know the detail about the queue that it is empty
or not and isFull() is to know that queue is full or not. Get an element from the front of the
queue without delete with using peak() operation.
The data structure has a different operation that is like:
 Traversing: a process to access any recode form the database
 Searching: process to search any file or record with entering a name or key
 Merging: take two files or records from different locations and merge or combine
them with using this factor.
 Inserting: add or insert any element in the database
 Deleting: remove any element or record form the database with using this term
 Sorting: set or arrange data of the database in order with ascending and descending
form (Walt, 2011).

P2 Determine the operations of a memory stack and how it is used to
implement function calls in a computer:
A stack is used to storing data and variables in the system memory. Stack works on the LIFO
(last in first out) principle to optimise the CPU and manage the data. Data enter from the last
and out form the first element. PUSH and POP are the two operations that used in the stack.
A variable is inserting into the stack that is called as PUSH and delete an element from the
stack is known as POP. LIFO is helpful in memory allocation and to increase the memory
speed. At the memory allocation time, a thread is created and at execution, a function calls to
take space in the memory. Call and return are the two more operations and used to manage
allocation and de-allocation the variable in the stack memory. Here define call and return
function as below:
Call: shift a variable into the new location with using call function. When a function call,
create and leave space for a new variable and compiler used to move a variable into the left
space.
Return: the operation of return is known as RET that perform the operation of return a
variable in the memory stack. Return function is also used for the restore a variable in the
memory stack at the execution time (Balakrishan, 2009).

LO2 Specify abstract data types and algorithms in a formal notation:
P3 Using an imperative definition, specify the abstract data types for a
software stack:
For understanding the abstract data type first it will get to know that what abstract data is.
The abstract data is a type of data in which only the useful data is visible to the user and other
data is hidden from the user. So in simple words, if it says abstract data types are the data
types which are used in the process of data abstraction.
The proper definition of abstract data is defined as it is a model of mathematical for all data
types used in data abstraction and a data type is defined as the behaviour of data. The
behaviour of data here stands for the semantics of data from the user’s point of view.
Take an example: Integers will use in day to day life here to know that integers are ADT so if
it performs any operations such as addition, multiplication, subtraction, division and many
more operation with many signs like equals to, greater than or less that which are most
familiar for any user, so it is noticed that how the integers are represented in computer system
(binary). It will have many of the conditions which called the behaviour of operation or data
that don’t have any commutative or associative rule and have take care that any no is not be
divisible by Zero (Brodie, 2012).
Advantages of Abstract Data Type:
 Encapsulation
 Flexibility
 User-friendly
 More precise
Some of the operations used in data abstraction are:
 Compare (a, b): which compare both the argument instances
 Hash (h): for a hash function
 Print (a) or show (a): for making the data human readable
As to discuss ADT for stack software so it is known that stack has a term LIFO (Last in First
out). In the stack software it will do generally two operations:
PUSH: push is used to insert or say to push any element or data in the stack
POP: Pop is used to delete or say to pop any element or data from the stack

LO3 Implement complex data structures and algorithms:
P4 Implement a complex ADT and algorithm in an executable programming
language to solve a well-defined problem:
So in this module, it is discussed how it can manage the processing speed of the task so that
the process will not take more time and it will execute as earlier as it can. Use an approach in
which it will have to create a queue in which the task is added and the task which is added
earlier will be executed first as the name of the queue states that FIFO (First in First out).
Implement a queue which has the following methods
 To add the task to the queue
 To remove any task from the queue
 To take care of the next tasks present in the queue
 To count the no of tasks present in the queue
 To clear a queue
 To add a task after removing a task
 To add the values in the queue
To add the task in the queue: Successfully created an algorithm for adding a single task in
the queue.
Figure 1: Add a new task
To remove any task from the queue: Successfully created an algorithm for removing a task
from the queue.

Figure 2: Remove task from the queue
Next task present in the queue: Successfully created an algorithm to check the next task
present in the queue.

Figure 3: Add other task
To count the no of the task in the queue: Successfully created the function to count the no
of tasks present in the queue.
Figure 4: Total number of job

Figure 5: Check available jobs
To clear a queue: Successfully created the function to clear all the elements in the queue.
Figure 6: Clear a queue

To add a task after removing a task: Successfully created a function to add a task after
removing a task.
Figure 7: Add task
To add the value in a queue: It has successfully created a function to add the value in the
queue.
Figure 8: Add value in the queue