The message below is from ICCP:
Welcome to the CCSCNE
We are the ICCP, Institute for Certifications of Computer Professionals, and we have been around for over 40 years. Every year we issue certificates to students and professionals to showcase their abilities to those around them including employers, networking peers, business partners, etc..
This weekend we will be offering the Computer Science (CS) exam to students as a pay-if-you-pass program. If you don’t pass the exam then you don’t owe us anything. At no risk to you. If you pass you pay only $125 per exam, there are 2 exam parts to take to attain the CSA Certificate, so a total of $250.
The CS test is based upon the ACM/IEEE 2013 Model Curriculum, it is a culmination of everything that you have learned over the past four years at your college or University. For this reason, we recommend the test to Juniors or Seniors, but we don’t discourage sophmores from taking it as it is a no-risk-to-you and it will give you the experience of taking the test, so if you don’t pass the first time next time you might pass.
The Exam is split into 2 parts. Each part is 75 minutes long consisting of 83 questions. All of the questions are theoretical multiple choice questions. You must bring a windows based pc with a USB port to run the exam from. You are not allowed to have anything “on” or “running” while the test is taking place, ie the internet, google, etc.. The test will be offered in room to be announced from 1 to 2:30 pm to give you enough time to finish the two and a half hour exam.
Listed below is an outline of everything that is covered on the exam
CS 2013 EXAM SUBJECT OUTLINE
1.0. ALGORITHMS AND COMPLEXITY
1.1. BASIC ANALYSIS
1.2. ALGORITHMIC STRATEGIES
1.3. FUNDAMENTAL DATA STRUCTURES AND ALGORITHMS
1.4. BASIC AUTOMATA COMPUTABILITY AND COMPLEXITY
2.0. COMPUTATIONAL SCIENCE
2.1. INTRODUCTION TO MODELING AND SIMULATION
2.2. SETS, RELATIONS, AND FUNCTIONS
3.0. DISCRETE STRUCTURES
3.1. BASIC LOGIC
3.2. PROOF TECHNIQUES
3.3. BASICS OF COUNTING
3.4. GRAPHS AND TREES
3.5. DISCRETE PROBABILITY
4.0. GRAPHICS AND VISUAL COMPUTING
4.1. FUNDAMENTAL CONCEPTS
5.0. HUMAN-COMPUTER INTERACTION
5.1. FOUNDATIONS
6.0. INFORMATION ASSURANCE AND SECURITY
6.1. FOUNDATIONAL CONCEPTS IN SECURITY
6.2. PRINCIPLES OF SECURE DESIGN
6.3. DEFENSIVE PROGRAMMING
7.0 INFORMATION MANAGEMENT
7.1. INFORMATION MANAGEMENT CONCEPTS
8.0. NETWORKING AND COMMUNICATIONS
8.1. INTRODUCTION
8.2. NETWORKED APPLICATIONS
9.0. OPERATING SYSTEMS
9.1. OVERVIEW OF OPERATING SYSTEMS
9.2. OPERATING SYSTEMS PRINCIPLES
10.0. PARALLEL AND DISTRIBUTED COMPUTING
10.1. PARALLEL ARCHITECTURE
10.2. PARALLEL DECOMPOSITION
10.3. COMMUNICATION AND COORDINATION
11.0 PROGRAMMING LANGUAGES
11.1. OBJECT ORIENTED PROGRAMMING
11.2. FUNCTIONAL PROGRAMMING
11.3. BASIC TYPE SYSTEMS
12.0. SOFTWARE DEVELOPMENT FUNDAMENTALS
12.1. ALGORITHMS AND DESIGN
12.2. FUNDAMENTAL PROGRAMMING CONCEPTS
12.3. FUNDAMENTAL DATA STRUCTURES
12.4. DEVELOPMENT METHODS
13.0. SOFTWARE ENGINEERING
13.1. SOFTWARE PROCESSES
13.2. REQUIREMENTS ENGINEERING
13.3. SOFTWARE DESIGN
14.0. SYSTEMS FUNDAMENTALS
14.1. COMPUTATIONAL PARADIGMS
14.2. CROSS-LAYER COMMUNICATIONS
14.3. STATE AND STATE MACHINES
14.4. PARALLELISM
14.5. EVALUATION
15.0. SOCIAL ISSUES AND PROFESSIONAL PRACTICE
15.1. SOCIAL CONTEXT
15.2. ANALYTICAL TOOLS
15.3. PROFESSIONAL ETHICS
15.4. INTELLECTUAL PROPERTY
15.5. PRIVACY AND CIVIL LIBERTIES
15.6. PROFESSIONAL COMMUNICATION
15.7. SUSTAINABILITY