foundations of computer science

Foundations of Computer Science challenges members to demonstrate their knowledge of basic computer science and programming concepts through an objective test. This event covers topics such as algorithms, data structures, programming logic, and foundational principles of software development.

Event Overview

Division: Collegiate
Event Type: Individual
Event Category: Objective Test, 100-multiple choice questions (breakdown of question by competencies below)
Objective Test Time: 50 minutes

Career Cluster Framework Connection: Digital Technology
NACE Competency Alignment: Career & Self-Development, Critical Thinking, Technology

Items Competitor Must Provide: Pencil, Computer

This event is intended for students who are early in their collegiate academic journey and just beginning their study of computer science. Only members who have completed no more than six credit hours on a semester schedule (or the equivalent number of quarter hours) of college-level computer science coursework by May 1, 2026, are eligible to compete.

Knowledge Areas

· Software Development Basics

· Algorithmic Foundations

· Database Fundamentals

· Programming Fundamentals

· Systems Foundations

· Networking Foundations

· Cybersecurity Foundations

· Artificial Intelligence Foundations

Test questions are based on the knowledge areas and objectives outlined for this event. Detailed objectives can be found in the study guide included in these guidelines.
State

Eligibility

·         FBLA membership dues are paid by 11:59 pm Eastern Time on February 1st of the current program year.

·         Members must be registered for the SLC and pay the state conference registration fee in order to participate in competitive events.

·         Members must stay within the official FBLA housing block of the official FBLA hotel to be eligible to compete.

·         Each chapter may submit six students in this event.

·         On the state level, each member can compete in up to three different events in the following combinations: three objective tests OR two objective tests and one performance OR two objective tests and one production or one objective test and two production OR one objective test, one performance, and one production. Students may enter the Christopher Heider, Rob Kelleher, Who’s Who event, and one Chapter event (Community Service, State of the Chapter) in addition to their above chosen events.

·         Picture identification (physical or digital: driver’s license, passport, state-issued identification, or school-issued identification) matching the conference nametag is required when checking in for competitive events.

·         If competitors are late for an objective test, they may be either disqualified or permitted to begin late with no extension of the time as scheduled. This is at the discretion of the proctor.

·         Participants must adhere to the Florida FBLA dress code established by the Florida Board of Directors or they will not be permitted to participate in the competitive event.

Recognition

·         The number of competitors will determine the number of winners. The maximum number of winners for each competitive event is 4.

Event Administration

·         This event is an objective test administered prior to the SLC. Advisers will be sent information regarding testing requirements.

·         No reference or study materials may be brought to the testing site.

·         No calculators may be brought into the testing site; online calculators will be provided through the testing software.

Scoring

·         Ties are broken by comparing the correct number of answers to the last 10 questions on the test. If a tie remains, answers to the last 20 questions on the test will be reviewed to determine the winner. If a tie remains, the competitor who completed the test in a shorter amount of time will place higher.

·         Results announced at the State Leadership Conference are considered official and will not be changed after the conclusion of the State Leadership Conference.

Americans with Disabilities Act (ADA)

·         FBLA complies with the Americans with Disabilities Act (ADA) by providing reasonable accommodations for competitors. Accommodation requests must be submitted through the conference registration system by the official registration deadline. All requests will be reviewed, and additional documentation may be required to determine eligibility and appropriate support.

Penalty Points

·         Competitors may be disqualified if they violate the Competitive Event Guidelines or the Honor Code.

Electronic Devices

·        Unless approved as part of a documented accommodation, all cell phones, smartwatches, electronic devices, and headphones must be turned off and stored away before the competition begins. Visible devices during the event will be considered a violation of the FBLA Honor Code.

National

If competing at the National level, be sure to see the National guidelines at https://www.fbla.org/collegiate/competitive-events/

Study Guide: Knowledge Areas and Objectives

Software Development Basics (15 test items)

1. Explain the steps of the software development life cycle (SDLC)

2. Discuss object-oriented and functional programming paradigms

3. Describe key features of object-oriented programming (e.g., encapsulation, abstraction, polymorphism, inheritance)

4. Discuss the use of comments in programs

5. Discuss the use of APIs and third-party libraries in programs

6. Discuss the importance of testing for software development

7. Discuss debugging methods

8. Interpret documentation for functions and classes

Algorithmic Foundations (15 test items)

1. Describe basic data structures (e.g., arrays, lists, hashmaps)

2. Describe basic sorting algorithms (bubble sort, heap sort, merge sort, etc.)

3. Explain recursive algorithms and their use cases

4. Describe the speed and memory performance of simple algorithms

5. Describe basic search algorithms (e.g., linear, binary, two pointers)

6. Describe the advantages and disadvantages of hash tables

7. Write an algorithm in pseudocode to solve a problem

Database Fundamentals (10 test items)

1. Create a relational database with tables, records, fields, primary keys, and foreign keys

2. Write basic SQL queries to obtain specific data sets

3. Design database tables to satisfy requirements

Programming Fundamentals (15 test items)

1. Identify variables by name, data type, scope, and value

2. Call functions with multiple parameters

3. Discuss types of statements (assignment, function calls, control flow, etc.)

4. Describe characteristics of a class or object (attributes, constructors, methods, etc.)

5. Use I/O to create, read from, write to, and delete files

6. Predict the output of a block of code with specified inputs

7. Distinguish between pass-by-value and pass-by-reference

8. Evaluate expressions with function calls, variables, and Boolean logic

Systems Foundations (15 test items)

1. Convert among common data representations (e.g., binary, hexadecimal, decimal)

2. Describe the basic architecture of a computer (e.g., CPU, ALU, buses)

3. Explain the functions of the operating system kernel

4. Discuss the memory hierarchy for computer storage (e.g., caches, registers, RAM)

5. Discuss the importance of locality in computer performance and organization

6. Describe the role of logic gates in computer systems (arithmetic, logic, ALU, etc.)

Networking Foundations (10 test items)

1. Explain how data is transmitted between nodes (packets, packet switching, routers, switches, etc.)

2. Identify types of networks and their uses (WAN, LAN, Wi-Fi, etc.)

3. Discuss the functions of DNS, IP addresses, and MAC addresses

4. Describe the layers of the OSI model

5. Explain basic networking protocols (TCP/IP, UDP, DHCP, etc.)

Cybersecurity Foundations (10 test items)

1. Discuss common cyber attacks and vulnerabilities (DoS, DDoS, phishing, SQL injection, malware, etc.)

2. Describe authentication methods (multi-factor authentication, digital certificates, SSO, etc.)

3. Describe confidentiality, integrity, and availability

4. Explain symmetric and asymmetric cryptography

Artificial Intelligence Foundations (10 test items)

1. Describe foundational algorithms for artificial intelligence (e.g., minimax, search algorithms, alpha-beta pruning)

2. Explain machine learning paradigms (e.g., supervised, unsupervised, reinforcement learning)

3. Describe the concept of neural networks

4. Describe how problems are formulated for AI (initial state, action, transition, etc.)

5. Describe the characteristics of AI agents (autonomy, decision-making, perception, etc.)