practical 9.docx

•Als DOCX, PDF herunterladen•

0 gefällt mir•2 views

N

practical

import java.util.*;
class KDK
{ public static void main(String args[])
{ Set<String> Lhs=new LinkedHashSet<String>();
Lhs.add("India");
Lhs.add("England");
Lhs.add("Iran");
Lhs.add("India");
System.out.println(Lhs);
Lhs.remove("England");
System.out.println("set after removing"+"England"+Lhs);
System.out.println("iterating over set");
Iterator<String> i=Lhs.iterator();
while(i.hasNext())
System.out.println(i.next());
}
}

import java.util.*;
class KDK
{ public static void main(String args[])
{
Set<String> Lhs=new LinkedHashSet<String>();
Lhs.add("India");
Lhs.add("England");
Lhs.add("Iran");
Lhs.add("India");
System.out.println(Lhs);
Lhs.remove("England");
System.out.println("set after removing"+"England"+Lhs);
System.out.println("iterating over set");
Iterator<String> i=Lhs.iterator();
while(i.hasNext())
System.out.println(i.next());
}
}

Weitere ähnliche Inhalte

Ähnlich wie practical 9.docx

UserInputHandler.java package midterm2023; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class UserInputHandler { public static List<String> readUserInput() { List<String> userData = new ArrayList<>(); System.out.println("Please enter your data below: (send 'bye' to exit) "); Scanner input = new Scanner(System.in); while (true) { String line = input.nextLine(); if ("bye".equalsIgnoreCase(line)) { break; } userData.add(line); } return userData; } public static void main(String[] args) { List<String> userData = readUserInput(); System.out.printf("User Input Data:n%s", String.join("n", userData)); } } UserInputHandlerUnitTest.java package midterm2023; import org.junit.jupiter.api.Test; import java.io.ByteArrayInputStream; import java.io.InputStream; import java.util.Arrays; import java.util.List; import java.util.stream.Collectors; import static org.assertj.core.api.Assertions.assertThat; public class UserInputHandlerUnitTest { //@Test void testByMakeUpDataInSystemIn() { String[] inputLines = new String[]{ "The first line.", "The second line.", "bye", "The last line.", "anything after 'bye' will be ignored" }; String[] expectedLines = Arrays.copyOf(inputLines, inputLines.length - 2); List<String> expected = Arrays.stream(expectedLines).collect(Collectors.toList()); InputStream stdin = System.in; try { System.setIn(new ByteArrayInputStream(String.join("n", inputLines).getBytes())); List<String> actual = UserInputHandler.readUserInput(); assertThat(actual).isEqualTo(expected); } finally { System.setIn(stdin); } } } QuickSort.java package coen352.ch07; public class QuickSort { public static <E extends Comparable<? super E>> void sort(E[] A) { qsort(A, 0, A.length-1);} static <E extends Comparable<? super E>> void qsort(E[] A, int i, int j) { // Quicksort int pivotindex = findpivot(A, i, j); // Pick a pivot DSutil.swap(A, pivotindex, j); // Stick pivot at end // k will be the first position in the right subarray int k = partition(A, i-1, j, A[j]); DSutil.swap(A, k, j); // Put pivot in place if ((k-i) > 1) qsort(A, i, k-1); // Sort left partition if ((j-k) > 1) qsort(A, k+1, j); // Sort right partition } static <E extends Comparable<? super E>> int partition(E[] A, int l, int r, E pivot) { do {// Move bounds inward until they meet while (A[++l].compareTo(pivot)<0); while ((r!=0) && (A[--r].compareTo(pivot)>0)); DSutil.swap(A, l, r); // Swap out-of-place values } while (l < r); // Stop when they cross DSutil.swap(A, l, r); // Reverse last, wasted swap return l; // Return first position in right partition } static <E extends Comparable<? super E>> int findpivot(E[] A, int i, int j) { return (i+j)/2; } } In this assignment, we aim to practise white box testing and coverage strategies to produce unit test cases. Problem 1 (30 MARKS) The UserInputHandler program code is provided in the attachment. It is a simple function that stores the user's input until a certain terminating token is typed. The original code applies.

UserInputHandlerjava package midterm2023 import javautil.pdf

UserInputHandlerjava package midterm2023 import javautil.pdf

UserInputHandlerjava package midterm2023 import javautil.pdf

Description (Part A) In this lab you will write a Queue implementation called CoolQueue, which closely matches the java.util.Queue collection, except with fewer methods. Test code is provided that allows you to compare your queue to the one in java.util.Queue, which you can assume is completely correct. Getting Started Create a project called Lab9 and download following files: QueueInterface.java TestProgram.java CoolQueue.java Fill in the supplied CoolQueue.java to make it implement the provided QueueInterface methods. Then use the TestProgram to verify that your code works. Here are the methods in the interface: public interface QueueInterface { // Add object onto rear of queue public abstract boolean add(E item); // Remove object from front of queue // Throws NoSuchElementException if empty public abstract E remove(); // Peek object from front of queue // Throws NoSuchElementException if empty public abstract E element(); // Check for empty public abstract boolean isEmpty(); // Returns size public abstract int size(); // Clears queue public abstract void clear(); // Various searches public abstract boolean contains(Object o); // Override toString public abstract String toString(); } Instructions Inherit the interface provided above. The Queue is a generic data structure, so declare an LinkedList. HINT: You should use the first entry or head of the LinkedList as the front of the queue. HINT: You should use the last entry or tail of the LinkedList as the rear of the queue. You must not use add(), remove(), or element() in the LinkedList object. You must implement toString() first, format is the same as LinkedList.toString(). Incremental development, so test one method at a time. Review the TestProgram to see what is tested by each test number, 1 through 7. Below is the CoolQueue.java: import java.util.LinkedList; import java.util.NoSuchElementException; class CoolQueue implements QueueInterface { // Underlying data structure // Default constructor } Below is the TestProgram.java: import java.util.LinkedList; import java.util.NoSuchElementException; import java.util.Queue; import java.util.Random; public class TestProgram { static Random random = new Random(); public static void main(String[] args) { // Make a Java stack Queue javaQueue = new LinkedList<>(); // Make a student stack CoolQueue coolQueue = new CoolQueue<>(); // Which test? int testNumber = Integer.parseInt(args[0]); switch (testNumber) { case 1: // testAdd System.err.println(\"testAdd: verifying add() method\"); pushRandom(javaQueue, 10); pushRandom(coolQueue, 10); System.err.println(\"Java Queue: \" + javaQueue); System.err.println(\"Cool Queue: \" + coolQueue); break; case 2: // testRemove System.err.println(\"testRemove: verifying remove() method\"); pushRandom(javaQueue, 10); pushRandom(coolQueue, 10); // Legal removes for (int i = 0; i < 10; i++) { System.err.printf(\"javaQueue.remove(): %4s, coolQueue.remove(): %4s\ \", javaQueue.remove(), coolQueue.remove()); } // Queue e.

Description (Part A) In this lab you will write a Queue implementati.pdf

Description (Part A) In this lab you will write a Queue implementati.pdf

Description (Part A) In this lab you will write a Queue implementati.pdf

Groovy

Favor composition over inheritance

Favor composition over inheritance

Favor composition over inheritance

Here is my code for a line/file editor: import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class FileEdit { public static List lines = new ArrayList(); public static void main(String[] args) throws IOException { Scanner s = new Scanner(System.in); System.out.print("EDIT: "); String fileName = s.nextLine(); BufferedReader br = new BufferedReader(new FileReader(new File(fileName))); String str=""; int count=0; while((str=br.readLine())!=null) { lines.add(count, str); System.out.println((++count) + "> "+ str); } String text=""; String command = ""; System.out.print((++count)+"> "); command=s.nextLine(); String commandArr[]; int flag; while(!command.equals("E")) { flag=0; commandArr = command.split("\\s"); if(commandArr[0].equals("I")) //Insertion { while(true) { if(commandArr.length==1&&flag!=2) { System.out.print((count)+"> "); text = s.nextLine(); insertLine(text,count-1); } else if(commandArr.length==2&&flag!=2) { System.out.print((commandArr[1])+"> "); count=Integer.parseInt(commandArr[1]); text = s.nextLine(); insertLine(text,Integer.parseInt(commandArr[1])-1); } else insertLine(text,count-1); System.out.print((++count)+"> "); command=s.nextLine(); commandArr = command.split("\\s"); if(commandArr[0].equals("I")||commandArr[0].equals("L")||commandArr[0].equals("D")||comm andArr[0].equals("E")) { flag=1; break; } else { flag=2; text=command; } } } else if(commandArr[0].equals("L")) //Listing { printList(); } else if(commandArr[0].equals("D")) //Deletion { if(commandArr.length==1) { deleteLine(count-1,count-1); } else if(commandArr.length==2) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[1])-1); } else if(commandArr.length==3) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[2])-1); } count=lines.size(); } if(flag!=1) { System.out.print((count++)+"> "); command = s.nextLine(); } } } public static void insertLine(String text,int count) { if (count >= lines.size()) { for(int i = lines.size(); i <= count; i++) { lines.add(null); } } lines.set(count,text); } public static void deleteLine(int start,int end) { for(int i=start;i<=end;i++) lines.remove(i); } public static void printList() { for(int i=0;i "+lines.get(i)); } } Here is my output: EDIT: textin.txt 1> The First Line 1> 2> And another line 3> I 3 3> The second line 4> One more line 5> L 1> null 2> null 3> The second line 4> One more line 5> D 2 3> L 1> null 2> The second line 3> One more line 4> E How can I keep it from printing "null" after ">" and it just be blank. I need the output to look like this: 1> The first line 2> 3> And another line 4> I 3 3> The second line 4> One more line 5> L 1> The first line 2> 3> The second line 4> One more line 5> And another line 5> D 2 4> L 1> The first line 2> The second line 3> One more line 4> And another line 5> E.

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Java 5 and 6 New Features

Java 5 and 6 New Features

Java 5 and 6 New Features

Jussi Pohjolainen

can do this in java please thanks in advance The code that you will write i would like it to be similar to snippets shown below for me to better understand the codes i have been given to fix: 1) public abstract class BasePerson { protected String name; private boolean publish; private int age; private int id; public BasePerson(String name,int age, boolean pub) { this.name =name; this.age=age; publish = pub; } public int getAge() { return age; } public abstract String getName(); protected void setId(int id) { this.id = id; } public int getId() { return id; } public boolean getPublish() { return publish; } } 2) public class Person extends BasePerson implements Comparable<Person> { private static int nextId=0; public Person(String name, int age, boolean willPublish) { super(name, age, willPublish); super.setId(nextId); nextId++; } public String getName() { return name; } public static String getPHeader() { String returnval = "IDtNametAgetWillPublish"; returnval+="n---------------------------------"; return returnval; } public String toString() { return(getId()+"t"+getName()+"t"+getAge()+"t"+getPublish()); } public static void resetId() { nextId=0; } public int compareTo(Person other) { return other.getId() - this.getId(); } 3) import java.util.ArrayList; import java.util.Scanner; import java.io.File; import java.io.IOException; public class VaccineBatch { private int size; private int balance=0; private String name; private int preference; private ArrayList<String> contras; public VaccineBatch( String name,int size, int preference, String contraIndicators) { this.size = size; this.balance = size; this.preference = preference; this.name = name; Scanner stringScan = new Scanner(contraIndicators); contras = new ArrayList<String>(); stringScan.useDelimiter(","); while (stringScan.hasNext()) contras.add(stringScan.next()); } public int getSize() { return size; } public int getBalance() { return balance; } public int getPreference() { return preference; } public String getName() { return name; } public String getContras() { String returnval=""; for (int i=0; i<contras.size();i++) { returnval+=contras.get(i); if (i<contras.size()-1) returnval+=","; } return returnval; } public static String getVBHeader() { String returnval = "NametSizetBalancetPreferencetContraIndicators"; returnval+="n---------------------------------"; return returnval; } public boolean contraImpact(ArrayList<String> comorbs) { boolean found = false; int i =0; while((!found)&&(i<contras.size())) { int j=0; while ((!found)&&(j<comorbs.size())) { if (contras.get(i).equals(comorbs.get(j))) found=true; else j++; } i++; } return found; } //public int compareTo(VaccineBatch other) //{ // return other.preference-this.preference ; //} public void reduceBalance() { balance--; } } 4) import java.util.ArrayList; public class ApprovedPerson extends BasePerson { ArrayList<String> comorbidities; public ApprovedPerson(int age, String name, boolean publish, int id) { super( name, age,publish); super.

can do this in java please thanks in advance The code that y.pdf

can do this in java please thanks in advance The code that y.pdf

can do this in java please thanks in advance The code that y.pdf

collectionframework-141116005344-conversion-gate01.pptx

collectionframework-141116005344-conversion-gate01.pptx

collectionframework-141116005344-conversion-gate01.pptx

Please help me with a UML class diagram for the following code: import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class FileEdit { public static List lines = new ArrayList(); public static void main(String[] args) throws IOException { Scanner s = new Scanner(System.in); System.out.print("EDIT: "); String fileName = s.nextLine(); BufferedReader br = new BufferedReader(new FileReader(new File(fileName))); String str=""; int count=0; while((str=br.readLine())!=null) { lines.add(count, str); System.out.println((++count) + "> "+ str); } String text=""; String command = ""; System.out.print((++count)+"> "); command=s.nextLine(); String commandArr[]; int flag; while(!command.equals("E")) { flag=0; commandArr = command.split("\\s"); if(commandArr[0].equals("I")) //Insertion { while(true) { if(commandArr.length==1&&flag!=2) { System.out.print((count)+"> "); text = s.nextLine(); insertLine(text,count-1); } else if(commandArr.length==2&&flag!=2) { System.out.print((commandArr[1])+"> "); count=Integer.parseInt(commandArr[1]); text = s.nextLine(); insertLine(text,Integer.parseInt(commandArr[1])-1); } else insertLine(text,count-1); System.out.print((++count)+"> "); command=s.nextLine(); commandArr = command.split("\\s"); if(commandArr[0].equals("I")||commandArr[0].equals("L")||commandArr[0].equals("D")||comm andArr[0].equals("E")) { flag=1; break; } else { flag=2; text=command; } } } else if(commandArr[0].equals("L")) //Listing { printList(); } else if(commandArr[0].equals("D")) //Deletion { if(commandArr.length==1) { deleteLine(count-1,count-1); } else if(commandArr.length==2) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[1])-1); } else if(commandArr.length==3) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[2])-1); } count=lines.size(); } if(flag!=1) { System.out.print((count++)+"> "); command = s.nextLine(); } } } public static void insertLine(String text,int count) { if (count >= lines.size()) { for(int i = lines.size(); i <= count; i++) { lines.add(null); } } lines.set(count,text); } public static void deleteLine(int start,int end) { for(int i=start;i<=end;i++) lines.remove(i); } public static void printList() { for(int i=0;i "+lines.get(i)); } }.

Please help me with a UML class diagram for the following code im.pdf

Please help me with a UML class diagram for the following code im.pdf

Please help me with a UML class diagram for the following code im.pdf

Labprogram.java LinkedList.java import java.util.NoSuchElementException; public class LinkedList { private class Node { private T data; private Node next; private Node prev; public Node(T data) { this.data = data; this.next = null; this.prev = null; } } private int length; private Node first; private Node last; private Node iterator; /**** CONSTRUCTORS ****/ public LinkedList() { first = null; last = null; iterator = null; length = 0; } /** * Converts the given array into a LinkedList * * @param array the array of values to insert into this LinkedList * @postcondition */ public LinkedList(T[] array) { } /** * Instantiates a new LinkedList by copying another List * * @param original the LinkedList to copy * @postcondition a new List object, which is an identical, * but separate, copy of the LinkedList original */ public LinkedList(LinkedList original) { } public T getFirst() throws NoSuchElementException { if (isEmpty()) { throw new NoSuchElementException("The list is empty"); } return first.data; } public T getLast() throws NoSuchElementException { if (isEmpty()) { throw new NoSuchElementException("The list is empty"); } return last.data; } public T getIterator() throws NullPointerException { if (iterator != null) { return iterator.data; } else { throw new NullPointerException("Iterator is off the end opf the list."); } } public int getLength() { return length; } public boolean isEmpty() { return length == 0; } public boolean offEnd() { return iterator == null; } public void addFirst(T data) { Node newNode = new Node(data); if (isEmpty()) { first = newNode; last = newNode; } else { newNode.next = first; first.prev = newNode; first = newNode; } length++; } public void addLast(T data) { Node newNode = new Node(data); if (isEmpty()) { first = newNode; last = newNode; } else { last.next = newNode; newNode.prev = last; last = newNode; } length++; } public void addIterator(T data) throws NullPointerException { if (offEnd()) { throw new NullPointerException("addIterator Iterator is off end."); } if (iterator == last) { addLast(data); } else { Node newNode = new Node(data); Node next = iterator.next; newNode.next = next; newNode.prev = iterator; iterator.next = newNode; next.prev = newNode; length++; } } public void removeFirst() throws NoSuchElementException { if (isEmpty()) { throw new NoSuchElementException("The list is empty"); } if (length == 1) { first = null; last = null; iterator = null; } else { if (iterator == first) { iterator = null; } first = first.next; first.prev = null; } length--; } public void removeLast() throws NoSuchElementException { if (isEmpty()) { throw new NoSuchElementException("The list is empty"); } if (length == 1) { first = null; last = null; iterator = null; } else { if (iterator == last) { iterator = null; } last = last.prev; last.next = null; } length--; } public void removeIterator() throws NullPointerException { if (offEnd()) { throw new NullPointerException("Iterator is off the end opf the list."); } if (iterator .

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Java Programs

Implement a queue using a linkedlist (java) Solution LinkedQueueImplement.java import java.util.*; class Node { protected int data; protected Node link; public Node() { link = null; data = 0; } public Node(int d,Node n) { data = d; link = n; } public void setLink(Node n) { link = n; } public void setData(int d) { data = d; } public Node getLink() { return link; } public int getData() { return data; } } class linkedQueue { protected Node front, rear; public int size; public linkedQueue() { front = null; rear = null; size = 0; } public boolean isEmpty() { return front == null; } public int getSize() { return size; } /* Function to insert an element to the queue */ public void insert(int data) { Node nptr = new Node(data, null); if (rear == null) { front = nptr; rear = nptr; } else { rear.setLink(nptr); rear = rear.getLink(); } size++ ; } /* Function to remove front element from the queue */ public int remove() { if (isEmpty() ) throw new NoSuchElementException(\"Underflow Exception\"); Node ptr = front; front = ptr.getLink(); if (front == null) rear = null; size-- ; return ptr.getData(); } /* Function to check the front element of the queue */ public int peek() { if (isEmpty() ) throw new NoSuchElementException(\"Underflow Exception\"); return front.getData(); } /* Function to display the status of the queue */ public void display() { System.out.print(\"\ Queue = \"); if (size == 0) { System.out.print(\"Empty\ \"); return ; } Node ptr = front; while (ptr != rear.getLink() ) { System.out.print(ptr.getData()+\" \"); ptr = ptr.getLink(); } System.out.println(); } } /* Class LinkedQueueImplement */ public class LinkedQueueImplement { public static void main(String[] args) { Scanner scan = new Scanner(System.in); /* Creating object of class linkedQueue */ linkedQueue lq = new linkedQueue(); /* Perform Queue Operations */ System.out.println(\"Linked Queue Test\ \"); char ch; do { System.out.println(\"\ Queue Operations\"); System.out.println(\"1. insert\"); System.out.println(\"2. remove\"); System.out.println(\"3. peek\"); System.out.println(\"4. check empty\"); System.out.println(\"5. size\"); int choice = scan.nextInt(); switch (choice) { case 1 : System.out.println(\"Enter integer element to insert\"); lq.insert( scan.nextInt() ); break; case 2 : try { System.out.println(\"Removed Element = \"+ lq.remove()); } catch (Exception e) { System.out.println(\"Error : \" + e.getMessage()); } break; case 3 : try { System.out.println(\"Peek Element = \"+ lq.peek()); } catch (Exception e) { System.out.println(\"Error : \" + e.getMessage()); } break; case 4 : System.out.println(\"Empty status = \"+ lq.isEmpty()); break; case 5 : System.out.println(\"Size = \"+ lq.getSize()); break; default : System.out.println(\"Wrong Entry \ \"); break; } /* display queue */ lq.display(); System.out.println(\"\ Do you want to continue (Type y or n) \ \"); ch = scan.next().charAt(0); } while (ch == \'Y\'|| ch == \'y\'); } } Output : Linked Queue Test Queue Operations 1. inse.

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

kostikjaylonshaewe47

sumOfSquares import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes Solution sumOfSquares import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes.

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

can you add a delete button and a add button to the below program. java fx package nusoft; public class Car { private String make; private String model; private int year; private String color; public Car(String make, int year, String model, String color) { this.make = make; this.model = model; this.year = year; this.color = color; } public String getMake() { return make; } public void setMake(String make) { this.make = make; } public String getModel() { return model; } public void setModel(String model) { this.model = model; } public int getYear() { return year; } public void setYear(int year) { this.year = year; } public String getColor() { return color; } public void setColor(String color) { this.color = color; } @Override public String toString() { return year + " " + make + " " + model + " (" + color + ")"; } } package nusoft; import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import javafx.application.Application; import javafx.geometry.Pos; import javafx.scene.Scene; import javafx.scene.control.Button; import javafx.scene.control.Label; import javafx.scene.layout.BorderPane; import javafx.scene.layout.VBox; import javafx.stage.Stage; public class CarNavigator extends Application { private ArrayList cars = new ArrayList<>(); private int currentIndex = 0; @Override public void start(Stage primaryStage) throws Exception { readCarsFile(); Label carLabel = new Label(); carLabel.setAlignment(Pos.CENTER); updateCarLabel(carLabel); Button prevButton = new Button("Previous"); prevButton.setOnAction(e -> { currentIndex--; if (currentIndex < 0) { currentIndex = cars.size() - 1; } updateCarLabel(carLabel); }); Button nextButton = new Button("Next"); nextButton.setOnAction(e -> { currentIndex++; if (currentIndex >= cars.size()) { currentIndex = 0; } updateCarLabel(carLabel); }); VBox buttonBox = new VBox(10, prevButton, nextButton); buttonBox.setAlignment(Pos.CENTER); BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null); Scene scene = new Scene(root, 400, 200); primaryStage.setScene(scene); primaryStage.show(); } private void readCarsFile() throws IOException { BufferedReader reader = new BufferedReader(new FileReader("cars.txt")); String line; while ((line = reader.readLine()) != null) { cars.add(line); } reader.close(); } private void updateCarLabel(Label label) { label.setText(cars.get(currentIndex)); } public static void main(String[] args) { launch(args); } } package nusoft.utils; import java.util.NoSuchElementException; import nusoft.Car; public class NuLinkedList { private Node head; private Node tail; private int size; private static class Node { E element; Node prev; Node next; Node(E element, Node prev, Node next) { this.element = element; this.prev = prev; this.next = next; } } public boolean contains(E e) { return indexOf(e) != -1; } public E get(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException(); } return getNode(index).el.

can you add a delete button and a add button to the below program. j.pdf

can you add a delete button and a add button to the below program. j.pdf

can you add a delete button and a add button to the below program. j.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

package singlylinkedlist; public class Node { public String value; public Node next; public Node(String value) { this.value = value; } @Override public String toString() { return value; } } SingleyLinkedList.java : package singlylinkedlist; import java.io.*; import java.util.*; /** * Defines the interface for a singly-linked list. * */ public interface SinglyLinkedList { /** * @return Reference to the first node. If the list is empty, this method * returns null. */ public Node getFirst(); /** * @return Reference to the last node . If the list is empty, this method * returns null. */ public Node getLast(); /** * @return Number of nodes in the list */ public int size(); /** * @return true if the list has no nodes; false otherwise */ public boolean isEmpty(); /** * Removes all nodes in the list. */ public void clear(); /** * Inserts a new node with the given value after cursor. * * @param cursor * The node to insert after. Set this to null to insert value as the * new first Node. * @param value * The value to insert * @return a reference to the newly inserted Node */ public Node insert(Node cursor, String value); /** * Inserts a new node with the given value at the "end" of the list. * * @param value * @return a reference to the newly inserted Node */ public Node append(String value); /** * Removes the node after the specified Node (cursor) from the list. * * @param cursor * A reference to the Node to remove. */ public void removeAfter(Node cursor); /** * Returns a reference to the first Node containing the key, starting from the * given Node. * * @param start * @param key * @return a reference to the first Node containing the key */ public Node find(Node start, String key); /** * Prints the values of all the items in a list */ public void printWholeList(); } SinglyLinkedTester.java: package sbccunittest; import static java.lang.Math.*; import static java.lang.System.*; import static org.apache.commons.lang3.StringUtils.*; import static org.junit.Assert.*; import static sbcc.Core.*; import java.io.*; import java.lang.reflect.*; import java.nio.file.*; import java.util.*; import java.util.stream.*; import org.apache.commons.lang3.*; import org.junit.*; import org.w3c.dom.ranges.*; import sbcc.*; import singlylinkedlist.*; /** * 09/16/2021 * * @author sstrenn * */ public class SinglyLinkedListTester { public static String newline = System.getProperty("line.separator"); public static int totalScore = 0; public static int extraCredit = 0; public static boolean isZeroScore = false; public static String scorePreamble = ""; @BeforeClass public static void beforeTesting() { totalScore = 0; extraCredit = 0; } @AfterClass public static void afterTesting() { if (isZeroScore) { totalScore = 0; extraCredit = 0; } println(scorePreamble + "Estimated score (w/o late penalties, etc.) is: " + totalScore + " out of 25."); // If the project follows the naming convention, save the results in a folder on // the desktop. (Alex Kohanim) try { String directory = substri.

package singlylinkedlist; public class Node { public String valu.pdf

package singlylinkedlist; public class Node { public String valu.pdf

package singlylinkedlist; public class Node { public String valu.pdf

for (String name : likedBy) { String likedUser= name.trim(); Set<String> likes = likesMap.getOrDefault(likedUser, new HashSet<>()); Here you create a new Set for likes. This is in the iteration over the likers though so it results in many missing entries. [ How do i Fix this ] import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.Set; public class FacebookLikeManager { private Map<String, Set<String>> likesMap; public FacebookLikeManager() { likesMap = new HashMap<>(); } public void buildMap(String filePath) { try (BufferedReader reader = new BufferedReader(new FileReader(filePath))) { String line = reader.readLine(); while (line != null) { String[] lineWords = line.split(":"); String user = lineWords[0].trim(); String[] likedBy = lineWords[1].split(","); for (String name : likedBy) { String likedUser= name.trim(); Set<String> likes = likesMap.getOrDefault(likedUser, new HashSet<>()); likes.add(user); likesMap.put(likedUser, likes); } line = reader.readLine(); } } catch (IOException ex) { System.err.format("IOException: %s%n", ex); } } public List<String> getAllUsers() { return new ArrayList<>(likesMap.keySet()); } public List<String> getLikes(String user) { Set<String> liked = likesMap.get(user); if (liked == null) { liked = new HashSet<>(); } return new ArrayList<>(liked); } public List<String> getLikedBy(String user) { List<String> likedBy = new ArrayList<>(); for (Map.Entry<String, Set<String>> post : likesMap.entrySet()) { if (post.getValue().contains(user)) { likedBy.add(post.getKey()); } } return likedBy; } } public class Main { public static void main(String[] args) { FacebookLikeManager main = new FacebookLikeManager(); main.buildMap(args[0]); System.out.println(main.getAllUsers()); System.out.println(main.getLikes("Kristen")); System.out.println(main.getLikedBy("Sara")); } } Mike: Kristen, Sara, Nate, Anthony, Randy Kristen: Mike, John, Steve, Bill Bill: Sara, Nate Sara: Nate, Anthony.

for String name likedBy String like.pdf

for String name likedBy String like.pdf

for String name likedBy String like.pdf

sachinactivepower

Basic java, java collection Framework and Date Time API

Basic java, java collection Framework and Date Time API

Basic java, java collection Framework and Date Time API

jagriti srivastava

import static org.junit.Assert.*; import java.util.Arrays; import java.util.List; import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.Parameterized; import org.junit.runners.Parameterized.Parameter; import org.junit.runners.Parameterized.Parameters; import com.att.osd.best.module.registration.bean.Min; @RunWith(Parameterized.class) public class DataDrivenMinTest { private List list; private String expected; public DataDrivenMinTest(List list, String expected) { this.list = list; this.expected = expected; } @Parameterized.Parameters public static Iterable data() { return Arrays.asList( new Object[][]{ {Arrays.asList(new Object[]{\"A\",\"B\",\"C\"}),\"A\"} } ); } @Test public void test_min() { assertEquals(expected, Min.min(list)); } } Solution import static org.junit.Assert.*; import java.util.Arrays; import java.util.List; import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.Parameterized; import org.junit.runners.Parameterized.Parameter; import org.junit.runners.Parameterized.Parameters; import com.att.osd.best.module.registration.bean.Min; @RunWith(Parameterized.class) public class DataDrivenMinTest { private List list; private String expected; public DataDrivenMinTest(List list, String expected) { this.list = list; this.expected = expected; } @Parameterized.Parameters public static Iterable data() { return Arrays.asList( new Object[][]{ {Arrays.asList(new Object[]{\"A\",\"B\",\"C\"}),\"A\"} } ); } @Test public void test_min() { assertEquals(expected, Min.min(list)); } }.

import static org.junit.Assert.;import java.util.Arrays; import.pdf

import static org.junit.Assert.;import java.util.Arrays; import.pdf

import static org.junit.Assert.;import java.util.Arrays; import.pdf

Nice to meet Kotlin

Nice to meet Kotlin

Nice to meet Kotlin

Ähnlich wie practical 9.docx (20)

UserInputHandlerjava package midterm2023 import javautil.pdf

UserInputHandlerjava package midterm2023 import javautil.pdf

UserInputHandlerjava package midterm2023 import javautil.pdf

Description (Part A) In this lab you will write a Queue implementati.pdf

Description (Part A) In this lab you will write a Queue implementati.pdf

Description (Part A) In this lab you will write a Queue implementati.pdf

Groovy

Favor composition over inheritance

Favor composition over inheritance

Favor composition over inheritance

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Here is my code for a linefile editor import java.io.BufferedRea.pdf

Java 5 and 6 New Features

Java 5 and 6 New Features

Java 5 and 6 New Features

can do this in java please thanks in advance The code that y.pdf

can do this in java please thanks in advance The code that y.pdf

can do this in java please thanks in advance The code that y.pdf

collectionframework-141116005344-conversion-gate01.pptx

collectionframework-141116005344-conversion-gate01.pptx

collectionframework-141116005344-conversion-gate01.pptx

Please help me with a UML class diagram for the following code im.pdf

Please help me with a UML class diagram for the following code im.pdf

Please help me with a UML class diagram for the following code im.pdf

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

Java Programs

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

sumOfSquaresimport java.util.;public class Arraylistoperation.pdf

can you add a delete button and a add button to the below program. j.pdf

can you add a delete button and a add button to the below program. j.pdf

can you add a delete button and a add button to the below program. j.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

Creating a Facebook Clone - Part XXIX - Transcript.pdf

package singlylinkedlist; public class Node { public String valu.pdf

package singlylinkedlist; public class Node { public String valu.pdf

package singlylinkedlist; public class Node { public String valu.pdf

for String name likedBy String like.pdf

for String name likedBy String like.pdf

for String name likedBy String like.pdf

Basic java, java collection Framework and Date Time API

Basic java, java collection Framework and Date Time API

Basic java, java collection Framework and Date Time API

import static org.junit.Assert.;import java.util.Arrays; import.pdf

import static org.junit.Assert.;import java.util.Arrays; import.pdf

import static org.junit.Assert.;import java.util.Arrays; import.pdf

Nice to meet Kotlin

Nice to meet Kotlin

Nice to meet Kotlin

Mehr von nilesh405711

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

DQDB notes.pdf

Frame-Script and Predicate logic.pptx

Frame-Script and Predicate logic.pptx

Frame-Script and Predicate logic.pptx

lecture02-cpp.ppt

lecture02-cpp.ppt

lecture02-cpp.ppt

Introduction06.ppt

Introduction06.ppt

Introduction06.ppt

Network-20210426203825.ppt

Network-20210426203825.ppt

Network-20210426203825.ppt

New Microsoft PowerPoint Presentation.pptx

New Microsoft PowerPoint Presentation.pptx

New Microsoft PowerPoint Presentation.pptx

Mehr von nilesh405711 (11)

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Review_of_Cybersecurity_in_Grid-Connected_Power_Electronics_Converters_Vuln...

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

A_Cooperative_PoW_and_Incentive_Mechanism_for_Blockchain_in_Edge_Computing.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

CHERUBIM_A_Secure_and_Highly_Parallel_Cross-Shard_Consensus_Using_Quadruple_P...

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

Smart_Land_Registration_Using_BlockChain.pdf

DQDB notes.pdf

Frame-Script and Predicate logic.pptx

Frame-Script and Predicate logic.pptx

Frame-Script and Predicate logic.pptx

lecture02-cpp.ppt

lecture02-cpp.ppt

lecture02-cpp.ppt

Introduction06.ppt

Introduction06.ppt

Introduction06.ppt

Network-20210426203825.ppt

Network-20210426203825.ppt

Network-20210426203825.ppt

New Microsoft PowerPoint Presentation.pptx

New Microsoft PowerPoint Presentation.pptx

New Microsoft PowerPoint Presentation.pptx

Kürzlich hochgeladen

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRLS IN bhubaneswar ESCORT SERVICE❤CALL GIRL No Advance Pay 💋💋 Book Now +91-9777949614 Discover Bhubaneswar Finest Call GirlsY ou're heading to Bhubaneswar for business or pleasure and want to experience the city to the fullest. What better way than in the company of a beautiful, intelligent companion to show you around town? Look no further than Bhubaneswar's finest Call Girls. These lovely ladies know all the hot spots and hidden gems that only locals are privy to. From the top restaurants and bars to the most stunning sights, they'll ensure you make unforgettable memories.

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Call Girls Mumbai

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

MuhammadAsimMuhammad6

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN We are Providing Contact Simra - 0000000000 WEBSITE FOR RENT : https://happyescortgirl.com/ MAILTO : BOOKKDREAMGIRL@GMAIL.COM HOT & SEXY MODELS // COLLEGE GIRLS AVAILABLE FOR COMPLETE ENJOYMENT WITH HIGH PROFILE INDIAN MODEL AVAILABLE HOTEL & HOME ★ SAFE AND SECURE HIGH CLASS SERVICE AFFORDABLE RATE SATISFACTION,UNLIMITED ENJOYMENT. ★ All Meetings are confidential and no information is provided to any one at any cost. ★ EXCLUSIVE PROFILes Are Safe and Consensual with Most Limits Respected ★ Service Available In: - HOME *Star Hotel Service .In Call & Out call SeRvIcEs : ★ A-Level ★ Strip-tease ★ BBBJ (Bareback Blowjob)Receive advanced sexual techniques in different mode make their life more pleasurable. ★ Spending time in hotel rooms ★ BJ (Blowjob Without a Condom) ★ Completion (Oral to completion) ★ Covered (Covered blowjob Without a Condom)

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

The purpose of Integrated Test Rig is to assess performance of Fuel Cooled Oil Cooler (FCOC), HP Pump & Oil Pump prior to fitment on Aero Engine. The design of rig is such that it can cater to individual testing of individual LRU or integrated testing of all the LRU’s installed together (in combination). The pumps under test shall be mounted directly on the high-speed electric motor flange through adapter quill shaft assembly. Variable speed drives shall be provided for all the pumps under testing. The rig shall cater for real time monitoring and recording of performance parameters. KEY FEATURES Key features of this Rig are as follows: - 1. It has separate power packs for both the fluids i.e. ATF Power pack for ATF Fluid, OX Power Pack for OX-27 Oil. 2. This Rig is designed for high temperature Application. It works on 200 deg. Celsius. 3. Two Dedicated heating systems have been integrated with this Rig to raise the temperature of OX-27 Oil. 4. In both Power Packs insulated tanks are being used, which is good for safe operation and safety of operator. 5. This rig is designed in such a way, that it’s OX power pack is in its left side, ATF Power pack is in right Side and test bed is in Centre. 6. A big Test bed have been provided for smooth testing of UUT’s. 7. All piping is being insulated for safe operation and maintenance. 8. It comprises with DAQ System. 9. This rig can test several components at a time, together or separately. Application All the UUT’s are mounted on HTFE-25 Engine after successful performance testing of those. Application of this Rig are as follows: - 1. One of its application is to test LP Pump of HTFE-25. It is designed for functional testing of LP Pump. a. Free Flow Test b. Load Test 2. It is used to test HP Pump of HTFE-25. It is designed for functional testing of HP Pump. a. Free Flow Test b. Load Test 3. It is used to test Oil Pump of HTFE-25. It is designed for functional testing of Oil Pump. 4. It is used to test FCOC of HTFE-25.

Integrated Test Rig For HTFE-25 - Neometrix

Integrated Test Rig For HTFE-25 - Neometrix

Integrated Test Rig For HTFE-25 - Neometrix

Neometrix_Engineering_Pvt_Ltd

Employee leave management system project.

Employee leave management system project.

Employee leave management system project.

Digital Communication: Digital communication refers to the transmission of information using digital signals, where data is represented by discrete symbols or values. It encompasses various techniques for encoding, transmitting, and decoding digital data, including text, images, audio, and video. Digital communication systems offer advantages such as improved signal quality, noise immunity, and the ability to multiplex multiple data streams. Differential Pulse Code Modulation (DPCM): DPCM is a digital modulation technique used for encoding analog signals into digital form. In DPCM, the difference between the current sample and the predicted value of the sample is quantized and encoded, rather than encoding the absolute sample value directly. This technique can reduce the amount of data required for transmission compared to standard pulse code modulation (PCM), especially for signals with correlation between successive samples. Delta Modulation (DM): Delta modulation is a simple form of analog-to-digital conversion where the difference (delta) between the current sample and the previous sample is quantized and encoded. In DM, only the sign of the difference (positive or negative) is transmitted, which simplifies the encoding process. However, DM may suffer from quantization noise and limited signal fidelity, especially for rapidly changing or high-frequency signals. Adaptive Delta Modulation (ADM): Adaptive delta modulation is an extension of delta modulation that dynamically adjusts the step size or quantization level based on the characteristics of the input signal. Unlike fixed-step delta modulation, ADM can adapt to changes in signal amplitude or frequency, resulting in improved signal fidelity and reduced quantization error. ADM is particularly useful for encoding signals with varying dynamics or signal-to-noise ratios

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Generative AI or GenAI technology based PPT

Generative AI or GenAI technology based PPT

Generative AI or GenAI technology based PPT

AIRCANVAS[1].pdf mini project for btech students

AIRCANVAS[1].pdf mini project for btech students

AIRCANVAS[1].pdf mini project for btech students

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

DeepFakes presentation : brief idea of DeepFakes

DeepFakes presentation : brief idea of DeepFakes

DeepFakes presentation : brief idea of DeepFakes

Introduction to Serverless with AWS Lambda

Introduction to Serverless with AWS Lambda

Introduction to Serverless with AWS Lambda

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

Work-Permit-Receiver-in-Saudi-Aramco.pptx

Work-Permit-Receiver-in-Saudi-Aramco.pptx

Work-Permit-Receiver-in-Saudi-Aramco.pptx

JuliansyahHarahap1

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top Class Call Girl Service Available WhatsApp Chat :- +91-6378878445 We offer all types of girls of your choice with space. Our escorts are fully cooperative and understand your needs.#K09 All types of call girls like Housewives, College girls,#K09 Russian girls, Muslim girls, Afghani girls, Bengali girls, Working girls, south Indian girls, Punjabi girls, etc. In-Call: — You Can Reach At Our Place in Bangalore Our place Which Is Very Clean Hygienic 100% safe Accommodation. Out-Call: — Service for Out Call You have To Come Pick The Girl From My Place We Also Provide Door-Step Services Hygienic: — Full Ac Neat And Clean Rooms Available In Hotel 24 * 7 Hrs In Bangalore

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

A Study of Urban Area Plan for Pabna Municipality

A Study of Urban Area Plan for Pabna Municipality

A Study of Urban Area Plan for Pabna Municipality

Morshed Ahmed Rahath

Thermal Engineering-R & A / C - unit - V

Thermal Engineering-R & A / C - unit - V

Thermal Engineering-R & A / C - unit - V

DineshKumar4165

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

SCMS School of Architecture

Kürzlich hochgeladen (20)

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

"Lesotho Leaps Forward: A Chronicle of Transformative Developments"

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

Orlando’s Arnold Palmer Hospital Layout Strategy-1.pptx

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

Jaipur ❤CALL GIRL 0000000000❤CALL GIRLS IN Jaipur ESCORT SERVICE❤CALL GIRL IN...

Integrated Test Rig For HTFE-25 - Neometrix

Integrated Test Rig For HTFE-25 - Neometrix

Integrated Test Rig For HTFE-25 - Neometrix

Employee leave management system project.

Employee leave management system project.

Employee leave management system project.

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Digital Communication Essentials: DPCM, DM, and ADM .pptx

Generative AI or GenAI technology based PPT

Generative AI or GenAI technology based PPT

Generative AI or GenAI technology based PPT

AIRCANVAS[1].pdf mini project for btech students

AIRCANVAS[1].pdf mini project for btech students

AIRCANVAS[1].pdf mini project for btech students

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

HAND TOOLS USED AT ELECTRONICS WORK PRESENTED BY KOUSTAV SARKAR

DeepFakes presentation : brief idea of DeepFakes

DeepFakes presentation : brief idea of DeepFakes

DeepFakes presentation : brief idea of DeepFakes

Introduction to Serverless with AWS Lambda

Introduction to Serverless with AWS Lambda

Introduction to Serverless with AWS Lambda

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

NO1 Top No1 Amil Baba In Azad Kashmir, Kashmir Black Magic Specialist Expert ...

Work-Permit-Receiver-in-Saudi-Aramco.pptx

Work-Permit-Receiver-in-Saudi-Aramco.pptx

Work-Permit-Receiver-in-Saudi-Aramco.pptx

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

💚Trustworthy Call Girls Pune Call Girls Service Just Call 🍑👄6378878445 🍑👄 Top...

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

1_Introduction + EAM Vocabulary + how to navigate in EAM.pdf

A Study of Urban Area Plan for Pabna Municipality

A Study of Urban Area Plan for Pabna Municipality

A Study of Urban Area Plan for Pabna Municipality

Thermal Engineering-R & A / C - unit - V

Thermal Engineering-R & A / C - unit - V

Thermal Engineering-R & A / C - unit - V

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

HOA1&2 - Module 3 - PREHISTORCI ARCHITECTURE OF KERALA.pptx

practical 9.docx

1. import java.util.*; class KDK { public static void main(String args[]) { Set<String> Lhs=new LinkedHashSet<String>(); Lhs.add("India"); Lhs.add("England"); Lhs.add("Iran"); Lhs.add("India"); System.out.println(Lhs); Lhs.remove("England"); System.out.println("set after removing"+"England"+Lhs); System.out.println("iterating over set"); Iterator<String> i=Lhs.iterator(); while(i.hasNext()) System.out.println(i.next()); } }

2. import java.util.*; class KDK { public static void main(String args[]) { Set<String> Lhs=new LinkedHashSet<String>(); Lhs.add("India"); Lhs.add("England"); Lhs.add("Iran"); Lhs.add("India"); System.out.println(Lhs); Lhs.remove("England"); System.out.println("set after removing"+"England"+Lhs); System.out.println("iterating over set"); Iterator<String> i=Lhs.iterator(); while(i.hasNext()) System.out.println(i.next()); } }