skip to main content

CS 102 - Little Bits to Big Ideas

Spring 2020

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Little Bits to Big IdeasCS102AB163230LAB01600 - 1715 T  G27 Foreign Languages Building Daniela M Markazi
David Earle Hopping
Little Bits to Big IdeasCS102AB263231LAB01600 - 1715 W  G27 Foreign Languages Building Ming Jiang
David Earle Hopping
Little Bits to Big IdeasCS102AB363232LAB01600 - 1715 R  G27 Foreign Languages Building Yishuo Liu
David Earle Hopping
Little Bits to Big IdeasCS102AB466601LAB01730 - 1845 T  G27 Foreign Languages Building Amitha Supragna Sandur
David Earle Hopping
Little Bits to Big IdeasCS102AB566603LAB01730 - 1845 W  G27 Foreign Languages Building Mohammad Amanzadeh
David Earle Hopping
Little Bits to Big IdeasCS102AL163225LEC40900 - 0950 M W F  2079 Natural History Building David Earle Hopping
Little Bits to Big IdeasINFO102AB163226LAB01600 - 1715 T  G27 Foreign Languages Building Daniela M Markazi
David Earle Hopping
Little Bits to Big IdeasINFO102AB263227LAB01600 - 1715 W  G27 Foreign Languages Building Ming Jiang
David Earle Hopping
Little Bits to Big IdeasINFO102AB363228LAB01600 - 1715 R  G27 Foreign Languages Building Yishuo Liu
David Earle Hopping
Little Bits to Big IdeasINFO102AB466600LAB01730 - 1845 T  G27 Foreign Languages Building Amitha Supragna Sandur
David Earle Hopping
Little Bits to Big IdeasINFO102AB566602LAB01730 - 1845 W  G27 Foreign Languages Building Mohammad Amanzadeh
David Earle Hopping
Little Bits to Big IdeasINFO102AL163224LEC40900 - 0950 M W F  2079 Natural History Building David Earle Hopping

Official Description

Course Information: Same as INFO 102. See INFO 102.

Text(s)

(Required) Computer Science Illuminated Sixth Edition, Nell Dale and John Lewis, Jones and Bartlett Learning 1284055914

Learning Goals

  1. Students should understand binary representation of numbers, text, and other data.
  2. Students should understand Boolean logic
  3. Students should understand basic digital logic and sequential circuits
  4. Students should be able to read and simulate simple programs
  5. Students should understand some basic algorithms and understand that some algorithms are better than others (basic computational complexity)
  6. Students should understand how basic ADTs work (e.g. stacks, queues, lists, graphs, and trees.)
  7. Students should understand that some problems cannot be solved by computers
  8. Students should recognize the basic components of a computer (e.g. RAM, CPU, motherboard)
  9. Students should understand the role of an operating system in a computer
  10. Students should be able to describe the basics of a computer network and the Internet

Topic List

  1. Binary and Boolean representations
  2. Basic digital design
  3. Basic sequential design
  4. Computation (fetch, decode, execute cycle)
  5. Assembly programming
  6. Representing integers, floats, and text
  7. Algorithms
  8. High level language programming
  9. Abstract data types and objects
  10. Operating systems and file systems
  11. Networking, the internet, and search engines
  12. Computer security and cryptography
  13. Machine learning
  14. Simulations and graphics
  15. Computability and countability

Required, Elective, or Selected Elective

Required for informatics minor

Last updated

2/18/2019by Ryan Matthew Cunningham