8 programming-using-java decision-making practices 20102011
Download as PPT, PDF0 likes141 views
This document is a lecture on decision making practices in Java. It identifies errors in code snippets involving if/else statements and while loops. It also contains examples to trace code with variables and determine output based on variable values. The document is in Arabic and English and presented by Mahmoud R. Alfarra on using Java and correcting errors in code involving conditional and iterative structures.
1 of 9
Downloaded 10 times
Ad
Recommended
Computer Programming, Loops using Java - part 2
Computer Programming, Loops using Java - part 2Mahmoud Alfarra Computer Programming, Loops part 2 using Java
Mahmoud Rafeek Alfarra
00972597393906
Computer Programming, Loops using Java
Computer Programming, Loops using JavaMahmoud Alfarra This document discusses repetition statements in Java, including while, for, and do-while loops. It provides examples of using each loop type, such as calculating the average of test grades in a class and summing even integers. The break and continue statements are also covered, along with examples of how they alter loop flow. Key aspects of counter-controlled repetition like loop counters, initialization, increment/decrement, and continuation conditions are defined.
2 programming-using-java how to built application
2 programming-using-java how to built applicationMahmoud Alfarra This document discusses key concepts in programming using Java, including:
1. The programming life cycle consists of five stages: thinking, planning, designing, coding, and testing.
2. Algorithms can be represented through pseudo code and flow charts to document solutions before coding.
3. Several examples of algorithms are provided to calculate averages, check conditions, and iterate through loops.
7 programming-using-java decision-making220102011
7 programming-using-java decision-making220102011Mahmoud Alfarra This document discusses selection statements in Java including if-else statements, nested if-else statements, blocks, and switch statements. It provides examples of using these statements to check conditions, compare values, and select different code paths. It also assigns practice problems for students to write programs using selection statements to check grades, login credentials, and print days of the week.
6 programming-using-java decision-making20102011-
6 programming-using-java decision-making20102011-Mahmoud Alfarra What is the decision ?
Equality and relational operators.
Precedence and associatively of operations
How to use if ?
Practice
Tcs nqt 2019 p 2
Tcs nqt 2019 p 2Phaneendra Bolla This document describes a Java program to check if a given number is prime or not. It takes input from the user and first checks if the number is positive using a check() method. If positive, it calls a prime() method that uses modulo operation to test for divisibility to return true if prime, false if not. It handles exceptions for non-integer input as well. The algorithm and program are explained step-by-step with sample outputs shown.
Tcs nqt 2019 p 1
Tcs nqt 2019 p 1Phaneendra Bolla This document discusses a Java program to determine if a given year is a leap year or not. It presents the algorithm, which checks if the year is divisible by 4 or 400 with a remainder of 0, in which case it returns 1, otherwise it returns 0. The code implements this by taking user input, passing it to a leap() method that performs the check, and prints the return value. It provides example outputs showing it correctly identifies 2016 and 2048 as leap years, and 1803 as a non-leap year.
PF LAB ASSIGNMENT
PF LAB ASSIGNMENTminqadtahir This document is a programming assignment submission containing solutions to two programming problems. It was submitted by Mohammad Minqad Tahir, roll number 08, for their 1st semester programming fundamentals lab course to their instructor Mam Hira Nazir at the Computer Science department of Islamia University Bhawalpur. The first problem calculates the factorial of a user-input number using a while loop. The second problem displays the Fibonacci series for a number of terms input by the user using a for loop.
Cis 355 i lab 2 of 6
Cis 355 i lab 2 of 6helpido9 This document provides instructions for three Java programming assignments that involve input/output and methods:
1. The Largest program takes 10 single-digit numbers as input and prints the largest number. It requires variables for a counter, current number, and largest number found.
2. The Palindrome program checks if a 5-digit user input is a palindrome by reversing the number and comparing. It must include main(), retrieveInput(), check(), and display() methods.
3. The Diamond program displays an asterisk diamond of a specified odd row size using the diamondOfAsterisks() method. It takes a user input for the row size and builds the pattern accordingly.
Cis 355 ilab 2 of 6
Cis 355 ilab 2 of 6comp274 This document provides instructions for three Java programming assignments that involve writing code to solve different problems:
1. The Largest assignment asks students to write a program that takes 10 single-digit numbers as input and prints the largest number.
2. The Palindrome assignment asks students to write a program that takes a 5-digit number as input and determines if it is a palindrome.
3. The Diamond assignment asks students to write a method that displays an asterisk diamond of a specified odd number of rows when given a number input.
#OSSPARIS19: Introduction to scikit-learn - Olivier Grisel, Inria
#OSSPARIS19: Introduction to scikit-learn - Olivier Grisel, InriaParis Open Source Summit This document is an introduction to scikit-learn, an open-source machine learning library for Python. It discusses predictive modeling and how scikit-learn fits into this domain. The presentation covers the basics of machine learning and predictive modeling, provides an overview of scikit-learn including its API and development process, and demonstrates examples of using common algorithms like logistic regression, support vector machines, and random forests.
Cp manual final
Cp manual finalitprasad1237 The document is a computer programming laboratory manual for Malla Reddy College of Engineering & Technology. It contains instructions for students attending the lab and outlines 16 weeks of programming exercises for students to complete. The exercises include programs to calculate sums and averages, generate Fibonacci sequences, check for prime and Armstrong numbers, perform matrix operations, work with strings and files, and more. It provides the goals, algorithms, flowcharts and programs for students to write and test out for each week's assignments.
Data structures Lecture no. 4
Data structures Lecture no. 4AzharIqbal710687 The document discusses algorithms and data structures. It defines an algorithm as a set of well-defined instructions to solve a problem. Some qualities of a good algorithm mentioned include having precise input/output and unambiguous steps. Algorithms should be written in a way that is not specific to any programming language. Examples of algorithms like adding two numbers and finding the largest of three numbers are provided. Data structures and algorithms are important to learn as they help solve computational problems efficiently. Factorials are used as another example to explain algorithms.
Algorithm
Algorithmfarishah A typical programming task can be divided into two phases:
Problem-solving phase: produce an ordered sequence of steps that describe the solution of the problem this sequence of steps is called an algorithm.
Implementation phase: implement the program in some programming language.
Every algorithm must satisfy the following criteria:
Input. Zero or more quantities are externally supplied.
Output. At least one quantity is produced.
Definiteness. Each instruction must be clear and unambiguous(Unique meaning).
Finiteness. An algorithm terminates in a finite number of steps.
Effectiveness. Every instruction must be basic enough to be carried out than, means not so complex.
An algorithm is a finite set of steps defining the solution of a particular problem.
What is the difference between an algorithm and a program?
a program is an implementation of an algorithm to be run on a specific computer and operating system.
an algorithm is more abstract – it does not deal with machine-specific details – think of it as a method to solve a problem.
What is a good algorithm?
Efficient algorithms are good, we generally measure the efficiency of an algorithm based on:
Time: the algorithm should take minimum time to execute.
Space: the algorithm should use less memory.
DIFFERENCE BETWEEN ALGORITHM AND PSEUDOCODE?
An algorithm is a well-defined sequence of steps that provides a solution for a given problem, while pseudocode is one of the methods that can be used to represent an algorithm.
While algorithms can be written in natural language, pseudocode is written in a format that is closely related to high-level programming language structures.
But pseudocode does not use specific programming language syntax and therefore could be understood by programmers who are familiar with different programming languages. Additionally, transforming an algorithm presented in pseudocode to programming code could be much easier than converting an algorithm written in natural language.
But pseudocode does not use specific programming language syntax and therefore could be understood by programmers who are familiar with different programming languages.
Additionally, transforming an algorithm presented in pseudocode to programming code could be much easier than converting an algorithm written in natural language.
Class 9 Lecture Notes
Class 9 Lecture NotesStephen Parsons This is the class notes presentation for Class 9 of the Programming 1026 course: Logic & Problem Solving
Cis355 a ilab 2 control structures and user defined methods devry university
Cis355 a ilab 2 control structures and user defined methods devry universitysjskjd709707 The document provides instructions for an assignment with three programming problems - Largest, Palindrome, and Diamond. For each problem, it describes the required program functionality and provides a grading rubric. The Largest program takes 10 single-digit numbers as input and finds the largest. Palindrome checks if a 5-digit number is a palindrome by using separate methods for input, checking, and output. Diamond displays an asterisk diamond of a specified odd height by calling the diamondOfAsterisks method. Students are instructed to include comments, compile and test their code, and submit zipped files of all programs and outputs.
Algorithm defination, design & Implementation
Algorithm defination, design & ImplementationBilal Maqbool ツ An algorithm is a set of step-by-step instructions to solve a problem or complete a task. It must specify all steps clearly so a computer can follow the algorithm without additional understanding. Algorithms can be represented as pseudocode, a written informal description, or as a flowchart using graphical symbols. The key phases of an algorithm are problem solving to design the steps, then implementation in a programming language. Properties of good algorithms include being correct, efficient, and working for all possible inputs to the problem.
175035 cse lab-05 
175035 cse lab-05 Mahbubay Rabbani Mim This lab report summarizes an experiment on conditional operators, nested loops, and goto statements in C programming. It includes examples of using conditional operators to check student results, nested for loops to print a pattern of numbers, and the goto statement to repeat a number input. The report concludes the experiment taught important programming concepts like decision making and loop control flow. Homework problems provide additional examples of half pyramids, largest number comparisons, and nested loop patterns.
Introduction to computer_lec_04_fall_2018
Introduction to computer_lec_04_fall_2018Ramadan Babers, PhD This document discusses algorithms and programming languages. It provides examples of algorithms to calculate the area of a rectangle, determine if a student passed or failed an exam based on their score, and print numbers from 1 to 100. It then gives two assignments: to write algorithms and flow charts to print odd numbers from 1 to 100 and to print a sequence of numbers and their squares from 1 to a user-input number. The document also discusses the evolution of programming languages from machine language to today's high-level languages and categorizes languages as low-level, high-level, or fourth-generation.
20171127 當julia遇上資料科學
20171127 當julia遇上資料科學岳華 杜 The document introduces Julia, a programming language for scientific computing and data science. It begins with an introduction of the speaker and why they chose Julia. Some key advantages of Julia are its readability like Python but performance of C. Julia avoids the two language problem of Python for development and C for performance. Examples are given of who uses Julia, including economists and cancer researchers. The document then demonstrates basic Julia code and concepts like variables, data types, operators, control flow and functions. It also provides a rock-paper-scissors game example to illustrate Julia concepts.
20170415 當julia遇上資料科學
20170415 當julia遇上資料科學岳華 杜 The document introduces Julia, a programming language for scientific computing and data science. It begins with an introduction of the speaker and why they chose Julia. Some key advantages of Julia are its readability like Python but performance of C. Julia also avoids the two language problem of Python for development and C for performance. Examples are given showing Julia code and its performance. Several use cases of Julia in fields like economics, astronomy, biology are also mentioned.
175035 cse lab-03
175035 cse lab-03Mahbubay Rabbani Mim This lab report summarizes an experiment on C control flow statements, including if, if-else, else if ladder, nested if, and switch statements. It provides code examples and explanations of each statement type. The objectives are to understand the working principles of each statement. The report describes each statement type, provides example code, and shows expected input/output. It concludes that this experiment taught important decision-making statements that will be useful for programming.
Selection Control Structures
Selection Control StructuresPRN USM The document discusses different types of control structures in Java, including sequential, selection, and repetition structures. It focuses on selection structures such as if, if-else, and switch statements. The if statement and if-else statement are explained with examples, including using logical operators and block statements. The switch statement is also covered, highlighting the use of break statements. Multiple selection structures like nested if statements are demonstrated.
JPC#8 Introduction to Java Programming
JPC#8 Introduction to Java ProgrammingPathomchon Sriwilairit This document provides an introduction to Java programming concepts including what Java is, how to set up a Java development environment, basic Java code structure, variables, data types, arithmetic operations, conditional statements, loops, and getting user input. It covers elementary Java topics through examples and explanations. Key points include how to write, compile and run a simple Java program that prints "Hello World", how to declare and use variables of different data types, the different conditional statements (if, if-else, if-else-if-else), looping constructs (while, do-while, for), and taking user input using the Scanner class.
Introduction to Julia
Introduction to Julia岳華 杜 This document introduces Julia and provides an overview of its key features. It begins with introductions and background on why Julia was created. It then covers basic Julia concepts like variables, arithmetic operators, control flow, arrays, functions, and parallelization capabilities. The document also discusses Julia's built-in package ecosystem and provides examples of packages like DataFrames. It aims to provide attendees with foundational knowledge of the Julia programming language.
Decisions in C or If condition
Decisions in C or If conditionyarkhosh The document discusses decision and control statements in C programming, specifically the if and if-else statements. It provides examples of using conditional expressions with logical, relational, and equality operators to evaluate conditions. The if statement executes code if the condition is true, while if-else executes one block for true and another for false. Nested if statements allow for multiple conditions. Braces are recommended with nested ifs to avoid dangling else problems.
Chapter 10: hashing data structure
Chapter 10: hashing data structureMahmoud Alfarra This document provides an outline and overview of hashing and hash tables. It defines hashing as a technique for storing data to allow for fast insertion, retrieval, and deletion. A hash table uses an array and hash function to map keys to array indices. Collision resolution techniques like linear probing are discussed. The document also summarizes the Hashtable class in .NET, which uses buckets and load factor to avoid collisions. Examples of hash functions and using the Hashtable class are provided.
Chapter9 graph data structure
Chapter9 graph data structureMahmoud Alfarra This document discusses graphs and their representation in code. It defines graphs as consisting of vertices and edges, with edges specified as pairs of vertices. It distinguishes between directed and undirected graphs. Key graph terms like paths, cycles, and connectivity are defined. Real-world systems that can be modeled as graphs are given as an example. The document then discusses representing vertices and edges in code, choosing an adjacency matrix to represent the edges in the graph.
Chapter 8: tree data structure
Chapter 8: tree data structureMahmoud Alfarra The document discusses trees and binary trees as data structures. It defines what a tree is, including parts like the root, parent, child, leaf nodes. It then defines binary trees as trees where each node has no more than two children. Binary search trees are introduced as binary trees where all left descendants of a node are less than or equal to the node and all right descendants are greater. The document concludes by discussing how to build a binary search tree class with Node objects.
Chapter 7: Queue data structure
Chapter 7: Queue data structureMahmoud Alfarra This document provides an outline and overview of the queue data structure. It defines a queue as a first-in, first-out (FIFO) structure where new items are added to the rear of the queue and items are removed from the front. The key queue operations of enqueue and dequeue are described. Code examples are provided for implementing a queue using a linked list structure with classes for the queue, its nodes, and methods for common queue operations like enqueue, dequeue, peek, clear, print, and search. Different types of queues like linear, circular, and double-ended queues are also mentioned.
Ad
More Related Content
What's hot (11)
Cis 355 i lab 2 of 6
Cis 355 i lab 2 of 6helpido9 This document provides instructions for three Java programming assignments that involve input/output and methods:
1. The Largest program takes 10 single-digit numbers as input and prints the largest number. It requires variables for a counter, current number, and largest number found.
2. The Palindrome program checks if a 5-digit user input is a palindrome by reversing the number and comparing. It must include main(), retrieveInput(), check(), and display() methods.
3. The Diamond program displays an asterisk diamond of a specified odd row size using the diamondOfAsterisks() method. It takes a user input for the row size and builds the pattern accordingly.
Cis 355 ilab 2 of 6
Cis 355 ilab 2 of 6comp274 This document provides instructions for three Java programming assignments that involve writing code to solve different problems:
1. The Largest assignment asks students to write a program that takes 10 single-digit numbers as input and prints the largest number.
2. The Palindrome assignment asks students to write a program that takes a 5-digit number as input and determines if it is a palindrome.
3. The Diamond assignment asks students to write a method that displays an asterisk diamond of a specified odd number of rows when given a number input.
#OSSPARIS19: Introduction to scikit-learn - Olivier Grisel, Inria
#OSSPARIS19: Introduction to scikit-learn - Olivier Grisel, InriaParis Open Source Summit This document is an introduction to scikit-learn, an open-source machine learning library for Python. It discusses predictive modeling and how scikit-learn fits into this domain. The presentation covers the basics of machine learning and predictive modeling, provides an overview of scikit-learn including its API and development process, and demonstrates examples of using common algorithms like logistic regression, support vector machines, and random forests.
Cp manual final
Cp manual finalitprasad1237 The document is a computer programming laboratory manual for Malla Reddy College of Engineering & Technology. It contains instructions for students attending the lab and outlines 16 weeks of programming exercises for students to complete. The exercises include programs to calculate sums and averages, generate Fibonacci sequences, check for prime and Armstrong numbers, perform matrix operations, work with strings and files, and more. It provides the goals, algorithms, flowcharts and programs for students to write and test out for each week's assignments.
Data structures Lecture no. 4
Data structures Lecture no. 4AzharIqbal710687 The document discusses algorithms and data structures. It defines an algorithm as a set of well-defined instructions to solve a problem. Some qualities of a good algorithm mentioned include having precise input/output and unambiguous steps. Algorithms should be written in a way that is not specific to any programming language. Examples of algorithms like adding two numbers and finding the largest of three numbers are provided. Data structures and algorithms are important to learn as they help solve computational problems efficiently. Factorials are used as another example to explain algorithms.
Algorithm
Algorithmfarishah A typical programming task can be divided into two phases:
Problem-solving phase: produce an ordered sequence of steps that describe the solution of the problem this sequence of steps is called an algorithm.
Implementation phase: implement the program in some programming language.
Every algorithm must satisfy the following criteria:
Input. Zero or more quantities are externally supplied.
Output. At least one quantity is produced.
Definiteness. Each instruction must be clear and unambiguous(Unique meaning).
Finiteness. An algorithm terminates in a finite number of steps.
Effectiveness. Every instruction must be basic enough to be carried out than, means not so complex.
An algorithm is a finite set of steps defining the solution of a particular problem.
What is the difference between an algorithm and a program?
a program is an implementation of an algorithm to be run on a specific computer and operating system.
an algorithm is more abstract – it does not deal with machine-specific details – think of it as a method to solve a problem.
What is a good algorithm?
Efficient algorithms are good, we generally measure the efficiency of an algorithm based on:
Time: the algorithm should take minimum time to execute.
Space: the algorithm should use less memory.
DIFFERENCE BETWEEN ALGORITHM AND PSEUDOCODE?
An algorithm is a well-defined sequence of steps that provides a solution for a given problem, while pseudocode is one of the methods that can be used to represent an algorithm.
While algorithms can be written in natural language, pseudocode is written in a format that is closely related to high-level programming language structures.
But pseudocode does not use specific programming language syntax and therefore could be understood by programmers who are familiar with different programming languages. Additionally, transforming an algorithm presented in pseudocode to programming code could be much easier than converting an algorithm written in natural language.
But pseudocode does not use specific programming language syntax and therefore could be understood by programmers who are familiar with different programming languages.
Additionally, transforming an algorithm presented in pseudocode to programming code could be much easier than converting an algorithm written in natural language.
Class 9 Lecture Notes
Class 9 Lecture NotesStephen Parsons This is the class notes presentation for Class 9 of the Programming 1026 course: Logic & Problem Solving
Cis355 a ilab 2 control structures and user defined methods devry university
Cis355 a ilab 2 control structures and user defined methods devry universitysjskjd709707 The document provides instructions for an assignment with three programming problems - Largest, Palindrome, and Diamond. For each problem, it describes the required program functionality and provides a grading rubric. The Largest program takes 10 single-digit numbers as input and finds the largest. Palindrome checks if a 5-digit number is a palindrome by using separate methods for input, checking, and output. Diamond displays an asterisk diamond of a specified odd height by calling the diamondOfAsterisks method. Students are instructed to include comments, compile and test their code, and submit zipped files of all programs and outputs.
Algorithm defination, design & Implementation
Algorithm defination, design & ImplementationBilal Maqbool ツ An algorithm is a set of step-by-step instructions to solve a problem or complete a task. It must specify all steps clearly so a computer can follow the algorithm without additional understanding. Algorithms can be represented as pseudocode, a written informal description, or as a flowchart using graphical symbols. The key phases of an algorithm are problem solving to design the steps, then implementation in a programming language. Properties of good algorithms include being correct, efficient, and working for all possible inputs to the problem.
175035 cse lab-05
175035 cse lab-05 Mahbubay Rabbani Mim This lab report summarizes an experiment on conditional operators, nested loops, and goto statements in C programming. It includes examples of using conditional operators to check student results, nested for loops to print a pattern of numbers, and the goto statement to repeat a number input. The report concludes the experiment taught important programming concepts like decision making and loop control flow. Homework problems provide additional examples of half pyramids, largest number comparisons, and nested loop patterns.
Introduction to computer_lec_04_fall_2018
Introduction to computer_lec_04_fall_2018Ramadan Babers, PhD This document discusses algorithms and programming languages. It provides examples of algorithms to calculate the area of a rectangle, determine if a student passed or failed an exam based on their score, and print numbers from 1 to 100. It then gives two assignments: to write algorithms and flow charts to print odd numbers from 1 to 100 and to print a sequence of numbers and their squares from 1 to a user-input number. The document also discusses the evolution of programming languages from machine language to today's high-level languages and categorizes languages as low-level, high-level, or fourth-generation.
Similar to 8 programming-using-java decision-making practices 20102011 (7)
20171127 當julia遇上資料科學
20171127 當julia遇上資料科學岳華 杜 The document introduces Julia, a programming language for scientific computing and data science. It begins with an introduction of the speaker and why they chose Julia. Some key advantages of Julia are its readability like Python but performance of C. Julia avoids the two language problem of Python for development and C for performance. Examples are given of who uses Julia, including economists and cancer researchers. The document then demonstrates basic Julia code and concepts like variables, data types, operators, control flow and functions. It also provides a rock-paper-scissors game example to illustrate Julia concepts.
20170415 當julia遇上資料科學
20170415 當julia遇上資料科學岳華 杜 The document introduces Julia, a programming language for scientific computing and data science. It begins with an introduction of the speaker and why they chose Julia. Some key advantages of Julia are its readability like Python but performance of C. Julia also avoids the two language problem of Python for development and C for performance. Examples are given showing Julia code and its performance. Several use cases of Julia in fields like economics, astronomy, biology are also mentioned.
175035 cse lab-03
175035 cse lab-03Mahbubay Rabbani Mim This lab report summarizes an experiment on C control flow statements, including if, if-else, else if ladder, nested if, and switch statements. It provides code examples and explanations of each statement type. The objectives are to understand the working principles of each statement. The report describes each statement type, provides example code, and shows expected input/output. It concludes that this experiment taught important decision-making statements that will be useful for programming.
Selection Control Structures
Selection Control StructuresPRN USM The document discusses different types of control structures in Java, including sequential, selection, and repetition structures. It focuses on selection structures such as if, if-else, and switch statements. The if statement and if-else statement are explained with examples, including using logical operators and block statements. The switch statement is also covered, highlighting the use of break statements. Multiple selection structures like nested if statements are demonstrated.
JPC#8 Introduction to Java Programming
JPC#8 Introduction to Java ProgrammingPathomchon Sriwilairit This document provides an introduction to Java programming concepts including what Java is, how to set up a Java development environment, basic Java code structure, variables, data types, arithmetic operations, conditional statements, loops, and getting user input. It covers elementary Java topics through examples and explanations. Key points include how to write, compile and run a simple Java program that prints "Hello World", how to declare and use variables of different data types, the different conditional statements (if, if-else, if-else-if-else), looping constructs (while, do-while, for), and taking user input using the Scanner class.
Introduction to Julia
Introduction to Julia岳華 杜 This document introduces Julia and provides an overview of its key features. It begins with introductions and background on why Julia was created. It then covers basic Julia concepts like variables, arithmetic operators, control flow, arrays, functions, and parallelization capabilities. The document also discusses Julia's built-in package ecosystem and provides examples of packages like DataFrames. It aims to provide attendees with foundational knowledge of the Julia programming language.
Decisions in C or If condition
Decisions in C or If conditionyarkhosh The document discusses decision and control statements in C programming, specifically the if and if-else statements. It provides examples of using conditional expressions with logical, relational, and equality operators to evaluate conditions. The if statement executes code if the condition is true, while if-else executes one block for true and another for false. Nested if statements allow for multiple conditions. Braces are recommended with nested ifs to avoid dangling else problems.
Ad
More from Mahmoud Alfarra (20)
Chapter 10: hashing data structure
Chapter 10: hashing data structureMahmoud Alfarra This document provides an outline and overview of hashing and hash tables. It defines hashing as a technique for storing data to allow for fast insertion, retrieval, and deletion. A hash table uses an array and hash function to map keys to array indices. Collision resolution techniques like linear probing are discussed. The document also summarizes the Hashtable class in .NET, which uses buckets and load factor to avoid collisions. Examples of hash functions and using the Hashtable class are provided.
Chapter9 graph data structure
Chapter9 graph data structureMahmoud Alfarra This document discusses graphs and their representation in code. It defines graphs as consisting of vertices and edges, with edges specified as pairs of vertices. It distinguishes between directed and undirected graphs. Key graph terms like paths, cycles, and connectivity are defined. Real-world systems that can be modeled as graphs are given as an example. The document then discusses representing vertices and edges in code, choosing an adjacency matrix to represent the edges in the graph.
Chapter 8: tree data structure
Chapter 8: tree data structureMahmoud Alfarra The document discusses trees and binary trees as data structures. It defines what a tree is, including parts like the root, parent, child, leaf nodes. It then defines binary trees as trees where each node has no more than two children. Binary search trees are introduced as binary trees where all left descendants of a node are less than or equal to the node and all right descendants are greater. The document concludes by discussing how to build a binary search tree class with Node objects.
Chapter 7: Queue data structure
Chapter 7: Queue data structureMahmoud Alfarra This document provides an outline and overview of the queue data structure. It defines a queue as a first-in, first-out (FIFO) structure where new items are added to the rear of the queue and items are removed from the front. The key queue operations of enqueue and dequeue are described. Code examples are provided for implementing a queue using a linked list structure with classes for the queue, its nodes, and methods for common queue operations like enqueue, dequeue, peek, clear, print, and search. Different types of queues like linear, circular, and double-ended queues are also mentioned.
Chapter 6: stack data structure
Chapter 6: stack data structureMahmoud Alfarra The document provides an overview of stack data structures, including definitions and examples. It discusses key stack operations like push, pop, peek, clear, print all, and search. Code examples are given for an Employee class and Stack class implementation to demonstrate how these operations work on a stack of employee objects. The document aims to teach the fundamentals of stack data structures and provide code samples to practice stack operations.
Chapter 5: linked list data structure
Chapter 5: linked list data structureMahmoud Alfarra This document provides an outline and overview of linked lists. It defines a linked list as a collection of nodes that are linked together by references to the next node. Each node contains a data field and a reference field. It describes how to implement a linked list using a self-referential class with fields for data and a reference to the next node. It then outlines common linked list operations like insertion and deletion at different positions as well as sorting and searching the linked list.
Chapter 4: basic search algorithms data structure
Chapter 4: basic search algorithms data structureMahmoud Alfarra 1) The document discusses two common search algorithms: sequential search and binary search. Sequential search looks at each item in a list sequentially until the target is found. Binary search works on a sorted list and divides the search space in half at each step.
2) It provides pseudocode examples of how each algorithm works step-by-step to find a target value in a list or array.
3) Binary search is more efficient than sequential search when the list is sorted, as it can significantly reduce the number of comparisons needed to find the target. Sequential search is used when the list is unsorted.
Chapter 3: basic sorting algorithms data structure
Chapter 3: basic sorting algorithms data structureMahmoud Alfarra The document provides an outline and introduction for a chapter on basic sorting algorithms, including bubble sort, selection sort, and insertion sort algorithms. It includes pseudocode examples and explanations of each algorithm. It notes that bubble sort is one of the slowest but simplest algorithms, involving values "floating" to their correct positions. Selection sort finds the smallest element and places it in the first position, then repeats to find the next smallest. Insertion sort works by moving larger elements to the right to make room for smaller elements inserted from the left.
Chapter 2: array and array list data structure
Chapter 2: array and array list data structureMahmoud Alfarra Chapter 2: array and array list data structures
Chapter1 intro toprincipleofc#_datastructure_b_cs
Chapter1 intro toprincipleofc#_datastructure_b_csMahmoud Alfarra This document is a presentation on data structures in C# by Mr. Mahmoud R. Alfarra. It introduces C# and its uses in different applications. It covers various data types in C#, calculations and logical operations, control statements like if/else and loops. The document also discusses arrays, methods, and classes in C#. It provides examples to explain concepts like selection statements, iteration, and calling methods. The presentation aims to provide an introduction to the principles of C# for learning purposes.
Chapter 0: introduction to data structure
Chapter 0: introduction to data structureMahmoud Alfarra This document provides an introduction and outline for a course on data structures. It introduces the lecturer, Mahmoud Rafeek Alfarra, and lists his qualifications. It outlines the course objectives, resources, guidelines, assessment, and schedule. Key topics that will be covered include arrays, sorting and searching algorithms, linked lists, stacks, queues, trees and graphs. The document provides classifications of different types of data structures such as linear vs nonlinear, static vs dynamic memory allocation. It concludes with information about how students can be successful in the course.
3 classification
3 classificationMahmoud Alfarra Definition of classification
Basic principles of classification
Typical
How Does Classification Works?
Difference between Classification & Prediction.
Machine learning techniques
Decision Trees
k-Nearest Neighbors
5 programming-using-java intro-tooop20102011
5 programming-using-java intro-tooop20102011Mahmoud Alfarra This document provides an introduction to object-oriented programming concepts like classes, objects, and methods in Java. It defines classes as templates that define attributes and behaviors of objects as variables and methods. Objects are instances of classes. The document explains how to declare a class with access modifiers, variables, constructors, and methods. It also demonstrates how to create objects using the new keyword and access object attributes and methods.
4 programming-using-java intro-tojava20102011
4 programming-using-java intro-tojava20102011Mahmoud Alfarra First Program in Java
Discussion of the main concepts
Install the JDK and JCreator
Memory Concepts and Data Types
Variables and Identifiers
3 programming-using-java introduction-to computer
3 programming-using-java introduction-to computerMahmoud Alfarra What is a computer?
Computer Organization
Programming languages
Java Class Libraries
Typical Java development environment
Case Study: Unified Modeling Language
1 programming-using-java -introduction
1 programming-using-java -introductionMahmoud Alfarra Who is Lecturer ?!
Course objectives
Resources
Course guidelines
Assessment
A word about lectures
Sending Home works & Questions
Office Hours
How to be successfully ?!
Course outlines
What is Programming?
Why Programming?
تلخيص النصوص تلقائيا
تلخيص النصوص تلقائياMahmoud Alfarra مقدمة حول موضوع تلخيص النصوص تلقائيا Automated Text Summarization وهو من المواضيع المميزة في تنقيب البيانات، ولا تزال مجالا للبحث وانتاج المعرفة.
4×4×4 لتحصيل التميز
4×4×4 لتحصيل التميزMahmoud Alfarra 12 نقطة لتحصيل التميز الدراسي في الحياة الجامعية
في البيت
في المحاضرة
ووقت الامتحان
لتقديم تدريب عن بعد أو مباشر يمكنك التواصل معي عبر:
[email protected]
whatsapp: 00972597393906
بالتوفيق للجميع
Data preparation and processing chapter 2
Data preparation and processing chapter 2Mahmoud Alfarra This document provides an overview of key aspects of data preparation and processing for data mining. It discusses the importance of domain expertise in understanding data. The goals of data preparation are identified as cleaning missing, noisy, and inconsistent data; integrating data from multiple sources; transforming data into appropriate formats; and reducing data through feature selection, sampling, and discretization. Common techniques for each step are outlined at a high level, such as binning, clustering, and regression for handling noisy data. The document emphasizes that data preparation is crucial and can require 70-80% of the effort for effective real-world data mining.
Introduction to-data-mining chapter 1
Introduction to-data-mining chapter 1Mahmoud Alfarra Data mining Course
Chapter 1
Definition of Data Mining
Data Mining as an Interdisciplinary field
The process of Data Mining
Data Mining Tasks
Challenges of Data Mining
Data mining application examples
Introduction to RapidMiner
Ad
Recently uploaded (20)
Kenan Fellows Participants, Projects 2025-26 Cohort
Kenan Fellows Participants, Projects 2025-26 CohortEducationNC These are the educators participating in the Kenan Fellows Program for Teacher Leadership at NC State University.
GDGLSPGCOER - Git and GitHub Workshop.pptx
GDGLSPGCOER - Git and GitHub Workshop.pptxazeenhodekar This presentation covers the fundamentals of Git and version control in a practical, beginner-friendly way. Learn key commands, the Git data model, commit workflows, and how to collaborate effectively using Git — all explained with visuals, examples, and relatable humor.
How to Manage Opening & Closing Controls in Odoo 17 POS
How to Manage Opening & Closing Controls in Odoo 17 POSCeline George In Odoo 17 Point of Sale, the opening and closing controls are key for cash management. At the start of a shift, cashiers log in and enter the starting cash amount, marking the beginning of financial tracking. Throughout the shift, every transaction is recorded, creating an audit trail.
Metamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative JourneyArshad Shaikh *Metamorphosis* is a biological process where an animal undergoes a dramatic transformation from a juvenile or larval stage to a adult stage, often involving significant changes in form and structure. This process is commonly seen in insects, amphibians, and some other animals.
Presentation on Tourism Product Development By Md Shaifullar Rabbi
Presentation on Tourism Product Development By Md Shaifullar RabbiMd Shaifullar Rabbi Presentation on Tourism Product Development By Md Shaifullar Rabbi, Assistant Manager- SABRE Bangladesh.
Grade 3 - English - Printable Worksheet (PDF Format)
Grade 3 - English - Printable Worksheet (PDF Format)Sritoma Majumder Grade 3 - English - Printable Worksheet (PDF Format)
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport This version of the lectures is provided free of charge to graduate students studying the Operations Management course at the MBA level.
SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptx
SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptxRonisha Das SCI BIZ TECH QUIZ (OPEN) PRELIMS - XTASY 2025
How to Manage Purchase Alternatives in Odoo 18
How to Manage Purchase Alternatives in Odoo 18Celine George Managing purchase alternatives is crucial for ensuring a smooth and cost-effective procurement process. Odoo 18 provides robust tools to handle alternative vendors and products, enabling businesses to maintain flexibility and mitigate supply chain disruptions.
One Hot encoding a revolution in Machine learning
One Hot encoding a revolution in Machine learningmomer9505 A brief introduction to ONE HOT encoding a way to communicate with machines
Herbs Used in Cosmetic Formulations .pptx
Herbs Used in Cosmetic Formulations .pptxRAJU THENGE The content is for the educational purpose for Pharmacy and Cosmetic students.
Introduction to Vibe Coding and Vibe Engineering
Introduction to Vibe Coding and Vibe EngineeringDamian T. Gordon Introduction to Vibe Coding and Vibe Engineering
APM Midlands Region April 2025 Sacha Hind Circulated.pdf
APM Midlands Region April 2025 Sacha Hind Circulated.pdfAssociation for Project Management APM event hosted by the Midlands Network on 30 April 2025.
Speaker: Sacha Hind, Senior Programme Manager, Network Rail
With fierce competition in today’s job market, candidates need a lot more than a good CV and interview skills to stand out from the crowd.
Based on her own experience of progressing to a senior project role and leading a team of 35 project professionals, Sacha shared not just how to land that dream role, but how to be successful in it and most importantly, how to enjoy it!
Sacha included her top tips for aspiring leaders – the things you really need to know but people rarely tell you!
We also celebrated our Midlands Regional Network Awards 2025, and presenting the award for Midlands Student of the Year 2025.
This session provided the opportunity for personal reflection on areas attendees are currently focussing on in order to be successful versus what really makes a difference.
Sacha answered some common questions about what it takes to thrive at a senior level in a fast-paced project environment: Do I need a degree? How do I balance work with family and life outside of work? How do I get leadership experience before I become a line manager?
The session was full of practical takeaways and the audience also had the opportunity to get their questions answered on the evening with a live Q&A session.
Attendees hopefully came away feeling more confident, motivated and empowered to progress their careers
To study the nervous system of insect.pptx
To study the nervous system of insect.pptxArshad Shaikh The *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview:
Structure
1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information.
2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing.
3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles.
Functions
1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell.
2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding.
3. *Behavioral responThe *nervous system of insects* is a complex network of nerve cells (neurons) and supporting cells that process and transmit information. Here's an overview:
Structure
1. *Brain*: The insect brain is a complex structure that processes sensory information, controls behavior, and integrates information.
2. *Ventral nerve cord*: A chain of ganglia (nerve clusters) that runs along the insect's body, controlling movement and sensory processing.
3. *Peripheral nervous system*: Nerves that connect the central nervous system to sensory organs and muscles.
Functions
1. *Sensory processing*: Insects can detect and respond to various stimuli, such as light, sound, touch, taste, and smell.
2. *Motor control*: The nervous system controls movement, including walking, flying, and feeding.
3. *Behavioral responses*: Insects can exhibit complex behaviors, such as mating, foraging, and social interactions.
Characteristics
1. *Decentralized*: Insect nervous systems have some autonomy in different body parts.
2. *Specialized*: Different parts of the nervous system are specialized for specific functions.
3. *Efficient*: Insect nervous systems are highly efficient, allowing for rapid processing and response to stimuli.
The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive in diverse environments.
The insect nervous system is a remarkable example of evolutionary adaptation, enabling insects to thrive
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schoolsdogden2 Algebra 1 is often described as a “gateway” class, a pivotal moment that can shape the rest of a student’s K–12 education. Early access is key: successfully completing Algebra 1 in middle school allows students to complete advanced math and science coursework in high school, which research shows lead to higher wages and lower rates of unemployment in adulthood.
Learn how The Atlanta Public Schools is using their data to create a more equitable enrollment in middle school Algebra classes.
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC) A measles outbreak originating in West Texas has been linked to confirmed cases in New Mexico, with additional cases reported in Oklahoma and Kansas. The current case count is 795 from Texas, New Mexico, Oklahoma, and Kansas. 95 individuals have required hospitalization, and 3 deaths, 2 children in Texas and one adult in New Mexico. These fatalities mark the first measles-related deaths in the United States since 2015 and the first pediatric measles death since 2003.
The YSPH Virtual Medical Operations Center Briefs (VMOC) were created as a service-learning project by faculty and graduate students at the Yale School of Public Health in response to the 2010 Haiti Earthquake. Each year, the VMOC Briefs are produced by students enrolled in Environmental Health Science Course 581 - Public Health Emergencies: Disaster Planning and Response. These briefs compile diverse information sources – including status reports, maps, news articles, and web content– into a single, easily digestible document that can be widely shared and used interactively. Key features of this report include:
- Comprehensive Overview: Provides situation updates, maps, relevant news, and web resources.
- Accessibility: Designed for easy reading, wide distribution, and interactive use.
- Collaboration: The “unlocked" format enables other responders to share, copy, and adapt seamlessly. The students learn by doing, quickly discovering how and where to find critical information and presenting it in an easily understood manner.
Link your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRMCeline George In Odoo 17 CRM, linking leads and opportunities to a spreadsheet can be done by exporting data or using Odoo’s built-in spreadsheet integration. To export, navigate to the CRM app, filter and select the relevant records, and then export the data in formats like CSV or XLSX, which can be opened in external spreadsheet tools such as Excel or Google Sheets.
Operations Management (Dr. Abdulfatah Salem).pdf
Operations Management (Dr. Abdulfatah Salem).pdfArab Academy for Science, Technology and Maritime Transport
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)
8 programming-using-java decision-making practices 20102011
- 1. Using Java MINISTRY OF EDUCATION & HIGHER EDUCATION COLLEGE OF SCIENCE AND TECHNOLOGY KHANYOUNIS- PALESTINE Lecture 8 Decision Making Practices
- 2. Identify and correct the errors in each of the following sets of code: if ( gender == 1 ) System.out.println( "Woman" ); else; System.out.println( "Man" ); while ( z >= 0 ) sum += z; 2Presented & Prepared by: Mahmoud R. Alfarra Practice 1
- 3. Identify and correct the errors in each of the following sets of code: if ( age >= 65 ); System.out.println( "Age greater than or equal to 65" ); else System.out.println( "Age is less than 65 )"; int x = 1, total; while ( x <= 10 ){ total += x; ++x; } 3Presented & Prepared by: Mahmoud R. Alfarra Practice 1
- 4. Identify and correct the errors in each of the following sets of code: while ( x <= 100 ) total += x; ++x; while ( y > 0 ) { System.out.println( y ); ++y; } 4Presented & Prepared by: Mahmoud R. Alfarra Practice 1
- 5. Trace the following program, assuming x =5, y = 8 and x=8, y=5: 5Presented & Prepared by: Mahmoud R. Alfarra Practice 2
- 6. Determine the output for each of the given sets of code when x is 9 and y is 11 and when x is 11 and y is 9. 6Presented & Prepared by: Mahmoud R. Alfarra Practice 2
- 7. Determine the output for each of the given sets of code when x is 9 and y is 11 and when x is 11 and y is 9. 7Presented & Prepared by: Mahmoud R. Alfarra Practice 2
- 8. العزة رب يقول(ـهنسبحا) (َلا ـَكِّبَر اسم ِّـحِّبَسـىَلـْع) 8Presented & Prepared by: Mahmoud R. Alfarra
- 9. Practices 9Presented & Prepared by: Mahmoud R. Alfarra