Scribd
Upload
289 views

Computer Science CS/CIS/CN Major Exit Exam Study Guide

The exit exam will cover five key areas of computing sciences: digital logic, discrete mathematics, programming, software engineering, and data structures. The document provides an outline of topics to review for the exam, including positional number representations and Boolean expressions for digital logic, propositional logic and sets for discrete math, functions and classes for programming, software development lifecycles for engineering, and data structures like linked lists, stacks, and queues. Students should also prepare for questions on algorithmic analysis using Big-O notation.

Uploaded by

lucky
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
289 views

Computer Science CS/CIS/CN Major Exit Exam Study Guide

The exit exam will cover five key areas of computing sciences: digital logic, discrete mathematics, programming, software engineering, and data structures. The document provides an outline of topics to review for the exam, including positional number representations and Boolean expressions for digital logic, propositional logic and sets for discrete math, functions and classes for programming, software development lifecycles for engineering, and data structures like linked lists, stacks, and queues. Students should also prepare for questions on algorithmic analysis using Big-O notation.

Uploaded by

lucky
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Science CS/CIS/CN Major Exit Exam Study

Guide
The exit exam will be broken into sections covering five key areas within the computing
sciences: (a) digital logic, (b) discrete mathematics, (c) programming, (d) software engineering,
and (e) data structures.
The following is an outline of topics students may wish to review in preparation of the exam:
1. Digital logic
a. Positional number representations and conversions between them binary, octal,
hexadecimal
b. Karnaugh maps
c. Boolean expressions and their negation
d. Sum of products minterm form expressions
e. Basic 2-input and 3-input logic gates and their truth tables
f. 2s complement representation, negation, and mathematics
2. Discrete mathematics
a. Fundamental conditional and proposition logic
b. Implication
c. DeMorgan's law
d. Contrapositive, converse, and contraconverse of a conditional statement
e. Fundamentals of indirect arguments
f. Sets, subsets, and power sets
3. Programming
a. Function prototyping
i. Purpose and benefits
b. Purpose and benefits of functions and decomposition
c. Function writing
d. Objects and classes
e. Fundamentals of class declaration sections: public, private, etc.
f. Basic pointers
g. Walking through small code snippets
4. Software engineering
a. Fundamental lifecycle models (e.g., waterfall, spiral, and agile) and their common
stages (e.g., requirements/analysis, design, deployment)
b. Software testing and test driven development
c. Purpose of code reviews
d. White and black box testing
5. Data structures
a. Linked-lists
b. Stacks
c. Queues
d. Binary trees

e. Heaps
f. Big-O notation and meaning
g. Determining Big-O for simple code snippets. Think...
1. what does O(N2) code look like?
2. what does O(log2 N) code look like?
3. what does O(N log2 N) code look like?

You might also like