| Skill | Description | Official Website |
|---|---|---|
| jQuery | Event handling | https://api.jquery.com/ |
| AJAX | Asynchronous JavaScript and XML | https://api.jquery.com/jquery.ajax/ |
| Bootstrap | Front-End web framework | https://getbootstrap.com/ |
| JSON | JavaScript Object Notation | https://www.json.org/ |
| HTTP Request/Response | https://www.w3schools.com/tags/ref_httpmethods.asp | |
| SQL vs No SQL | Databases | |
| Relational vs Non-Relational Database | Databases | |
| MySQL | https://www.mysql.com/ | |
| MongoDB | The motivation of the MongoDB language is to implement a data store that provides high performance, high availability, and automatic scaling. | https://www.mongodb.com/ |
| CRUD Operations | Create, Read, Update, Delete | https://en.wikipedia.org/wiki/Create,_read,_update_and_delete |
| Angular (workflow) | https://angular.io/ | |
| Node.js | https://nodejs.org/en/ | |
| Socket.IO | JavaScript library for realtime web applications | https://socket.io/ |
| Git | https://git-scm.com/ | |
| Amazon Web Services (EC2) | https://aws.amazon.com/ | |
| Node Package Manager (NPM) | https://www.npmjs.com/ | |
| Agile Scrum Methodology | https://www.scrum.org/resources/what-is-scrum | |
| Algorithms and Data Structures | Algorithms | |
| Linux/Unix | ||
| RESTful architecture/API | An architectural style called REST (Representational State Transfer) advocates that web applications should use HTTP as it was originally envisioned. Lookups should use GET requests. PUT, POST, and DELETE requests should be used for mutation, creation, and deletion respectively. | https://www.restapitutorial.com/ https://restfulapi.net/ https://stackoverflow.com/questions/671118/what-exactly-is-restful-programming |
| Object Oriented Programming (OOP) | The main aim of OOP is to bind together the data and the functions that operates on them so that no other part of code can access this data except that function. | https://www.geeksforgeeks.org/basic-concepts-of-object-oriented-programming-using-c/ |
| Model View Controller (MVC) | The Model View Controller (MVC) design pattern specifies that an application consist of a data model, presentation information, and control information. The pattern requires that each of these be separated into different objects. | https://www.geeksforgeeks.org/mvc-design-pattern/ https://www.tutorialspoint.com/design_pattern/mvc_pattern.htm https://www.tutorialspoint.com/mvc_framework/mvc_framework_introduction.htm http://web.archive.org/web/20130116005443/http://tomayko.com/writings/rest-to-my-wife |
| Document Object Model (DOM) | With the Document Object Model, programmers can create and build documents, navigate their structure, and add, modify, or delete elements and content. Anything found in an HTML or XML document can be accessed, changed, deleted, or added using the Document Object Model, with a few exceptions - in particular, the DOM interfaces for the internal subset and external subset have not yet been specified. | https://www.w3.org/TR/WD-DOM/introduction.html |
Data Model (psql): a mathematical formalism that consists of three parts:
1. A notation for describing and representing data (structure of the data)
2. A set of operations for manipulating data
3. A set of constraints on the data
RAID (Redundant Array of Inexpensive Disks or Drives, or Redundant Array of Independent Disks) is a data storage virtualization technology that combines multiple physical disk drive components into one or more logical units for the purposes of data redundancy, performance improvement, or both.
| Terms | Definition | Performance |
|---|---|---|
| RAID 0 | RAID 0 consists of striping, but no mirroring or parity. Compared to a spanned volume, the capacity of a RAID 0 volume is the same; it is the sum of the capacities of the disks in the set. But because striping distributes the contents of each file among all disks in the set, the failure of any disk causes all files, the entire RAID 0 volume, to be lost. A broken spanned volume at least preserves the files on the unfailing disks. The benefit of RAID 0 is that the throughput of read and write operations to any file is multiplied by the number of disks because, unlike spanned volumes, reads and writes are done concurrently, and the cost is complete vulnerability to drive failures. Indeed, the average failure rate is worse than that of an equivalent single non-RAID drive. | A RAID 0 array of n drives provides data read and write transfer rates up to n times as high as the individual drive rates, but with no data redundancy. As a result, RAID 0 is primarily used in applications that require high performance and are able to tolerate lower reliability, such as in scientific computing or computer gaming. Some benchmarks of desktop applications show RAID 0 performance to be marginally better than a single drive. |
| RAID 1 | RAID 1 consists of data mirroring, without parity or striping. Data is written identically to two drives, thereby producing a "mirrored set" of drives. Thus, any read request can be serviced by any drive in the set. If a request is broadcast to every drive in the set, it can be serviced by the drive that accesses the data first (depending on its seek time and rotational latency), improving performance. Sustained read throughput, if the controller or software is optimized for it, approaches the sum of throughputs of every drive in the set, just as for RAID 0. Actual read throughput of most RAID 1 implementations is slower than the fastest drive. Write throughput is always slower because every drive must be updated, and the slowest drive limits the write performance. The array continues to operate as long as at least one drive is functioning | Any read request can be serviced and handled by any drive in the array; thus, depending on the nature of I/O load, random read performance of a RAID 1 array may equal up to the sum of each member's performance, while the write performance remains at the level of a single disk. However, if disks with different speeds are used in a RAID 1 array, overall write performance is equal to the speed of the slowest disk. |