Preferred Data Structure to hold all the necessary data for card even for add additional fields for efficiency is Linked List

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Project - Assignment I

SECTION 1

  Preferred Data Structure to hold all the necessary data for card even for add additional fields for efficiency is Linked List with singly linked list mechanism with hashing. 

By this Linked list technique, we have Dynamic size, Efficient memory allocation/utilization and quick insertion of additional fields.

 

Linked List Structure

The list is not required to be contiguously present in the memory. The node can reside anywhere in the memory and linked together to make a list. This achieves optimized utilization of space. list size is limited to the memory size and doesn't need to be declared in advance. We can store values of primitive types or objects in the singly linked list.

 

3.     *Time Complexity:

Linked lists have most of their benefit when it comes to the insertion and deletion of nodes in the list. Unlike the dynamic array, insertion and deletion at any part of the list takes constant time.

 

Sl.no Operation Complexity

1 Accessing element O(√N*N)

2 Traverse all elements O(√N*N)

3 Insertion (Current) O (1)

4 Deletion (Current) O (1)

5 Insertion (Front) O (1)

6 Insertion (End) O(√N*N)

     *Space Complexity:

The Space Complexity of the above Linked List operations is O(1).This is because we do not need extra space beyond a fixed number of variables. For some operations, you may need extra space of the order of O(N). For example, sorting a Linked List using a sorting algorithm that is not in-place.

  *Efficiency of Memory:

The efficient way of representing a linked list is using the free pool of storage. During the creation of a linked list, whenever a node is required the request is placed to the memory; the memory will then search the memory space.

 

4. Data structure that will hold all customer data in a sorted order, the complexity will be less. I prefer linked list for this sorted order. Because during sorting the data in increasing order it is easy to accessing using singly linked list.

 For example, the implementer cannot scramble the order to improve efficiency. An ordered list is a list in which the order of the items is significant. However, the items in an ordered list are not necessarily sorted. Consequently, it is possible to change the order O items and still have a valid ordered list.

 

Local Variables

Free memory

Global Variables

C Program Instruction

  

Memory Allocation Process

 

5. Indexing criteria will be the account number because each user is provided with an account number the process of registration stage. If the indexing is name or card number there is a difficult with searching and process the data. Not naming and Card number because similar naming and card may be lost so it may cause a problem when the user buys new cards.

 

6. Banks use credit card number as in index my choice if they go with account number with bank it may not cause any problem over the indexing of the card. As we have implemented the data while the registration process. So, index can be may as account number.

 

7. Banks also use a person’s name to index because of this case if bank as naming as an indexing many persons have similar name it may create a data with duplicate records which may create a run-time error when it is implemented. 

 

8. If you have to give a facility that a customer can be indexed with either his name or card number, in some cases if card number and naming becomes similar it may cause an issue at the run-time which may cause a duplicate record which may cause a crashing of data in the process. So, card number is maximum prefer for the linked list-based algorithms.

 

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of