Information Technology Class N
Information Technology Class N
– Control Structures:
2. Data Structures
– Linked Lists & Trees: Non-linear data structures for complex data
organization.
3. Algorithms
– Searching: Linear Search vs. Binary Search (time complexity: O(n) vs.
O(log n)).
2. Key Details
Pseudocode Example
BEGIN
SET score = 85
IF score >= 90 THEN
PRINT "A"
ELSE IF score >= 80 THEN
PRINT "B"
ELSE
PRINT "C"
END IF
END
Networking Basics
• OSI Model: 7 layers (Physical, Data Link, Network, Transport, Session,
Presentation, Application).
Databases
• SQL: Structured Query Language for managing relational databases.
– Example Query:
3. Summary
• Programming requires understanding syntax, variables, and control flow.
4. Review Questions
1. What is the difference between an array and a dictionary?
5. Write a SQL query to find all employees with a salary over $50,000.