INB221 Lecture Notes - Global Variable, Call Stack, Decimal Mark
4 Jul 2013
School
Department
Course
Professor
Document Summary
Inb371 data structures and algorithms lecture 1. Lecture overview introduction to the unit, data structures and algorithms, and. Malcolm corney unit coordinator/lecturer m. corney@qut. edu. au ph: 3138 1923, office: gp-s1042. Prereq knowledge sequence of statements (which statements run first), selection statements (if/else), repetition statements, variables, functions and methods, classes and libraries (object oriented programming basics, encapsulation,extension,etc), editing compilation and debugging. Use abstraction and encapsulation to design abstract data types (adt"s) Analyse and solve programming problems by choosing appropriate data structures and algorithms. Classic algorithms binary search, insertion sort, selection sort, Pc hardware gets faster, memory gets cheaper, following moore"s law. If you as a software developer can make software that uses less memory and resources to run, then you"re doing the world a favour. Smartphones have limited resources, so efficiency is important especially in mobile applications. Some of the challenges which efficiency is helping: 3. 3 million parts of dna which need to be mapped, so efficient string comparison algorithms are required.
