OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
A function in PL/SQL is a named block that can take parameters and return a value. Functions have three sections: declaration, executable, and exception handling. They are created using the CREATE FUNCTION statement and can be single-row or multiple-row. Single-row functions return one result per row while multiple-row functions return one result per group of rows. Common functions include character, numeric, date, and conversion functions for manipulating values.
This document discusses procedures and functions in PL/SQL. It defines a subprogram as a program module that performs a particular task. Subprograms can be standalone, packaged, or inside a PL/SQL block. Procedures perform actions without returning values, while functions compute and return a single value. Each subprogram has a declarative part, executable part, and optional exception handling. The document provides examples of creating, executing, and deleting procedures and functions, and explains the IN, OUT, and IN OUT parameter modes.
The document discusses functional programming concepts including pure functions, immutability, higher-order functions, closures, function composition, currying, and referential transparency. It provides examples of these concepts in JavaScript and compares imperative and declarative approaches. Functional programming in Java-8 is discussed through the use of interfaces to define function types with type inference.
This is a whirlwind tour of the FP land and is primarily meant for developers wanting to embark on their functional programming journey. Java is used to understand most of the concepts, however, where it falls short to explain certain concepts such as lazy evaluation, currying and partial function application, de-structuring and pattern-matching, Scala or Groovy or Clojure or even Haskell are used to demonstrate it.
Clojure is a functional programming language that promotes functional programming style. In functional programming, functions are the fundamental building blocks rather than program instructions. Pure functions depend only on their parameters and return a value without side effects. Clojure supports defining functions using defn, anonymous functions, and higher-order functions. Functions can be composed together and curried to create new functions. Recursion is natural in functional programming through expressions like recursion without modifying state.
Procedures functions structures in VB.Nettjunicornfx
This document discusses procedures, functions, and structures in Visual Basic .NET. It defines procedures as blocks of code that can be invoked from other parts of a program and optionally accept arguments. Functions are similar but return a value. Structures allow user-defined data types. The document provides examples and explains how to declare, define parameters for, and call procedures and functions. It also covers argument passing mechanisms, built-in math and string functions, and variable scope.
C++ basics include object-oriented programming concepts like encapsulation, inheritance and polymorphism. Functions can be overloaded in C++ by having the same name but different parameters. Variables have scope depending on whether they are local, global or block variables. Inline functions avoid function call overhead by copying the function code directly into the calling code. Recursion allows functions to call themselves, which can be useful for computing things like factorials.
The document discusses functions in C++. It covers standard and user-defined functions, value-returning and void functions, formal and actual parameters, and how to define, declare, and call functions. It also discusses scope of identifiers, value vs reference parameters, function overloading, and functions with default parameters.
The document describes functions in Pascal programming. It defines what a function is, how it is similar to and different from procedures. It explains the parts of a function like arguments, return type, local declarations, and function body. It provides examples of a basic max function and how to declare, define, call and recursively call functions. It discusses acceptable return types and notes about short-circuit evaluation and passing functions as parameters.
Object Oriented Programming Short Notes for Preperation of ExamsMuhammadTalha436
The document appears to be lecture notes on object-oriented programming using C++. It covers key concepts like classes, objects, encapsulation, inheritance, and polymorphism. It also provides examples of input/output statements, arithmetic operators, assignment operators, and relational operators in C++ code. The document is divided into multiple chapters with topics like classes, inheritance, templates, and exceptions.
Subroutines and functions allow programmers to organize code into reusable blocks. Subroutines contain code that is executed when called but do not return a value, while functions contain code that is executed and returns a value. Both can be called with or without parameters to make them more flexible. To call a subroutine, use the Call statement or just the subroutine name. To call a function, assign its return value to a variable using the function name. The key difference is that functions return a value that can be assigned to a variable, while subroutines do not.
The document discusses pointers in C programming. It provides examples of declaring and using pointers, dereferencing pointers, pointer arithmetic, passing pointers to functions, and const pointers. The examples demonstrate how to print values at addresses, increment pointers, pass pointers to functions to modify variables, and common string functions using pointers.
The document discusses functions in C programming. It defines functions as mini-programs that can take in inputs, execute statements, and return outputs. Functions allow programmers to break large tasks into smaller, reusable parts. The key aspects of functions covered include: defining functions with return types and parameters; calling functions and passing arguments; return values; function prototypes; recursion; and examples of calculating factorials and acceleration using functions.
Bansari Shah's document discusses greedy algorithms. It defines greedy algorithms as making locally optimal choices at each step to find a global optimum. The document outlines the characteristics, optimization problems, pseudo-code for greedy algorithms, and provides an example of Prim's algorithm. It also compares greedy algorithms to dynamic programming and discusses pros and cons, such as greedy algorithms being faster but not always reaching the global optimum.
Functions allow programmers to organize code into reusable blocks. A function is defined using the def keyword and can accept parameters. The body of a function contains a set of statements that run when the function is called. Functions can return values and allow code to be reused, reducing errors and improving readability. Parameters allow information to be passed into functions, while return values allow functions to provide results.
Here is how to convert the method into a curried function:
Function<A, Function<B, Function<C, Function<D, String>>>> func =
a -> b -> c -> d -> String.format("%s, %s, %s, %s", a, b, c, d);
This defines func as a function that takes an argument of type A and returns a function that takes B and returns a function that takes C and returns a function that takes D and returns a String.
Functional Objects in Ruby: new horizons – Valentine OstakhRuby Meditation
This document discusses functional objects in Ruby. It begins by defining a functional object as an object with a callable interface, specifically a #call method. It then explores how functional programming concepts like purity, immutability, higher-order functions, closures, and functional composition can be applied to objects in Ruby. Achieving pure functions without side effects within objects allows them to behave more like functions. This enables better reusability, composition, and adherence to SOLID principles. Functional objects provide a bridge between object-oriented and functional paradigms in Ruby.
This document discusses procedures and functions in PL/SQL. It defines a procedure as a group of PL/SQL statements that can be called by name and does not need to return a value. A function is similar to a procedure but must return a single value. The document provides the syntax for creating procedures and functions, and examples of standalone and recursive procedures and functions. It explains how to call procedures and functions, and the differences between them, such as procedures not having a return value while functions do.
The document discusses improving readability and performance in DataWeave 2.0. It explains that DataWeave is an expression-based language which can lead to nested function calls that are difficult to read. It presents using declarations and do statements in DataWeave 2.0 to write code in a more imperative style with improved readability and performance by avoiding unnecessary calculations. A real-world example of calculating account balances is provided to demonstrate transforming nested expressions into a more readable style using declarations and do statements.
This document discusses parameters in C++. There are two types of parameters: formal parameters defined in a function and actual parameters passed during a function call. C++ supports two ways of passing parameters: call by value where the formal parameter is a copy of the actual value, and call by reference where the formal parameter is an alias to the actual parameter. Call by reference allows a function to modify the original value. While it is more efficient for large data types, it can be ambiguous whether a parameter is intended for input or output.
The document provides an overview of functional programming concepts including:
- Functions are the primary building blocks and avoid side effects by being pure and using immutable data.
- Referential transparency means functions always return the same output for a given input.
- Higher order functions accept or return other functions. Function composition combines functions.
- Partial application and currying transform functions to accept arguments incrementally.
The document discusses MATLAB's Optimization Toolbox. It provides an overview of function optimization and outlines the toolbox's capabilities, including routines for unconstrained and constrained optimization problems. An example is presented to demonstrate unconstrained minimization using the fminunc routine. Options are discussed to customize the optimization parameters, such as tolerance levels and algorithm selection.
User-defined functions (UDFs) are executable database objects that contain SQL statements and return a value. Scalar functions return a single value while table functions return an entire table. UDFs can take parameters and be invoked in expressions or queries. They must be defined with a name, parameters, return type, and SQL statements within a BEGIN-END block to return a value.
Note: This slide was created by me. I am Md. Touhidul Islam Shawan. Here in these slide I have written about some basic points of function of c program and how the function works.
OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
The document describes functions in Pascal programming. It defines what a function is, how it is similar to and different from procedures. It explains the parts of a function like arguments, return type, local declarations, and function body. It provides examples of a basic max function and how to declare, define, call and recursively call functions. It discusses acceptable return types and notes about short-circuit evaluation and passing functions as parameters.
Object Oriented Programming Short Notes for Preperation of ExamsMuhammadTalha436
The document appears to be lecture notes on object-oriented programming using C++. It covers key concepts like classes, objects, encapsulation, inheritance, and polymorphism. It also provides examples of input/output statements, arithmetic operators, assignment operators, and relational operators in C++ code. The document is divided into multiple chapters with topics like classes, inheritance, templates, and exceptions.
Subroutines and functions allow programmers to organize code into reusable blocks. Subroutines contain code that is executed when called but do not return a value, while functions contain code that is executed and returns a value. Both can be called with or without parameters to make them more flexible. To call a subroutine, use the Call statement or just the subroutine name. To call a function, assign its return value to a variable using the function name. The key difference is that functions return a value that can be assigned to a variable, while subroutines do not.
The document discusses pointers in C programming. It provides examples of declaring and using pointers, dereferencing pointers, pointer arithmetic, passing pointers to functions, and const pointers. The examples demonstrate how to print values at addresses, increment pointers, pass pointers to functions to modify variables, and common string functions using pointers.
The document discusses functions in C programming. It defines functions as mini-programs that can take in inputs, execute statements, and return outputs. Functions allow programmers to break large tasks into smaller, reusable parts. The key aspects of functions covered include: defining functions with return types and parameters; calling functions and passing arguments; return values; function prototypes; recursion; and examples of calculating factorials and acceleration using functions.
Bansari Shah's document discusses greedy algorithms. It defines greedy algorithms as making locally optimal choices at each step to find a global optimum. The document outlines the characteristics, optimization problems, pseudo-code for greedy algorithms, and provides an example of Prim's algorithm. It also compares greedy algorithms to dynamic programming and discusses pros and cons, such as greedy algorithms being faster but not always reaching the global optimum.
Functions allow programmers to organize code into reusable blocks. A function is defined using the def keyword and can accept parameters. The body of a function contains a set of statements that run when the function is called. Functions can return values and allow code to be reused, reducing errors and improving readability. Parameters allow information to be passed into functions, while return values allow functions to provide results.
Here is how to convert the method into a curried function:
Function<A, Function<B, Function<C, Function<D, String>>>> func =
a -> b -> c -> d -> String.format("%s, %s, %s, %s", a, b, c, d);
This defines func as a function that takes an argument of type A and returns a function that takes B and returns a function that takes C and returns a function that takes D and returns a String.
Functional Objects in Ruby: new horizons – Valentine OstakhRuby Meditation
This document discusses functional objects in Ruby. It begins by defining a functional object as an object with a callable interface, specifically a #call method. It then explores how functional programming concepts like purity, immutability, higher-order functions, closures, and functional composition can be applied to objects in Ruby. Achieving pure functions without side effects within objects allows them to behave more like functions. This enables better reusability, composition, and adherence to SOLID principles. Functional objects provide a bridge between object-oriented and functional paradigms in Ruby.
This document discusses procedures and functions in PL/SQL. It defines a procedure as a group of PL/SQL statements that can be called by name and does not need to return a value. A function is similar to a procedure but must return a single value. The document provides the syntax for creating procedures and functions, and examples of standalone and recursive procedures and functions. It explains how to call procedures and functions, and the differences between them, such as procedures not having a return value while functions do.
The document discusses improving readability and performance in DataWeave 2.0. It explains that DataWeave is an expression-based language which can lead to nested function calls that are difficult to read. It presents using declarations and do statements in DataWeave 2.0 to write code in a more imperative style with improved readability and performance by avoiding unnecessary calculations. A real-world example of calculating account balances is provided to demonstrate transforming nested expressions into a more readable style using declarations and do statements.
This document discusses parameters in C++. There are two types of parameters: formal parameters defined in a function and actual parameters passed during a function call. C++ supports two ways of passing parameters: call by value where the formal parameter is a copy of the actual value, and call by reference where the formal parameter is an alias to the actual parameter. Call by reference allows a function to modify the original value. While it is more efficient for large data types, it can be ambiguous whether a parameter is intended for input or output.
The document provides an overview of functional programming concepts including:
- Functions are the primary building blocks and avoid side effects by being pure and using immutable data.
- Referential transparency means functions always return the same output for a given input.
- Higher order functions accept or return other functions. Function composition combines functions.
- Partial application and currying transform functions to accept arguments incrementally.
The document discusses MATLAB's Optimization Toolbox. It provides an overview of function optimization and outlines the toolbox's capabilities, including routines for unconstrained and constrained optimization problems. An example is presented to demonstrate unconstrained minimization using the fminunc routine. Options are discussed to customize the optimization parameters, such as tolerance levels and algorithm selection.
User-defined functions (UDFs) are executable database objects that contain SQL statements and return a value. Scalar functions return a single value while table functions return an entire table. UDFs can take parameters and be invoked in expressions or queries. They must be defined with a name, parameters, return type, and SQL statements within a BEGIN-END block to return a value.
Note: This slide was created by me. I am Md. Touhidul Islam Shawan. Here in these slide I have written about some basic points of function of c program and how the function works.
OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
OOP Course " Object oriented programming" using java technology , slide is talking about the Java langauge Basics which need to be understood to start learning OOP
OOP Course " Object oriented programming" using java technology , slide is talking about the concept of Object in Software which need to be understood to start learning OOP
introduction of OOP Course " Object oriented programming" using java technology , slide is talking about the main concepts which need to be understood to start learning OOP
OOP Course " Object oriented programming" using java technology , slide is talking about the concept of Inheritace in Software which need to be understood to start learning OOP
Websoftex Software Solution pvt ltd, successfully running MLM single leg software at an affordable rate with Advanced User Panel & Panel control. Highly experienced and professional team specialized on MLM Software Development, developed more than 3000+ Projects on MLM Domain. MLM Soft is the ultimate MLM Software developer for Single Leg plan, Binary Plan, Helping plan, Commitment
plan and so on.
More detail: www.Websoftex.com
This document summarizes the franchise opportunity for Global Pinoy Remittance and Services Inc (GPRS), which offers 4 main services - remittance, bill payment, ticketing/booking, and airtime loading. The franchise package costs 596,000 PHP and includes marketing materials, signage, and support. Franchisees can earn income from service fees from each service. For example, remittance outlets earn 35% of fees for local transfers. The document provides sample income projections for each service ranging from several thousand to over 300,000 PHP per month depending on transaction volumes.
The Infinite MLM software is an entire solution for all type of business plans like Binary, Matrix,Unilevel, Board, Monoline,Generation and many other MLM Compensation Plans. This is developed by the leading Software development company Infinite Open Source Solutions LLP™. More over the basic MLM Software, we are keen to develop Multi-Level Marketing software as per the MLM business Plan suggested by our clients. Our MLM Website Design is featured of with integrated SMS, E-Wallet, Replicating Website, E-Pin, E-Commerce Shopping Cart, Custom MLM Website Design and more.
According to the modern Multi-Level Marketing (or) MLM Strategies, there are number of MLM Compensation Plans you can choose from. Each Plan has its own advantages and limitations.
Are you looking to start your OWN MLM Business, here is a little presentation that details the Basics of MLM Business and the key considerations, when you design a Business Plan, Compensation Plan & Marketing Plan for your Network Marketing Business
Based on chapter 2 of the textbook "Building Java Programs", 3rd edition. Covers primitive data types, variables, operators, ASCII values for chars, operator precedence, String concatenation, casting, for loops, nested for loops, and class constants.
See a video presentation of this slideshow on my YouTube channel JavaGoddess, at https://www.youtube.com/watch?v=N7SBkMY65gc&t=4s
This document provides an overview of basic Java programming concepts including:
- Java programs require a main method inside a class and use print statements for output.
- Java has primitive data types like int and double as well as objects. Variables are declared with a type.
- Control structures like if/else and for loops work similarly to other languages. Methods can call themselves recursively.
- Basic input is done through dialog boxes and output through print statements. Formatting is available.
- Arrays are objects that store multiple values of a single type and know their own length. Strings are immutable character arrays.
Final year M.E IEEE PROJECTS TITLES 2014-2015 Final year IEEE PROJECTS TITLES 2014-2015 Final year M.TECH IEEE PROJECTS TITLES 2014-2015 Final year B.E IEEE
This document outlines an Angular.io training course that provides 40 hours of instruction over 8 days. The course covers key Angular concepts and features through 20 sections, including components, templates, data binding, routing, and HTTP client. It is aimed at UI/UX developers and targets HTML, CSS, and JavaScript knowledge. The training has regular daily classes from 8am to 1pm and 2pm to 7pm, as well as weekend crash classes. For more information, contact Arjun Sridhar on the provided phone number or website.
- The document discusses event handling in Java GUI programs.
- It explains the Java AWT event delegation model where event sources generate events that are passed to registered listener objects.
- An example program is shown where a button generates an ActionEvent when clicked, which is handled by a listener class that implements the ActionListener interface.
- The AWT event hierarchy and common event types like KeyEvents and MouseEvents are described. Individual events provide information about user input.
- Adapter classes are mentioned which provide default empty implementations of listener interfaces to simplify coding listeners.
The document outlines a web project workshop hosted by Yaazli International that provides training on project management, full stack development, and placement assistance. The workshop covers methodologies like PMBOK and SCRUM and technologies like Java, PHP, and UI/UX design. Participants will work in minimum 2-4 member groups on a real client project using SCRUM methodology over 2-4 months of 8 hour daily sessions. The workshop aims to help participants find jobs and also provides technical and HR interview preparation assistance.
The Toolbar is a view introduced in Android Lollipop that is easier to customize and position than the ActionBar. It can be used on lower Android versions by including the AppCompat support library. To use the Toolbar as an ActionBar, disable the theme-provided ActionBar, add the Toolbar to the activity layout, and include dependencies for AppCompat and Design support libraries.
This document provides an overview of the topics covered in a Core Java online training course. The course consists of 12 modules that cover Java fundamentals, OOP concepts, collections, files and I/O, threads, exceptions, JDBC and more. Each module includes topics to be covered and programming sessions to apply the concepts learned through examples and exercises.
Problem solving using computers - Chapter 1 To Sum It Up
The document discusses problem solving using computers. It begins with an introduction to problem solving, noting that writing a program involves writing instructions to solve a problem using a computer as a tool. It then outlines the typical steps in problem solving: defining the problem, analyzing it, coding a solution, debugging/testing, documenting, and developing an algorithm or approach. The document also discusses key concepts like algorithms, properties of algorithms, flowcharts, pseudocode, and complexity analysis. It provides examples of different algorithm types like brute force, recursive, greedy, and dynamic programming.
Functions allow programmers to organize and structure their code by splitting it into reusable blocks. There are two types of functions: built-in functions that are predefined in Python, and user-defined functions that programmers create. Functions make code easier to debug, test and maintain by dividing programs into separate, reusable parts. Functions can take arguments as input and return values. Function definitions do not alter the normal flow of a program's execution, but calling a function causes the program flow to jump to the function code and then return to pick up where it left off.
The document summarizes the different types of operators in Java, including arithmetic, relational, conditional, and bitwise operators. It provides examples of each type of operator and how they are used in Java code. The main types of operators covered are assignment, arithmetic, unary, relational, conditional, type comparison, and bitwise/bit shift operators. Examples are given to demonstrate how each operator is used and the output it produces.
This presentation covers a detailed overview of python advanced concepts. it covers the below aspects.
Comprehensions
Lambda with (map, filter and reduce)
Context managers
Iterator, Generators, Decorators
Python GIL and multiprocessing and multithreading
Python WSGI
Python Unittests
This book's author is Zafar Ali Khan .
It consists of all the topics of As Level Computer Science topics that are required to be covered.
All credits goes to Zafar Ali Khan .
E2 – Fundamentals, Functions & ArraysPlease refer to announcemen.docxjacksnathalie
E2 – Fundamentals, Functions & Arrays
Please refer to announcements for details about this exam. Make sure you fill the information below to avoid not being graded properly;
Last Name
First Name
Student ID #
Here is the grading matrix where the TA will leave feedback. If you scored 100%, you will most likely not see any feedback (
Question
# points
Feedback
Max
Scored
1
Tracing
3
2
Testing
2
3
Refactoring
2
4
Debugging
3
Interlude – How to Trace Recursive Programs
To help you fill the trace table in question #1, we start with an example of a small recursive program & provide you with the trace table we expect you to draw.
Example Program to Trace
This program implements a power function recursively. We do not have local variables in either function, thus making the information in each activation record a bit shorter.
1 #include <stdio.h>
2 #include <stdlib.h>
3 int pwr(int x, int y){
4
if( y == 0 )
return 1;
5
if( y == 1 )
return x;
6
return x * pwr(x, y-1);
7 }
8 int main(){
9
printf("%d to power %d is %d\n", 5, 3, pwr(5,3));
10
return EXIT_SUCCESS;
11 }
Example Trace Table
Please note the following about the table below;
· We only write down the contents of the stack when it is changed, i.e. when we enter a function or assign a new value to a variable in the current activation record.
· When we write the contents of the stack, we write the contents of the whole stack, including previous activation records.
· Each activation record is identified by a bold line specifying the name of the function & the parameters passed to it when it was invoked.
· It is followed by a bullet list with one item per parameter or local variable.
· New activation records are added at the end of the contents of the previous stack
Line #
What happens?
Stack is
10
Entering main function
main’s activation record
· No local vars / parameters
11
Invoking function pwr as part of executing the printf
Stack is the same, no need to repeat it
4
Entering pwr function with arguments 5 & 3
main’s activation record
· No local vars / parameters
pwr(5,3) activation record
· x is 5
· y is 3
5
Testing if y is 0 ( false
6
Testing if y is 1 ( false
7
Invoking pwr(5,2) as part of return statement
4
Entering pwr function with arguments 5 & 2
main’s activation record
· No local vars / parameters
pwr(5,3) activation record
· x is 5
· y is 3
pwr(5,2) activation record
· x is 5
· y is 2
5
Testing if y is 0 ( false
6
Testing if y is 1 ( false
7
Invoking pwr(5,1)
4
Entering pwr function with arguments 5 & 1
main’s activation record
· No local vars / parameters
pwr(5,3) activation record
· x is 5
· y is 3
pwr(5,2) activation record
· x is 5
· y is 2
pwr(5,1) activation record
· x is 5
· y is 1
5
Testing if y is 0 ( false
6
Testing if y is 1 ( true
6
Return value x which is 5
7
Back from invocation of pwr(5,1) with result 5.
main’s activation record
· No local vars / parameters
pwr(5,3) activation r ...
Operators are symbols that tell the computer to perform mathematical or logical manipulations on data. There are several types of operators in C including arithmetic, relational, logical, assignment, increment/decrement, conditional, and bitwise operators. Operators are used in expressions to manipulate variables and return a value. For example, arithmetic operators like +, -, *, / perform addition, subtraction, multiplication and division on operands.
Algorithms, Structure Charts, Corrective and adaptive.ppsxDaniyalManzoor3
This a very imp presentation for students who want to learn about programming this is using pseudocode and python basic and it also speaks about the basic selection statements and loops stucutre diagrams subroutines which are local and global and main programs
2-Algorithms and Complexit data structurey.pdfishan743441
The document discusses algorithms design and complexity analysis. It defines an algorithm as a well-defined sequence of steps to solve a problem and notes that algorithms always take inputs and produce outputs. It discusses different approaches to designing algorithms like greedy, divide and conquer, and dynamic programming. It also covers analyzing algorithm complexity using asymptotic analysis by counting the number of basic operations and deriving the time complexity function in terms of input size.
The document provides information about Java programming concepts including:
- How to download, install Java, and write a simple "Hello World" program.
- Common operators in Java like arithmetic, assignment, logical, and comparison operators.
- How to compile and run a Java program from the command line.
- Core Java concepts like variables, data types, classes, and methods.
- The document is intended as an introduction to Java programming for beginners.
The document discusses various elements of programming in C++ including literals, variables, types, expressions, statements, control flow constructs, functions, and libraries. It then focuses on different types of operators in C++ like arithmetic, relational, logical, and bitwise operators. It explains operator precedence and associativity rules for evaluating expressions. Special assignment operators, increment/decrement operators, and their differences are also covered.
Program 1 (Practicing an example of function using call by referenc.pdfezhilvizhiyan
Program 1: (Practicing an example of function using call by reference)
Write a program that reads a set of information related to students in C++ class and prints them
in a table format. The information is stored in a file called data.txt. Each row of the file contains
student number, grade for assignment 1, grade for assignment 2, grade for assignment 3, and
grade for assignment 4. Your main program should read each row, pass the grades for the three
assignments to a function called ProcessRow to calculate the average of the grades, minimum of
the four assignments, and the maximum of the four assignments. The results (average,
maximum, and minimum) should be returned to the main program and the main program prints
them on the screen in a table format. For example, if the file includes
126534 7 8 10 7
321345 5 6 4 9
324341 8 3 8 5
your program should print
Std-Id A1 A2 A3 A4 Min Max Average
----------------------------------------------------------------------------------
126534 7 8 10 7 7 10 8
321345 5 6 4 9 4 9 6
324341 8 3 8 5 3 8 6
You must use call by reference to do the above question.
_________________________________________________________________
Program 2: (Practicing an example of function using call by value)
Repeat the above question using call by value. This means you need to have three different
functions: one to calculate the average, another to calculate the minimum, and the third one to
calculate the maximum. This is how to call these functions:
Max = CalculateMax(A1,A2,A3, A4);
Min = CalculateMin(A1,A2,A3, A4);
Average = CalculateAvg(A1,A2,A3, A4);
_________________________________________________________________
Program 3:
Write a program with several functions that performs the following tasks. :
Create a function that reads the following 5 float numbers from the file data.txt into array Called
Arr1.
12.0 15.0 29.3 25.0 93.2
Copy array Arr1 into array Arr2 in reverse order
Print array Arr1.
Print array Arr2.
Find the number of elements in array Arr1 that are >= 80 and <=100.
Find the number of the elements in array Arr1 in which their contents are divisible by 5
Find the index of the elements in array Arr1 in which their contents are divisible by 3.
Find mean (average) in array Arr1.
Find the maximum number in array Arr1.
Ask the user to input a key. Then search for the key in array Arr1 and inform the user about the
existence (true / false) of the key in array
Your program should include several functions.
A function for filling up the information from file into an array (part a should call this function)
A function that does the copying of one array into another in reverse order. Arrays must have the
same size (part b should call this function)
Printing any array with any size (part c and d should call this function)
finding and returning the number of elements between 80 and 100 in any array with any size
(part e calls this function)
finding and returning the number of elements in an array that are divisible by 5 (par.
E2 – Fundamentals, Functions & ArraysPlease refer to announcements.docxshandicollingwood
E2 – Fundamentals, Functions & Arrays
Please refer to announcements for details about this exam. Make sure you fill the information below to avoid not being graded properly;
Last Name
Hanrahan
First Name
Kane
Student ID #
U84918862
Here is the grading matrix where the TA will leave feedback. If you scored 100%, you will most likely not see any feedback
Question
# points
Feedback
Max
Scored
1
Tracing
3
2
Testing
2
3
Refactoring
2
4
Debugging
3
Interlude – How to Trace Recursive Programs
To help you fill the trace table in question #1, we start with an example of a small recursive program & provide you with the trace table we expect you to draw.
Example Program to Trace
This program implements a power function recursively. We do not have local variables in either function, thus making the information in each activation record a bit shorter.
#include
#include
int pwr(int x, int y){
if( y == 0 ) return 1;
if( y == 1 ) return x;
return x * pwr(x, y-1);
}
int main(){
printf("%d to power %d is %d\n", 5, 3, pwr(5,3));
return EXIT_SUCCESS;
}
Example Trace Table
Please note the following about the table below;
We only write down the contents of the stack when it is changed, i.e. when we enter a function or assign a new value to a variable in the current activation record.
When we write the contents of the stack, we write the contents of the whole stack, including previous activation records.
Each activation record is identified by a bold line specifying the name of the function & the parameters passed to it when it was invoked.
It is followed by a bullet list with one item per parameter or local variable.
New activation records are added at the end of the contents of the previous stack
Line #
What happens?
Stack is
10
Entering main function
main’s activation record
No local vars / parameters
11
Invoking function pwr as part of executing the printf
Stack is the same, no need to repeat it
4
Entering pwr function with arguments 5 & 3
main’s activation record
No local vars / parameters
pwr(5,3) activation record
x is 5
y is 3
5
Testing if y is 0
false
6
Testing if y is 1
false
7
Invoking pwr(5,2) as part of return statement
4
Entering pwr function with arguments 5 & 2
main’s activation record
No local vars / parameters
pwr(5,3) activation record
x is 5
y is 3
pwr(5,2) activation record
x is 5
y is 2
5
Testing if y is 0
false
6
Testing if y is 1
false
7
Invoking pwr(5,1)
4
Entering pwr function with arguments 5 & 1
main’s activation record
No local vars / parameters
pwr(5,3) activation record
x is 5
y is 3
pwr(5,2) activation record
x is 5
y is 2
pwr(5,1) activation record
x is 5
y is 1
5
Testing if y is 0
false
6
Testing if y is 1
true
6
Return value x which is 5
7
Back from invocation of pwr(5,1) with result 5.
main’s activation record
No local vars / parameters
pwr(5,3) activation record
x is 5
y is 3
pwr(5,2) activation record
x is 5
y is 2
7
Return the result * x
= 5 * 5
= .
This document discusses functions in R language and data analysis. It explains control structures like if/else statements, the ... argument which allows a variable number of arguments, function arguments and defaults, lazy evaluation of arguments, and how the ... argument is used when the number of arguments is unknown. Examples are provided to illustrate if/else logic, formals() to view function arguments, and how ... passes variable arguments to functions like paste() and cat().
This document provides an introduction to the Java programming language. It discusses Java's evolution and history from 1991 to present. It also covers Java fundamentals including data types, operators, decision making and looping constructs, classes and objects, arrays and strings. The document is intended as an overview of the major topics and features in Java.
This document discusses numeric data types and operations in Java. It introduces common numeric data types like byte, short, int, long, float, and double. It explains arithmetic expressions and operators like addition, subtraction, multiplication, division, and remainder. It covers operator precedence, arithmetic expression evaluation order, and using parentheses to alter evaluation order. It also discusses the Math class for common mathematical functions.
Functions and tasks allow for code reusability in Verilog. Functions are used for combinational logic, execute immediately without delays, and return a single value. Tasks can contain delays and timing controls, are used for both combinational and sequential logic, and can pass multiple values through input/output arguments but do not return a value. The key differences are that functions cannot enable other tasks or contain delays while tasks can enable other tasks and functions and can contain delays.
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
session 8 is about how to get data for network using NSURLSession and
Getting image from camera or choose Image from Gallery
this session # 8
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
session 7 is about how to get data for network using NSURLConnection and
Data Exchange format"JSON"
this session # 7
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
this session # 5
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
this session # 4
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
this session # 3
This document provides an overview of developing mobile applications for iOS. It discusses creating classes and objects in Objective-C, including .h and .m files, alloc and init methods, and NSLogging. It also covers the model-view-controller framework, creating user interfaces with nibs/xibs and storyboards, and the layered iOS architecture including the Cocoa Touch, Media, and Core Services layers. The document is presented by Amr Elghadban and includes information about his background and contact details.
iOS development Crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
this session # 1 after the intro
introduction to iOS development, crash course in how to build an native application for iPhone.
i will be start from beginning till publishing on Apple Store step by step.
Noah Loul Shares 5 Steps to Implement AI Agents for Maximum Business Efficien...Noah Loul
Artificial intelligence is changing how businesses operate. Companies are using AI agents to automate tasks, reduce time spent on repetitive work, and focus more on high-value activities. Noah Loul, an AI strategist and entrepreneur, has helped dozens of companies streamline their operations using smart automation. He believes AI agents aren't just tools—they're workers that take on repeatable tasks so your human team can focus on what matters. If you want to reduce time waste and increase output, AI agents are the next move.
Dev Dives: Automate and orchestrate your processes with UiPath MaestroUiPathCommunity
This session is designed to equip developers with the skills needed to build mission-critical, end-to-end processes that seamlessly orchestrate agents, people, and robots.
📕 Here's what you can expect:
- Modeling: Build end-to-end processes using BPMN.
- Implementing: Integrate agentic tasks, RPA, APIs, and advanced decisioning into processes.
- Operating: Control process instances with rewind, replay, pause, and stop functions.
- Monitoring: Use dashboards and embedded analytics for real-time insights into process instances.
This webinar is a must-attend for developers looking to enhance their agentic automation skills and orchestrate robust, mission-critical processes.
👨🏫 Speaker:
Andrei Vintila, Principal Product Manager @UiPath
This session streamed live on April 29, 2025, 16:00 CET.
Check out all our upcoming Dev Dives sessions at https://community.uipath.com/dev-dives-automation-developer-2025/.
Artificial Intelligence is providing benefits in many areas of work within the heritage sector, from image analysis, to ideas generation, and new research tools. However, it is more critical than ever for people, with analogue intelligence, to ensure the integrity and ethical use of AI. Including real people can improve the use of AI by identifying potential biases, cross-checking results, refining workflows, and providing contextual relevance to AI-driven results.
News about the impact of AI often paints a rosy picture. In practice, there are many potential pitfalls. This presentation discusses these issues and looks at the role of analogue intelligence and analogue interfaces in providing the best results to our audiences. How do we deal with factually incorrect results? How do we get content generated that better reflects the diversity of our communities? What roles are there for physical, in-person experiences in the digital world?
Quantum Computing Quick Research Guide by Arthur MorganArthur Morgan
This is a Quick Research Guide (QRG).
QRGs include the following:
- A brief, high-level overview of the QRG topic.
- A milestone timeline for the QRG topic.
- Links to various free online resource materials to provide a deeper dive into the QRG topic.
- Conclusion and a recommendation for at least two books available in the SJPL system on the QRG topic.
QRGs planned for the series:
- Artificial Intelligence QRG
- Quantum Computing QRG
- Big Data Analytics QRG
- Spacecraft Guidance, Navigation & Control QRG (coming 2026)
- UK Home Computing & The Birth of ARM QRG (coming 2027)
Any questions or comments?
- Please contact Arthur Morgan at [email protected].
100% human made.
Vaibhav Gupta BAML: AI work flows without Hallucinationsjohn409870
Shipping Agents
Vaibhav Gupta
Cofounder @ Boundary
in/vaigup
boundaryml/baml
Imagine if every API call you made
failed only 5% of the time
boundaryml/baml
Imagine if every LLM call you made
failed only 5% of the time
boundaryml/baml
Imagine if every LLM call you made
failed only 5% of the time
boundaryml/baml
Fault tolerant systems are hard
but now everything must be
fault tolerant
boundaryml/baml
We need to change how we
think about these systems
Aaron Villalpando
Cofounder @ Boundary
Boundary
Combinator
boundaryml/baml
We used to write websites like this:
boundaryml/baml
But now we do this:
boundaryml/baml
Problems web dev had:
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
State management was impossible.
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
State management was impossible.
Dynamic components? forget about it.
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
State management was impossible.
Dynamic components? forget about it.
Reuse components? Good luck.
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
State management was impossible.
Dynamic components? forget about it.
Reuse components? Good luck.
Iteration loops took minutes.
boundaryml/baml
Problems web dev had:
Strings. Strings everywhere.
State management was impossible.
Dynamic components? forget about it.
Reuse components? Good luck.
Iteration loops took minutes.
Low engineering rigor
boundaryml/baml
React added engineering rigor
boundaryml/baml
The syntax we use changes how we
think about problems
boundaryml/baml
We used to write agents like this:
boundaryml/baml
Problems agents have:
boundaryml/baml
Problems agents have:
Strings. Strings everywhere.
Context management is impossible.
Changing one thing breaks another.
New models come out all the time.
Iteration loops take minutes.
boundaryml/baml
Problems agents have:
Strings. Strings everywhere.
Context management is impossible.
Changing one thing breaks another.
New models come out all the time.
Iteration loops take minutes.
Low engineering rigor
boundaryml/baml
Agents need
the expressiveness of English,
but the structure of code
F*** You, Show Me The Prompt.
boundaryml/baml
<show don’t tell>
Less prompting +
More engineering
=
Reliability +
Maintainability
BAML
Sam
Greg Antonio
Chris
turned down
openai to join
ex-founder, one
of the earliest
BAML users
MIT PhD
20+ years in
compilers
made his own
database, 400k+
youtube views
Vaibhav Gupta
in/vaigup
[email protected]
boundaryml/baml
Thank you!
Generative Artificial Intelligence (GenAI) in BusinessDr. Tathagat Varma
My talk for the Indian School of Business (ISB) Emerging Leaders Program Cohort 9. In this talk, I discussed key issues around adoption of GenAI in business - benefits, opportunities and limitations. I also discussed how my research on Theory of Cognitive Chasms helps address some of these issues
UiPath Community Berlin: Orchestrator API, Swagger, and Test Manager APIUiPathCommunity
Join this UiPath Community Berlin meetup to explore the Orchestrator API, Swagger interface, and the Test Manager API. Learn how to leverage these tools to streamline automation, enhance testing, and integrate more efficiently with UiPath. Perfect for developers, testers, and automation enthusiasts!
📕 Agenda
Welcome & Introductions
Orchestrator API Overview
Exploring the Swagger Interface
Test Manager API Highlights
Streamlining Automation & Testing with APIs (Demo)
Q&A and Open Discussion
Perfect for developers, testers, and automation enthusiasts!
👉 Join our UiPath Community Berlin chapter: https://community.uipath.com/berlin/
This session streamed live on April 29, 2025, 18:00 CET.
Check out all our upcoming UiPath Community sessions at https://community.uipath.com/events/.
Increasing Retail Store Efficiency How can Planograms Save Time and Money.pptxAnoop Ashok
In today's fast-paced retail environment, efficiency is key. Every minute counts, and every penny matters. One tool that can significantly boost your store's efficiency is a well-executed planogram. These visual merchandising blueprints not only enhance store layouts but also save time and money in the process.
Procurement Insights Cost To Value Guide.pptxJon Hansen
Procurement Insights integrated Historic Procurement Industry Archives, serves as a powerful complement — not a competitor — to other procurement industry firms. It fills critical gaps in depth, agility, and contextual insight that most traditional analyst and association models overlook.
Learn more about this value- driven proprietary service offering here.
Role of Data Annotation Services in AI-Powered ManufacturingAndrew Leo
From predictive maintenance to robotic automation, AI is driving the future of manufacturing. But without high-quality annotated data, even the smartest models fall short.
Discover how data annotation services are powering accuracy, safety, and efficiency in AI-driven manufacturing systems.
Precision in data labeling = Precision on the production floor.
Train Smarter, Not Harder – Let 3D Animation Lead the Way!
Discover how 3D animation makes inductions more engaging, effective, and cost-efficient.
Check out the slides to see how you can transform your safety training process!
Slide 1: Why 3D animation changes the game
Slide 2: Site-specific induction isn’t optional—it’s essential
Slide 3: Visitors are most at risk. Keep them safe
Slide 4: Videos beat text—especially when safety is on the line
Slide 5: TechEHS makes safety engaging and consistent
Slide 6: Better retention, lower costs, safer sites
Slide 7: Ready to elevate your induction process?
Can an animated video make a difference to your site's safety? Let's talk.
Special Meetup Edition - TDX Bengaluru Meetup #52.pptxshyamraj55
We’re bringing the TDX energy to our community with 2 power-packed sessions:
🛠️ Workshop: MuleSoft for Agentforce
Explore the new version of our hands-on workshop featuring the latest Topic Center and API Catalog updates.
📄 Talk: Power Up Document Processing
Dive into smart automation with MuleSoft IDP, NLP, and Einstein AI for intelligent document workflows.
HCL Nomad Web – Best Practices and Managing Multiuser Environmentspanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-nomad-web-best-practices-and-managing-multiuser-environments/
HCL Nomad Web is heralded as the next generation of the HCL Notes client, offering numerous advantages such as eliminating the need for packaging, distribution, and installation. Nomad Web client upgrades will be installed “automatically” in the background. This significantly reduces the administrative footprint compared to traditional HCL Notes clients. However, troubleshooting issues in Nomad Web present unique challenges compared to the Notes client.
Join Christoph and Marc as they demonstrate how to simplify the troubleshooting process in HCL Nomad Web, ensuring a smoother and more efficient user experience.
In this webinar, we will explore effective strategies for diagnosing and resolving common problems in HCL Nomad Web, including
- Accessing the console
- Locating and interpreting log files
- Accessing the data folder within the browser’s cache (using OPFS)
- Understand the difference between single- and multi-user scenarios
- Utilizing Client Clocking
Technology Trends in 2025: AI and Big Data AnalyticsInData Labs
At InData Labs, we have been keeping an ear to the ground, looking out for AI-enabled digital transformation trends coming our way in 2025. Our report will provide a look into the technology landscape of the future, including:
-Artificial Intelligence Market Overview
-Strategies for AI Adoption in 2025
-Anticipated drivers of AI adoption and transformative technologies
-Benefits of AI and Big data for your business
-Tips on how to prepare your business for innovation
-AI and data privacy: Strategies for securing data privacy in AI models, etc.
Download your free copy nowand implement the key findings to improve your business.
3. JAVA :Language Basics part2
OPERATORS
▸ Operators are special symbols that perform specific
operations on one, two, or three operands, and then return
a result.
▸ The operators in the following table are listed according to
precedence order.
▸ The closer to the top of the table an operator appears, the
higher its precedence.
▸ Operators with higher precedence are evaluated before
operators with relatively lower precedence.
4. JAVA :Language Basics part2
OPERATORS
▸ In general-purpose programming, certain operators tend
to appear more frequently than others.
▸ for example, the assignment operator "=" is far more
common than the unsigned right shift operator ">>>".
5. JAVA :Language Basics part2
OPERATORS
▸ The Simple Assignment Operator
▸ One of the most common operators that you'll encounter
is the simple assignment operator "=". You saw this
operator in the Bicycle class; it assigns the value on its
right to the operand on its left:
▸ int cadence = 0;
▸ int speed = 0;
▸ int gear = 1;
6. JAVA :Language Basics part2
OPERATORS
▸ The Arithmetic Operators
▸ Java provides operators that perform addition, subtraction, multiplication, and
division.
▸ The only symbol that might look new to you is "%", which divides one operand by
another and returns the remainder as its result.
Operator Description
+ Additive operator (also
- Subtraction operator
* Multiplication operator
/ Division operator
% Remainder operator
7. JAVA :Language Basics part2
▸ class ArithmeticDemo {
▸ public static void main (String[] args) {
▸ int result = 1 + 2;
▸ // result is now 3
▸ System.out.println("1 + 2 = " + result);
▸ int original_result = result;
▸ result = result - 1;
▸ // result is now 2
▸ System.out.println(original_result + " - 1 = " + result);
▸ original_result = result;
8. JAVA :Language Basics part2
▸ result = result * 2;
▸ // result is now 4
▸ System.out.println(original_result + " * 2 = " + result);
▸ original_result = result;
▸ result = result / 2;
▸ // result is now 2
▸ System.out.println(original_result + " / 2 = " + result);
▸ original_result = result;
9. JAVA :Language Basics part2
▸ result = result + 8;
▸ // result is now 10
▸ System.out.println(original_result + " + 8 = " + result);
▸ original_result = result;
▸ result = result % 7;
▸ // result is now 3
▸ System.out.println(original_result + " % 7 = " + result);
▸ }
▸ }
11. JAVA :Language Basics part2
▸ You can also combine the arithmetic operators with the simple assignment operator to
create compound assignments. For example, x+=1; and x=x+1; both increment the
value of x by 1.
▸ The + operator can also be used for concatenating (joining) two strings together, as
shown in the following ConcatDemo program:
▸ class ConcatDemo {
▸ public static void main(String[] args){
▸ String firstString = "This is";
▸ String secondString = " a concatenated string.";
▸ String thirdString = firstString+secondString;
▸ System.out.println(thirdString);
▸ }
▸ }
▸ By the end of this program, the variable thirdString contains "This is a concatenated
string.", which gets printed to standard output.
12. JAVA :Language Basics part2
OPERATORS
▸ The Arithmetic Operators
▸ Java provides operators that perform addition, subtraction, multiplication, and
division.
▸ The only symbol that might look new to you is "%", which divides one operand by
another and returns the remainder as its result.
Operator Description
+ Unary plus operator indicates positive value
(numbers are positive without this,- Unary minus operator negates an expression
++ Increment operator, increments a value by 1
- - Decrement operator, decrements a value by 1
! Logical complement operator, inverts the
13. JAVA :Language Basics part2
▸ class UnaryDemo {
▸ public static void main(String[] args) {
▸ int result = +1;
▸ System.out.println(result); // result is now 1
▸ result--;
▸ System.out.println(result); // result is now 0
▸ result++;
▸ System.out.println(result); // result is now 1
▸ result = -result;
▸ System.out.println(result); // result is now -1
▸ boolean success = false;
▸ System.out.println(success); // false
▸ System.out.println(!success); // true } }
14. JAVA :Language Basics part2
▸ The increment/decrement operators can be applied
before (prefix) or after (postfix) the operand.
▸ The code result++ and ++result will both end in result
being incremented by one.
▸ The only difference is that the prefix version (++result)
evaluates to the incremented value, whereas the postfix
version (result++) evaluates to the original value.
▸ If you are just performing a simple increment/decrement,
it doesn't really matter which version you choose.
▸ But if you use this operator in part of a larger expression,
the one that you choose may make a significant difference.
15. JAVA :Language Basics part2
▸ The following program, PrePostDemo, illustrates the prefix/postfix unary increment
operator:
▸ class PrePostDemo {
▸ public static void main(String[] args){
▸ int i = 3;
▸ i++;
▸ System.out.println(i); // prints 4
▸ ++i;
▸ System.out.println(i); // prints 5
▸ System.out.println(++i); // prints 6
▸ System.out.println(i++); // prints 6
▸ System.out.println(i); // prints 7
▸ }
▸ }
16. JAVA :Language Basics part2
▸ The Equality and Relational Operators
▸ The equality and relational operators determine if one operand is
greater than, less than, equal to, or not equal to another operand.
The majority of these operators will probably look familiar to you as
well. Keep in mind that you must use "==", not "=", when testing if
two primitive values are equal.
▸ == equal to
▸ != not equal to
▸ > greater than
▸ >= greater than or equal to
▸ < less than
▸ <= less than or equal to
19. JAVA :Language Basics part2
▸ Another conditional operator is ?:, which can be thought of as shorthand for an if-then-else
statement (discussed in the Control Flow Statements section of this lesson). This operator is also
known as the ternary operator because it uses three operands. In the following example, this
operator should be read as: "If someCondition is true, assign the value of value1 to result.
Otherwise, assign the value of value2 to result."
▸ The following program, ConditionalDemo2, tests the ?: operator:
▸ class ConditionalDemo2 {
▸ public static void main(String[] args){
▸ int value1 = 1;
▸ int value2 = 2;
▸ int result;
▸ boolean someCondition = true;
▸ result = someCondition ? value1 : value2;
▸ System.out.println(result); } }
▸ Because someCondition is true, this program prints "1" to the screen. Use the ?: operator instead of
an if-then-else statement if it makes your code more readable; for example, when the expressions
are compact and without side-effects (such as assignments).
20. JAVA :Language Basics part2
▸ The following quick reference summarizes the operators supported by the Java programming language.
▸ Simple Assignment Operator
▸ = Simple assignment operator
▸ Arithmetic Operators
▸ + Additive operator (also used for String concatenation)
▸ - Subtraction operator
▸ * Multiplication operator
▸ / Division operator
▸ % Remainder operator
▸ Unary Operators
▸ + Unary plus operator; indicates positive value (numbers are positive without this, however)
▸ - Unary minus operator negates an expression
▸ ++ Increment operator increments a value by 1
▸ -- Decrement operator decrements a value by 1
▸ ! Logical complement operator inverts the value of a boolean
▸ Equality and Relational Operators
▸ == Equal to
▸ != Not equal to
▸ > Greater than
▸ >= Greater than or equal to
▸ < Less than
▸ <= Less than or equal to
21. JAVA :Language Basics part2
▸ The following quick reference summarizes the operators supported by the Java programming
language.
▸ Conditional Operators
▸ && Conditional-AND
▸ || Conditional-OR
▸ ?: Ternary (shorthand for if-then-else statement)
▸ Type Comparison Operator
▸ instanceof Compares an object to a specified type
▸ Bitwise and Bit Shift Operators
▸ ~ Unary bitwise complement
▸ << Signed left shift
▸ >> Signed right shift
▸ >>> Unsigned right shift
▸ & Bitwise AND
▸ ^ Bitwise exclusive OR
▸ | Bitwise inclusive OR
22. THANKS
WISH YOU A WONDERFUL DAY
▸ Skype : amr_elghadban
▸ Email :[email protected]
▸ Phone : (+20)1098558500
▸ Fb/amr.elghadban
▸ Linkedin/amr_elghadban