fixed most of the hbox errors

tex/courses/csci.tex

@@ -1,9 +1,11 @@
 \subsection{Computer Science}
 
-Offical course plan found here: \\
-\href{http://www.uq.edu.au/study/plan_display.html?acad_plan=COSCIX2030}{\nolinkurl{http://www.uq.edu.au/study/plan_display.html?acad_plan=COSCIX2030}} \\
+Offical course plan found here:
+
+\href{http://www.uq.edu.au/study/plan_display.html?acad_plan=COSCIX2030}{\nolinkurl{http://www.uq.edu.au/study/plan_display.html?acad_plan=COSCIX2030}}
+
+For Science students there is also this helpful guide
 
-For Science students there is also this helpful guide \\ 
 \href{http://planner.science.uq.edu.au/content/bsc/computer-science-major}{\nolinkurl{http://planner.science.uq.edu.au/content/bsc/computer-science-major}}
 
 \subsubsection{First Year}

tex/courses/subjects/COMP3301.tex

@@ -10,10 +10,14 @@
 example & example\% & example \\
 },
 review = {
-    Not a difficult course provided you keep up with course materials, but assignments will take a good chunk of time. Matt and Tutors extremely helpful and very short response times. \\
-    Through the course you will cover the different parts that make up an operating system kernel (especially a linux kernel), and assignments focus on concurrency and display (X11, but almost any display driver will be accepted). \\
-    Note that while the textbook is mandatory, it is extremely useful. You will cover the entirety of the textbook throughout the course. \\
-    The exam is fairly easy to prepare for, but going in without doing previous year's exams will result in failure. \\
+    Not a difficult course provided you keep up with course materials, but assignments will take a good chunk of time. Matt and Tutors extremely helpful and very short response times.
+
+    Through the course you will cover the different parts that make up an operating system kernel (especially a linux kernel), and assignments focus on concurrency and display (X11, but almost any display driver will be accepted).
+
+    Note that while the textbook is mandatory, it is extremely useful. You will cover the entirety of the textbook throughout the course.
+
+    The exam is fairly easy to prepare for, but going in without doing previous year's exams will result in failure.
+
     If you enjoyed 2310, I would highly recommend this course. 
 },
 preparation = {

tex/courses/subjects/COMP3506.tex

@@ -3,7 +3,7 @@
 code = {COMP3506},
 title = {Algorithms \& Data Structures},
 score = {4},
-prereq = {CSSE2002 + (MATH1061 or (CSSE2010 + STAT2202))},
+prereq = {CSSE2002 + (MATH1061 or \newline (CSSE2010 + STAT2202))},
 contact = {3L, 1T},
 coordinator = {Prof Yufei Tao ([email protected])},
 assessment = {

tex/courses/subjects/COMP4403.tex

@@ -13,13 +13,13 @@
 Final Exam & 40\% & Closed book (one A4 sheet allowed). Examines all theoretical course content. \\
 },
 review = {
-    The course covers basic compiler design. It splits the course up into theoretical (taught in the lectures and examined on the final) and practical content (through the assignments).\\
+    The course covers basic compiler design. It splits the course up into theoretical (taught in the lectures and examined on the final) and practical content (through the assignments).
 
-    In the theoretical component, it covers context-free grammars, recursive descent and bottom up LR(1) / LALR(1) parsing, static checking, code generation, garbage collection and object-orientation. The practical component consists of three assignments, where students are given the Java source code for a compiler for the PL0 programming language and are to add additional features to the language.\\
+    In the theoretical component, it covers context-free grammars, recursive descent and bottom up LR(1) / LALR(1) parsing, static checking, code generation, garbage collection and object-orientation. The practical component consists of three assignments, where students are given the Java source code for a compiler for the PL0 programming language and are to add additional features to the language.
 
-    The textbook is not required, but attending the lectures is highly recommended as the content, while not too difficult to grasp, does require explanation, plus Professor Hayes is a fantastic lecturer. Professor Hayes also provides comprehensive PDF notes of all topics based on the lectures that make excellent study tools.\\
+    The textbook is not required, but attending the lectures is highly recommended as the content, while not too difficult to grasp, does require explanation, plus Professor Hayes is a fantastic lecturer. Professor Hayes also provides comprehensive PDF notes of all topics based on the lectures that make excellent study tools.
 
-    The final exam is closed book, but one double-sided A4 sheet of paper is allowed. Preparing for the exam is easy due to the aforementioned lecture notes, tutorial questions and numerous past exams available. The structure of the course has remained static for a number of years, so previous exams provide a good guide as to what to expect on the final.\\
+    The final exam is closed book, but one double-sided A4 sheet of paper is allowed. Preparing for the exam is easy due to the aforementioned lecture notes, tutorial questions and numerous past exams available. The structure of the course has remained static for a number of years, so previous exams provide a good guide as to what to expect on the final.
 
     If you are interested in how programming languages work, I highly recommend this course. It's one of the best organised and taught courses in the school that I have personally taken, the content is interesting, and the assessment structure makes high grades achievable with moderate effort.
 },

tex/courses/subjects/COMP4500.tex

@@ -7,19 +7,19 @@
 contact = {2L},
 coordinator = {Dr Larissa Meinicke ([email protected])},
 assessment = {
-Online Quizzes & 10\% & Six online quizzes over semester; best five count for 2\% each. \\
+Online Quizzes & 10\% & Six online quizzes over semester; \newline best five count for 2\% each. \\
 Assignment 1 & 20\% & Program / report on algorithmic analysis and graph algorithms. \\
-Assignment 2 & 20\% & Program / report on dynamic programming. \\
+Assignment 2 & 20\% & Program / report on dynamic \newline programming. \\
 Final Exam & 50\% & Closed book (one A4 sheet allowed). \\
 },
 review = {
-    This course follows on from COMP3506, examining algorithms and data structures. Specifically, the course covers algorithmic analysis, recurrences / divide-and-conquer algorithms, graph algorithms, dynamic programming, greedy programming, amortised analysis, complexity theory and randomised algorithms.\\
+    This course follows on from COMP3506, examining algorithms and data structures. Specifically, the course covers algorithmic analysis, recurrences / divide-and-conquer algorithms, graph algorithms, dynamic programming, greedy programming, amortised analysis, complexity theory and randomised algorithms.
 
-    The lectures are worth attending as they go over the material in depth and include examples done on the board (which don't appear on recordings). In addition, since the content can be quite theoretical, being able to see examples done and ask questions is useful to aid understanding.The online quizzes involve multiple choice questions and are generally easy, but some questions are unclear and confusingly worded.\\
+    The lectures are worth attending as they go over the material in depth and include examples done on the board (which don't appear on recordings). In addition, since the content can be quite theoretical, being able to see examples done and ask questions is useful to aid understanding.The online quizzes involve multiple choice questions and are generally easy, but some questions are unclear and confusingly worded.
 
-    The assignments are quite involved, requiring both an implementation and a report component. The programming component requires students to come up with an algorithm to efficiently solve a problem, and then justify the algorithm and analysis its complexity in the report. Generally the actual implementation is easy, but designing the algorithm and getting it to `click' in your head can be tough. Allow time to think the problem over for a few days before attempting to actually write code.\\
+    The assignments are quite involved, requiring both an implementation and a report component. The programming component requires students to come up with an algorithm to efficiently solve a problem, and then justify the algorithm and analysis its complexity in the report. Generally the actual implementation is easy, but designing the algorithm and getting it to `click' in your head can be tough. Allow time to think the problem over for a few days before attempting to actually write code.
 
-    The final exam is closed book with one double-sided A4 sheet of paper allowed. The exam follows the same structure year to year, so past papers are useful study, as are the lecture notes and tutorial sheets. The exam is difficult, requiring students to come up with algorithms to solve graph problems, dynamic programming problems and prove a problem's NP-Completeness within the exam.\\
+    The final exam is closed book with one double-sided A4 sheet of paper allowed. The exam follows the same structure year to year, so past papers are useful study, as are the lecture notes and tutorial sheets. The exam is difficult, requiring students to come up with algorithms to solve graph problems, dynamic programming problems and prove a problem's NP-Completeness within the exam.
 
     Overall, this course is one that students may find difficult, but its content is incredibly useful, to the point that the content is really mandatory knowledge for anyone practising computer science or software engineering at a professional level. In addition, the course is well taught despite its difficulty, and knowing the content will help you in many other courses, and as such I highly recommend this course.
 },

tex/courses/subjects/COMS3000.tex

@@ -12,15 +12,15 @@
 Final Exam & 60\% & An open book short response exam. \\
 },
 review = {
-    This course provides a broad but comprehensive overview of the basics of information security. In particular, it covers concepts around access control, information theory, cryptography, network security, cloud security, payment card security and industrial control system security.\\
+    This course provides a broad but comprehensive overview of the basics of information security. In particular, it covers concepts around access control, information theory, cryptography, network security, cloud security, payment card security and industrial control system security.
 
-    The lectures are recorded, but attending them is recommended since Dr Ross asks questions of the class and does examples on the whiteboard, which do not appear on recordings. Further, the lectures are worth engaging in since Dr Ross, in addition to teaching at the university, works as an information security professional in industry and as such has a lot of insight into practical aspects of the course.\\
+    The lectures are recorded, but attending them is recommended since Dr Ross asks questions of the class and does examples on the whiteboard, which do not appear on recordings. Further, the lectures are worth engaging in since Dr Ross, in addition to teaching at the university, works as an information security professional in industry and as such has a lot of insight into practical aspects of the course.
 
-    The tutorials in 2016 were mediocre but the marked tutorial sheets must be handed both online at the beginning of the week, and then again at the end of the tutorial (you are able to change your answers during discussion in the tutorial, so the sheets are essentially free marks). The tutorial sheets do provide good study materials and practice questions for the final exam.\\
+    The tutorials in 2016 were mediocre but the marked tutorial sheets must be handed both online at the beginning of the week, and then again at the end of the tutorial (you are able to change your answers during discussion in the tutorial, so the sheets are essentially free marks). The tutorial sheets do provide good study materials and practice questions for the final exam.
 
-    The report is expected to be quite in depth, with research based on peer-reviewed literature. Students are given a choice of two topics and the report is designed to be an overview of the state of information security in the chosen area.\\
+    The report is expected to be quite in depth, with research based on peer-reviewed literature. Students are given a choice of two topics and the report is designed to be an overview of the state of information security in the chosen area.
 
-    The final exam is open book and in 2016 was reasonably easy, with several questions being repeated or similar to past exams, and all questions being doable with notes and a good understanding of the course material.\\
+    The final exam is open book and in 2016 was reasonably easy, with several questions being repeated or similar to past exams, and all questions being doable with notes and a good understanding of the course material.
 
     Overall, this course provides an interesting overview of the InfoSec field, with the added benefit of being taught by someone who actually applies the content for a living. Recommended if you are considering InfoSec as a career path or have a general interest in the field.
 },

tex/courses/subjects/COMS3200.tex

@@ -13,13 +13,13 @@
 Final Exam & 55\% & Open book exam with multi-choice and short answer questions. \\
 },
 review = {
-    This course provides a thorough overview of modern computer networking, based around the TCP/IP stack. Much of the content will be familiar to students who have completed CSSE2310, but the theory is covered in greater detail here.\\
+    This course provides a thorough overview of modern computer networking, based around the TCP/IP stack. Much of the content will be familiar to students who have completed CSSE2310, but the theory is covered in greater detail here.
 
-    The course lectures can be boring but do cover the content well. It is worth either attending the lectures or studying the lecture notes, but the course does not require much external study beyond that. Tutorials are pointless generally, but students are required to demo the programming components of their assignments in them.\\
+    The course lectures can be boring but do cover the content well. It is worth either attending the lectures or studying the lecture notes, but the course does not require much external study beyond that. Tutorials are pointless generally, but students are required to demo the programming components of their assignments in them.
 
-    The assignments are all quite easy and can be completed with minimal effort. Nominally, all three assignments involve a theory and programming part, but in 2016 the last assignment had no programming component. For the programming parts, there is no restriction on choice of programming language.\\
+    The assignments are all quite easy and can be completed with minimal effort. Nominally, all three assignments involve a theory and programming part, but in 2016 the last assignment had no programming component. For the programming parts, there is no restriction on choice of programming language.
 
-    The final exam is open book, and is incredibly easy (based on the 2016 course). If you bring in a good set of notes and have a reasonable understanding the content you will have little trouble with the final. Past exams are reasonably representative, but some years have extra cryptography content not included in more recent years.\\
+    The final exam is open book, and is incredibly easy (based on the 2016 course). If you bring in a good set of notes and have a reasonable understanding the content you will have little trouble with the final. Past exams are reasonably representative, but some years have extra cryptography content not included in more recent years.
 
     If you want to get a better understanding of networking and/or want an easy course that requires minimal study beyond contact hours, this course is recommended.
 },

tex/courses/subjects/DECO1400.tex

@@ -9,19 +9,19 @@
 assessment = {
 Tutorials & 20\% & Randomly picked presentations each week, and a paper prototype \\
 Practicals & 30\% & Two exams: one on HTML/CSS, and one on jQuery \\
-Project & 25\% & A fully implemented website in HTML/CSS, plus documentation \\
+Project & 25\% & A fully implemented website in \newline HTML/CSS, plus documentation \\
 Final Exam & 25\% & Closed book final exam on lecture material \\
 },
 review = {
-    This course will teach you all you need to know to create a basic website with HTMl, CSS and JavaScript. While this course has become more theoretical recently, it still a very practical course. \\
+    This course will teach you all you need to know to create a basic website with HTMl, CSS and JavaScript. While this course has become more theoretical recently, it still a very practical course.
 
-    You will be required to prepare a speech each week on the week's topic in the lecture. The tutor will randomly pick a group to do their speech. Be sure to know the topic well in case you are picked. \\
+    You will be required to prepare a speech each week on the week's topic in the lecture. The tutor will randomly pick a group to do their speech. Be sure to know the topic well in case you are picked.
 
-    The prac class will have a set of activities which help you learn the essential skills of programming in HTML, CSS and jQuery. Two exams will be conducted through the semester in the prac classes. Students who have done CSSE1001 tend to do better on these exams. \\
+    The prac class will have a set of activities which help you learn the essential skills of programming in HTML, CSS and jQuery. Two exams will be conducted through the semester in the prac classes. Students who have done CSSE1001 tend to do better on these exams.
 
-    A full-scale website will be made individually using the skills learnt in the prac classes. An accompanying document will be made explaining the concept, as well as a reference to the design decisions made. \\
+    A full-scale website will be made individually using the skills learnt in the prac classes. An accompanying document will be made explaining the concept, as well as a reference to the design decisions made.
 
-   	The final exam will be divided into quizzing on the skills learnt in the practical classes, and concepts learnt in the lectures. The first part of the exam should not be difficult for those who did well in the prac exams. \\
+   	The final exam will be divided into quizzing on the skills learnt in the practical classes, and concepts learnt in the lectures. The first part of the exam should not be difficult for those who did well in the prac exams.
 
     Overall, this a very well-rounded and interesting course. Code monkeys might be put off by the speeches, documentation and final exam, but they should just suck it up and do the work.
 },