Linq in practice
•Download as PPTX, PDF•
1 like•485 views
Copy: https://docs.google.com/presentation/d/1JKNJDU6KTnzaebh1U2qWRJ6t_E9GNTXY9w-ywDpWRYQ/edit?usp=sharing
Report
Share
Report
Share
Recommended
Theory/literature vs practice - the flipped classroom
This document discusses the theory and practice of flipped classrooms based on literature and examples. It defines flipped classrooms as shifting from traditional lectures to active learning during face-to-face class time after students are first exposed to content outside of class. Several studies show improved exam performance and student perceptions with flipped models in statistics, economics, and calculus courses, though preparation outside of class was sometimes lacking. Open questions remain around large-scale implementation, measuring success, and whether readily available technologies are suitable for all mathematics teaching.
Mixing Functional and Object Oriented Approaches to Programming in C#
The document discusses mixing functional and object-oriented programming approaches in C#, including examples of filtering arrays using predicates and delegates. It covers the evolution of C# from version 1.0 to 3.0, introducing generics, lambda expressions, extension methods and LINQ. Functional programming concepts like higher-order functions, immutability and lazy evaluation are also briefly discussed.
Mixing functional and object oriented approaches to programming in C#
The document discusses mixing functional and object-oriented programming approaches in C#, covering topics like generics, LINQ, lambdas, anonymous methods, extension methods, and more. It provides examples of filtering arrays and enumerables using predicates in increasingly functional styles. It argues that functional programming can complement object-oriented code by abstracting over common operations.
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Data structures lab
The document describes an algorithm to implement a leftist heap data structure in Java with insert and delete minimum operations. It involves the following steps:
1. Start the program by defining heap functions.
2. Insert operations combine two leftist trees by melding them together.
3. Delete minimum removes the root node containing the minimum element.
4. After each insert or delete, the updated leftist heap elements are displayed.
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Step 1: Implement the getSortedRunLength() method
Implement the getSortedRunLength() method in NaturalMergeSorter.java. Access
NaturalMergeSorter.java by clicking on the orange arrow next to NaturalMerge.java at the top of
the coding window.
getSortedRunLength() has three parameters:
array: a reference to an array of integers,
arrayLength: an integer for the array's length, and
startIndex: an integer for the run's starting index.
The method returns the number of array elements sorted in ascending order, starting at startIndex
and ending either at the end of the sorted run, or the end of the array, whichever comes first. The
method returns 0 if startIndex is out of bounds.
File NaturalMerge.java has several test cases for getSortedRunLength() that can be run by
clicking the "Run program" button. One test case also exists for naturalMergeSort(), but that can
be ignored until step two is completed.
The program's output does not affect grading.
Submit for grading to ensure that the getSortedRunLength() unit tests pass before proceeding.
Step 2: Implement the naturalMergeSort() method
Implement the naturalMergeSort() method in NaturalMergeSorter.java. naturalMergeSort() must:
Start at index i=0
Get the length of the first sorted run, starting at i
Return if the first run's length equals the array length
If the first run ends at the array's end, reassign i=0 and repeat step 2
Get the length of the second sorted run, starting immediately after the first
Merge the two runs with the provided merge() method
Reassign i with the first index after the second run, or 0 if the second run ends at the array's end
Go to step 2
NaturalMergeSorter.java
public class NaturalMergeSorter {
public static int getSortedRunLength(int[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static int getSortedRunLength(double[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static void naturalMergeSort(int[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLength) {
return;
}
int secondRunLength = getSortedRunLength(array, arrayLength, i + firstRunLength);
merge(array, i, i + firstRunLength - 1, i + firstRunLength + secondRunLength - 1);
if (i + firstRunLength + secondRunLength == arrayLength) {
i = 0;
} else {
i = i + firstRunLength + secondRunLength;
}
}
}
public static void naturalMergeSort(double[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLen.
Project_Euler_No_104_Pandigital_Fibonacci_ends
This document contains C# code for Project Euler problem #104, which involves finding the first Fibonacci number with pandigital endings. The code defines functions for checking if a number contains the digits 1-k, adding two Fibonacci numbers, and converting an integer to an array. The main method takes in inputs a, b, and k, initializes the Fibonacci sequence with a and b, and iterates through calculating subsequent numbers until it finds one with pandigital endings from 1 to k or reaches 1000000 terms without finding a solution.
Java Week6(B) Notepad
This applet program takes an integer input in one text field, calculates its factorial value using a for loop, and displays the result in another text field when the "Compute" button is clicked. It also clears both text fields when the "Clear" button is clicked. The applet contains labels, text fields, and buttons to accept user input, perform the calculation, and display the output.
Recommended
Theory/literature vs practice - the flipped classroom
This document discusses the theory and practice of flipped classrooms based on literature and examples. It defines flipped classrooms as shifting from traditional lectures to active learning during face-to-face class time after students are first exposed to content outside of class. Several studies show improved exam performance and student perceptions with flipped models in statistics, economics, and calculus courses, though preparation outside of class was sometimes lacking. Open questions remain around large-scale implementation, measuring success, and whether readily available technologies are suitable for all mathematics teaching.
Mixing Functional and Object Oriented Approaches to Programming in C#
The document discusses mixing functional and object-oriented programming approaches in C#, including examples of filtering arrays using predicates and delegates. It covers the evolution of C# from version 1.0 to 3.0, introducing generics, lambda expressions, extension methods and LINQ. Functional programming concepts like higher-order functions, immutability and lazy evaluation are also briefly discussed.
Mixing functional and object oriented approaches to programming in C#
The document discusses mixing functional and object-oriented programming approaches in C#, covering topics like generics, LINQ, lambdas, anonymous methods, extension methods, and more. It provides examples of filtering arrays and enumerables using predicates in increasingly functional styles. It argues that functional programming can complement object-oriented code by abstracting over common operations.
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Data structures lab
The document describes an algorithm to implement a leftist heap data structure in Java with insert and delete minimum operations. It involves the following steps:
1. Start the program by defining heap functions.
2. Insert operations combine two leftist trees by melding them together.
3. Delete minimum removes the root node containing the minimum element.
4. After each insert or delete, the updated leftist heap elements are displayed.
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Step 1: Implement the getSortedRunLength() method
Implement the getSortedRunLength() method in NaturalMergeSorter.java. Access
NaturalMergeSorter.java by clicking on the orange arrow next to NaturalMerge.java at the top of
the coding window.
getSortedRunLength() has three parameters:
array: a reference to an array of integers,
arrayLength: an integer for the array's length, and
startIndex: an integer for the run's starting index.
The method returns the number of array elements sorted in ascending order, starting at startIndex
and ending either at the end of the sorted run, or the end of the array, whichever comes first. The
method returns 0 if startIndex is out of bounds.
File NaturalMerge.java has several test cases for getSortedRunLength() that can be run by
clicking the "Run program" button. One test case also exists for naturalMergeSort(), but that can
be ignored until step two is completed.
The program's output does not affect grading.
Submit for grading to ensure that the getSortedRunLength() unit tests pass before proceeding.
Step 2: Implement the naturalMergeSort() method
Implement the naturalMergeSort() method in NaturalMergeSorter.java. naturalMergeSort() must:
Start at index i=0
Get the length of the first sorted run, starting at i
Return if the first run's length equals the array length
If the first run ends at the array's end, reassign i=0 and repeat step 2
Get the length of the second sorted run, starting immediately after the first
Merge the two runs with the provided merge() method
Reassign i with the first index after the second run, or 0 if the second run ends at the array's end
Go to step 2
NaturalMergeSorter.java
public class NaturalMergeSorter {
public static int getSortedRunLength(int[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static int getSortedRunLength(double[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static void naturalMergeSort(int[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLength) {
return;
}
int secondRunLength = getSortedRunLength(array, arrayLength, i + firstRunLength);
merge(array, i, i + firstRunLength - 1, i + firstRunLength + secondRunLength - 1);
if (i + firstRunLength + secondRunLength == arrayLength) {
i = 0;
} else {
i = i + firstRunLength + secondRunLength;
}
}
}
public static void naturalMergeSort(double[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLen.
Project_Euler_No_104_Pandigital_Fibonacci_ends
This document contains C# code for Project Euler problem #104, which involves finding the first Fibonacci number with pandigital endings. The code defines functions for checking if a number contains the digits 1-k, adding two Fibonacci numbers, and converting an integer to an array. The main method takes in inputs a, b, and k, initializes the Fibonacci sequence with a and b, and iterates through calculating subsequent numbers until it finds one with pandigital endings from 1 to k or reaches 1000000 terms without finding a solution.
Java Week6(B) Notepad
This applet program takes an integer input in one text field, calculates its factorial value using a for loop, and displays the result in another text field when the "Compute" button is clicked. It also clears both text fields when the "Clear" button is clicked. The applet contains labels, text fields, and buttons to accept user input, perform the calculation, and display the output.
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an "Exception in thread "main"
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0"
Here is the code after screenshot if needed:
for (int k = 0; k < elements.size(); k += 2) {
int coefficient = coefficients.get(j);
int count = Integer.parseInt(elements.get(k + 1));
balancedEquation.append(elements.get(k));
if (coefficient * count != 1) {
balancedEquation.append(coefficient * count);
}
}
j++;
}
System.out.println(balancedEquation.toString());
}
}
}
} catch (FileNotFoundException e) {
System.out.println("File not found: " + fileName);
}
}
private static Map<String, Integer> parseSide(String side) {
Map<String, Integer> elements = new HashMap<>();
String[] compounds = side.split("\\+");
for (String compound : compounds) {
compound = compound.trim();
int coeff = 1;
int i = 0;
if (Character.isDigit(compound.charAt(0))) {
coeff = compound.charAt(0) - '0';
i++;
}
String element = "";
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
element = "" + c;
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
} else if (Character.isDigit(c)) {
int j = i;
while (j < compound.length() && Character.isDigit(compound.charAt(j))) {
j++;
}
int num = Integer.parseInt(compound.substring(i, j));
coeff *= num;
i = j;
} else {
i++;
}
}
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
}
return elements;
}
public static List<String> splitCompound(String compound) {
List<String> elements = new ArrayList<>();
int i = 0;
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
String element = Character.toString(c);
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i)))
{
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
elements.add(element);
elements.add(count);
} else if (c == '(') {
i++;
int j = compound.indexOf(')', i);
String subCompound = compound.substring(i, j);
i = j + 1;
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i))) {
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
List<String> subElements = splitCompound(subCompound);
for (int k = 0; k < subElements.size(); k += 2) {
String element = subElements.get(k);
int subCount = Integer.parseInt(subElements.get(k + 1));
int total = subCount * Integer.parseInt(count);
if (elements.contains(element)) {
int index = elements.indexOf(element) + 1;
int currentCount = Integer.parseInt(elements.get(index));
elements.set(index, Integer.toString(currentCount + total));
} else {
elements.add(element);
elements.add(Integer.toString(total));
}
}
} else .
Compiler Optimization Presentation
Compiler optimization transforms programs to equivalent programs that use fewer resources by applying techniques like:
1) Combining multiple simple operations like increments into a single optimized operation
2) Evaluating constant expressions at compile-time rather than run-time
3) Eliminating redundant computations and storing values in registers rather than memory when possible
4) Optimizing loops, conditionals, and expressions to minimize computations
Compiler optimization aims to minimize program execution time, memory usage, and power consumption by transforming programs in various ways before producing executable code. Some key techniques include instruction combining, constant folding, common subexpression elimination, strength reduction, dead code elimination, and loop optimizations. This improves program efficiency and performance.
The Arrow Library in Kotlin
Using the Arrow Library to increase the Functional Programming potential of the Kotlin Language. Presented to the Cork Java Users Group and Cork Functional Programmers on 1st May 2018
Mixing functional programming approaches in an object oriented language
The document discusses applying functional programming approaches in object-oriented languages like C#. It starts with examples of filtering arrays using predicates and shows how this can be refactored to be more functional. It introduces interfaces for predicates, delegates for functions, and anonymous methods. Lambdas, type inference, extension methods and LINQ are presented as ways to further improve the functional style. Concerns like performance and side effects are addressed. Overall it promotes embracing functional techniques like passing functions as values to gain abstraction and reduce errors while also discussing where object-oriented approaches are still useful.
C programs
1. The document contains 12 C programming questions and their solutions ranging from calculating factorials and Fibonacci sequences to matrix operations like addition, multiplication, and inverse.
2. The questions cover basic programming concepts like loops, conditionals, functions as well as mathematical concepts like prime numbers, series, and matrix algebra.
3. The solutions provided implement the required logic to solve each problem using standard C syntax and functions.
for loop in java
The document discusses for loops in Java including their syntax, examples of using for loops to print numbers, infinite loops, breaking and continuing loops, and nested for loops. It provides examples of using for loops to generate Fibonacci sequences, factorials, prime numbers, and nested patterns.
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
Questions has 4 parts.1st part Program to implement sorting algor.pdf
The document contains a C++ program that implements several sorting algorithms including bubble sort, selection sort, insertion sort, merge sort, quick sort, and radix sort. The program defines functions for each sorting algorithm and includes a main method that tests each algorithm by sorting sample data arrays and printing the results.
&Y tgs P kii for
The document discusses looping in Java programming using for loops. It provides 8 examples of for loops with different initialization conditions, increment/decrement amounts, and nested loops. Each example prints the output of two variables, a and b, that are manipulated within the for loop.
Pointer
The document discusses key concepts related to pointers in C++ including declaring and initializing pointers, manipulating pointers, pointer expressions and arithmetic, using pointers with arrays and strings, arrays of pointers, and pointers to functions. Pointers allow accessing and modifying data dynamically by referring to the memory address of variables rather than the variables themselves.
C# Advanced L04-Threading
This document discusses threading and parallel programming in C#. It demonstrates how to use Parallel.For to execute a loop in parallel threads to improve performance. It also shows examples of potential threading issues like race conditions that can occur when accessing shared resources from multiple threads simultaneously without synchronization. The document presents solutions for race conditions using locks to synchronize access to shared resources.
A Skeptics guide to functional style javascript
The document discusses functional programming concepts like pure functions, higher order functions, currying, and monads and how they can be applied in JavaScript. It provides examples of transforming iterative array methods like map, filter, and reduce into functional style code using pure functions. While functional programming aims to avoid side effects, the document notes that side effects cannot be fully avoided in JavaScript and functional style is more of a mindset of keeping pieces small and interactions simple.
Code
The document discusses several sorting and search algorithms:
1) Binary search and binary search with recursion find a target value in a sorted array by repeatedly dividing the array range in half and comparing the middle element to the target.
2) Linear search compares each element of an unsorted array to the target.
3) Insertion sort divides an array into sorted and unsorted parts, inserting elements from the unsorted part into the sorted part.
4) Selection sort finds the minimum element in the unsorted part and swaps it into the sorted position in each iteration.
5) Merge sort recursively splits the array into single elements and then merges the sorted parts back together.
Lec 1 Ds
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation is introduced to analyze algorithms' time complexity as the problem size increases. Common time complexities like O(1), O(log n), O(n), O(n log n), O(n^2), O(n^3) and O(2^n) are defined. An example algorithm to find the minimum element in an array is analyzed, showing it has O(n) time complexity. Selection sort is analyzed and shown to have O(n^2) time complexity.
Data Structure
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation provides an asymptotic analysis of algorithms, estimating how their running time grows with input size. Common time complexities include constant O(1), linear O(n), quadratic O(n^2), and exponential O(2^n).
Lec 1 Ds
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation provides an asymptotic analysis of algorithms, estimating how their running time grows with input size. Common time complexities include constant O(1), linear O(n), quadratic O(n^2), and exponential O(2^n).
Functional Programming Patterns (NDC London 2014)
(video of these slides available here http://fsharpforfunandprofit.com/fppatterns/)
In object-oriented development, we are all familiar with design patterns such as the Strategy pattern and Decorator pattern, and design principles such as SOLID.
The functional programming community has design patterns and principles as well.
This talk will provide an overview of some of these, and present some demonstrations of FP design in practice.
AAD UNIT 2.pptx
This document discusses algorithms and their role in computing. It begins by listing the typical stages of an algorithm: algorithm, flowchart, pseudocode, and program. It then defines characteristics of algorithms such as having input, output, being definite, finite, and correct. The document discusses how algorithms depend on input data, accuracy, environment, and problem domain. It provides examples of problems solved by algorithms, such as aspects of the Human Genome Project and e-commerce. The document also covers evaluating algorithms based on correctness and efficiency, and discusses approaches to proving correctness like loop invariants. It provides examples of algorithms for computing factorials and Fibonacci sequences.
AAD.pptx
This document discusses algorithms and their role in computing. It begins by listing the typical stages of an algorithm: algorithm, flowchart, pseudocode, and program. It then defines characteristics of algorithms such as having input, output, being definite, finite, and correct. The document discusses how algorithms depend on input data, accuracy, environment, and problem domain. It provides examples of problems solved by algorithms, such as aspects of the Human Genome Project and e-commerce. The document also covers evaluating algorithms based on correctness and efficiency, and discusses approaches to proving correctness like loop invariants. It provides examples of algorithms for computing factorials and Fibonacci sequences.
Blockchain (using NBitcoin and FSharp)
Blcok-chain example, F#.
https://www.meetup.com/FSharpHelsinki/events/242919339/
Copy:
https://docs.google.com/presentation/d/1CjAU8st7johlGOs1-jO2rdNhAB-PdeHVq0Loga798Us/edit?usp=sharing
Machine learning (using Accord.NET and FSharp)
Analysing wine quality, F#.
https://www.meetup.com/FSharpHelsinki/events/242919339/
Copy: https://docs.google.com/presentation/d/1JnxOR9ysNSLfBqWTjrgwTVrKHNBe_L73ZSvJt3A_3DY/edit?usp=sharing
More Related Content
Similar to Linq in practice
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an "Exception in thread "main"
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0"
Here is the code after screenshot if needed:
for (int k = 0; k < elements.size(); k += 2) {
int coefficient = coefficients.get(j);
int count = Integer.parseInt(elements.get(k + 1));
balancedEquation.append(elements.get(k));
if (coefficient * count != 1) {
balancedEquation.append(coefficient * count);
}
}
j++;
}
System.out.println(balancedEquation.toString());
}
}
}
} catch (FileNotFoundException e) {
System.out.println("File not found: " + fileName);
}
}
private static Map<String, Integer> parseSide(String side) {
Map<String, Integer> elements = new HashMap<>();
String[] compounds = side.split("\\+");
for (String compound : compounds) {
compound = compound.trim();
int coeff = 1;
int i = 0;
if (Character.isDigit(compound.charAt(0))) {
coeff = compound.charAt(0) - '0';
i++;
}
String element = "";
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
element = "" + c;
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
} else if (Character.isDigit(c)) {
int j = i;
while (j < compound.length() && Character.isDigit(compound.charAt(j))) {
j++;
}
int num = Integer.parseInt(compound.substring(i, j));
coeff *= num;
i = j;
} else {
i++;
}
}
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
}
return elements;
}
public static List<String> splitCompound(String compound) {
List<String> elements = new ArrayList<>();
int i = 0;
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
String element = Character.toString(c);
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i)))
{
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
elements.add(element);
elements.add(count);
} else if (c == '(') {
i++;
int j = compound.indexOf(')', i);
String subCompound = compound.substring(i, j);
i = j + 1;
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i))) {
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
List<String> subElements = splitCompound(subCompound);
for (int k = 0; k < subElements.size(); k += 2) {
String element = subElements.get(k);
int subCount = Integer.parseInt(subElements.get(k + 1));
int total = subCount * Integer.parseInt(count);
if (elements.contains(element)) {
int index = elements.indexOf(element) + 1;
int currentCount = Integer.parseInt(elements.get(index));
elements.set(index, Integer.toString(currentCount + total));
} else {
elements.add(element);
elements.add(Integer.toString(total));
}
}
} else .
Compiler Optimization Presentation
Compiler optimization transforms programs to equivalent programs that use fewer resources by applying techniques like:
1) Combining multiple simple operations like increments into a single optimized operation
2) Evaluating constant expressions at compile-time rather than run-time
3) Eliminating redundant computations and storing values in registers rather than memory when possible
4) Optimizing loops, conditionals, and expressions to minimize computations
Compiler optimization aims to minimize program execution time, memory usage, and power consumption by transforming programs in various ways before producing executable code. Some key techniques include instruction combining, constant folding, common subexpression elimination, strength reduction, dead code elimination, and loop optimizations. This improves program efficiency and performance.
The Arrow Library in Kotlin
Using the Arrow Library to increase the Functional Programming potential of the Kotlin Language. Presented to the Cork Java Users Group and Cork Functional Programmers on 1st May 2018
Mixing functional programming approaches in an object oriented language
The document discusses applying functional programming approaches in object-oriented languages like C#. It starts with examples of filtering arrays using predicates and shows how this can be refactored to be more functional. It introduces interfaces for predicates, delegates for functions, and anonymous methods. Lambdas, type inference, extension methods and LINQ are presented as ways to further improve the functional style. Concerns like performance and side effects are addressed. Overall it promotes embracing functional techniques like passing functions as values to gain abstraction and reduce errors while also discussing where object-oriented approaches are still useful.
C programs
1. The document contains 12 C programming questions and their solutions ranging from calculating factorials and Fibonacci sequences to matrix operations like addition, multiplication, and inverse.
2. The questions cover basic programming concepts like loops, conditionals, functions as well as mathematical concepts like prime numbers, series, and matrix algebra.
3. The solutions provided implement the required logic to solve each problem using standard C syntax and functions.
for loop in java
The document discusses for loops in Java including their syntax, examples of using for loops to print numbers, infinite loops, breaking and continuing loops, and nested for loops. It provides examples of using for loops to generate Fibonacci sequences, factorials, prime numbers, and nested patterns.
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
Questions has 4 parts.1st part Program to implement sorting algor.pdf
The document contains a C++ program that implements several sorting algorithms including bubble sort, selection sort, insertion sort, merge sort, quick sort, and radix sort. The program defines functions for each sorting algorithm and includes a main method that tests each algorithm by sorting sample data arrays and printing the results.
&Y tgs P kii for
The document discusses looping in Java programming using for loops. It provides 8 examples of for loops with different initialization conditions, increment/decrement amounts, and nested loops. Each example prints the output of two variables, a and b, that are manipulated within the for loop.
Pointer
The document discusses key concepts related to pointers in C++ including declaring and initializing pointers, manipulating pointers, pointer expressions and arithmetic, using pointers with arrays and strings, arrays of pointers, and pointers to functions. Pointers allow accessing and modifying data dynamically by referring to the memory address of variables rather than the variables themselves.
C# Advanced L04-Threading
This document discusses threading and parallel programming in C#. It demonstrates how to use Parallel.For to execute a loop in parallel threads to improve performance. It also shows examples of potential threading issues like race conditions that can occur when accessing shared resources from multiple threads simultaneously without synchronization. The document presents solutions for race conditions using locks to synchronize access to shared resources.
A Skeptics guide to functional style javascript
The document discusses functional programming concepts like pure functions, higher order functions, currying, and monads and how they can be applied in JavaScript. It provides examples of transforming iterative array methods like map, filter, and reduce into functional style code using pure functions. While functional programming aims to avoid side effects, the document notes that side effects cannot be fully avoided in JavaScript and functional style is more of a mindset of keeping pieces small and interactions simple.
Code
The document discusses several sorting and search algorithms:
1) Binary search and binary search with recursion find a target value in a sorted array by repeatedly dividing the array range in half and comparing the middle element to the target.
2) Linear search compares each element of an unsorted array to the target.
3) Insertion sort divides an array into sorted and unsorted parts, inserting elements from the unsorted part into the sorted part.
4) Selection sort finds the minimum element in the unsorted part and swaps it into the sorted position in each iteration.
5) Merge sort recursively splits the array into single elements and then merges the sorted parts back together.
Lec 1 Ds
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation is introduced to analyze algorithms' time complexity as the problem size increases. Common time complexities like O(1), O(log n), O(n), O(n log n), O(n^2), O(n^3) and O(2^n) are defined. An example algorithm to find the minimum element in an array is analyzed, showing it has O(n) time complexity. Selection sort is analyzed and shown to have O(n^2) time complexity.
Data Structure
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation provides an asymptotic analysis of algorithms, estimating how their running time grows with input size. Common time complexities include constant O(1), linear O(n), quadratic O(n^2), and exponential O(2^n).
Lec 1 Ds
The document discusses data structures and algorithms. It defines data structures as organized ways of storing data to allow efficient processing. Algorithms manipulate data in data structures to perform operations like searching and sorting. Big-O notation provides an asymptotic analysis of algorithms, estimating how their running time grows with input size. Common time complexities include constant O(1), linear O(n), quadratic O(n^2), and exponential O(2^n).
Functional Programming Patterns (NDC London 2014)
(video of these slides available here http://fsharpforfunandprofit.com/fppatterns/)
In object-oriented development, we are all familiar with design patterns such as the Strategy pattern and Decorator pattern, and design principles such as SOLID.
The functional programming community has design patterns and principles as well.
This talk will provide an overview of some of these, and present some demonstrations of FP design in practice.
AAD UNIT 2.pptx
This document discusses algorithms and their role in computing. It begins by listing the typical stages of an algorithm: algorithm, flowchart, pseudocode, and program. It then defines characteristics of algorithms such as having input, output, being definite, finite, and correct. The document discusses how algorithms depend on input data, accuracy, environment, and problem domain. It provides examples of problems solved by algorithms, such as aspects of the Human Genome Project and e-commerce. The document also covers evaluating algorithms based on correctness and efficiency, and discusses approaches to proving correctness like loop invariants. It provides examples of algorithms for computing factorials and Fibonacci sequences.
AAD.pptx
This document discusses algorithms and their role in computing. It begins by listing the typical stages of an algorithm: algorithm, flowchart, pseudocode, and program. It then defines characteristics of algorithms such as having input, output, being definite, finite, and correct. The document discusses how algorithms depend on input data, accuracy, environment, and problem domain. It provides examples of problems solved by algorithms, such as aspects of the Human Genome Project and e-commerce. The document also covers evaluating algorithms based on correctness and efficiency, and discusses approaches to proving correctness like loop invariants. It provides examples of algorithms for computing factorials and Fibonacci sequences.
Similar to Linq in practice (20)
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
Mixing functional programming approaches in an object oriented language
Mixing functional programming approaches in an object oriented language
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain There is Mylist There is MyArrayList pa.pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
Questions has 4 parts.1st part Program to implement sorting algor.pdf
Questions has 4 parts.1st part Program to implement sorting algor.pdf
More from Tuomas Hietanen
Blockchain (using NBitcoin and FSharp)
Blcok-chain example, F#.
https://www.meetup.com/FSharpHelsinki/events/242919339/
Copy:
https://docs.google.com/presentation/d/1CjAU8st7johlGOs1-jO2rdNhAB-PdeHVq0Loga798Us/edit?usp=sharing
Machine learning (using Accord.NET and FSharp)
Analysing wine quality, F#.
https://www.meetup.com/FSharpHelsinki/events/242919339/
Copy: https://docs.google.com/presentation/d/1JnxOR9ysNSLfBqWTjrgwTVrKHNBe_L73ZSvJt3A_3DY/edit?usp=sharing
Possible FSharp Refactorings could be...
Copy: https://docs.google.com/presentation/d/1JnJdraX_shZT7MuisAQskiF5kmR_FEJWnHOLG4rn09k/edit?usp=sharing
Message passing & NoSQL (in English)
F# User Group presentation
Many current topics briefly.
More descriptions in the notes-tab.
Copy: https://docs.google.com/presentation/d/1s49ArmNmEy_vcjgQOUM2CWWz6bl-lZ4rHZVkQJe4bm0/edit?usp=sharing
Same presentation in Finnish:
http://www.slideshare.net/thorium/message-passing-nosql
Function therory
This document discusses functional programming concepts in F#, including function theory, type inference, function composition, monads, and combinators. It provides examples of defining and inferring types for various functions in F#, and explains concepts like partial function application, function composition using the >> operator, and common combinators like S, K, and I. It also briefly introduces monads and compares them to constructs like the list and nullable types in other languages.
The Pain Points of C#
Copy: https://docs.google.com/presentation/d/1eOi0wHcINe6WfhCfvxl6j8qbP-fko8NuPb-vgNMrTO0/edit?usp=sharing
F# references (and some misc slides)
Copy: https://docs.google.com/presentation/d/1lwqRUFZstZZj5ag2SXY5h92qtm6CWVKpd_HujNdY34U/edit?usp=sharing
Using f# project from c#
Copy: https://docs.google.com/presentation/d/1G33bo1f1cRqM66VVwr7yi3AcLovFce9JpU_r_2h_2TA/edit?usp=sharing
Funktioteoriaa
F# Tyyppijärjestelmä
Function composition
Sanko F# -tapahtuman diasarja
Copy: https://docs.google.com/presentation/d/1hatO8npbgaHnSDoHBK-6WTBJT6MNWkvApotroWt-bNM/edit?usp=sharing
Pari sekalaista diaa ja F#-Referenssejä
Pari sekalaista diaa, mm. linkit ja lisätiedot
Sanko F# -tapahtuman diasarja
Copy: https://docs.google.com/presentation/d/1-gCifUy5QOkcu6ByEPfZOJ9UcnAlmJclKIzL9lMlmLo/edit?usp=sharing
F# ja C# yhteiskäyttö
F# dll käyttö C#-projektin referenssinä
Sanko F# -tapahtuman diasarja
Copy: https://docs.google.com/presentation/d/1dcMRxedzQf12f-UMhKEZYJuWi5mgLWPxrTFrUJHDHLs/edit?usp=sharing
C# nykyiset kipupisteet
Olio-ohjelmoinnin ongelmat
C#-kielen ongelmat
Sanko F# -tapahtuman diasarja
Copy: https://docs.google.com/presentation/d/1oJm-PRWkCy4qbUOunD2xE-hCZ2gARvN9ASIouuEe02k/edit?usp=sharing
LINQ käytännössä
LINQ käytännössä.
Sanko F# -tapahtuman diasarja
Copy: https://docs.google.com/presentation/d/17diWPB0AuYVr496NHEofxBwG0nmdb1eoR9hGUWSLdmA/edit?usp=sharing
Coding with LINQ, Patterns & Practices
LINQ ja koodauskäytännöt (Finnish) http://www.youtube.com/watch?v=OFQltnLESOg
Coding with LINQ, Patterns & Practices (English) http://www.youtube.com/watch?v=YAha8tQyVHE
Slides: http://www.slideshare.net/thorium/coding-with-linq-patterns-practices
Copy: https://drive.google.com/file/d/13N-fe00M6DcWJhDAygHPte1HuH4OqI7J/view?usp=sharing
---
LINQ:lle refaktorointi (Finnish) http://www.youtube.com/watch?v=2wpqydogdPw
Refactoring to LINQ (English) http://www.youtube.com/watch?v=1gX0piE3xbk
F#-koodaus (Finnish) http://www.youtube.com/watch?v=WgVcJitKUZ8
Coding F# (English) http://www.youtube.com/watch?v=OA-zLw7xJm4
Source code: https://github.com/Thorium/Demo
More from Tuomas Hietanen (14)
Recently uploaded
National Security Agency - NSA mobile device best practices
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Programming Foundation Models with DSPy - Meetup Slides
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Skybuffer SAM4U tool for SAP license adoption
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Best 20 SEO Techniques To Improve Website Visibility In SERP
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
20240607 QFM018 Elixir Reading List May 2024
Everything I found interesting about the Elixir programming ecosystem in May 2024
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
ここ3000字までしか入らないけどタイトルの方がたくさん文字入ると思います。
Columbus Data & Analytics Wednesdays - June 2024
Columbus Data & Analytics Wednesdays, June 2024 with Maria Copot 20
Introduction of Cybersecurity with OSS at Code Europe 2024
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
How to Get CNIC Information System with Paksim Ga.pptx
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
20240609 QFM020 Irresponsible AI Reading List May 2024
Everything I found interesting about the irresponsible use of machine intelligence in May 2024
Artificial Intelligence for XMLDevelopment
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Building Production Ready Search Pipelines with Spark and Milvus
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Generating privacy-protected synthetic data using Secludy and Milvus
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Recently uploaded (20)
National Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practices
Programming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup Slides
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Best 20 SEO Techniques To Improve Website Visibility In SERP
Best 20 SEO Techniques To Improve Website Visibility In SERP
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
Introduction of Cybersecurity with OSS at Code Europe 2024
Introduction of Cybersecurity with OSS at Code Europe 2024
How to Get CNIC Information System with Paksim Ga.pptx
How to Get CNIC Information System with Paksim Ga.pptx
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
WeTestAthens: Postman's AI & Automation Techniques
WeTestAthens: Postman's AI & Automation Techniques
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
Building Production Ready Search Pipelines with Spark and Milvus
Building Production Ready Search Pipelines with Spark and Milvus
Generating privacy-protected synthetic data using Secludy and Milvus
Generating privacy-protected synthetic data using Secludy and Milvus
Linq in practice
- 1. LINQ in practice ”In theory there is no difference between theory and practice. But in practice there is”. Except in mathematics…
- 2. Func<TIn1, TIn2, TOut> public int PlusFive(int i){ return i+5; } Func<int, int> PlusFive = delegate(int i) { return i + 5; }; Func<int, int> PlusFive = i => i + 5;
- 4. ” Infiniteloop” publicstaticIEnumerable<int> NaturalNumbers() { inti=0; while(true){ yieldreturn i++; } }
- 5. Filtered publicstaticIEnumerable<int> Odds() { returnNaturalNumbers().Where(i=>i%2==1); }
- 6. It works! static void Main(string[] args) { var nums = Odds().Take(5); //var executed = nums.ToList(); foreach(var i in nums) Console.WriteLine(i); }
- 7. What is inside LINQ? public static class FetchExtension{ public static IEnumerable<T> MyWhere<T>( this IEnumerable<T> list, Func<T, bool> cond){ foreach(var i in list){ if (cond(i)) yield return i; } } }
- 8. Imperative vs. declarative var result = new List<int>(); foreach(var i in list){ if(i % 2 == 0){ result.Add(i); } } var result = from i in list where i % 2 == 0 select i;
Editor's Notes
- Func<…> is “function as type”These code blocks are equals.First type parameters are input parameters. The last type parameter is the return valueIn type declaration we already know the function type…
- Instead of List<T> use the base classIEnumerable<T>- It is the base class for the lists (and LINQ) It doesn’t contain any kind of .RemoveAt(…) methods, so no-one will mess with your list
- Using System.LinqFilter the ones that are not interesting
- When you debug you notice what happens! Don’t do if(list.Count() == 0) but if(!list.Any()) so you don’t evaluate the whole list
- Declarative is better: Higher level of abstaction Define what computer does, not howSQL-like syntax is not the point, but the functionality!SQL-like syntax is just one way to express .Where(i=>i%2==0);