Introduction to Programming
Cards (7)
- Data Structures
- Arrary, a list of elements indexed by position
- Associative, information is stored in key-value pairs
- Hash tables, uses (key, bucket) pairs where multiple values are stored together
- Queue, an item that is first inserted is the first to leave
- Stack, elements that are inserted last is the first to leave
- Linked list, ordered set of elements in which each element is connected to the next
- Record, collections of related elements
- Data groups
- Functions return a value and are transferrable within a system
- Methods belong to a class and does not return a value.
- Class acts as a blueprint used to store properties of an entity, the class can be used to contain related inputs.
- Design brief, a document outlining the nature of a problem
- Solution requirements, are what the client needs from the solution
- Constraints, factors that may limit or restrict solution requirements (Technical and non-technical)
- Scope, outlines the boundaries of the solution
- Representation of designs
- Data dictionary, used to plan the storage of software elements including variables, data structures and objects
- Object descriptions, a way of describing all relevant properties, methods and events of an object
- Mock-ups, a sketch showing the UI
- Pseudocode, outlines the logic of a system
- Files
- Plain text file, structured file that comntans characters of readable data stores small amounts of data
- Delimited file, a text file that is separated by a character makes it readable to humans
- XML file contains user defined tags that store information on the data and makes it easier for computers to understand
- Internal documentation conventions
- A header comment, contains brief descriptin of program
- Documentation of class and methods, describe behaviours
- Comments, describe sections of code
- Naming convention
- Camel case, FirstNameAndLastName
- Snake case, first_name_and_last_name
- Hungarian notation, (prefix)FirstNameAndLastName