The objective is to study the following topics: Definition of the computer, history of the computer and its development, generations of computers, the data processing cycle, methods of data processing, the physical entity and software of the computer, input and output units, the central processing unit, the control unit, the external storage unit, computer classifications, computer languages, number systems, an introduction to ready-made software and its impact on manual work methods.

This course covers the following topics: basic concepts in computer programming in a high-level language, steps for solving problems using a computer, algorithms, flowcharts, the structure of the programming language used, data and its types, expressions, decisions, iterations, arrays and their applications.

Objective: This course aims to provide students with fundamental concepts in mathematics, particularly calculus and algebra, and their applications. This will equip them to understand advanced computer science topics that rely on this mathematical background. # Contents: * Relations and Functions: • Real numbers / Intervals / Inequalities / Absolute value. • Bilateral relations / Domain and range of a relation / Inverse relations. • Definition of a function / Domain / Range of a function / Odd, even, and one-to-one functions. • Types of functions (bilateral / Linear / Quadratic / Standard / Algebraic / Simple). • Graphing some constant, quadratic, and non-algebraic functions. * Limits and Continuous Functions: • The concept of a limit. • Theorems of limits (limits of multiplication, division, addition, and difference of two functions). • Using factorization, congruence, and formulas to find a limit. • Continuous and discontinuous functions. * Derivatives: • Definition of the first derivative and the rate of change. • The geometric meaning of the first derivative. • Theorems in differentiation. • Differentiation (addition of two functions / difference of two functions / multiplication of two functions / division of two functions). * Determinants and matrices: • Definition of a second-order determinant / expansion of a third-order determinant. • Properties of determinants. • Symmetric, congruent, homogeneous, simultaneous, and linear equations. • Simultaneous equations with two and three unknowns. • Definition of a matrix. • Types of matrices (zero, diagonal, identity matrix). • Operations (addition / subtraction / multiplication) of two matrices. • Imperative, inverse, and determinant matrices. • Solving equations using matrices.

This course covers the following topics: Frequency distributions (some statistical concepts, sources and types of statistical data, methods of collecting statistical data, types of samples and sampling methods, tabular presentation of statistical data, graphical presentation of statistical data), measures of central tendency (arithmetic mean, harmonic mean, median, mode, quartiles, deciles, percentiles), the relationship between the arithmetic mean, median and mode, measures of dispersion (range, mean deviation, standard deviation, variance, quartile deviation, coefficient of variation, measures of skewness and kurtosis), correlation and regression (simple correlation, rank correlation, simple deviation), basic concepts in probability (sample and event space, definition of probability, probability axioms, permutations and combinations, conditional probability - independence, laws of addition and multiplication, Bayes' theorem).

This course aims to enable students to understand the properties of electrical components and equip them to grasp the laws and theories for analyzing DC circuits. It also expands their understanding of AC electrical networks and provides a simplified overview of magnetism and its applications. This course serves as a fundamental building block for students to enhance their technical and engineering skills. Contents: * Introduction • Types of Materials • Atomic Structure • Definition of Magnetic Materials • Systems of Units • Effect of Dimensions and Temperature on Resistance • Thermal Coefficient • Ohm's Law • Series and Parallel Connections of Resistors • Electrical Sources • Electromotive Force (EMF) • Connection of Electrical Sources • Internal Resistance of Electrical Sources • Conditions for Maximum Power Transfer • Kirchhoff's Law • Voltage and Current Division of Circuits • Ring and Nodal Analysis • Teffenn and Northn's Theorems • Superposition Theory • Triangular and star transformations. • Magnetic field and flux, flux density. • Waves • Sine waves. • Square and triangular waves and various signal modes. • Average peak and effective values ​​of signals. • Instantaneous power, power factor, average power. • Resonant circuit, resonant factor, bandwidth. • Finding the shortest power. • Phase-bound systems, phase and line voltages and currents. • Force between two current-carrying conductors • Series and parallel magnetic circuits. • Electric flux density. • Coulomb's law. • Area. • Series and parallel capacitors. • Time constant. • Capacitor discharge and charge. • Farad's first and second laws. • Self-reflexive and reciprocal conversation. • Parallel and series windings. • Equilibrium energy in the electric and magnetic fields. • Ohm's Law • Kirchhoff's Law • The Tufnin and Northen Theorems • The Theory of Structures and its Applications to Alternating Current • Power and Power Measurement • Transformers • Transformer Plant Structure • Transformer Efficiency

OBJECTIVES : This course aims to train the students in speaking and writing skills so they will be able to use these skills ITEMS 1 – GRAMMAR • NOUNS : ** FUNCTIONS OF NOUNS . ** COUNTALE AND UNCOUNTABLE NOUNS . ** PLURAL FORMS OF NOUNS . ** DEFINTE AND INDEFINTE ARTICLES . • PRONOUNS ** SUBJECT PRONOUNS ** OBJECT PRONOUNS ** POSSESSIVE PRONOUNS ** POSSESSIVE ADJECTIVES ** DEMONSTRATIVE PRONOUNS • TENSES : ** PRESENT SIMPLE . ** PRESENT CONTINUOUS . ** PAST SIMPLE . ** PAST CONTINUOUS . ** FUTURE SIMPLE . EACH OF THE TENSES MENTIONED ABOVE SHOULD BE PRESENTED IN THE AFFIRMATIVE , NEGATIVE , AND INTERROGATIVE FORMS , THE MOST COMMON ADVERBS SHOULD BE PRESENTED WITH EACH TENSE • INTERROGATIVES : ** WHO ** WHOM ** WHAT ** WHERE ** WHOSE ** WHICH ** WHY ** HOW ( MANY , MUCH , TALL , OLD , ….ETC ) • ADJECTIVES : ** POSITIONS OF ADJECTIVES . ** PROPER ADJECTIVES ** COMPARATIVE ADJECTIVES . ** SUPERLATIVE ADJECTIVES . ** IRREGULAR ADJECTIVES . • PREPOSITIONS : ** PREPOSITIONS OF TIME . ** PREPOSITIONS OF PLACE . ** PREPOSITIONS ADJECTIVES . 2 - COMPREHENSION : * READING FOR APPRECIATION . FOUR OR FIVE SIMPLE AND SHORT PASSAGES TAUGHT FROM SELECTIONS FOR DEVELOPING READING SKILLS 3 – COMPOSTION : STUDENTS SHOULD BE TAUGHT HOW TO WRTTE SIMPLE SENTENCES CONSISTING OF * - NOUN + VERB ( SUBJECT AND PREDICATE OF SENTENCE) * - NOUN + VERB+ NOUN ( SUBJECT, PREDICATE , OBJECT) * - NOUN + VERB+ NOUN + NOUN (….INDIRECT, DIRECTION ) * - NOUN + VERB+ ADJECTIVE + NOUN . * - ADJECTIVE + NOUN + ADJECTIVE + NOUN * - NOUN + ADVERB + VERB . * - NOUN + ADVERB + VERB + NOUN *- NOUN + VERB+ ADVERB * - NOUN + VERB+ NOUN + ADVERB *- NOUN + VERB+ PREPOSITION + NOUN . *- NOUN + VERB+ PREPOSITION + NOUN + ADVERB . *- VERB + NOUN . *- ADVERB + VERB + NOUN . 4 – PUNCTUATION AND SPELLING . *- CAPITALIZATION . *- FULL STOP . *- QUESTION MARK . *- DOUBLING FINAL CONSTANTS . *- OMISSION OF FINAL ( E ) . *- OMISSION OF FINAL ( Y ) **- ( C ) = a) ( S) **- ( K) ** - ( TCH ) 5- PRONUNCIATION : MORE CONCENTRATION SHOULD BE GIVEN TO THE SOUNDS WHICH DO NOT OCCUR IN ARBIC LANGUAGE OR LIBYAN DIALOG SUCH AS (P).(V).(TH) …AND THOSE WHICH DO NOT HAVE THE POINT OF ARTICULATION SUCH AS ® .(L) … PEFERENCES : Grammar and Vocabulary are taught and Explained toroughly and all four skills are developed systematically . 1- practical English Grammar ( OXFORD UNIVERSPTY PRERE) . 2 – Essential Gramar in use 3 –Developing reading skill ( oxford university press) .

This course covers the following topics: Number systems, sign-carrying number representation, codes, logic gates, Kartov tables, construction of binary, sequential and operand logic circuits, ascending and descending, registers, parallel binary addition circuits, floating-point numbers and their operations, a general overview of computer units (arithmetic logic unit, main memory, input, output and control), laboratory experiments covering the basics of composite logic operations, flippers and time flippers, sequential operations such as registers and counters, arithmetic logic circuits for addition and subtraction operations, logic circuits for data retrieval and storage, instruction search and operation, and design methods for synchronous and asynchronous logic circuits.

This course covers the following topics: • Introduction to the Pascal programming language and its evolution. • A basic overview of programming languages ​​and their types. • A basic overview of algorithms and flowcharts. • Variables, their types, constants, and how to use them in Pascal. • Arithmetic and logical operations. • Relational operators. • How to run a Pascal program. • Familiarity with screens, tools, menus, their functions, and tasks. • How to create a Pascal program (creating a new program, saving a program, opening a program, etc.). • Statements for reading data from the user using the `Read` and `Readln` functions. • The `Write` and `Writeln` functions. • Conditional statements, `if` statements, and nested `if` statements. • Multiple-choice statements (Select case). • Loops: o For statements. o While statements. o Repeat until statements. • Arrays (one-dimensional and two-dimensional). • Functions. • Structures. • Files. • Providing various examples and programs for all statements and programs in Pascal. • In addition to the ability to create a small system in Pascal.

Objective: This course introduces the concept of mathematical logic, the foundation of set and group theories, which are fundamental to computer science logic. It also aims to enable students to use propositional algebra, Boolean algebra, and number theory—topics they will encounter in advanced computer science courses. Contents: * Mathematical Logic • Simple Logical Propositions • Conjunctions, Disjunctions, and Parametric Pairs • Compound Propositions • Truth Tables • Logically True and Declining Propositions • Logical Equivalence • Propositional Algebra and its Laws • Using Propositional Algebra in Proofs Instead of Truth Tables • Applications of Propositional Algebra to Gates * Sets and Groups • The Concept of a Set and Operations on Sets • The Cartesian Product • Inverting and Inverting Relations • Symmetric and Asymmetric Relations • Transitive and Equivalent Relations • Graphical and Directed Representation of Relations • Matrix Representation of Relations • Groups and Half-Groups * Number Theory • Postulates of the Integer Set • Mathematical Deduction • The Rule of Perfect Order • Permutations and Combinations * Boolean Algebra • Postulates and Laws of Boolean Algebra • Examples of Boolean Algebra • Application of Boolean Algebra to Gates Logic

The following topics are studied: • Random Variables: The concept of a random variable, the probability distribution function of a random variable (continuous and discrete). • Expectation: Definition of expectation, addition and multiplication, properties of expectation. • Special Distributions: Two-sided distribution, Poisson distribution, normal distribution, T-distribution, chi-square distribution, F-distribution. • Sampling: The concept of sampling, sampling methods, sampling distributions for the sample mean, sampling distribution for the difference between the means of two samples, and the difference between two ratios (practical application). • Estimation: Basic concepts of point estimation and interval estimation, population mean estimation (point or interval), estimation of the difference between the means of two populations, confidence interval for the population ratio and the difference between the ratios of two populations, confidence interval for variance. • Hypothesis Testing: The concept of a statistical hypothesis, the basic steps of statistical hypothesis testing, hypothesis tests related to (the mean of one population, the difference between the means of two populations, the population ratio, and the difference between the ratios of two populations).

OBJECTIVES : Aims to develop all four skills W – R – L with special emphasis on vocabulary acquisition grammatical accuracy . The course with aim at providing student with other reading materials the view to meeting the needs and interests of students . ITEMS 1 – GRAMMAR • TENSES : ** - PRESENT PERFECT . ** - PAST PERFECT . ** - FUTURE CONTINUOUS . ** FUTURE PERFECT . ( EACH OF THE ABOVE TENSES SHOULD BE PRESENTED IN THE AFFIRMATIVE NEGATIVE AND INTERROGATIVE FORMS ) • MODEL VERBS : ** - CAN . ** - MAY . ** - MUST . ** - HAVE TO ** - OUGHT TO . ( NOTE : THESE MODEL VERBS SHOULD BE PRESENTED IN THE AFFIRMATIVE NEGATIVE AND INTEROGATIVE FORMS ) • RELATIVE CLAUSES ** - DEFINING RC . ** - NON DEFINING RC • PASSIVE VOICE : ** - PRESENT SIMPLE . ** - PAST SIMPLE . ** - PRESENT CONTINUOUS . **- FUTURE SIMPLE . ** - PRESENT PERFECT . ** - PAST CONTINUOUS . ** - PAST PERFECT . 2 – COMPREHENSION : *- THE FIRST TWO UNITS OF THE LANGUAGE OF COMPUTER PROGRAMMING IN ENGLISH . BY JOHN CKEEGEL . *- THE MOST COMMON TERMS OF COMPUTER GIVEN IN THE ABOVE BOOK .

This course aims to study the following topics: - Basic computer design, circuits, arithmetic and logic unit, control circuits, computer organization, representation and processing of decimal numbers in the computer, full-subtractor parallel, arithmetic and logic unit structure, addressing, storing and executing programs in the computer, fetch and execution cycle, studying the timeline of machine cycles, data transfer instructions, arithmetic instructions, unconditional branching and interrupt instructions, semester project in real applications.

This course covers the following topics: • Introduction to the C++ programming language and its development. • A basic overview of programming languages ​​and their types. • A simplified explanation of algorithms and flowcharts. • Variables, their types, constants, and how to use them in C++. • Arithmetic and logical operations. • Relational operators. • Increment and decrement operators (++, --). • An introduction to screens, tools, menus, their functions, and tasks. • How to create a C++ program (creating a new program, saving a program, opening a program, etc.). • Statements for reading data from the user using the cin>> function. • Output and printing statements (cout <<). • If statements, if else statements, and nested if statements. • Multiple-choice statements (select case). • Loops: o For – Next o While – Do while • Arrays: o One-dimensional o Two-dimensional • Functions in C++ • Structures in C++ • Files in C++ • Providing various examples and programs for all statements and programs in C++. • Creating a small system in C++.

This course includes practical training in:  Microsoft Word (printing program).  Microsoft Excel (calculating program).  Microsoft PowerPoint (presentation program).  Photoshop (image editing and design).

This course covers the following topics: Data, information as a resource, its definition and importance in decision-making, components of information systems, their types, a study of DSS, MIS, TPS, and OAS systems, and information systems management and security.

This course covers the following topics: Vector space (the concept of a field, axioms of vector space, linear dependence and linear independence, basis and dimension, sub-vector space), matrices (types of matrices, matrix transform, matrix algebra, operations on rows and columns, equivalent matrix, matrix order, determinants, inverse matrices, and matrix inverse), systems of linear algebraic equations (homogeneous and non-homogeneous), inner wall space (definitions and properties, orthogonality methods, Gram and Smith's method), eigenvalue problem of a matrix (basic definitions and theorems), linear transformations (properties, matrix representation, algebra of linear transformations, diagonal forms of linear transformations, Kelly and Hamilton's theorem), and linear binary forms (quadratic forms and their reduction to canonical forms).

This course covers the following topics: the foundations of logic, logical propositions and connectives, truth tables and logical relations, sets, functions, algorithms, integers and matrices, mathematical reasoning, methods of proof, mathematical induction, regressive definitions and algorithms, combinatorics, counting methods, permutations and combinations (and discrete probabilities), probability theory, and discrete structures.

This course covers the following topics: • General Introduction to Programming Languages • Machine Language • Definition of Assembly Language – Assembler Program • Processor Architecture • 8086 Processor Architecture • Processor Buses • Registers in the 8086 Processor: Types and How to Work with Them • Memory • Number Systems • Binary – Decimal – Octal – Hexadecimal • Conversions Between Number Systems and Operations on Them • General Structure of an Assembly Program • Code Section – Stack Section – Data Section • Program counter – Assembler – LINK – duBG execution • Assembly language instructions • Move instruction • Substitution instruction (XCHG) • Addition instruction (ADC) • Subtraction instruction (Sbb) • Multiplication instruction (lmul) • Division instruction (ldiv) • Comparison instructions • Increment and decrement instructions (lnc) • Iteration instructions using the register (CX) • Arrays • Address patterns • Push instructions (Pop) • Logical instructions and operations (AND, OR, NOT, XOR, Test)

This course covers the following topics: • Description of the hardware and software components of a computer. • Disassembly, assembly, and identification of hardware components. • Practical application of assembling a complete computer. • Methods of installing software and operating systems. • Troubleshooting software and hardware malfunctions. • Computer viruses and antivirus software.

This course covers the following topics: - Basic concepts – general introduction and review of memory, its structure and operation – data types (simple and complex) – arrays – records – strings – algorithms – programs – object-oriented programming. - The importance of studying data structures. - One-dimensional and two-dimensional arrays. - Stacks. - Queues. - Records. - Single-linked lists. - Double-linked lists.

This course covers the following topics:  Taylor Polynomials: Calculating errors when using Taylor polynomials.  Errors: Sources of errors, the Riaci model, representation of numbers according to systems, and the use of calculators for approximation. - Types of Errors:  Circular Errors  Interpolation Errors  Polynomial Interpolation  How to calculate errors with properties: - Absolute Error - Percentage Relative Error - Roots of Linear Equations:  Gaussian Elimination - Successive Approximation - Yacoubian Method - Gauss and Seidel Method - SOR Method - Power Series Method - Interpolation and Radicals:  Interpolation from within (Newton's formula, Lagrange's formula, plane difference formula).  Interpolation from the outside (least squares method), Lagrange, Newton, and Hermit polynomials.  Numerical differentiation:  Newton's formula using Sterling numbers, Lagrange's method.  Numerical integration:  Derivation of the three formulas using the forward difference formula, trapezoidal method, Simpson's method, and Chebyshev's method.  Numerical solution of ordinary differential equations:  Euler's method, Weng's method, Kotta's method, and the method for solving elementary value problems.  Numerical solution of partial differential equations:  Introduction to the method of implicit and explicit finite differences.

This course covers the following topics: data and information, administrative levels, introduction to systems and their concepts, qualifications of a system analyst, system lifecycle, feasibility study report, system analysis techniques, methods of collecting facts, data flowcharts, decision tables, data analysis, modifying data structures, data access forms, systems design techniques, system path forms, file design, model design, icon design, system documentation, system implementation - system maintenance, network analysis and software evaluation and review methods.

This course covers the following topics: • Trees • Graphs • Sorting Algorithms • Search, Sort, and Merge

This course covers the following topics: • Introduction to the definition and importance of operating systems. • Types of operating systems based on user bases – multi-user and multi-tasking systems based on execution modes – real-time systems – batch systems – time-sharing systems. • Components: Hardware – Software – Firmware. • Process Concepts • Definition of a process – Process states and lifecycle (within the computer's outputs). • Processor Management Software • Scheduling: Scheduling methods (scheduling principles) based on sequential execution (OIF – FJS – FFW) – multi-program scheduling. • Memory Management Software • Single memory – Coherent single memory management. o Renewable Memory o Static Partitioning of Memory o Variable Partitioning of Memory o Page Partitioning of Memory o Virtual Memory o Memory Management by Required Pages o Memory Management by Sharding o Memory Management by Sharding and Required Pages  File Management Software  Network Operating Systems o What is a network? – Components of a network operating system – Its importance – Its benefits o Types of networks: Fully Connected, Star, Ring, Bus Practical: - Exploring the advanced features of an operating system (MS-DOS), particularly the use of BATSH FILE commands in projects. - A case study comparing the MS-DOS operating system and the UNIX operating system regarding the management of the four basic resources (input/output, processors, memory, and storage).

This course aims to cover the following topics: • Introduction to Visual Basic and its development. • A basic overview of programming languages ​​and their types. • A simplified understanding of algorithms and flowcharts. • Variables, their types, constants, and how to use them. • Arithmetic and logical operations. • Relational operators. • How to run a Visual Basic program. • Understanding screens, tools, menus, their functions, and tasks. • Designing forms using the available tools. • How to set up a Visual Basic program (creating a new program, saving the program, opening the program, etc.). • Data reading statements from the user using the Console.Read() function. • Output and printing statements using the Console.write() function via the Console Application. • If statement – ​​If else statement – ​​Nested if statement. • Select case statement. • Loops: o For statement – ​​Next statement o While statement – ​​Do while statement. • Arrays: o One-dimensional o Two-dimensional • Setting up practical Windows Forms applications. • Setting up practical Console applications.

This course covers the following topics: Introduction to Communications, Communication Systems and Data Distribution, Types of Communication Systems, Nature of Communication Waves, Modulation and its Types, Digital Communications, Types of Data Transmission Medium, Communication System Requirements, Concurrent and Interlaced Communication Protocols, Sequential and Parallel Communications with Examples, The Concept of Communication Networks, Basic Concepts of Networking, Typical Network Components, Terminal PCs and Servers, Interconnection Tools, Network Operating System, Local Area Network (LAN), Wide Area Networks (WAN), Network Implementation and Design Issues, Responsibilities of the Network Administrator, Use and Configuration of the Network Operating System (User Group Design, Licenses, Rights, Groups and Domains, Adding Sub-Workstations and Printing Capability), Information Exchange over the Network, Detection, Correction and Maintenance of Errors When Sending Data.

This course covers the following topics: • General overview of databases. • Types of databases. • Limitations of a database system. • Field sizes and types. • Database file types. • How to operate a database system. • Working with the control center. • Creating database files and entering data into them. • Designing screens from the control center and using its commands. • Database commands and commands for manipulating files and their contents. • Modifying, sorting, and extracting data from files. • Storing and manipulating data in memory. • Saving, retrieving, and deleting memory fields to an external file. • Database functions, timing functions, calculation functions, conversion functions, etc. • Programming techniques, including program creation, saving, modification, and execution. • Simple and compound IF statements. • Looping and the concept of functions. • Structured programming. • Transferring information from one program to another. • Working with multiple files. • Reports: their creation, types, lengths, etc. • Files: their creation, types, lengths, etc.

This course covers the following topics: • Introduction to Object-Oriented Programming • Features of Object-Oriented Programming • Understanding Input/Output Channels • Functions • Classes and Objects • Inheritance and Polymorphism • Principles of an Object-Oriented Programming Language, its Structure, and Input/Output Statements • Programs, Classes, and Objects • Data Types and Selection and Control Statements • Variable Types • Files • Error Handling

This course covers the following topics: • Introduction to Systems Programming • Definition of Software Types, Language Processing, Higher and Lower Programming Languages • Memory and the Central Processing Unit (CPU) • Construction of Assemblers, Connectors, and Loaders • Conditional Assembly and Extender Processing, Word Processing, and Large File Processing • Introduction to Operating Systems, Business Processing, and Processor Management • Memory Management and File Management

This course covers the following topics: • How to connect Visual Basic to a database, such as Microsoft Access. • Functions in Visual Basic. • Structures in Visual Basic. • Files in Visual Basic. • Providing various examples and programs for all statements and functions in Visual Basic. • Creating a small system using Visual Basic.

This course aims to highlight the security aspects of information systems, and then study and analyze the necessary methods for preventing risks and protecting information. Contents: * Introduction • The need for security systems • Definition of computer system security • Types of threats to computer systems • Security of personal computers and local networks • Data security in networks and communication systems • Vulnerabilities in computer security systems * Methods of protecting personal computers • Programmatic protection, password protection, password limits, disk disaster prevention and recovery • Cryptography, physical protection, viruses * Analysis of security risks to computer systems • Risk analysis, risk reduction, security system evaluation, planning for preventive measures, contingency plans • Factors for evaluating security breach remediation * Cryptography systems • Secret key cryptography • Public key cryptography • Key generation and distribution * Electronic signatures

This course covers the following topics: • The origins and development of scientific research. • The meaning of methodology and research, the qualities of a good researcher, and the objectives of research and writing. • The most important scientific research methodologies (the deductive method, the inductive method, the deductive method, the descriptive method, the historical method, the experimental method, and the analytical and synthetic method). • The integration of scientific methodologies. • The stages of research preparation (selecting the topic, determining the methodology, identifying sources and references, gathering scientific material, using index cards, preparing for writing, drafts, writing the final version of the research, footnotes and annotations, methodological terminology, citation, abbreviation, appendices, indexes, introduction, and conclusion).

This course covers the following topics: • Introduction to the Java programming language and its evolution. • Variables, their types, constants, and how to use them in Java. • Arithmetic and logical operations. • Relational operators. • Increment and decrement operators. • How to run a Java program using the NetBeans IDE 7.1.2. • Understanding screens, widgets, menus, their functions, and tasks. • How to create a Java program (creating a new program, saving a program, opening a program, etc.). • Reading data from the user using the Scanner function in Import Java.util.Scanner. • The System.out.print() printing statement. • Conditional if statements – if-else statements – nested if statements. • Switch case statements. • Loops: o For statements. o While statements. o DO while statements. • Arrays (one-dimensional and two-dimensional). • How to connect Java to a database, such as Access. • Functions in Java. • Structures in Java. • Files in Java. • Providing various examples and programs for all statements and programs in Pascal. • In addition to the ability to create a small organization in Pascal.

This course covers the following topics: • Developing and using a web interface (HTML). • Dynamic HTML, XML. • Unified Java programs. • Information processing implementation programs (with Perl, C, C++, etc.). • JavaScript, JavaService, and animations. • Technical issues in web page design and visual data. • Search engines and their features. • Digital public libraries.

This course covers the following topics:  Specification, design, implementation, and maintenance of large, multi-module software systems.  Principles, techniques, methodologies, and tools for software development.  Human-computer interaction.  Interactive and real-time systems.  Software-hardware interaction.  Application distribution.

This course covers the following topics: Introduction to Artificial Intelligence, Knowledge Systems, Crucible, Programming Methods, Applications such as Model Recognition, Theorem Proof, Search Methods (Blind Search, Deep First Search, Width First Search, Limited Depth Search, Iterative Search, Random Search, Blind Search, Mountain Climb), Understanding Human Languages, Understanding Simulation, Expert Systems Programming Languages, Problem Solving, Introduction to the Prolock or LSP Programming Language.

This course covers the following topics: • An introduction to multimedia used in the world of the internet and computers (audio, images, video, and text). • Types of multimedia, the encoding used in each, and file compression methods. • Areas of multimedia application. • An overview of database systems.

This course covers the following topics: • Introduction to computer-aided design (CAD). • Drawing basic shapes (point, straight line, square, rectangle, triangle). • Combining some shapes. • Designing a specific geometric shape. • Designing various drawings. • Producing musical sounds. • Combining colors. • Animating images. • Designing a complete scene with sound and video.

The student is trained to complete an integrated system where the student prepares a study and analysis of an existing system with the aim of programming it, or designing a website, under the supervision of a specialist in the subject who has scientific experience in this field, and presents it for the purpose of discussion and evaluation.