CSCI 1112 Lecture Notes - Lecture 1: Weighing Scale, Primitive Data Type, The Algorithm
Document Summary
Writing a program: understand the requirements of the program, structure the raw data of the problem in a informative way, design algorithms that use the structure data to solve to problem. Implementing data structures and algorithms using an appropriate computer language. Data structures: a (cid:862)logi(cid:272)al(cid:863) (cid:449)a(cid:455) of stori(cid:374)g a (cid:272)olle(cid:272)tio(cid:374) of ra(cid:449) data. Data structure taxonomy: primitive vs non-primitive data structures (and types) Primitive: built in: linear (like an array) vs non-linear data structures, homogenous vs non-homogenous data structures. Definition of data types: a data type is a set of values and a set of operations defined on those values, values. Example: the values of the primitive data type int are integers between - The operations of int are the basic arithmetic and logical operations. Basic data types: byte: an 8-(cid:271)it sig(cid:374)ed t(cid:449)o(cid:859)s (cid:272)o(cid:373)pli(cid:373)e(cid:374)t i(cid:374)teger, boolean: true or false, short: a 16-bit sig(cid:374)ed t(cid:449)o(cid:859)s (cid:272)o(cid:373)pli(cid:373)e(cid:374)t.
