51ºÚÁÏ

Noughts and Crosses – a first Visual Studio Project is designed as a first opportunity to code a Microsoft Visual Studio project from start to finish having finished a course of study learning C#, either through classes, self-study or following a tutorial. Presented in a series of thirteen steps, the learner is guided through the whole process, from interface design to adding functionality through coding, to produce a noughts and crosses (tic tac toe) game. Towards the end of developing the game, a little twist is added which gives the opportunity to code a practical use of a Circular Queue. Each step in the development process is supported by a fully commented coded example of a possible solution to prevent learners from hitting an insurmountable roadblock. In this version, the learner builds the interface by writing code. This method offers the opportunity to see how, by using constants and placing controls mathematically relative to each other, ongoing maintenance and development of the solution can be simplified. It also shows how control arrays can be created and how to write efficient code by using a single handler to action the same event for all the controls within an array or of the same type on the form. The supplied example solutions use this approach. Both versions offer an ideal gateway to developing the skills necessary to create one’s own, unique solutions to coding problems rather than following someone else’s style as in a tutorial. They also make an ideal jump-off point to using our File Handling Visual Studio project, which provides a one-stop guide to adding loading and saving functionality to an application.

Noughts and Crosses – a first Visual Studio Project is designed as a first opportunity to code a Microsoft Visual Studio project from start to finish having finished a course of study learning C#, either through classes, self-study or following a tutorial. Presented in a series of thirteen steps, the learner is guided through the whole process, from interface design to adding functionality through coding, to produce a noughts and crosses (tic tac toe) game. Towards the end of developing the game, a little twist is added which gives the opportunity to code a practical use of a Circular Queue. Each step in the development process is supported by a fully commented coded example of a possible solution to prevent learners from hitting an insurmountable roadblock. In this version, the learner builds the interface by writing code. This method offers the opportunity to see how, by using constants and placing controls mathematically relative to each other, ongoing maintenance and development of the solution can be simplified. It also shows how control arrays can be created and how to write efficient code by using a single handler to action the same event for all the controls within an array or of the same type on the form. The supplied example solutions use this approach. Both versions offer an ideal gateway to developing the skills necessary to create one’s own, unique solutions to coding problems rather than following someone else’s style as in a tutorial. They also make an ideal jump-off point to using our File Handling Visual Studio project, which provides a one-stop guide to adding loading and saving functionality to an application.

Noughts and Crosses – a first Visual Studio Project is designed as a first opportunity to code a Microsoft Visual Studio project from start to finish having finished a course of study learning C#, either through classes, self-study or following a tutorial. Presented in a series of thirteen steps, the learner is guided through the whole process, from interface design to adding functionality through coding, to produce a noughts and crosses (tic tac toe) game. Towards the end of developing the game, a little twist is added which gives the opportunity to code a practical use of a Circular Queue. Each step in the development process is supported by a fully commented coded example of a possible solution to prevent learners from hitting an insurmountable roadblock. In this version, the learner builds the interface using Visual Studio’s built-in Form Designer. This method offers the opportunity to develop the front end quickly and simply at the expense of some inefficiency in coding the functionality behind the controls. The supplied example solutions use this approach. Both versions offer an ideal gateway to developing the skills necessary to create one’s own, unique solutions to coding problems rather than following someone else’s style as in a tutorial. They also make an ideal jump-off point to using our File Handling Visual Studio project, which provides a one-stop guide to adding loading and saving functionality to an application.

Noughts and Crosses – a first Visual Studio Project is designed as a first opportunity to code a Microsoft Visual Studio project from start to finish having finished a course of study learning C#, either through classes, self-study or following a tutorial. Presented in a series of thirteen steps, the learner is guided through the whole process, from interface design to adding functionality through coding, to produce a noughts and crosses (tic tac toe) game. Towards the end of developing the game, a little twist is added which gives the opportunity to code a practical use of a Circular Queue. Each step in the development process is supported by a fully commented coded example of a possible solution to prevent learners from hitting an insurmountable roadblock. In this version, the learner builds the interface using Visual Studio’s built-in Form Designer. This method offers the opportunity to develop the front end quickly and simply at the expense of some inefficiency in coding the functionality behind the controls. The supplied example solutions use this approach. Both versions offer an ideal gateway to developing the skills necessary to create one’s own, unique solutions to coding problems rather than following someone else’s style as in a tutorial. They also make an ideal jump-off point to using our File Handling Visual Studio project, which provides a one-stop guide to adding loading and saving functionality to an application.

Data Sorts provides theory notes and interactive models of four common data sorting routines used in computing: the Bubble Sort, Insertion Sort, Merge Sort and Quicksort. The models include a delay feature so sorting occurs at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Sort that is currently being processed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used. There is an option to switch on a step-by-step explanation of how each algorithm is functioning. Speed Trials generates a large data set and then allows the user to sort that data using one of the sorting algorithms, timing how long it took. The data can then be returned to its original order, and one of the other sorts used, allowing comparisons to be drawn. Further sets of data can then be generated to substantiate results. Unlike the standalone models, Speed Trials is not deliberately slowed down and has all unnecessary formatting code removed to optimise performance and therefore provide true comparative data. Alongside the five interactive models are a set of theory notes describing each of the sort algorithms and designed to be read before interacting with the models and to reinforce learning as they are used. Data Sorts is supported by a comprehensive help file.

Math Parser Compiler Emulator supports learning how a compiler creates an executable program file from source code. Using mathematical expressions as an input, Math Parser shows how the following stages of compilation are performed: Lexical Analysis Syntax Analysis Code Generation Optimisation In addition, Math Parser demonstrates: How mathematical expressions are formed into Reverse Polish Notation (RPN) for execution using the Shunting Yard algorithm and the Stack data structure. How an Abstract Syntax Tree can be created from the RPN, showing how a recursive algorithm is used in practice. The RPN and Data Dictionary from successfully compiled expressions can be saved and then evaluated using the Math Parser Virtual Machine. Math Parser supports implied multiplication (e.g. 5x) as well as explicit multiplication (e.g. 5 * x) in its input expressions. Fully supported by a comprehensive Help file, Math Parser includes all the algorithms used and explains all the technical terminology.

Math Parser Virtual Machine supports learning how Reverse Polish Notation (RPN) is evaluated to produce answers. Using RPN files created using Math Parser Compiler Emulator (supplied) as input, Math Parser Virtual Machine shows how: The Stack is used in evaluation How the X Register in the CPU is used How the Y Register in the CPU is used How the Accumulator in the CPU is used How run-time errors are handled Fully supported by a comprehensive Help file, Math Parser Virtual Machine includes the algorithm used and explains all the technical terminology.

Data Structures provides interactive models and theory notes of four common data structures used in computing: the Stack, Circular Queue, Binary Search Tree and Linked List. Each is designed to prevent the user from performing illegal operations such as adding data to an already full structure and explains why such actions are being taken. The Binary Search Tree and Linked List models include a delay feature so that the Tree may be traversed, and the List read at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Tree or List that is currently being accessed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used. The Binary Search Tree includes removal of data from the tree, complete with a Structured English description and a Pseudocode algorithm in the theory notes of how it is accomplished. There is an option to switch on a step-by-step explanation of how data is entered into a Binary Search Tree and how the three traversal methods operate, and how data is inserted into, read from and removed from a Linked List. Alongside the four interactive models are a set of theory notes describing each of the data structures and designed to be read before interacting with the models and to reinforce learning as they are used. Data Structures is supported by a comprehensive help file.