0% found this document useful (0 votes)
8 views2 pages

Information Technology Class N

The document provides an overview of fundamental concepts in computer science, including programming basics, data structures, and algorithms. It highlights key details such as the OSI model for networking and the use of SQL for database management. The notes also include review questions to reinforce understanding of the material covered.

Uploaded by

9187793
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views2 pages

Information Technology Class N

The document provides an overview of fundamental concepts in computer science, including programming basics, data structures, and algorithms. It highlights key details such as the OSI model for networking and the use of SQL for database management. The notes also include review questions to reinforce understanding of the material covered.

Uploaded by

9187793
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Information Technology Class Notes

Date: [Insert Date]


Topic: Introduction to Computer Science
Fundamentals
1. Key Concepts
1. Programming Basics

– Syntax: Rules defining structure of code (e.g., print("Hello


World") in Python).

– Variables: Containers for storing data (e.g., age = 20).

– Control Structures:

• Conditionals: if, else, elif statements.

• Loops: for and while loops for repetition.

2. Data Structures

– Arrays/Lists: Ordered collections (e.g., numbers = [1, 2, 3]).

– Dictionaries/Objects: Key-value pairs (e.g., user = {"name":


"Alice", "age": 25}).

– Linked Lists & Trees: Non-linear data structures for complex data
organization.

3. Algorithms

– Sorting: Methods like Bubble Sort, Quick Sort.

– 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).

• TCP/IP: Protocol suite for internet communication (e.g., HTTP, FTP).

Databases
• SQL: Structured Query Language for managing relational databases.

– Example Query:

SELECT name FROM users WHERE age > 30;

• Primary Key: Unique identifier for database records.

3. Summary
• Programming requires understanding syntax, variables, and control flow.

• Data structures optimize data storage and access.

• Algorithms solve problems efficiently (focus on time/space complexity).

• Networking relies on protocols like TCP/IP.

• Databases use SQL to organize and retrieve data.

4. Review Questions
1. What is the difference between an array and a dictionary?

2. Explain the purpose of a loop in programming.

3. Why is Binary Search faster than Linear Search?

4. What does TCP/IP stand for?

5. Write a SQL query to find all employees with a salary over $50,000.

Next Class: Introduction to Web Development (HTML/CSS Basics).


Note: Revise key terms and practice writing pseudocode/SQL queries!

You might also like