Help I keep getting the same error when running a code. Below is the.pdf
0 likes3 views
Help I keep getting the same error when running a code. Below is the code and the instructions about the code. import java.util.Arrays; public class Album implements Comparable { private final int id; private final String[] artists; private final int numSongs; public Album(int id, String title, String[] artists, int numSongs) { this.id = id; this.artists = new String[]{Arrays.toString(artists)}; this.numSongs = numSongs; } public int getId() { return id; } @Override public int compareTo(Album other) { return Integer.compare(this.numSongs, other.numSongs); } @Override public String toString() { StringBuilder artistNames = new StringBuilder(); for (String artist : artists) { artistNames.append(artist).append(", "); } artistNames.delete(artistNames.length() - 2, artistNames.length()); return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]"; } } import java.util.Random; public class DoublyLinkedList { private static class Node { T data; Node prev; Node next; Node(T data) { this.data = data; } } private Node head; private Node tail; private int size; public DoublyLinkedList() { head = null; tail = null; size = 0; } public Node append(T data) { Node newNode = new Node<>(data); if (head == null) { head = newNode; } else { tail.next = newNode; newNode.prev = tail; } tail = newNode; size++; return newNode; } public Node insert(int location, T data) { if (location < 0 || location > size) { throw new IllegalArgumentException("Invalid location"); } Node newNode = new Node<>(data); if (location == 0) { newNode.next = head; if (head != null) { head.prev = newNode; } head = newNode; if (tail == null) { tail = newNode; } } else if (location == size) { tail.next = newNode; newNode.prev = tail; tail = newNode; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } newNode.prev = current.prev; newNode.next = current; current.prev.next = newNode; current.prev = newNode; } size++; return newNode; } public Node delete(int location) { if (location < 0 || location >= size) { throw new IllegalArgumentException("Invalid location"); } Node deletedNode; if (location == 0) { deletedNode = head; head = head.next; if (head != null) { head.prev = null; } else { tail = null; } } else if (location == size - 1) { deletedNode = tail; tail = tail.prev; tail.next = null; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } deletedNode = current; current.prev.next = current.next; current.next.prev = current.prev; } size--; return deletedNode; } public int getIndex(T data) { Node current = head; for (int i = 0; i < size; i++) { if (current.data.equals(data)) { return i; } current = current.next; } return -1; } @Override public String toString() { StringBuilder result = new StringBuilder(); Node current = head; while (current != null) { result.append(current.data).append(" -> "); current = current.next; } result.append("NULL"); return result.toString(); } public Node shuffle() { Random r.
1 of 9
Download to read offline
![Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;](https://image.slidesharecdn.com/helpikeepgettingthesameerrorwhenrunningacode-231006123418-41ec0a8e/85/Help-I-keep-getting-the-same-error-when-running-a-code-Below-is-the-pdf-1-320.jpg)
![if (index < 0 || index >= size) {
throw new IllegalArgumentException("Invalid index");
}
Node current = head;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
}
{
public static void main(String[] args) {
// Create an empty DLL
DoublyLinkedList dll = new DoublyLinkedList<>();
// Create albums
Album album1 = new Album(1, "Album 1", new String[]{"Artist A", "Artist B"}, 10);
Album album2 = new Album(2, "Album 2", new String[]{"Artist C"}, 15);
// Append albums to DLL
dll.append(album1);
dll.append(album2);
// Test append()
Album album5 = new Album(5, "Album 5", new String[]{"Artist G"}, 7);
dll.append(album5);
System.out.println("DLL after append: " + dll);
// Test toString()
System.out.println("DLL: " + dll);
// Test insert()
Album album4 = new Album(4, "Album 4", new String[]{"Artist F"}, 12);
dll.insert(1, album4);
System.out.println("DLL after insert: " + dll);
// Test delete()
dll.delete(2);](https://image.slidesharecdn.com/helpikeepgettingthesameerrorwhenrunningacode-231006123418-41ec0a8e/85/Help-I-keep-getting-the-same-error-when-running-a-code-Below-is-the-pdf-8-320.jpg)
![System.out.println("DLL after delete: " + dll);
// Test getIndex()
System.out.println("Index of album2: " + dll.getIndex(album2));
// Test shuffle()
dll.shuffle();
System.out.println("Shuffled DLL: " + dll);
// Test partition()
DoublyLinkedList newList = dll.partition(album1);
System.out.println("New List after partition: " + newList);
System.out.println("Original DLL after partition: " + dll);
}
}c: Users Fleegyboy .jdksopenjdk-20.0.1binjava.exe ... DLL after append: ID: 1 -- 10 songs
-- [[Artist A, Artist B]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5 -- 7 songs -- [[Artist G]] ->
NULL DLL: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5
-- 7 songs -- [[Artist G]] -> NULL after insert: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 4
-- 12 songs -- [[Artist F]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5 -- 7 after delete: ID: 1 -- 10
songs -- [[Artist A, Artist B]] -> ID: 4 -- 12 songs -- [[Artist F]] -> ID: 5 -- 7 songs -- [[Artist G]]
-> NULL Index of album2: -1 Shuffled DLL: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 4 -
- 12 songs -- [[Artist F]] -> ID: 5 -- 7 songs -- [[Artist G]] -> NULL Exception in thread "main"
java.lang.IlleqalArqumentException Create breakpoint: Invalid location at
DoublyLinkedList.delete (DoublyLinkedList.java:73) at DoublyLinkedList.partition
(DoublyLinkedList. java:208) at DoublyLinkedListTest.main (DoublyLinkedListTest. java:37)
Process finished with exit code 1](https://image.slidesharecdn.com/helpikeepgettingthesameerrorwhenrunningacode-231006123418-41ec0a8e/85/Help-I-keep-getting-the-same-error-when-running-a-code-Below-is-the-pdf-9-320.jpg)
Ad
Recommended
I need help writing test Codepackage org.example;import j.pdf
I need help writing test Codepackage org.example;import j.pdfmail931892 I need help writing test
Code:
package org.example;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
class Album implements Comparable {
private int id;
private List artists;
private String title;
private int numSongs;
public Album(int id, List artists, String title, int numSongs) {
this.id = id;
this.artists = artists;
this.title = title;
this.numSongs = numSongs;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
return "ID: " + id + " -- " + numSongs + " songs -- " + artists;
}
// Getter methods for Album properties
// Implement these as needed
}
class DoublyLinkedList {
private Node head;
private Node tail;
private int size;
private class Node {
Album data;
Node prev;
Node next;
Node(Album data) {
this.data = data;
this.prev = null;
this.next = null;
}
}
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public void append(Album data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
}
size++;
}
public Node insert(int location, Album data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node(data);
if (location == 0) {
newNode.next = head;
head.prev = newNode;
head = newNode;
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location - 1; i++) {
current = current.next;
}
newNode.prev = current;
newNode.next = current.next;
current.next.prev = newNode;
current.next = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(Album data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
Node current = head;
while (current != null) {
sb.append(current.data.toString());
if (current.next != null) {
sb.append(" -> ");
} else {
sb.append(" -> NULL");
}
current = current.next;
}
return sb.toString();
}
public void shuffle() {
List albumList = new ArrayList<>();
Node current = head;
while (current != null) {
albumList.add(current.data);
current = current.next;
}
Collections.shuffle(albumList, new Rando.
Data structures cs301 power point slides lecture 03
Data structures cs301 power point slides lecture 03Nasir Mehmood The document discusses linked lists and C++ code for implementing a linked list. It includes definitions of a Node class to represent individual nodes, with fields for storing data and pointers to other nodes. It also defines a List class for managing the overall linked list, including functions for adding new nodes to the list. Diagrams show how nodes are linked and stored non-contiguously in memory. The code provided implements adding new nodes to the front or end of the linked list by updating pointer references between nodes.
Help please!!(Include your modified DList.java source code file in.pdf
Help please!!(Include your modified DList.java source code file in.pdfjyothimuppasani1 Help please!!
(Include your modified DList.java source code file in your homework solution zip archive)
Using
whatever Java IDE you prefer, create a project and add DList.java and DListTest.java to it (these
files are provided
in the Week 6 Source zip archive). Modify DList to implement a method that removes all
occurrences of a specific
integer from the list. Here is the pseudocode:
Method removeAll(In: Integer pData) Returns Nothing
Define index variable i and initialize i to 0
While i < the size of this Dlist Do
If get(i) equals pData Then
remove(i)
Else
Increment i
End If
End While
End Method removeAll
Next, modify DListTest() to add test case 21 which tests that removeAll() works correctly.
WHat more do i need to provide to get help on this???
Solution
/* DListNode.java */
/**
* A DListNode is a node in a DList (doubly-linked list).
*/
class DListNode {
/**
* item references the item stored in the current node.
* prev references the previous node in the DList.
* next references the next node in the DList.
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
public Object item;
protected DListNode prev;
protected DListNode next;
/**
* DListNode() constructor.
* @param i the item to store in the node.
* @param p the node previous to this node.
* @param n the node following this node.
*/
DListNode(Object i, DListNode p, DListNode n) {
item = i;
prev = p;
next = n;
}
}
/* DList.java */
/**
* A DList is a mutable doubly-linked list ADT. Its implementation is
* circularly-linked and employs a sentinel (dummy) node at the head
* of the list.
*
* DO NOT CHANGE ANY METHOD PROTOTYPES IN THIS FILE.
*/
class DList {
/**
* head references the sentinel node.
* size is the number of items in the list. (The sentinel node does not
* store an item.)
*
* DO NOT CHANGE THE FOLLOWING FIELD DECLARATIONS.
*/
protected DListNode head;
protected int size;
/* DList invariants:
* 1) head != null.
* 2) For any DListNode x in a DList, x.next != null.
* 3) For any DListNode x in a DList, x.prev != null.
* 4) For any DListNode x in a DList, if x.next == y, then y.prev == x.
* 5) For any DListNode x in a DList, if x.prev == y, then y.next == x.
* 6) size is the number of DListNodes, NOT COUNTING the sentinel,
* that can be accessed from the sentinel (head) by a sequence of
* \"next\" references.
*/
/**
* newNode() calls the DListNode constructor. Use this class to allocate
* new DListNodes rather than calling the DListNode constructor directly.
* That way, only this method needs to be overridden if a subclass of DList
* wants to use a different kind of node.
* @param item the item to store in the node.
* @param prev the node previous to this node.
* @param next the node following this node.
*/
protected DListNode newNode(Object item, DListNode prev, DListNode next) {
return new DListNode(item, prev, next);
}
/**
* DList() constructor for an empty DList.
*/
public DList() {
// Your solution here.
head = newNode(null, head, head);
head.prev = head;
head.next = head;
si.
137 Lab-2.2.pdf
137 Lab-2.2.pdf21E135MAHIESHWARJ The document contains C program code and explanations for performing operations on singly linked lists and circular singly linked lists, as well as calculating the sum of nodes in a singly linked list. It includes code to insert, delete and display nodes for both types of linked lists. It also includes the output of running example programs to test the linked list operations and node sum calculation.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a pro.pdfarchgeetsenterprises hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
Data Structures & Algorithms - Lecture 3
Data Structures & Algorithms - Lecture 3Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt Data Structures and Algorithms using C++ programming language.
Lab-2.2 717822E504.pdf
Lab-2.2 717822E504.pdf21E135MAHIESHWARJ The document contains C program code and explanations for performing operations on singly linked lists and circular singly linked lists. It includes code to insert, delete and display nodes for each type of linked list. It also includes code to calculate and print the sum of all nodes in a singly linked list. The programs are run and output is shown confirming the successful implementation of the linked list operations.
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo.docxajoy21 This document contains C++ code to implement a linked list program that performs the following tasks:
1. Inputs 10 integers into a linked list while sorting them as they are inserted
2. Prints the sorted list and computes the average of the values
3. Deletes nodes from the list with values less than the average
4. Creates a second list of 10 sorted integers
5. Merges the two lists together, eliminating duplicates, and prints the final list
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in.pdfarjunstores123 In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
void insert_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop Because I believe that it is making a.pdffeelinggift How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
UNIT I LINEAR DATA STRUCTURES – LIST .pptx
UNIT I LINEAR DATA STRUCTURES – LIST .pptxVISWANATHAN R V Abstract Data types (ADTs) — List ADT — Array-based implementation — Linked list implementation — Singly linked lists — Circularly linked lists — Doubly linked lists — Applications of lists — Polynomial Manipulation.
Functional Programming with Groovy
Functional Programming with GroovyArturo Herrero My talk about Functional Programming with Groovy at Greach
Greach http://greach.es/
the Groovy spanish conf
Date:
04-11-2011
C Exam Help 
C Exam Help Programming Exam Help I am Gabriel C. I am a C Exam Expert at programmingexamhelp.com. I hold a PhD. in Business analyst of Information Technology, Montreal College of Information Technology, Canada. I have been helping students with their exams for the past 8 years. You can hire me to take your exam in C.
Visit programmingexamhelp.com or email [email protected]. You can also call on +1 678 648 4277 for any assistance with the C Exam.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdfarccreation001 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.
Lab-2.4 101.pdf
Lab-2.4 101.pdf21E135MAHIESHWARJ The document contains C program code to implement three data structures using linked lists:
1) A stack using a singly linked list with push, pop, and display functions.
2) A queue using a singly linked list with enqueue, dequeue, and display functions.
3) A program to merge two sorted linked lists by comparing nodes and appending to the merged list.
Pseudocode and sample test cases are provided for each problem.
Ds 2 cycle
Ds 2 cycleChaitanya Kn The document discusses the implementation of a binary search tree (BST) using both recursive and non-recursive traversal methods. It defines a BST node structure with left and right child pointers. Functions are included to insert nodes, perform inorder, preorder and postorder traversals recursively and non-recursively using stacks. Main inserts sample nodes into the tree and calls the various traversal functions to output the node values in the specified orders.
GIVEN CODE template -typename T- class DList { private- struct Node {.docx
GIVEN CODE template -typename T- class DList { private- struct Node {.docxLeonardN9WWelchw GIVEN CODE
template <typename T>
class DList {
private:
struct Node {
T data;
Node* next;
Node* prev;
Node(const T& d = T{}, Node* n = nullptr, Node* p = nullptr)
: data(d), next(n), prev(p) {}
};
Node* head;
Node* tail;
int sz;
public:
class const_iterator {
public:
const_iterator() : current(nullptr) {}
const T& operator*() const {
return retrieve();
}
const_iterator& operator++() {
current = current->next;
return *this;
}
const_iterator operator++(int) {
const_iterator old = *this;
++(*this);
return old;
}
const_iterator& operator--() {
current = current->prev;
return *this;
}
const_iterator operator--(int) {
const_iterator old = *this;
--(*this);
return old;
}
bool operator==(const const_iterator& rhs) const {
return current == rhs.current;
}
bool operator!=(const const_iterator& rhs) const {
return !(*this == rhs);
}
protected:
Node* current;
const_iterator(Node* p) : current(p) {}
T& retrieve() const {
return current->data;
}
friend class DList<T>;
};
class iterator : public const_iterator {
public:
iterator() {}
T& operator*() {
return const_iterator::retrieve();
}
const T& operator*() const {
return const_iterator::operator*();
}
iterator& operator++() {
this->current = this->current->next;
return *this;
}
iterator operator++(int) {
iterator old = *this;
++(*this);
return old;
}
iterator& operator--() {
this->current = this->current->prev;
return *this;
}
iterator operator--(int) {
iterator old = *this;
--(*this);
return old;
}
protected:
iterator(Node* p) : const_iterator(p) {}
friend class DList<T>;
};
DList() : head(new Node()), tail(new Node()), sz(0) {
head->next = tail;
tail->prev = head;
}
~DList() {
clear();
delete head;
delete tail;
}
DList(const DList& rhs) : head(new Node()), tail(new Node()), sz(rhs.sz) {
head->next = tail;
tail->prev = head;
for (auto it = rhs.cbegin(); it != rhs.cend(); ++it) {
insert(cend(), *it);
}
}
DList& operator=(const DList& rhs) {
DList copy = rhs;
std::swap(*this, copy);
return *this;
}
DList(DList&& rhs) : head(rhs.head), tail(rhs.tail), sz(rhs.sz) {
rhs.head = nullptr;
rhs.tail = nullptr;
rhs.sz = 0;
}
DList& operator=(DList&& rhs) {
std::swap(head, rhs.head);
std::swap(tail, rhs.tail);
std::swap(sz, rhs.sz);
return *this;
}
iterator insert(iterator it, const T& data) {
Node* p = it.current;
++sz;
return iterator(p)
iterator search(const T& data);
iterator erase(iterator it);
There is a given code , please complete the code that is marked in BOLD in C++ code language , than you!
Please provide an answer only for that is marked in BOLD !!
.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptxRashidFaridChishti Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Lab Week 2 Game Programming.docx
Lab Week 2 Game Programming.docxteyaj1 This program implements a doubly linked list to print the list forward and backward. It defines a Node struct with data, next and prev pointers. It inserts nodes at the head of the list using InsertAtHead() and prints the list forward using Print() and backward using ReversePrint(). It initially inserts two nodes and prints the list both ways. It then inserts three more nodes at the head and prints the list again forward and backward.
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdf
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdfaathiauto DoublyList.cpp:
#include "DoublyList.h"
using namespace std;
void DoublyList::insertFront(int newData)
{
if (first == nullptr)
{
first = new DLLNode(newData, nullptr, nullptr);
last = first;
// Common error: Forgetting to reset pointer last.
}
else
{
first = new DLLNode(newData, nullptr, first);
first->getNext()->setPrev(first);
// Common error: Forgetting to connect pointer
// prev of what is now the second node to the
// new first node.
}
++count;
}
void DoublyList::printForward() const
{
DLLNode* current = first;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getNext();
}
}
void DoublyList::printReverse() const
{
DLLNode* current = last;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getPrev();
}
}
void DoublyList::clearList()
{
DLLNode* temp = first;
while (first != nullptr)
{
first = first->getNext();
delete temp;
temp = first;
}
last = nullptr;
// Don't forget to reset pointer last to nullptr.
count = 0;
}
DoublyList::~DoublyList()
{
if (first != nullptr)
clearList();
}
DoublyList.h
#ifndef DOUBLYLIST_H
#define DOUBLYLIST_H
#include <string>
#include <iostream>
class DLLNode
{
public:
DLLNode() : data(0), prev(nullptr), next(nullptr) {}
DLLNode(int theData, DLLNode* prevLink, DLLNode* nextLink)
: data(theData), prev(prevLink), next(nextLink) {}
int getData() const { return data; }
DLLNode* getPrev() const { return prev; }
DLLNode* getNext() const { return next; }
void setData(int theData) { data = theData; }
void setPrev(DLLNode* prevLink) { prev = prevLink; }
void setNext(DLLNode* nextLink) { next = nextLink; }
~DLLNode(){}
private:
int data; // To simplify, we are using only one piece of data.
DLLNode* prev;
DLLNode* next;
};
class DoublyList
{
public:
DoublyList() : first(nullptr), last(nullptr), count(0) {}
void insertFront(int newData);
void printForward() const;
void printReverse() const;
void rotateNodesRight(int);
void clearList();
~DoublyList();
private:
// Pointer to the first node in the list.
DLLNode*first;
// Pointer to the last node in the list.
DLLNode*last;
// Number of nodes in the list.
int count;
};
#endif
Main.cpp
#include "DoublyList.h"
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<vector<int>> data = {
{25, 76, 35, 67, 15, 98},
{1, 2, 3, 4, 5, 6, 7, 8, 9},
{10, 20},
{34, 56, 78, 12, 89, 34, 76, 28, 54, 22, 41},
{123, 873, 619},
};
vector<int> nodesToRotate = { 2, 3, 1, 9, 2 };
{
DoublyList doublyList;
int vectorSize = static_cast<int>(data.size());
for (int i = 0; i < vectorSize; ++i)
{
int innerSize = static_cast<int>(data[i].size());
for (int j = innerSize - 1; j >= 0; --j)
doublyList.insertFront(data[i].at(j));
cout << "Rotate right: " << nodesToRotate[i] << "\n";
cout << " List is: ";
doublyList.printForward();
cout << "\n";
doublyList.rotateNodesRight(nodesToRotate[i]);
cout << "After rotating:";
cout << "\n Print forward: ";
doublyList.printForward();
cout << "\nPrint backwards: ";
doublyList.printReverse(.
Doublylinklist
Doublylinklistritu1806 This document presents information on doubly linked lists including their representation, initialization, node creation, and various operations like insertion, deletion, and traversal. It discusses inserting and deleting nodes at the beginning or end of the list, as well as inserting before or after a specified node. Code examples are provided for initializing a doubly linked list and performing each operation.
You can list anything, it doesnt matter. I just want to see code f.pdf
You can list anything, it doesnt matter. I just want to see code f.pdffashionbigchennai You can list anything, it doesn\'t matter. I just want to see code for this problem. Thank you
Solution
Include header files .......
Source code:
public class SinglyLinkedListImpl {
private Node head;
private Node tail;
public void add(T element){
Node nd = new Node();
nd.setValue(element);
System.out.println(\"Adding: \"+element);
if(head == null){
head = nd;
tail = nd;
} else {
tail.setNextRef(nd);
}
tail = nd;
}
}
public void addAfter(T element, T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
Node nd = new Node();
nd.setValue(element);
nd.setNextRef(tmp.getNextRef());
if(tmp == tail){
tail = nd;
}
tmp.setNextRef(nd);
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void deleteFront(){
if(head == null){
System.out.println(\"Underflow...\");
}
Node tmp = head;
head = tmp.getNextRef();
if(head == null){
tail = null;
}
System.out.println(\"Deleted: \"+tmp.getValue());
}
public void deleteAfter(T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
tmp = refNode.getNextRef();
refNode.setNextRef(tmp.getNextRef());
if(refNode.getNextRef() == null){
tail = refNode;
}
System.out.println(\"Deleted: \"+tmp.getValue());
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void traverse(){
Node tmp = head;
while(true){
if(tmp == null){
break;
}
System.out.println(tmp.getValue());
tmp = tmp.getNextRef();
}
}
public static void main(String a[]){
SinglyLinkedListImpl sl = new SinglyLinkedListImpl();
sl.add(3);
sl.add(32);
sl.add(54);
sl.add(89);
sl.addAfter(76, 54);
sl.deleteFront();
sl.deleteAfter(76);
sl.traverse();
}
}
class Node implements Comparable {
private T value;
private Node nextRef;
public T getValue() {
return value;
}
public void setValue(T value) {
this.value = value;
}
public Node getNextRef() {
return nextRef;
}
public void setNextRef(Node ref) {
this.nextRef = ref;
}
public int compareTo(T arg) {
if(arg == this.value){
return 0;
} else {
return 1;
}
}
}
This program implement the concept of single linked list..
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please package dlist i.pdfABHISHEKREADYMADESKO Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program an.pdfmichardsonkhaicarr37 in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
C Homework Help
C Homework HelpProgramming Homework Help I am Andrew O. I am a C Homework Expert at programminghomeworkhelp.com. I hold a master’s in Programming from, the University of Southampton, UK. I have been helping students with their homework for the past 10 years. I solve homework related to C.
Visit programminghomeworkhelp.com or email [email protected].
You can also call on +1 678 648 4277 for any assistance with C Homework.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdfarrowmobile Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
fix the error - class Node{ int data- Node next-.pdf
fix the error - class Node{ int data- Node next-.pdfAKVIGFOEU fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
double linked list header file code#include iostream#include.pdf
double linked list header file code#include iostream#include.pdffacevenky This document contains C++ code for implementing a priority queue using a doubly linked skip list. It includes class definitions for a Node and SkipList that make up the skip list, and a PriorityQueue class that uses the skip list to store and retrieve elements based on priority. The main() function creates a PriorityQueue and SkipList, adds some sample elements, and calls the Process() method to iteratively remove and output elements by highest priority. However, the code is not fully implementing the Process() method and is not outputting the processed data as intended.
I need help on this 5 and 6. here is the code so far import jav.pdf
I need help on this 5 and 6. here is the code so far import jav.pdfmail931892 I need help on this 5 and 6.
here is the code so far:
import javax.swing.*;
import java.awt.*;
import java.util.*;
/**
* !!! Put in description of your program here !!!
*
* @author !!! your name here !!!
*
*/
public class AngryBirds extends JPanel
{
/**
* Here are some variables you are likely to find useful. I have created
* this variables outside of any method, so that they are available to all
* the methods.
*
* (Typically instance variables like this should be labeled as "public" or
* "private" but I have omitted this designation since you are not familiar
* with the meanings of these terms yet.)
*
* Show care not to create local variables with the same names as these
* ones!
*/
double timeInterval;
double velocity;
double angle;
/**
* paint
*
* Draws the Angry Birds simulation on the graphics window
*
* @param g the Graphics object for the window
*/
public void paint(Graphics g)
{
super.paint(g); // do not edit
// Set background color
Color skyBlueDay = new Color(135, 206, 250);
setBackground(skyBlueDay);
// Draw horizon (ground)
g.setColor(new Color(34, 139, 34)); // Green color for the ground
g.fillRect(0, getHeight() - 50, getWidth(), 50);
// Draw structure (e.g., a wooden block)
g.setColor(new Color(139, 69, 19)); // Brown color for the structure
g.fillRect(200, getHeight() - 100, 80, 80);
// Draw pigs in the structure (green round pigs with happy faces)
g.setColor(Color.GREEN);
// Pig 1
g.fillOval(215, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(220, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(222, getHeight() - 85, 2, 2); // Left eye
g.fillOval(226, getHeight() - 85, 2, 2); // Right eye
// Pig 2
g.setColor(Color.GREEN);
g.fillOval(235, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(240, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(242, getHeight() - 85, 2, 2); // Left eye
g.fillOval(246, getHeight() - 85, 2, 2); // Right eye
// Pig 3
g.setColor(Color.GREEN);
g.fillOval(255, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(260, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(262, getHeight() - 85, 2, 2); // Left eye
g.fillOval(266, getHeight() - 85, 2, 2); // Right eye
// Draw slingshot
g.setColor(new Color(139, 69, 19)); // Brown color for slingshot base
g.fillRect(50, getHeight() - 20, 20, 100); // Slingshot base
// Angry bird (Red bird)
g.setColor(new Color(255, 0, 0)); // Red color for the bird
g.fillOval(30, getHeight() - 50, 40, 40); // Body
g.setColor(Color.BLACK); // Bird's features
g.fillArc(40, getHeight() - 45, 10, 10, 0, -180); // Happy mouth
g.fillOval(35, getHeight() - 50, 8, 8); // Left eye
g.fillOval(45, getHeight() - 50, 8, 8); // Right eye
//put your code here
}//paint
/**
* init
*
* prompts user for information about the simulation
*/
public void init()
{
// prompt user for information
String time = ""; //used to store user input
do
{
time = JOpti.
I need a substantive comment on this postThe formal structure of .pdf
I need a substantive comment on this postThe formal structure of .pdfmail931892 I need a substantive comment on this post:
The formal structure of an organization is often shown in an organizational chart that displays
names, job titles, and lines of authority. At its core, a formal structure is meant to show how the
company operates at optimal health. My company utilizes an organizational chart (org chart) and
I am the one who updates it constantly. My company operates most closely under a functional
structure. A functional structure groups together people with similar skills who perform similar
tasks (Uhl-Bien, 2021). Our organizational structure starts with our founder and CEO, then
beneath him is the rest of the executive team. Each executive operates a different business unit
and has full teams below them as well. Depending on the business unit there are four to five
levels of employees from the top down. Our structure is a reflection of our goals, because each
business unit has goals that are specific to them, but that impact the overall organization. We also
have very distinct competencies within each business unit such as designers, project managers,
accountants, and account managers. They are all very specialized in what they do, and their role
is specific to their business unit..
Ad
More Related Content
Similar to Help I keep getting the same error when running a code. Below is the.pdf (20)
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in.pdfarjunstores123 In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
void insert_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
How do you stop infinite loop Because I believe that it is making a.pdf
How do you stop infinite loop Because I believe that it is making a.pdffeelinggift How do you stop infinite loop? Because I believe that it is making an infinite circular list.
c++ code:
Here is the list class:
#ifndef LIN_J_LIST
#define LIN_J_LIST
typedef unsigned int uint;
#include
#include
using namespace std;
/**
* a simplified generic singly linked list class to illustrate C++ concepts
* @author Jerry Lin
* @version 2/17/17
*/
template< typename Object >
class List
{
private:
/**
* A class to store data and provide a link to the next node in the list
*/
class Node
{
public:
/**
* The constructor
* @param data the data to be stored in this node
*/
explicit Node( const Object & data )
: data{ data }, next{ nullptr } {}
Object data;
Node * next;
};
public:
/**
* The constructor for an empty list
*/
List()
: size{ 0 }, first{ nullptr }, last{ nullptr } {}
/**
* the copy constructor-creates and copy the list
*/
List( List && rhs ) = delete;
List( const List & rhs )
{
count = 0;
size = 0;
if(rhs.size != 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first;
size++;
while(current->next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op.
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode->next;
size++;
}
}
// you document and implement this method
}
/**
* the operator= method-copies the list
*/
List & operator=( List && rhs) = delete;
List & operator=( const List & rhs )
{
count = 0;
size = 0;
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
if(rhs.size!= 0)
{
push_front(rhs.front());
Node * current = rhs.first;
Node * tempNode = first; //create a temporary to store
size++;
while(current -> next != nullptr)
{
current = current->next;
Node *newNode = new Node(current->data); //transfer the data. basic op
count++;
tempNode->next = newNode;
last = newNode;
tempNode = tempNode -> next;
size++;
}
}
return *this;
// you document and implement this method
}
/**
* accessor
* @return count
*/
int get_count() const
{
return count;
}
/**
* The destructor that gets rid of everything that\'s in the list and
* resets it to empty. If the list is already empty, do nothing.
*/
~List()
{
if( size != 0 )
{
Node * current = first;
Node * temp;
while( current != nullptr )
{
temp = current;
current = current->next;
delete temp;
}
}
}
/**
* Put a new element onto the beginning of the list
* @param item the data the new element will contain
*/
void push_front( const Object& item )
{
Node * new_node = new Node( item );//basic op.
if(is_empty())
{
last = new_node;
}
else
{
new_node->next = first;
}
first = new_node;
size++;
/* you complete the rest */
}
/**
* Remove the element that\'s at the front of the list. Causes an
* assertion error if the list is empty.
*/
void pop_front()
{
assert( !is_empty() );
Node * temp = first;
if( first == last )
{
first = last = nullptr;
}
else
{
first = first->next;
}
delete temp;
size--;
}
/**
* Accessor to return the da.
UNIT I LINEAR DATA STRUCTURES – LIST .pptx
UNIT I LINEAR DATA STRUCTURES – LIST .pptxVISWANATHAN R V Abstract Data types (ADTs) — List ADT — Array-based implementation — Linked list implementation — Singly linked lists — Circularly linked lists — Doubly linked lists — Applications of lists — Polynomial Manipulation.
Functional Programming with Groovy
Functional Programming with GroovyArturo Herrero My talk about Functional Programming with Groovy at Greach
Greach http://greach.es/
the Groovy spanish conf
Date:
04-11-2011
C Exam Help
C Exam Help Programming Exam Help I am Gabriel C. I am a C Exam Expert at programmingexamhelp.com. I hold a PhD. in Business analyst of Information Technology, Montreal College of Information Technology, Canada. I have been helping students with their exams for the past 8 years. You can hire me to take your exam in C.
Visit programmingexamhelp.com or email [email protected]. You can also call on +1 678 648 4277 for any assistance with the C Exam.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdfarccreation001 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.
Lab-2.4 101.pdf
Lab-2.4 101.pdf21E135MAHIESHWARJ The document contains C program code to implement three data structures using linked lists:
1) A stack using a singly linked list with push, pop, and display functions.
2) A queue using a singly linked list with enqueue, dequeue, and display functions.
3) A program to merge two sorted linked lists by comparing nodes and appending to the merged list.
Pseudocode and sample test cases are provided for each problem.
Ds 2 cycle
Ds 2 cycleChaitanya Kn The document discusses the implementation of a binary search tree (BST) using both recursive and non-recursive traversal methods. It defines a BST node structure with left and right child pointers. Functions are included to insert nodes, perform inorder, preorder and postorder traversals recursively and non-recursively using stacks. Main inserts sample nodes into the tree and calls the various traversal functions to output the node values in the specified orders.
GIVEN CODE template -typename T- class DList { private- struct Node {.docx
GIVEN CODE template -typename T- class DList { private- struct Node {.docxLeonardN9WWelchw GIVEN CODE
template <typename T>
class DList {
private:
struct Node {
T data;
Node* next;
Node* prev;
Node(const T& d = T{}, Node* n = nullptr, Node* p = nullptr)
: data(d), next(n), prev(p) {}
};
Node* head;
Node* tail;
int sz;
public:
class const_iterator {
public:
const_iterator() : current(nullptr) {}
const T& operator*() const {
return retrieve();
}
const_iterator& operator++() {
current = current->next;
return *this;
}
const_iterator operator++(int) {
const_iterator old = *this;
++(*this);
return old;
}
const_iterator& operator--() {
current = current->prev;
return *this;
}
const_iterator operator--(int) {
const_iterator old = *this;
--(*this);
return old;
}
bool operator==(const const_iterator& rhs) const {
return current == rhs.current;
}
bool operator!=(const const_iterator& rhs) const {
return !(*this == rhs);
}
protected:
Node* current;
const_iterator(Node* p) : current(p) {}
T& retrieve() const {
return current->data;
}
friend class DList<T>;
};
class iterator : public const_iterator {
public:
iterator() {}
T& operator*() {
return const_iterator::retrieve();
}
const T& operator*() const {
return const_iterator::operator*();
}
iterator& operator++() {
this->current = this->current->next;
return *this;
}
iterator operator++(int) {
iterator old = *this;
++(*this);
return old;
}
iterator& operator--() {
this->current = this->current->prev;
return *this;
}
iterator operator--(int) {
iterator old = *this;
--(*this);
return old;
}
protected:
iterator(Node* p) : const_iterator(p) {}
friend class DList<T>;
};
DList() : head(new Node()), tail(new Node()), sz(0) {
head->next = tail;
tail->prev = head;
}
~DList() {
clear();
delete head;
delete tail;
}
DList(const DList& rhs) : head(new Node()), tail(new Node()), sz(rhs.sz) {
head->next = tail;
tail->prev = head;
for (auto it = rhs.cbegin(); it != rhs.cend(); ++it) {
insert(cend(), *it);
}
}
DList& operator=(const DList& rhs) {
DList copy = rhs;
std::swap(*this, copy);
return *this;
}
DList(DList&& rhs) : head(rhs.head), tail(rhs.tail), sz(rhs.sz) {
rhs.head = nullptr;
rhs.tail = nullptr;
rhs.sz = 0;
}
DList& operator=(DList&& rhs) {
std::swap(head, rhs.head);
std::swap(tail, rhs.tail);
std::swap(sz, rhs.sz);
return *this;
}
iterator insert(iterator it, const T& data) {
Node* p = it.current;
++sz;
return iterator(p)
iterator search(const T& data);
iterator erase(iterator it);
There is a given code , please complete the code that is marked in BOLD in C++ code language , than you!
Please provide an answer only for that is marked in BOLD !!
.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptxRashidFaridChishti Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Lab Week 2 Game Programming.docx
Lab Week 2 Game Programming.docxteyaj1 This program implements a doubly linked list to print the list forward and backward. It defines a Node struct with data, next and prev pointers. It inserts nodes at the head of the list using InsertAtHead() and prints the list forward using Print() and backward using ReversePrint(). It initially inserts two nodes and prints the list both ways. It then inserts three more nodes at the head and prints the list again forward and backward.
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdf
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdfaathiauto DoublyList.cpp:
#include "DoublyList.h"
using namespace std;
void DoublyList::insertFront(int newData)
{
if (first == nullptr)
{
first = new DLLNode(newData, nullptr, nullptr);
last = first;
// Common error: Forgetting to reset pointer last.
}
else
{
first = new DLLNode(newData, nullptr, first);
first->getNext()->setPrev(first);
// Common error: Forgetting to connect pointer
// prev of what is now the second node to the
// new first node.
}
++count;
}
void DoublyList::printForward() const
{
DLLNode* current = first;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getNext();
}
}
void DoublyList::printReverse() const
{
DLLNode* current = last;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getPrev();
}
}
void DoublyList::clearList()
{
DLLNode* temp = first;
while (first != nullptr)
{
first = first->getNext();
delete temp;
temp = first;
}
last = nullptr;
// Don't forget to reset pointer last to nullptr.
count = 0;
}
DoublyList::~DoublyList()
{
if (first != nullptr)
clearList();
}
DoublyList.h
#ifndef DOUBLYLIST_H
#define DOUBLYLIST_H
#include <string>
#include <iostream>
class DLLNode
{
public:
DLLNode() : data(0), prev(nullptr), next(nullptr) {}
DLLNode(int theData, DLLNode* prevLink, DLLNode* nextLink)
: data(theData), prev(prevLink), next(nextLink) {}
int getData() const { return data; }
DLLNode* getPrev() const { return prev; }
DLLNode* getNext() const { return next; }
void setData(int theData) { data = theData; }
void setPrev(DLLNode* prevLink) { prev = prevLink; }
void setNext(DLLNode* nextLink) { next = nextLink; }
~DLLNode(){}
private:
int data; // To simplify, we are using only one piece of data.
DLLNode* prev;
DLLNode* next;
};
class DoublyList
{
public:
DoublyList() : first(nullptr), last(nullptr), count(0) {}
void insertFront(int newData);
void printForward() const;
void printReverse() const;
void rotateNodesRight(int);
void clearList();
~DoublyList();
private:
// Pointer to the first node in the list.
DLLNode*first;
// Pointer to the last node in the list.
DLLNode*last;
// Number of nodes in the list.
int count;
};
#endif
Main.cpp
#include "DoublyList.h"
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<vector<int>> data = {
{25, 76, 35, 67, 15, 98},
{1, 2, 3, 4, 5, 6, 7, 8, 9},
{10, 20},
{34, 56, 78, 12, 89, 34, 76, 28, 54, 22, 41},
{123, 873, 619},
};
vector<int> nodesToRotate = { 2, 3, 1, 9, 2 };
{
DoublyList doublyList;
int vectorSize = static_cast<int>(data.size());
for (int i = 0; i < vectorSize; ++i)
{
int innerSize = static_cast<int>(data[i].size());
for (int j = innerSize - 1; j >= 0; --j)
doublyList.insertFront(data[i].at(j));
cout << "Rotate right: " << nodesToRotate[i] << "\n";
cout << " List is: ";
doublyList.printForward();
cout << "\n";
doublyList.rotateNodesRight(nodesToRotate[i]);
cout << "After rotating:";
cout << "\n Print forward: ";
doublyList.printForward();
cout << "\nPrint backwards: ";
doublyList.printReverse(.
Doublylinklist
Doublylinklistritu1806 This document presents information on doubly linked lists including their representation, initialization, node creation, and various operations like insertion, deletion, and traversal. It discusses inserting and deleting nodes at the beginning or end of the list, as well as inserting before or after a specified node. Code examples are provided for initializing a doubly linked list and performing each operation.
You can list anything, it doesnt matter. I just want to see code f.pdf
You can list anything, it doesnt matter. I just want to see code f.pdffashionbigchennai You can list anything, it doesn\'t matter. I just want to see code for this problem. Thank you
Solution
Include header files .......
Source code:
public class SinglyLinkedListImpl {
private Node head;
private Node tail;
public void add(T element){
Node nd = new Node();
nd.setValue(element);
System.out.println(\"Adding: \"+element);
if(head == null){
head = nd;
tail = nd;
} else {
tail.setNextRef(nd);
}
tail = nd;
}
}
public void addAfter(T element, T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
Node nd = new Node();
nd.setValue(element);
nd.setNextRef(tmp.getNextRef());
if(tmp == tail){
tail = nd;
}
tmp.setNextRef(nd);
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void deleteFront(){
if(head == null){
System.out.println(\"Underflow...\");
}
Node tmp = head;
head = tmp.getNextRef();
if(head == null){
tail = null;
}
System.out.println(\"Deleted: \"+tmp.getValue());
}
public void deleteAfter(T after){
Node tmp = head;
Node refNode = null;
System.out.println(\"Traversing to all nodes..\");
while(true){
if(tmp == null){
break;
}
if(tmp.compareTo(after) == 0){
refNode = tmp;
break;
}
tmp = tmp.getNextRef();
}
if(refNode != null){
tmp = refNode.getNextRef();
refNode.setNextRef(tmp.getNextRef());
if(refNode.getNextRef() == null){
tail = refNode;
}
System.out.println(\"Deleted: \"+tmp.getValue());
} else {
System.out.println(\"Unable to find the given element...\");
}
}
public void traverse(){
Node tmp = head;
while(true){
if(tmp == null){
break;
}
System.out.println(tmp.getValue());
tmp = tmp.getNextRef();
}
}
public static void main(String a[]){
SinglyLinkedListImpl sl = new SinglyLinkedListImpl();
sl.add(3);
sl.add(32);
sl.add(54);
sl.add(89);
sl.addAfter(76, 54);
sl.deleteFront();
sl.deleteAfter(76);
sl.traverse();
}
}
class Node implements Comparable {
private T value;
private Node nextRef;
public T getValue() {
return value;
}
public void setValue(T value) {
this.value = value;
}
public Node getNextRef() {
return nextRef;
}
public void setNextRef(Node ref) {
this.nextRef = ref;
}
public int compareTo(T arg) {
if(arg == this.value){
return 0;
} else {
return 1;
}
}
}
This program implement the concept of single linked list..
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please package dlist i.pdfABHISHEKREADYMADESKO Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program an.pdfmichardsonkhaicarr37 in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
C Homework Help
C Homework HelpProgramming Homework Help I am Andrew O. I am a C Homework Expert at programminghomeworkhelp.com. I hold a master’s in Programming from, the University of Southampton, UK. I have been helping students with their homework for the past 10 years. I solve homework related to C.
Visit programminghomeworkhelp.com or email [email protected].
You can also call on +1 678 648 4277 for any assistance with C Homework.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdfarrowmobile Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
fix the error - class Node{ int data- Node next-.pdf
fix the error - class Node{ int data- Node next-.pdfAKVIGFOEU fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
double linked list header file code#include iostream#include.pdf
double linked list header file code#include iostream#include.pdffacevenky This document contains C++ code for implementing a priority queue using a doubly linked skip list. It includes class definitions for a Node and SkipList that make up the skip list, and a PriorityQueue class that uses the skip list to store and retrieve elements based on priority. The main() function creates a PriorityQueue and SkipList, adds some sample elements, and calls the Process() method to iteratively remove and output elements by highest priority. However, the code is not fully implementing the Process() method and is not outputting the processed data as intended.
More from mail931892 (13)
I need help on this 5 and 6. here is the code so far import jav.pdf
I need help on this 5 and 6. here is the code so far import jav.pdfmail931892 I need help on this 5 and 6.
here is the code so far:
import javax.swing.*;
import java.awt.*;
import java.util.*;
/**
* !!! Put in description of your program here !!!
*
* @author !!! your name here !!!
*
*/
public class AngryBirds extends JPanel
{
/**
* Here are some variables you are likely to find useful. I have created
* this variables outside of any method, so that they are available to all
* the methods.
*
* (Typically instance variables like this should be labeled as "public" or
* "private" but I have omitted this designation since you are not familiar
* with the meanings of these terms yet.)
*
* Show care not to create local variables with the same names as these
* ones!
*/
double timeInterval;
double velocity;
double angle;
/**
* paint
*
* Draws the Angry Birds simulation on the graphics window
*
* @param g the Graphics object for the window
*/
public void paint(Graphics g)
{
super.paint(g); // do not edit
// Set background color
Color skyBlueDay = new Color(135, 206, 250);
setBackground(skyBlueDay);
// Draw horizon (ground)
g.setColor(new Color(34, 139, 34)); // Green color for the ground
g.fillRect(0, getHeight() - 50, getWidth(), 50);
// Draw structure (e.g., a wooden block)
g.setColor(new Color(139, 69, 19)); // Brown color for the structure
g.fillRect(200, getHeight() - 100, 80, 80);
// Draw pigs in the structure (green round pigs with happy faces)
g.setColor(Color.GREEN);
// Pig 1
g.fillOval(215, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(220, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(222, getHeight() - 85, 2, 2); // Left eye
g.fillOval(226, getHeight() - 85, 2, 2); // Right eye
// Pig 2
g.setColor(Color.GREEN);
g.fillOval(235, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(240, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(242, getHeight() - 85, 2, 2); // Left eye
g.fillOval(246, getHeight() - 85, 2, 2); // Right eye
// Pig 3
g.setColor(Color.GREEN);
g.fillOval(255, getHeight() - 85, 20, 20); // Head
g.setColor(Color.BLACK); // Pig's features
g.fillArc(260, getHeight() - 80, 6, 6, 180, 180); // Happy mouth
g.fillOval(262, getHeight() - 85, 2, 2); // Left eye
g.fillOval(266, getHeight() - 85, 2, 2); // Right eye
// Draw slingshot
g.setColor(new Color(139, 69, 19)); // Brown color for slingshot base
g.fillRect(50, getHeight() - 20, 20, 100); // Slingshot base
// Angry bird (Red bird)
g.setColor(new Color(255, 0, 0)); // Red color for the bird
g.fillOval(30, getHeight() - 50, 40, 40); // Body
g.setColor(Color.BLACK); // Bird's features
g.fillArc(40, getHeight() - 45, 10, 10, 0, -180); // Happy mouth
g.fillOval(35, getHeight() - 50, 8, 8); // Left eye
g.fillOval(45, getHeight() - 50, 8, 8); // Right eye
//put your code here
}//paint
/**
* init
*
* prompts user for information about the simulation
*/
public void init()
{
// prompt user for information
String time = ""; //used to store user input
do
{
time = JOpti.
I need a substantive comment on this postThe formal structure of .pdf
I need a substantive comment on this postThe formal structure of .pdfmail931892 I need a substantive comment on this post:
The formal structure of an organization is often shown in an organizational chart that displays
names, job titles, and lines of authority. At its core, a formal structure is meant to show how the
company operates at optimal health. My company utilizes an organizational chart (org chart) and
I am the one who updates it constantly. My company operates most closely under a functional
structure. A functional structure groups together people with similar skills who perform similar
tasks (Uhl-Bien, 2021). Our organizational structure starts with our founder and CEO, then
beneath him is the rest of the executive team. Each executive operates a different business unit
and has full teams below them as well. Depending on the business unit there are four to five
levels of employees from the top down. Our structure is a reflection of our goals, because each
business unit has goals that are specific to them, but that impact the overall organization. We also
have very distinct competencies within each business unit such as designers, project managers,
accountants, and account managers. They are all very specialized in what they do, and their role
is specific to their business unit..
I need help debugging some code. I am trying to read a text file and.pdf
I need help debugging some code. I am trying to read a text file and.pdfmail931892 I need help debugging some code. I am trying to read a text file and capture certain values from
said text file in order to initialize objects. The text file is of variaing size, and the line sizes are
not the same. All text files however follow a certain format. At some point there will be a header
[Territories] and underneath that will be information regarding these territories. The information
is presented as follows:
[Territories]
Cockpit01,658,355,Cockpit,Cockpit02,Territory33
Cockpit02,658,375,Cockpit,Cockpit01,Cockpit03,Territory33,Territory85
Cockpit03,658,395,Cockpit,Cockpit02,Territory85
Territory04,205,170,Left Cargo,Territory05,Territory10,Territory69,Territory11
Territory05,332,136,Left Cargo,Territory08,Territory06,Territory04
The lines are read as follows:
TerritoryName, pixel1, pixel2, continent, adjacent territories
There may be many or no adjacent territories, but the adjacent territories will continue after
continent until the end of the line. All values are delimited with ,. I am trying to capture the
values for TerritoryName, continent, and ALL adjacent territories, but my code is not working as
intended. This is what I have:
void Map::MapLoader(string filePath){
ifstream inputFile(filePath);
//if we cant find the file to open, return invalid
if(!inputFile){
cerr << "Invalid Input, failed to open file." << endl;
}
string line;
//this will be a map of territories
map territories;
while (getline(inputFile, line)) {
//skip all empty lines
if(line.empty()){
continue;
}
//if we find the territories tag, we begin to create territory objects and populate the vector
if(line.find("[Territories]") != string::npos){
while(getline(inputFile, line, ',') && !line.empty()){
istringstream iss(line);
string territoryName;
string continent;
int army;
string pixel1;
string pixel2;
//this is where I am having issues, must assign values using delimiter ','
iss >> territoryName >> pixel1 >> pixel2 >> continent;
//cout<<"territory name: " << territoryName <<" continent: "<< continent <<" pixel1:
"<< pixel1 <<" pixel 2: "<> adjacentTerritory){
currentTerritory.addAdjTerritories(adjacentTerritory);
}
territories[territoryName] = currentTerritory;
//adding the territory to our Map object
allTerritories = territories;
}
}
//if we do not find the [Territories] tag, we consider this file to be invalid
else{
// cerr << "Invalid map file. Please try again with a valid map file." << endl;
}
}
inputFile.close();
}
Any help with this would be greatly appreciated!.
I have these files in picture I wrote most the codes but I stuck wit.pdf
I have these files in picture I wrote most the codes but I stuck wit.pdfmail931892 I have these files in picture I wrote most the codes but I stuck with somethings.
Please, do not copy and paste from another solution becauce it is incomplete
1- I want the items in GlobalItems file display in the home page with divider between each one.
Homepage.
Note: you can edit on my code but dont create totally different code that does not relate totally
code bc it will be Un useful
if you can also:
Item file
Globalitem file
EdititemPage
mport 'item.dart'; lass Globalitems \{ static final GlobalItems _item = Globalitems._instance();
List < Item> item = Item(1, 'l', 'q'), Item(2,a ', 'd'), Item(3,J ', 'l'), Item(4,g ', 'w'), Item(5,c ', ' n '),
Item(6,l ', 's'), Item(7,q, ' dz '), Item(8,D ', 'Dn'), Item(9,Cr,CF '), Item(10,w,n '), ]; factory
Globalitems() \{ return_item; \} Globalitems._instance(); List < Item > items =[ ];
class Item \{ int Id; String name; String Description; Item(this.Id, this.name, this.Description); \}
Widget build(Buildcontext context) \{ return scaffold( appBar: AppBar ( backgroundColor:
Theme.of(context).colorscheme.inversePrimary, title: Text(widget.title), ), // AppBar body:
Center ( child: Column( mainAxisAlignment: MainAxisAlignment.start, children: Widget>[
Text "Item Information", style: Textstyle(fontsize: 30, fontweight: Fontweight.bold), , // Text
Text ( "Item ID: \$\{item.Id\}", style: TextStyle(fontSize: 20), ), // Text Text( "Item name:
\$\{item.name }, style: Textstyle(fontSize: 20), ), // Text Text( "Item Description: \$\{item.
Description\}", style: TextStyle(fontsize: 20), ), // Text ElevatedButton(
onPressed:_handleButtonPress, child: Text("Edit Items")) // ], // Widget >[] ), // Column
cuurentItem.Description = itemDescriptionController.text; Navigator.pop(context); override
idget build(BuildContext context) \{ return Container( child: Scaffold( appBar: AppBar(
backgroundColor: Theme.of(context).colorscheme.inversePrimary, title: Text("Edit Items \$
item.Id }"), ), // AppBar body: Center ( child: Column( mainAxisAlignment:
MainAxisAlignment.start, children: TextField( controller: itemNameController, decoration:
InputDecoration(labelText: "Name")), // TextFie TextField( controller:
itemDescriptionController, decoration: InputDecoration(labelText: "Description")), //
ElevatedButton( onPressed: updateitemPressed, child: Text("Update Item"), ) // ElevatedButton
]), // widget>[] // column ), // Center )); // Scaffold // Container
class EditItemPage extends statefulwidget \{ final Item item; const EditItemPage(\{Key? key,
required this.item }) : super(key: key); @override State createstate() EditItemPagestate(item); \}
class _EditItemPagestate extends State \{ EditItemPagestate(item); late Item item = widget.item;
TextEditingController itemNameController = new TextEditingController();
TextEditingController itemDescriptionController = new TextEditingController(); @override
void initstate() \{ super.initstate(); itemNameController.text = item.name;
itemDescriptioncontroller.text = item.Description; \} .
I am trying to create a dynamic web project in Eclipse IDE that impl.pdf
I am trying to create a dynamic web project in Eclipse IDE that impl.pdfmail931892 I am trying to create a dynamic web project in Eclipse IDE that implements a CRUD
functionality and connects to a Film database in MySQL using the MVC pattern.
I have a Film class with the following attributes: int id; string title; string director; string date;
string genres; string characters; string synopsis; and with to string method.
I have the following methods in FilmDAO class: public ArrayList getAllFilms(), public Film
getFilmByID(int id), public ArrayList getFilmByTitle(string title), public boolean
updateFilm(Film film), public Boolean deleteFilm(int id), public Boolean insertFilm (Film film).
How do I write code for the following Servlets: 1. DeleteFilmServlet(do Post method to delete
film from database), 2. HomeServlet (do get method - to get all films from database and pass to
JSP). 3. InsertFilmServlet (do get method present web page with html form for inserting films
and do post method to process submitted form and insert film to db). 4. UpdateFilmServlet (do
get method present web page with html form for updating films and do post method process
submitted form: retrieve parameters and updata film in db).
Thanks..
How do I fix it in LinkedList.javaLinkedList.java Define.pdf
How do I fix it in LinkedList.javaLinkedList.java Define.pdfmail931892 How do I fix it in LinkedList.java?
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
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 ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
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) {
}
/**** ACCESSORS ****/
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;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
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++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoSuchElementExcept.
How do I fix it in LinkedList.javathis is what i didLabProgra.pdf
How do I fix it in LinkedList.javathis is what i didLabProgra.pdfmail931892 The document provides instructions for implementing iterator methods in a LinkedList class. It describes updating the default constructor to initialize the iterator field to null, and modifying removeFirst() and removeLast() methods to handle cases where the iterator is at the first or last node. It then lists 8 steps to implement iterator methods like positionIterator(), offEnd(), getIterator(), advanceIterator(), reverseIterator(), addIterator(), and removeIterator(). The main() method creates a linked list and calls the iterator methods to test their functionality.
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdfmail931892 How do I fix it in LinkedList.java?
LabProgram.java
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
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 ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
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) {
}
/**** ACCESSORS ****/
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;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
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++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoS.
how can i build this as problem 2 of my code #include iostream.pdf
how can i build this as problem 2 of my code #include iostream.pdfmail931892 how can i build this as problem 2 of my code?
#include
#include
#include
#include
#include "./freeglut-3.4.0/include/GL/freeglut.h"
using namespace std;
bool leftDown = false, rightDown = false;
int lastPos[2];
float cameraPos[4] = { 0,1,4,1 };
int windowWidth = 640, windowHeight = 480;
double xRot = 0;
double yRot = 0;
int curProblem = 1; // TODO: change this number to try different examples
float specular[] = { 1.0, 1.0, 1.0, 1.0 };
float shininess[] = { 50.0 };
void problem1() {
// TODO
}
void problem2() {
//FIX HERE
}
void problem3() {
//TO DO
}
void problem4() {
//TO DO
}
void display()
{
glClearColor(0, 0, 0, 0);
glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
glDisable(GL_LIGHTING);
glEnable(GL_DEPTH_TEST);
glBegin(GL_LINES);
glColor3f(1, 0, 0); glVertex3f(0, 0, 0); glVertex3f(1, 0, 0); // x axis
glColor3f(0, 1, 0); glVertex3f(0, 0, 0); glVertex3f(0, 1, 0); // y axis
glColor3f(0, 0, 1); glVertex3f(0, 0, 0); glVertex3f(0, 0, 1); // z axis
glEnd(/*GL_LINES*/);
glEnable(GL_LIGHTING);
glShadeModel(GL_SMOOTH);
glMaterialfv(GL_FRONT, GL_SPECULAR, specular);
glMaterialfv(GL_FRONT, GL_SHININESS, shininess);
glEnable(GL_LIGHT0);
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
glViewport(0, 0, windowWidth, windowHeight);
float ratio = (float)windowWidth / (float)windowHeight;
gluPerspective(50, ratio, 1, 1000);
glMatrixMode(GL_MODELVIEW);
glLoadIdentity();
gluLookAt(cameraPos[0], cameraPos[1], cameraPos[2], 0, 0, 0, 0, 1, 0);
glLightfv(GL_LIGHT0, GL_POSITION, cameraPos);
glRotatef(xRot, 1, 0, 0);
glRotatef(yRot, 0, 1, 0);
if (curProblem == 1) problem1();
if (curProblem == 2) problem2();
if (curProblem == 3) problem3();
if (curProblem == 4) problem4();
glutSwapBuffers();
}
void mouse(int button, int state, int x, int y)
{
if (button == GLUT_LEFT_BUTTON) leftDown = (state == GLUT_DOWN);
else if (button == GLUT_RIGHT_BUTTON) rightDown = (state == GLUT_DOWN);
lastPos[0] = x;
lastPos[1] = y;
}
void mouseMoved(int x, int y)
{
if (leftDown) {
xRot += (y - lastPos[1]) * .1;
yRot += (x - lastPos[0]) * .1;
}
if (rightDown) {
for (int i = 0; i < 3; i++)
cameraPos[i] *= pow(1.1, (y - lastPos[1]) * .1);
}
lastPos[0] = x;
lastPos[1] = y;
glutPostRedisplay();
}
void keyboard(unsigned char key, int x, int y)
{
curProblem = key - '0';
if (key == 'q' || key == 'Q' || key == 27) {
exit(0);
}
glutPostRedisplay();
}
void reshape(int width, int height)
{
windowWidth = width;
windowHeight = height;
glutPostRedisplay();
}
int main(int argc, char** argv)
{
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB | GLUT_DEPTH);
glutInitWindowSize(windowWidth, windowHeight);
glutCreateWindow("HW2");
glutDisplayFunc(display);
glutMotionFunc(mouseMoved);
glutMouseFunc(mouse);
glutReshapeFunc(reshape);
glutKeyboardFunc(keyboard);
glutMainLoop();
return 0;
}.
Hi All!I have a question regrading creating a subgraph or rather v.pdf
Hi All!I have a question regrading creating a subgraph or rather v.pdfmail931892 Hi All!
I have a question regrading creating a subgraph or rather verifying that a connected or
unconnected graph has a connected or unconnected subgraph. I have a territory object, and each
of these objects have adjacent territories in the form of a string vector. Moreover, these territory
objects also have strin continent attached (every territory belongs to one and only one continent).
Is there a way in C++ to check to see if the contients for a connected subgraph? This is the code
I currently have running to check to see if that graph is connected, I wanted to know if there was
a way to check if the subgraphs are connected.
//walk function will traverse the map. This will be a recursive function to walk along the array
void Map::walk(int visit, bool visited[]){
visited[visit] = true;
for(int i = 0; i< vertCount; i++){
if(adjacencyMatrix[visit][i] == 1){
if(!visited[visit]){
walk(i, visited);
}
}
}
}
//verify if an edge is connected in a graph
bool Map::validate(){
bool connectedGraph=false;
bool connectedSubGraph=false;
bool notUniqueContinent = true;
bool* verifyArr = new bool[vertCount];
//the idea here is we will start at i=o, then traverse and check as we go along whether or not all
nodes are visble
for(int i=0; i.
HeadWallRam Inc. has expanded its reach globally and needs to re-lay.pdf
HeadWallRam Inc. has expanded its reach globally and needs to re-lay.pdfmail931892 HeadWallRam Inc. has expanded its reach globally and needs to re-layout it is IP architecture.
The executive team has hired you as a consultant to propose a greenfield network design.
Follow all the same guidlines, restrictions and provisions from Lab Report writing. Include the
following information:
Full IP documentation (not just an IP Grid).
Network Diagram from Draw.io
VyOS route configuration (i.e the "set protocols static" commands) that would be used to
impliment all route entries in all routers. ONLY include the route commands
ISP provides a single DHCP public IP address
Plan for ONE connection to the internet connected to the US site
Interior IP ranges that the company uses (172.18.128.0/17)
Plan a STAR topology for the network core between sites
Plan for networks needed for connections between sites
Plan for all pieces of equipment to be located at one of the Head-Wall-Ram sites (No routers in
space)
Think about WHY you were called in and plan for that too!
US site has five subdivisions: Sales (40 hosts), Technical (600 hosts), Support (300 hosts), Local
Management (150 hosts), Global Management (300 hosts)
China site has six subdivisions: Manufacturing (800 hosts), Sales (20 hosts), Technical (1200
hosts), Support (50 hosts), Legal (40 hosts), R&D (200 hosts)
Europe site has seven subdivisions: Manufacturing (80 hosts), Sales (20 hosts), Technical (400
hosts), Support (40 hosts), Legal (30 hosts), R&D (200 hosts), Management (10 hosts).
For this part you will need to analyze the provided logfile part2.lo.pdf
For this part you will need to analyze the provided logfile part2.lo.pdfmail931892 For this part you will need to analyze the provided logfile part2.log. This files contains log
entries from a Linux server over the course of a month. The log entries are structured as follows:
Month Day H:M:S Level Component[ProcessID]: Content
For example the following log entry follows this format. Here the component is sshd(pam_unix)
and the content shows an authentication failure from remote host 218.188.2.4. Jun 14 15:16:01
combo sshd(pam_unix)[19939]: authentication failure; rhost=218.188.2.4
To analyze this logfile, perform the following steps:
1. Open the log file such that only a single line at a time is loaded into memory. [1]
2. Parse the log file and record the fields highlighted above. [5]
3. Create a datetime object to record the date. [2]
4. Find and print the three most commonly used components. [3]
5. Briefly describe these components as a comment in your program/notebook. One or two
sentences for each is sufficient. [3]
6. Create a plot that shows then these three common components were used throughout the day.
Divide the day into 2 periods (working hours and after hours) and plot the number of entrys for
each component during those periods. Working hours are between 9 and 5. [5].
Ginny (45) is unmarried. Who of the following may be Ginnys quali.pdf
Ginny (45) is unmarried. Who of the following may be Ginnys quali.pdfmail931892 Ginny (45) is unmarried. Who of the following may be Ginny's qualifying child for Child Tax
Credit purposes? None of the individuals listed provided more than half of their own support.
A. Ben. Ben is the five-year-old son of Ginny's boyfriend, Adam. Adam, Ben, and Ginny all
lived in the same household all year. Adam is required to file a return, but is willing to let Ginny
claim Ben.
B. Susannah. Susannah is Ginny's 20-year-old daughter. She lived with Ginny all year while
attending Your State University as a full-time student.
C. Tania. Tania is Ginny's nine-year-old daughter from a prior relationship. Tania lived with her
father, Greg, in another state for most of the year, but she stayed with Ginny for two weeks
during summer vacation.
D. Alexander. Alexander is Ginny's 12-year-old half-brother. Alexander's parents passed away
several years ago and he lived with Ginny all year..
Ad
Recently uploaded (20)
Engage Donors Through Powerful Storytelling.pdf
Engage Donors Through Powerful Storytelling.pdfTechSoup In this webinars, members learn how to craft impactful messages that connect with donors to create donor engagement.
To study Digestive system of insect.pptx
To study Digestive system of insect.pptxArshad Shaikh Education is one thing no one can take away from you.”
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schools
K12 Tableau Tuesday - Algebra Equity and Access in Atlanta Public Schoolsdogden2 Algebra 1 is often described as a “gateway” class, a pivotal moment that can shape the rest of a student’s K–12 education. Early access is key: successfully completing Algebra 1 in middle school allows students to complete advanced math and science coursework in high school, which research shows lead to higher wages and lower rates of unemployment in adulthood.
Learn how The Atlanta Public Schools is using their data to create a more equitable enrollment in middle school Algebra classes.
Metamorphosis: Life's Transformative Journey
Metamorphosis: Life's Transformative JourneyArshad Shaikh *Metamorphosis* is a biological process where an animal undergoes a dramatic transformation from a juvenile or larval stage to a adult stage, often involving significant changes in form and structure. This process is commonly seen in insects, amphibians, and some other animals.
Political History of Pala dynasty Pala Rulers NEP.pptx
Political History of Pala dynasty Pala Rulers NEP.pptxArya Mahila P. G. College, Banaras Hindu University, Varanasi, India. The Pala kings were people-protectors. In fact, Gopal was elected to the throne only to end Matsya Nyaya. Bhagalpur Abhiledh states that Dharmapala imposed only fair taxes on the people. Rampala abolished the unjust taxes imposed by Bhima. The Pala rulers were lovers of learning. Vikramshila University was established by Dharmapala. He opened 50 other learning centers. A famous Buddhist scholar named Haribhadra was to be present in his court. Devpala appointed another Buddhist scholar named Veerdeva as the vice president of Nalanda Vihar. Among other scholars of this period, Sandhyakar Nandi, Chakrapani Dutta and Vajradatta are especially famous. Sandhyakar Nandi wrote the famous poem of this period 'Ramcharit'.
SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptx
SCI BIZ TECH QUIZ (OPEN) PRELIMS XTASY 2025.pptxRonisha Das SCI BIZ TECH QUIZ (OPEN) PRELIMS - XTASY 2025
How to Customize Your Financial Reports & Tax Reports With Odoo 17 Accounting
How to Customize Your Financial Reports & Tax Reports With Odoo 17 AccountingCeline George The Accounting module in Odoo 17 is a complete tool designed to manage all financial aspects of a business. Odoo offers a comprehensive set of tools for generating financial and tax reports, which are crucial for managing a company's finances and ensuring compliance with tax regulations.
apa-style-referencing-visual-guide-2025.pdf
apa-style-referencing-visual-guide-2025.pdfIshika Ghosh Title: A Quick and Illustrated Guide to APA Style Referencing (7th Edition)
This visual and beginner-friendly guide simplifies the APA referencing style (7th edition) for academic writing. Designed especially for commerce students and research beginners, it includes:
✅ Real examples from original research papers
✅ Color-coded diagrams for clarity
✅ Key rules for in-text citation and reference list formatting
✅ Free citation tools like Mendeley & Zotero explained
Whether you're writing a college assignment, dissertation, or academic article, this guide will help you cite your sources correctly, confidently, and consistent.
Created by: Prof. Ishika Ghosh,
Faculty.
📩 For queries or feedback: [email protected]
How to manage Multiple Warehouses for multiple floors in odoo point of sale
How to manage Multiple Warehouses for multiple floors in odoo point of saleCeline George The need for multiple warehouses and effective inventory management is crucial for companies aiming to optimize their operations, enhance customer satisfaction, and maintain a competitive edge.
Link your Lead Opportunities into Spreadsheet using odoo CRM
Link your Lead Opportunities into Spreadsheet using odoo CRMCeline George In Odoo 17 CRM, linking leads and opportunities to a spreadsheet can be done by exporting data or using Odoo’s built-in spreadsheet integration. To export, navigate to the CRM app, filter and select the relevant records, and then export the data in formats like CSV or XLSX, which can be opened in external spreadsheet tools such as Excel or Google Sheets.
"Basics of Heterocyclic Compounds and Their Naming Rules"
"Basics of Heterocyclic Compounds and Their Naming Rules"rupalinirmalbpharm This video is about heterocyclic compounds, which are chemical compounds with rings that include atoms like nitrogen, oxygen, or sulfur along with carbon. It covers:
Introduction – What heterocyclic compounds are.
Prefix for heteroatom – How to name the different non-carbon atoms in the ring.
Suffix for heterocyclic compounds – How to finish the name depending on the ring size and type.
Nomenclature rules – Simple rules for naming these compounds the right way.
Common rings – Examples of popular heterocyclic compounds used in real life.
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC) A measles outbreak originating in West Texas has been linked to confirmed cases in New Mexico, with additional cases reported in Oklahoma and Kansas. The current case count is 795 from Texas, New Mexico, Oklahoma, and Kansas. 95 individuals have required hospitalization, and 3 deaths, 2 children in Texas and one adult in New Mexico. These fatalities mark the first measles-related deaths in the United States since 2015 and the first pediatric measles death since 2003.
The YSPH Virtual Medical Operations Center Briefs (VMOC) were created as a service-learning project by faculty and graduate students at the Yale School of Public Health in response to the 2010 Haiti Earthquake. Each year, the VMOC Briefs are produced by students enrolled in Environmental Health Science Course 581 - Public Health Emergencies: Disaster Planning and Response. These briefs compile diverse information sources – including status reports, maps, news articles, and web content– into a single, easily digestible document that can be widely shared and used interactively. Key features of this report include:
- Comprehensive Overview: Provides situation updates, maps, relevant news, and web resources.
- Accessibility: Designed for easy reading, wide distribution, and interactive use.
- Collaboration: The “unlocked" format enables other responders to share, copy, and adapt seamlessly. The students learn by doing, quickly discovering how and where to find critical information and presenting it in an easily understood manner.
How to Manage Opening & Closing Controls in Odoo 17 POS
How to Manage Opening & Closing Controls in Odoo 17 POSCeline George In Odoo 17 Point of Sale, the opening and closing controls are key for cash management. At the start of a shift, cashiers log in and enter the starting cash amount, marking the beginning of financial tracking. Throughout the shift, every transaction is recorded, creating an audit trail.
CBSE - Grade 8 - Science - Chemistry - Metals and Non Metals - Worksheet
CBSE - Grade 8 - Science - Chemistry - Metals and Non Metals - WorksheetSritoma Majumder Introduction
All the materials around us are made up of elements. These elements can be broadly divided into two major groups:
Metals
Non-Metals
Each group has its own unique physical and chemical properties. Let's understand them one by one.
Physical Properties
1. Appearance
Metals: Shiny (lustrous). Example: gold, silver, copper.
Non-metals: Dull appearance (except iodine, which is shiny).
2. Hardness
Metals: Generally hard. Example: iron.
Non-metals: Usually soft (except diamond, a form of carbon, which is very hard).
3. State
Metals: Mostly solids at room temperature (except mercury, which is a liquid).
Non-metals: Can be solids, liquids, or gases. Example: oxygen (gas), bromine (liquid), sulphur (solid).
4. Malleability
Metals: Can be hammered into thin sheets (malleable).
Non-metals: Not malleable. They break when hammered (brittle).
5. Ductility
Metals: Can be drawn into wires (ductile).
Non-metals: Not ductile.
6. Conductivity
Metals: Good conductors of heat and electricity.
Non-metals: Poor conductors (except graphite, which is a good conductor).
7. Sonorous Nature
Metals: Produce a ringing sound when struck.
Non-metals: Do not produce sound.
Chemical Properties
1. Reaction with Oxygen
Metals react with oxygen to form metal oxides.
These metal oxides are usually basic.
Non-metals react with oxygen to form non-metallic oxides.
These oxides are usually acidic.
2. Reaction with Water
Metals:
Some react vigorously (e.g., sodium).
Some react slowly (e.g., iron).
Some do not react at all (e.g., gold, silver).
Non-metals: Generally do not react with water.
3. Reaction with Acids
Metals react with acids to produce salt and hydrogen gas.
Non-metals: Do not react with acids.
4. Reaction with Bases
Some non-metals react with bases to form salts, but this is rare.
Metals generally do not react with bases directly (except amphoteric metals like aluminum and zinc).
Displacement Reaction
More reactive metals can displace less reactive metals from their salt solutions.
Uses of Metals
Iron: Making machines, tools, and buildings.
Aluminum: Used in aircraft, utensils.
Copper: Electrical wires.
Gold and Silver: Jewelry.
Zinc: Coating iron to prevent rusting (galvanization).
Uses of Non-Metals
Oxygen: Breathing.
Nitrogen: Fertilizers.
Chlorine: Water purification.
Carbon: Fuel (coal), steel-making (coke).
Iodine: Medicines.
Alloys
An alloy is a mixture of metals or a metal with a non-metal.
Alloys have improved properties like strength, resistance to rusting.
Kenan Fellows Participants, Projects 2025-26 Cohort
Kenan Fellows Participants, Projects 2025-26 CohortEducationNC These are the educators participating in the Kenan Fellows Program for Teacher Leadership at NC State University.
APM Midlands Region April 2025 Sacha Hind Circulated.pdf
APM Midlands Region April 2025 Sacha Hind Circulated.pdfAssociation for Project Management APM event hosted by the Midlands Network on 30 April 2025.
Speaker: Sacha Hind, Senior Programme Manager, Network Rail
With fierce competition in today’s job market, candidates need a lot more than a good CV and interview skills to stand out from the crowd.
Based on her own experience of progressing to a senior project role and leading a team of 35 project professionals, Sacha shared not just how to land that dream role, but how to be successful in it and most importantly, how to enjoy it!
Sacha included her top tips for aspiring leaders – the things you really need to know but people rarely tell you!
We also celebrated our Midlands Regional Network Awards 2025, and presenting the award for Midlands Student of the Year 2025.
This session provided the opportunity for personal reflection on areas attendees are currently focussing on in order to be successful versus what really makes a difference.
Sacha answered some common questions about what it takes to thrive at a senior level in a fast-paced project environment: Do I need a degree? How do I balance work with family and life outside of work? How do I get leadership experience before I become a line manager?
The session was full of practical takeaways and the audience also had the opportunity to get their questions answered on the evening with a live Q&A session.
Attendees hopefully came away feeling more confident, motivated and empowered to progress their careers
One Hot encoding a revolution in Machine learning
One Hot encoding a revolution in Machine learningmomer9505 A brief introduction to ONE HOT encoding a way to communicate with machines
Political History of Pala dynasty Pala Rulers NEP.pptx
Political History of Pala dynasty Pala Rulers NEP.pptxArya Mahila P. G. College, Banaras Hindu University, Varanasi, India.
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptx
YSPH VMOC Special Report - Measles Outbreak Southwest US 4-30-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)
Ad
Help I keep getting the same error when running a code. Below is the.pdf
- 1. Help I keep getting the same error when running a code. Below is the code and the instructions about the code. import java.util.Arrays; public class Album implements Comparable { private final int id; private final String[] artists; private final int numSongs; public Album(int id, String title, String[] artists, int numSongs) { this.id = id; this.artists = new String[]{Arrays.toString(artists)}; this.numSongs = numSongs; } public int getId() { return id; } @Override public int compareTo(Album other) { return Integer.compare(this.numSongs, other.numSongs); } @Override public String toString() { StringBuilder artistNames = new StringBuilder(); for (String artist : artists) { artistNames.append(artist).append(", "); } artistNames.delete(artistNames.length() - 2, artistNames.length()); return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]"; } } import java.util.Random;
- 2. public class DoublyLinkedList { private static class Node { T data; Node prev; Node next; Node(T data) { this.data = data; } } private Node head; private Node tail; private int size; public DoublyLinkedList() { head = null; tail = null; size = 0; } public Node append(T data) { Node newNode = new Node<>(data); if (head == null) { head = newNode; } else { tail.next = newNode; newNode.prev = tail; } tail = newNode; size++; return newNode; } public Node insert(int location, T data) {
- 3. if (location < 0 || location > size) { throw new IllegalArgumentException("Invalid location"); } Node newNode = new Node<>(data); if (location == 0) { newNode.next = head; if (head != null) { head.prev = newNode; } head = newNode; if (tail == null) { tail = newNode; } } else if (location == size) { tail.next = newNode; newNode.prev = tail; tail = newNode; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } newNode.prev = current.prev; newNode.next = current; current.prev.next = newNode; current.prev = newNode; } size++; return newNode; } public Node delete(int location) { if (location < 0 || location >= size) { throw new IllegalArgumentException("Invalid location");
- 4. } Node deletedNode; if (location == 0) { deletedNode = head; head = head.next; if (head != null) { head.prev = null; } else { tail = null; } } else if (location == size - 1) { deletedNode = tail; tail = tail.prev; tail.next = null; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } deletedNode = current; current.prev.next = current.next; current.next.prev = current.prev; } size--; return deletedNode; } public int getIndex(T data) { Node current = head; for (int i = 0; i < size; i++) { if (current.data.equals(data)) { return i; } current = current.next;
- 5. } return -1; } @Override public String toString() { StringBuilder result = new StringBuilder(); Node current = head; while (current != null) { result.append(current.data).append(" -> "); current = current.next; } result.append("NULL"); return result.toString(); } public Node shuffle() { Random rand = new Random(); for (int i = size - 1; i > 0; i--) { int j = rand.nextInt(i + 1); swapNodes(i, j); } return head; } private void swapNodes(int i, int j) { if (i == j) { return; } Node node1 = getNodeAtIndex(i); Node node2 = getNodeAtIndex(j); Node tempPrev1 = node1.prev; Node tempNext1 = node1.next;
- 6. if (node1.next == node2) { // Nodes are adjacent node1.next = node2.next; node2.prev = node1.prev; node2.next = node1; node1.prev = node2; if (tempPrev1 != null) { tempPrev1.next = node2; } if (node1.next != null) { node1.next.prev = node1; } } else if (node2.next == node1) { // Nodes are adjacent, but in reverse order node2.next = node1.next; node1.prev = node2.prev; node1.next = node2; node2.prev = node1; if (tempPrev1 != null) { tempPrev1.next = node2; } if (node2.next != null) { node2.next.prev = node2; } } else { // Nodes are not adjacent node1.next = node2.next; node2.prev = tempPrev1; node2.next = tempNext1; if (tempPrev1 != null) { tempPrev1.next = node2; } if (tempNext1 != null) { tempNext1.prev = node1; } if (node1.next != null) {
- 7. node1.next.prev = node1; } if (node2.next != null) { node2.next.prev = node2; } } if (i == 0) { head = node2; } else if (j == 0) { head = node1; } if (i == size - 1) { tail = node2; } else if (j == size - 1) { tail = node1; } } public DoublyLinkedList partition(T data) { DoublyLinkedList newList = new DoublyLinkedList<>(); Node current = head; while (current != null) { if (((Comparable) current.data).compareTo(data) >= 0) { newList.append(current.data); delete(getIndex(current.data)); } else { current = current.next; } } return newList; } private Node getNodeAtIndex(int index) {
- 8. if (index < 0 || index >= size) { throw new IllegalArgumentException("Invalid index"); } Node current = head; for (int i = 0; i < index; i++) { current = current.next; } return current; } } { public static void main(String[] args) { // Create an empty DLL DoublyLinkedList dll = new DoublyLinkedList<>(); // Create albums Album album1 = new Album(1, "Album 1", new String[]{"Artist A", "Artist B"}, 10); Album album2 = new Album(2, "Album 2", new String[]{"Artist C"}, 15); // Append albums to DLL dll.append(album1); dll.append(album2); // Test append() Album album5 = new Album(5, "Album 5", new String[]{"Artist G"}, 7); dll.append(album5); System.out.println("DLL after append: " + dll); // Test toString() System.out.println("DLL: " + dll); // Test insert() Album album4 = new Album(4, "Album 4", new String[]{"Artist F"}, 12); dll.insert(1, album4); System.out.println("DLL after insert: " + dll); // Test delete() dll.delete(2);
- 9. System.out.println("DLL after delete: " + dll); // Test getIndex() System.out.println("Index of album2: " + dll.getIndex(album2)); // Test shuffle() dll.shuffle(); System.out.println("Shuffled DLL: " + dll); // Test partition() DoublyLinkedList newList = dll.partition(album1); System.out.println("New List after partition: " + newList); System.out.println("Original DLL after partition: " + dll); } }c: Users Fleegyboy .jdksopenjdk-20.0.1binjava.exe ... DLL after append: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5 -- 7 songs -- [[Artist G]] -> NULL DLL: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5 -- 7 songs -- [[Artist G]] -> NULL after insert: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 4 -- 12 songs -- [[Artist F]] -> ID: 2 -- 15 songs -- [[Artist C]] -> ID: 5 -- 7 after delete: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 4 -- 12 songs -- [[Artist F]] -> ID: 5 -- 7 songs -- [[Artist G]] -> NULL Index of album2: -1 Shuffled DLL: ID: 1 -- 10 songs -- [[Artist A, Artist B]] -> ID: 4 - - 12 songs -- [[Artist F]] -> ID: 5 -- 7 songs -- [[Artist G]] -> NULL Exception in thread "main" java.lang.IlleqalArqumentException Create breakpoint: Invalid location at DoublyLinkedList.delete (DoublyLinkedList.java:73) at DoublyLinkedList.partition (DoublyLinkedList. java:208) at DoublyLinkedListTest.main (DoublyLinkedListTest. java:37) Process finished with exit code 1