Question

Short answer in your own word:

1. Describe the role of a “Back-End” computer engineer in creating software. Give examples of decisions back end engineers make. Use the relationship between long-term and short-term memory as context for decision examples.

2. Identify Stack or Heap storage in RAM.

a) Hash Map with static array as underlying storage

b) Doubly Linked LIst - Stack Implementation

c) Binary Search Tree with 10,000 Nodes

d) Static Array - Stack Implementation

c) Doubly Linked List - Queue Implementation

3. Briefly describe Abstract Data Types (ADT) or Abstract Data structures in general. Why are Abstract data structures implemented? Make sure to use your own words.

Answer 1

1) The roles of a “Back-End” computer engineer in creating software are:

(i) Improving and maintaining the server.

(ii) Development of program code to create software.

(iii) Maintenance and improvement of server side applications.

(iv) Database maintenance.

A back end engineer takes decision like:

(i) How the system will be designed so that the user interaction with the system is maximum.

(ii) Data storage locations.

(iii) Addition of features into the developments.

(iv) Coding and development procedures and strategies.

Third Part:

The memory for the software is for long term based on the user interaction with the software. For the same reason the database also required long term memory. For the features of the software system the memory may be short term or long term based on the duration of the software and user interaction with the software.

2) Stack and heap both are stored in RAM. For static memory allocation we use stack and for dynamic memory allocation heap is used. Accessing variables in stack is faster than accessing variables in heap.

a) Hash map with static array as underlying storage: As the storage is underlying so some fix memory can't be allocated. Memory in different parts can't be allocated so it can be performed by static memory allocation. So, for this case stack storage should be used.

b) Doubly linked list (stack implementation): It does not get allocated memory allocation at the time of declaration. This data structure takes memory dynamically while accessing it. So, for this case heap storage should be used.

c) Binary search tree with 10,000 nodes: This data structure is dynamic in nature. Which means if we don't fix memory allocation at the time of declaration, then it takes memory as required and the frees the memory once the requirement is completed. So, for this case heap storage should be used.
d) Static Array: Static memory is allocated initially for static array. So, for this case stack storage should be used.

e) Doubly linked list (queue implementation): It does not get allocated memory allocation at the time of declaration. This data structure takes memory dynamically while accessing it. So, for this case heap storage should be used.

3) Abstract data type or Abstract data structure can be defined as the model for data structures. It is set of data values and the operations associated with the data without the mention of the real implementation. It divides the data type data type specification and data type representation. It works like a black box, where users can only see the syntax and semantics of it's operations. It is a combination of interface and implementation while the interface defines the logical properties of the ADT and the operation signatures.

The implementation of Abstract data types define the representation of data structure and algorithms to implement the operations. It also encapsulates data and function which makes the code easy to understand. It also allows the change in implementation of ADT without changing the current program. The most common examples of ADT are stack, queue, list, etc.

Hope this helps.