#includeiostream#includecstdio#includecstdlib Node .pdf
โข
0 likesโข3 views
#include #include #include /* * Node Declaration */ using namespace std; struct node { int info; struct node *next; struct node *prev; }*start; /* Class Declaration */ class double_llist { public: void create_list(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_dlist(); void count(); void reverse(); double_llist() { start = NULL; } }; /* * Main: Conatins Menu */ int main() { int choice, element, position; double_llist dl; while (1) { cout<>choice; switch ( choice ) { case 1: cout<<\"Enter the element: \"; cin>>element; dl.create_list(element); cout<>element; dl.add_begin(element); cout<>element; cout<<\"Insert Element after postion: \"; cin>>position; dl.add_after(element, position); cout<>element; dl.delete_element(element); cout<info = value; temp->next = NULL; if (start == NULL) { temp->prev = NULL; start = temp; } else { s = start; while (s->next != NULL) s = s->next; s->next = temp; temp->prev = s; } } /* * Insertion at the beginning */ void double_llist::add_begin(int value) { if (start == NULL) { cout<<\"First Create the list.\"<prev = NULL; temp->info = value; temp->next = start; start->prev = temp; start = temp; cout<<\"Element Inserted\"<next; if (q == NULL) { cout<<\"There are less than \"; cout<info = value; if (q->next == NULL) { q->next = tmp; tmp->next = NULL; tmp->prev = q; } else { tmp->next = q->next; tmp->next->prev = tmp; q->next = tmp; tmp->prev = q; } cout<<\"Element Inserted\"<info == value) { tmp = start; start = start->next; start->prev = NULL; cout<<\"Element Deleted\"<next->next != NULL) { /*Element deleted in between*/ if (q->next->info == value) { tmp = q->next; q->next = tmp->next; tmp->next->prev = q; cout<<\"Element Deleted\"<next; } /*last element deleted*/ if (q->next->info == value) { tmp = q->next; free(tmp); q->next = NULL; cout<<\"Element Deleted\"<info<<\" <-> \"; q = q->next; } cout<<\"NULL\"<next; cnt++; } cout<<\"Number of elements are: \"<next; p1->next = NULL; p1->prev = p2; while (p2 != NULL) { p2->prev = p2->next; p2->next = p1; p1 = p2; p2 = p2->prev; } start = p1; cout<<\"List Reversed\"< Solution #include #include #include /* * Node Declaration */ using namespace std; struct node { int info; struct node *next; struct node *prev; }*start; /* Class Declaration */ class double_llist { public: void create_list(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_dlist(); void count(); void reverse(); double_llist() { start = NULL; } }; /* * Main: Conatins Menu */ int main() { int choice, element, position; double_llist dl; while (1) { cout<>choice; switch ( choice ) { case 1: cout<<\"Enter the element: \"; cin>>element; dl.create_list(element); cout<>element; dl.add_begin(element); cout<>element; cout<<\"Insert Element after postion: \"; cin>>position; dl.add_after(element, position); cout.
Report
Share
Report
Share
Download to read offline
Recommended
C++ Program to Implement Doubly Linked List #includei.pdf
This C++ program implements a doubly linked list with the following functions:
- create() adds a node to the empty list
- append() adds a node to the end of the list
- insert() inserts a node at a given index position
- del() deletes a node with a given value
- display() prints out the contents of the list
It uses a node struct to define each list element and a DLL class to implement the linked list functions.
#includeiostream#includecstdio#includecstdlibusing names.pdf
This document defines a C++ class for a circular linked list. The class contains methods for creating nodes, adding elements to the beginning of the list, deleting elements, and displaying the list. A node struct is also defined containing an info field and a next pointer.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
#includeiostream #includecstdio #includecstdlib using na.pdf
#include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
The document provides code for implementing a linked list data structure in C++. It includes class definitions for a ListInterface, Node, and LinkedList class. The Node class represents individual nodes in the linked list. The LinkedList class implements the linked list and inherits from ListInterface. It uses Node objects to store and connect list elements. Helper functions and exceptions are also defined to support linked list operations like insertion, removal and accessing elements.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
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.
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked list code linkedList.c, complete
an implementation of the Table ADT. Make sure that you apply the concepts of design by
contract (DbC) to your implementation.
Once you have fully implemented the table, create a main.c file that implements a testing
framework for your table.
Your table implementation must ensure that values inserted are unique, and internally sorted
within a linked list.
table.h
linkedList.c
Solution
khsdg
#include
#include
typedef enum BOOL { false, true } bool;
// Linked list node definition
typedef struct Node node;
struct Node
{
int number;
node *next;
};
static node *top = NULL;
// used to track where we are for the list traversal methods
static node *traverseNode = NULL;
// \"destroy\" will deallocate all nodes in a linked list object
// and will set \"top\" to NULL.
void destroy()
{
node *curr = top;
node *temp = NULL;
while ( curr != NULL )
{
// flip order to see it blow up...
temp = curr;
curr = curr->next;
free( temp );
}
top = NULL;
}
// \"build\" will create an ordered linked list consisting
// of the first \"size\" even integers.
void build( int size )
{
node *newNode = NULL;
int i = 0;
// make sure we don\'t have a list yet
destroy();
for ( i=size ; i>0 ; i-- )
{
newNode = malloc( sizeof( node ) );
newNode->number = i*2;
newNode->next = top;
top = newNode;
}
}
// starts a list traversal by getting the data at top.
// returns false if top == NULL.
bool firstNode( int *item )
{
bool result = false;
if ( top )
{
*item = top->number;
traverseNode = top->next;
result = true;
}
return result;
}
// gets the data at the current traversal node and increments the traversal.
// returns false if we\'re at the end of the list.
bool nextNode( int *item )
{
bool result = false;
if ( traverseNode )
{
*item = traverseNode->number;
traverseNode = traverseNode->next;
result = true;
}
return result;
}
// \"print\" will output an object\'s entire linked list
// to the standard output device -- one \"number\" per line.
void print()
{
int value;
if ( firstNode( &value ) )
{
do
{
printf( \"%d\ \", value );
} while ( nextNode( &value ) );
}
}
int main( int argc, char *argv[] )
{
build( 10 );
print();
destroy();
build( 5 );
build( 20 );
print();
destroy();
return 0;
}.
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 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 .
Recommended
C++ Program to Implement Doubly Linked List #includei.pdf
This C++ program implements a doubly linked list with the following functions:
- create() adds a node to the empty list
- append() adds a node to the end of the list
- insert() inserts a node at a given index position
- del() deletes a node with a given value
- display() prints out the contents of the list
It uses a node struct to define each list element and a DLL class to implement the linked list functions.
#includeiostream#includecstdio#includecstdlibusing names.pdf
This document defines a C++ class for a circular linked list. The class contains methods for creating nodes, adding elements to the beginning of the list, deleting elements, and displaying the list. A node struct is also defined containing an info field and a next pointer.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
#includeiostream #includecstdio #includecstdlib using na.pdf
#include
#include
#include
using namespace std;
struct node
{
int val;
struct node *next;
}*startNode;
// declaring class
class LinkedList
{
public:
node* create_node(int);
void insert_last();
void sort();
void search();
void reverse();
void display();
LinkedList()
{
startNode = NULL;
}
};
// main
main()
{
int userChoice, linkedListNodes, i;
LinkedList LinkList;
startNode = NULL;
while (1)
{
// displaying menu
cout<<\" 1)Insert\";
cout<<\"2) Remove\";
cout<<\"3) Search\";
cout<<\"4) Display\";
cout<<\"5) Reverse\";
cout<<\"6) Exit \";
// reading user choice
cout<<\"Enter your userChoice : \";
cin>>userChoice;
switch(userChoice)
{
case 1:
cout<<\"Inserting node to linked list: \";
LinkList.insert_begin();
cout;
break;
case 2:
cout<<\"Delete element from linked list: \";
LinkList.delete();
break;
case 3:
cout<<\"Searching data in linked list: \";
LinkList.search();
cout;
break;
case 4:
cout<<\"Displaying linked list data: \";
LinkList.display();
cout;
break;
case 5:
cout<<\"Linked list reversing: \";
LinkList.reverse();
cout;
break;
case 6:
cout<<\"Exiting...\";
exit(1);
break;
default:
cout<<\"Enter correct userChoice\";
}
}
}
// node creating to store into list
node *LinkedList::create_node(int val)
{
struct node *tempNode, *tempNode;
tempNode = new(struct node);
if (tempNode == NULL)
{
cout<<\"No memory allocated \";
return 0;
}
else
{
tempNode->val = val;
tempNode->next = NULL;
return tempNode;
}
}
/*
* Inserting Node at last
*/
void LinkedList::insert_last()
{
int val;
cout<<\"Enter the val to be inserted: \";
cin>>val;
struct node *tempNode, *tempNode;
tempNode = create_node(val);
tempNode = startNode;
while (tempNode->next != NULL)
{
tempNode = tempNode->next;
}
tempNode->next = NULL;
tempNode->next = tempNode;
cout<<\"Element Inserted\";
}
// deleting element
void LinkedList::delete()
{
int position, i, count = 0;
if (startNode == NULL)
{
cout<<\"Linkedlist empty\"<>position;
struct node *tempNode, *ptr;
tempNode = startNode;
if (position == 1)
{
startNode = tempNode->next;
}
else
{
while (tempNode != NULL)
{
tempNode = tempNode->next;
count++;
}
if (position > 0 && position <= count)
{
tempNode = startNode;
for (i = 1;i < position;i++)
{
ptr = tempNode;
tempNode = tempNode->next;
}
ptr->next = tempNode->next;
}
else
{
cout<<\"Enter correct position\";
}
}
}
// search data in linked list
void LinkedList::search()
{
int val, position = 0;
bool flagValue = false;
if (startNode == NULL)
{
cout<<\"List is empty\";
return;
}
cout<<\"Enter the val to search: \";
cin>>val;
struct node *tempNode;
tempNode = startNode;
while (tempNode != NULL)
{
position++;
if (tempNode->val == val)
{
flagValue = true;
cout<<\"Data \"<next;
}
if (!flagValue)
cout<<\"data not found\";
}
// linkedlist reverese
void LinkedList::reverse()
{
struct node *pointer1, *pointer2, *pointer3;
if (startNode == NULL)
{
cout<<\"List is empty\"<next == NULL)
{
return;
}
pointer1 = startNode;
pointer2 = pointer1->next;
pointer3 = pointer2->next;
pointer1->next = NULL;
pointer2->.
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
The document provides code for implementing a linked list data structure in C++. It includes class definitions for a ListInterface, Node, and LinkedList class. The Node class represents individual nodes in the linked list. The LinkedList class implements the linked list and inherits from ListInterface. It uses Node objects to store and connect list elements. Helper functions and exceptions are also defined to support linked list operations like insertion, removal and accessing elements.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
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.
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked list code linkedList.c, complete
an implementation of the Table ADT. Make sure that you apply the concepts of design by
contract (DbC) to your implementation.
Once you have fully implemented the table, create a main.c file that implements a testing
framework for your table.
Your table implementation must ensure that values inserted are unique, and internally sorted
within a linked list.
table.h
linkedList.c
Solution
khsdg
#include
#include
typedef enum BOOL { false, true } bool;
// Linked list node definition
typedef struct Node node;
struct Node
{
int number;
node *next;
};
static node *top = NULL;
// used to track where we are for the list traversal methods
static node *traverseNode = NULL;
// \"destroy\" will deallocate all nodes in a linked list object
// and will set \"top\" to NULL.
void destroy()
{
node *curr = top;
node *temp = NULL;
while ( curr != NULL )
{
// flip order to see it blow up...
temp = curr;
curr = curr->next;
free( temp );
}
top = NULL;
}
// \"build\" will create an ordered linked list consisting
// of the first \"size\" even integers.
void build( int size )
{
node *newNode = NULL;
int i = 0;
// make sure we don\'t have a list yet
destroy();
for ( i=size ; i>0 ; i-- )
{
newNode = malloc( sizeof( node ) );
newNode->number = i*2;
newNode->next = top;
top = newNode;
}
}
// starts a list traversal by getting the data at top.
// returns false if top == NULL.
bool firstNode( int *item )
{
bool result = false;
if ( top )
{
*item = top->number;
traverseNode = top->next;
result = true;
}
return result;
}
// gets the data at the current traversal node and increments the traversal.
// returns false if we\'re at the end of the list.
bool nextNode( int *item )
{
bool result = false;
if ( traverseNode )
{
*item = traverseNode->number;
traverseNode = traverseNode->next;
result = true;
}
return result;
}
// \"print\" will output an object\'s entire linked list
// to the standard output device -- one \"number\" per line.
void print()
{
int value;
if ( firstNode( &value ) )
{
do
{
printf( \"%d\ \", value );
} while ( nextNode( &value ) );
}
}
int main( int argc, char *argv[] )
{
build( 10 );
print();
destroy();
build( 5 );
build( 20 );
print();
destroy();
return 0;
}.
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 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 .
#include iostream #includeData.h #includePerson.h#in.pdf
#include
#include\"Data.h\"
#include\"Person.h\"
#include\"Report.h\"
#include
#include
#include \"Menu.h\"
using namespace std;
/*
Programmers: Javier A. Molina, Eduardo Bonnet
Students #:79249
*/
int main()
{
int cnt;
int idx;
string fileName;
Report * telefonia;
Menu menu(\"Reports\");
bool fileNameExists(string fileName);
Report * addReport(Report * reports, int & totalReports);
Report * delReport(Report * reports, int & totalReports, int idx);
int displayReports(Report * reports, int totalReports);
menu.addItem(\"New report\");
menu.addItem(\"Delete a report\");
menu.addItem(\"Display a report\");
cnt = 0;
telefonia = NULL;
do {
cout << menu;
cin >> menu;
//cls();
switch (menu.getOption()) {
case 1:
cout << \"Enter report name (TE?????): \";
cin >> fileName;
if (fileNameExists(fileName + \".tel\")) {
telefonia = addReport(telefonia, cnt);
idx = cnt - 1;
telefonia[idx].setFileName(fileName);
// telefonia[idx].loadReport();
}
else {
cls();
cerr << \"Error: Report name \'\" << fileName << \"\' does not exists!\ \ \ \";
//pause();
}
break;
case 2:
if (telefonia != NULL) {
do {
cls();
cout << \"Delete a Report:\ \ \";
idx = displayReports(telefonia, cnt);
if (between(idx, 0, cnt - 1)) {
cls();
telefonia = delReport(telefonia, cnt, idx);
idx = 0;
// pause();
}
} while (idx != cnt);
}
else {
cerr << \"No reports available for deleting!\ \ \ \";
//pause();
}
break;
case 3:
char ans;
if (telefonia != NULL) {
do {
// cls();
cout << \"Display/Filed a Report:\ \ \";
idx = displayReports(telefonia, cnt);
if (between(idx, 0, cnt - 1)) {
// cls();
cout << \"Would you like the report to be display otherwise save into a file? \";
cin >> ans;
cls();
cin.ignore();
if (upper(ans) == \'Y\') {
cout << telefonia[idx] << endl;
}
else {
//telefonia[idx].saveReport();
cout << \"Report \'\" << telefonia[idx].getFileName() << \"\' saved as \'\" <<
telefonia[idx].getFileName() << \".rep\'.\ \ \";
}
//pause();
}
} while (idx != cnt);
}
else {
cerr << \"No reports available for displaying!\ \ \ \";
// pause();
}
break;
case 4:
cout << \"Thanks for using Telefonia Reports System!!!\ \ \ \";
break;
}
} while (menu.getLast() != menu.getOption());
delete[] telefonia;
return 0;
}
//Funcion que verifica si existe un archivo en disco
bool fileNameExists(string fileName) {
ifstream fin(fileName.c_str());
bool exists = !(fin.fail());
if (exists) fin.close();
return(exists);
}
//Anade dinamicamente objetos tipo Report al arreglo reports
Report * addReport(Report * reports, int & totalReports) {
if (totalReports == 0) {
reports = new Report[1];
}
else {
Report * tmp = new Report[totalReports];
for (int i = 0; i < totalReports; ++i) {
tmp[i] = reports[i];
}
delete[] reports;
reports = new Report[totalReports + 1];
for (int i = 0; i < totalReports; ++i) {
reports[i] = tmp[i];
}
delete[] tmp;
}
totalReports++;
return(reports);
}
//Borra objetos del arreglo reports segun el idx enviado
Report * delReport(Report * reports, int & totalReports, int idx) {
Report * tmp = new Report[tota.
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and doubly linked list. Use
inheritance to define singly linked list and doubly linked list. Add Node() Delete Node() Update
Node() Delete All() Size()
Solution
#include
using namespace std;
class List;
class Node
{
friend class List;
protected:
int Data;
Node *Link;
};
class List:public Node
{
friend class Node;
private:
Node *Start;
public:
List()
{
Start=NULL;
}
Node Insert(int x);
Node Delete(int &x);
void Display();
};
Node List::Insert(int x)
{
Node *New=new Node;
New->Data=x;
New->Link=Start;
Start=New;
return *this;
}
Node List::Delete(int &x)//deletes first node
{
Node *Del=Start;
Start=Start->Link;
delete Del;
return *this;
}
void List::Display()
{
Node *P=Start;
while(P!=NULL)
{
cout<Data<<\" \";
P=P->Link;
}
}
int main()
{
List L;
L.Insert(4);
L.Insert(64);
L.Insert(3);
L.Insert(90);
L.Insert(66);
L.Insert(13);
L.Display();
}
Double Linked List.
Ds 2 cycle
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.
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identities
Solution
import java.util.Scanner;
/* category Node */
class Node
creator */
public Node()
/* builder */
public Node(int d,Node n)
/* perform to line link to next Node */
public void setLink(Node n)
/* perform to line knowledge to current Node */
public void setData(int d)
/* perform to urge link to next node */
public Node getLink()
come back link;
}
/* perform to urge knowledge from current Node */
public int getData()
come back data;
}
}
/* category linkedList */
class linkedList
begin ;
protected Node finish ;
public int size ;
/* builder */
public linkedList()
begin = null;
finish = null;
size = 0;
}
/* perform to envision if list is empty */
public mathematician isEmpty()
come back begin == null;
}
/* perform to urge size of the list */
public int getSize()
come back size;
}
/* perform to insert part at the begining */
public void insertAtStart(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
begin = nptr;
}
size++ ;
}
/* perform to insert part at finish */
public void insertAtEnd(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
finish = nptr;
}
size++ ;
}
/* perform to insert part at position */
public void insertAtPos(int val , int pos)
one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size++ ;
}
/* perform to delete part at position */
public void deleteAtPos(int pos)
one && pos == 1)
begin = null;
finish = null;
size = 0;
return ;
}
if (pos == 1)
begin = begin.getLink();
end.setLink(start);
size--;
return ;
}
if (pos == size)
whereas (s != end)
end = t;
end.setLink(start);
size --;
return;
}
Node ptr = start;
pos = pos - one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size-- ;
}
/* perform to show contents */
public void display()
making object of linkedList */
linkedList list = new linkedList();
System.out.println(\"Circular individually coupled List Test\ \");
char ch;
/* Perform list operations */
do
{
System.out.println(\"\ Circular individually coupled List Operations\ \");
System.out.println(\"1. insert at begining\");
System.out.println(\"2. insert at end\");
System.out.println(\"3. insert at position\");
System.out.println(\"4. delete at position\");
System.out.println(\"5. check empty\");
System.out.println(\"6. get size\");
int selection = scan.nextInt();
switch (choice).
mainpublic class AssignmentThree { ย ย public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
Consider L = {a^nb^2nc^P p 0}. Prove L is not a context-free langu.pdf
Capital and Revenue Expenditures On February 13, Scanlon Co. paid $3,400 to repair the
transmission on one of its delivery vans.
In addition, Scanlon paid $20 to install a GPS system in its van.
Journalize the entries for the transmission. February 13? It should be two answers, Cr/Dr
Journalize the entry for GPS system expenditures. February 13? It should be two answers, Cr/Dr
Solution
Account Debit Credit Accumulated Depreciation- Delivery Van $3400 Cash $3400 To
record the repair of transmission on delivery vans.(Revenue Expenditure Delivery Van $20
Cash $20 (To record capital expenditure on Van (installing GPS).
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please include all header files and
main file with their own title.
Extend the class linkedListType by adding the following operations:
Write a function that returns the info of the kth element of the linked list. If no such element
exists, terminate the program.
Write a function that deletes the kth element of the linked list. If no such element exists,
terminate the program.
Provide the definitions of these functions in the class linkedListType. Also, write a program to
test these functions. (Use either the class unorderedLinkedList or the
class orderedLinkedList to test your function.)
Solution
C++ Code for the given problem is below.....
.....................................................
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
//using namespace std;
/*
* Node Declaration
*/
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
/*
* Class Declaration
*/
class linkedListType
{
public:
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
int item,ch,kth;
node *ptr,*head,*temp;
};
/*
* Main :contains menu
*/
void main()
{
int item,ch,kth;
node *ptr,*head,*temp;
linkedListType s1;
clrscr();
while (1)
{
while(1)
{
cout<<\"PRESS (1) FOR INSERT INTO LIST\"<>ch;
switch(ch)
{
case 1:
cout<<\"ENTER THE VALUE \"<>item;
s1.insfrombeg(&head,item);
break;
case 2:
s1.traverse(head);
break;
case 3:
cout<<\"ENTER THE Kth Element which you want\'s to delete\"<>kth;
s1.delfromkth(&head,kth);
break;
case 4:
cout<<\"ENTER THE Kth Element which you want\'s to search \ \"<>kth;
s1.findthekthnode(head,kth);
break;
case 5:
exit(1);
}
}
// getch();
}
}
/*
* Inserting element in beginning
*/
void linkedListType::insfrombeg(node **head,int item)
{
temp= ( node * ) malloc (sizeof( node ));
temp->info= item;
temp->next= NULL;
if(*head == NULL)
{
temp->next= *head;
*head= temp;
}
else
{
temp->next= *head;
*head= temp;
}
}
/*
* Delete element at a given position
*/
void linkedListType::delfromkth(node **head,int kth)
{ node* temp1=*head,*temp2;
if(*head ==NULL)
{
cout<<\"LINK LIST IS EMPTY\ \"<next;
free(temp);
}
else
for(int j=0;jnext;
temp2= temp1->next;
temp1->next=temp2->next;
free(temp2);
}
/*
* Searching an element
*/
void linkedListType::findthekthnode(node *head,int kth)
{
ptr=head;
int i=1;
while((ptr!=NULL))
{
if(i==kth)
{
cout<<\"\ The Element at\"<< kth<< \"position with value is \\t
\"<info<info<next;
i++;
}
}
}
/*
* Traverse Link List
*/
void linkedListType::traverse(node *head)
{
ptr = head;
while((ptr->next)->next!=NULL)
{
cout<info<<\"\\t\";
ptr=ptr->next;
}
cout<
#include
#include
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
int item,ch,kth,total=1;
node *ptr,*head,*temp;
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
void main()
{
clrscr();
while(1)
{
printf(\"PRESS .
Computer_Practicals-file.doc.pdf
The document contains examples of various C++ programs and SQL commands. Some of the C++ programs include binary search, linear search, bubble sort, selection sort, insertion sort, copy constructor, parametrized constructor, lower matrix, sum of matrices, nesting, pointers, linear queue, circular queue, reading and writing binary files. The SQL commands include showing databases, creating a database, creating and describing a table, inserting and selecting data, altering a table by adding or dropping a column, using LIKE in select statements, and ordering results.
Class โincrementโ
In object-oriented programming, a class is an extensible program-code-template for creating objects, providing initial values for state (member variables) and implementations of behavior (member functions or methods).
#include <stdio.h> #include <malloc.h> #define ISEMP.pdf
#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(\"\ EMPTY LIST:\");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == \'Y\'||ans == \'y\')
value = val;
newnode->next = NULL;
{return|come back|come\" id=\"tip_27\">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ Inserted\");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(\"\ ----INSERTED----\");
}
else
}
}
printf(\"\ ---Sorted List---\");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (
Solution
#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(\"\ EMPTY LIST:\");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == \'Y\'||ans == \'y\')
value = val;
newnode->next = NULL;
{return|come back|come\" id=\"tip_27\">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ Inserted\");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(\"\ ----INSERTED----\");
}
else
}
}
printf(\"\ ---Sorted List---\");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (.
Help please!!(Include your modified DList.java source code file in.pdf
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.
I cant find the error in which my double linked list wont display .pdf
I can't find the error in which my double linked list won't display help me pls
#include
using namespace std;
typedef string Elem;
class DNode {
private:
Elem elem;
DNode* prev;
DNode* next;
friend class DLinkedList;
};
class DLinkedList {
public:
DLinkedList();
~DLinkedList();
bool empty() const;
const Elem& front() const;
const Elem& back() const;
void addFront(const Elem& e);
void addBack(const Elem& e);
void removeFront();
void removeBack();
void print(); // prints the doubly linked list
void insertElem(const Elem& e); // inserts element e in ascending order
void deleteElem(const Elem& e); // deletes element e
private:
DNode* header;
DNode* trailer;
protected:
void add(DNode* v, const Elem& e);
void remove(DNode* v);
};
DLinkedList::DLinkedList() {
header = new DNode;
trailer = new DNode;
header->next = trailer;
trailer->prev = header;
}
DLinkedList::~DLinkedList() {
while (!empty()) removeFront();
delete header;
delete trailer;
}
bool DLinkedList::empty() const {
return (header->next == trailer);
}
const Elem& DLinkedList::front() const {
return header->next->elem;
}
const Elem& DLinkedList::back() const {
return trailer->prev->elem;
}
void DLinkedList::add(DNode* v, const Elem& e) {
DNode* u = new DNode;
u->elem = e;
u->next = v;
u->prev = v->prev;
v->prev->next = v->prev = u;
}
void DLinkedList::addFront(const Elem& e) {
add(header->next, e);
}
void DLinkedList::addBack(const Elem& e) {
add(trailer, e);
}
void DLinkedList::remove(DNode* v) {
DNode* u = v->prev;
DNode* w = v->next;
u->next = w;
w->prev = u;
delete v;
}
void DLinkedList::removeFront() {
remove(header->next);
}
void DLinkedList::removeBack() {
remove(trailer->prev);
}
void DLinkedList::print() {
DNode* cur = header->next; // First element in the list is header->next
while (cur != trailer) { // Loop until the end is not reached
cout<elem<<" "; // Print the element
cur = cur->next; // Increment the pointer
}
cout<next;
while (cur != trailer && cur->elem < e) { // Loop until end of list or current element becomes
equal to or more than e
cur = cur->next;
}
add(cur, e); // Add e just before cur
}
void DLinkedList::deleteElem(const Elem& e) {
DNode* cur = header->next;
while (cur != trailer && cur->elem != e) { // Loop until end of list or current element matches e
cur = cur->next;
}
if (cur != trailer) { // If element is found
remove(cur); // Remove this node
}
}
int main() {
DLinkedList dlist;
dlist.addFront("c");
dlist.addFront("a");
dlist.addBack("d");
dlist.print(); // prints a c d
dlist.insertElem("b");
dlist.print(); // prints a b c d
dlist.deleteElem("d");
dlist.print(); // prints a b c
return 0;
}.
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
C program to insert a node in doubly linked list
This C program implements functions to create and manipulate a doubly linked list. It allows the user to choose from a menu to create a list, insert nodes at the beginning, end, or a specified position, and display the list. Functions are defined to create a list by dynamically allocating nodes and linking them together, insert nodes at different positions by updating next and prev pointers, and display the list by traversing from head to tail.
Lecture 3, c++(complete reference,herbet sheidt)chapter-13
Slide of C++(Complete Reference,Herbet Sheildt book)
CSE Department
Rajshahi Engineering Science and Technology College
Given BinaryNode.javapackage util;import java.util.;T.pdf
Given BinaryNode.java
package util;
import java.util.*;
/*
This class implements Binary Node for Binary Trees
Methods:
I) Two constructors
II) Two toString methods
III) height and size methods
IV) preorder, postorder, and inorder traversals
V) BFS and DFS traversal
*/
public class BinaryNode {
public E element;//data
public BinaryNode left;//left child
public BinaryNode right;//right child
//constructor for leaves
public BinaryNode(E element) {
this(element, null, null);
}
//constructor for internal nodes
public BinaryNode(E element, BinaryNode left, BinaryNode right) {
this.left = left;
this.right = right;
this.element = element;
}
public String toString2() {
if (left == null && right == null)//base case
return element + "";
return element + "(" + left + ", " + right + ")";
}
public int height() {
if (left == null && right == null)
return 0;
if (left == null)
return 1 + right.height();
if (right == null)
return 1 + left.height();
return 1 + Math.max(left.height(), right.height());
}
public int size() {
int size = 1;//counting root
if (left != null)//counting left subtree nodes
size += left.size();
if (right != null)//counting right subtree nodes
size += right.size();
return size;
}
public void printPreOrder() {
System.out.print(element + " ");
if (left != null)
left.printPreOrder();
if (right != null)
right.printPreOrder();
}
public void printPostOrder() {
if (left != null)
left.printPostOrder();
if (right != null)
right.printPostOrder();
System.out.print(element + " ");
}
public void printInOrder() {
if (left != null)
left.printInOrder();
System.out.print(element + " ");
if (right != null)
right.printInOrder();
}
public void printBFS() {//breadth first search traversal - non-recursive method
Queue q = new LinkedList<>();
q.add(this);
while (!q.isEmpty()) {
BinaryNode cur = q.remove();
System.out.print(cur.element + " ");
if (cur.left != null)
q.add(cur.left);
if (cur.right != null)
q.add(cur.right);
}
}
public void printDFS() {//depth first search traversal - equivalent to pre-order traversal
Stack stack = new Stack<>();
stack.add(this);
while (!stack.empty()) {
BinaryNode cur = stack.pop();
System.out.print(cur.element + " ");
if (cur.right != null)
stack.push(cur.right);
if (cur.left != null)
stack.push(cur.left);
}
}
public String toString() {
if (left == null && right == null && element == null)
return "";
Queue list = new LinkedList<>();
String result = "";
list.add(this);
list.add(null);
int level = (int) Math.pow(2, height());
BinaryNode dummy = new BinaryNode(null);
while (!list.isEmpty()) {
boolean allDummies = true;
for (BinaryNode b : list)
if (b != dummy && b != null) {
allDummies = false;
break;
}
BinaryNode cur = list.remove();
if (cur == null || allDummies)
break;
for (int i = 0; i < level - 1; i++)
result += '\t';
if (cur != dummy)
result += cur.element;
for (int i = 0; i < level + 1; i++)
result += '\t';
if (cur.left != null)
list.add(cur.left);
else
list.add(dummy);
if (cur.right != null)
list.add(cur.right);
else
list.add.
C# labprograms
The program defines a jagged array with 3 inner arrays of unspecified length. It initializes the inner arrays. It then iterates through the jagged array and sums all elements of the inner arrays. The total sum is returned.
ItemNodeh include ltiostreamgt include ltstring.pdf
ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Define InsertAtEnd() function that inserts a node
// to the end of the linked list
void InsertAtEnd(string item) {
ItemNode* newNode = new ItemNode(item);
if (nextNodeRef == NULL) {
nextNodeRef = newNode;
} else {
ItemNode* current = nextNodeRef;
while (current->nextNodeRef != NULL) {
current = current->nextNodeRef;
}
current->nextNodeRef = newNode;
}
}
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
int main() {
int numItems;
cin >> numItems;
ItemNode head;
ItemNode* current = &head;
for (int i = 0; i < numItems; i++) {
string item;
cin >> item;
current->InsertAtEnd(item);
current = current->GetNext();
}
current = head.GetNext();
while (current != NULL) {
current->PrintNodeData();
current = current->GetNext();
}
return 0;
}
main.cpp (only for viewing)
#include "ItemNode.h"
int main() {
ItemNode *headNode; // Create intNode objects
ItemNode *currNode;
ItemNode *lastNode;
string item;
int i;
int input;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
cin >> input;
for (i = 0; i < input; i++) {
cin >> item;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, define an
InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked
list. DO NOT print the dummy head node. Ex. if the input is: begin{tabular}{|l} hline 4 Kale Lettuce
Carrots Peanuts end{tabular} where 4 is the number of items to be inserted; Kale, Lettuce,
Carrots, Peanuts are the names of the items to be added at the end of the list. The output is:.
(deftemp Animalย ย (slot locย ย ย ย ย (default greencouch))ย ย (slot.pdf
(deftemp Animal
(slot loc
(default greencouch))
(slot on-top-of
(default roof))
(slot hold
(default nothing)))
(deftemp thing
(slot name
(default NONE))
(slot loc
(default NONE))
(slot on-top-of
(default roof))
(slot mass
(default light weight)))
(deftemp chest
(slot name
(default NONE))
(slot contents
(default NONE))
(slot unlocked-by
(default NONE)))
(deftemp goal-was
(slot act
(default NONE))
(multislot args))
(defrule hold chest to get of roof \"\"
(goal-was (act unlock) (args ?chest))
(thing (name ?chest) (on-top-of ~roof) (mass light weight))
(Animal (hold ~?chest))
(not (goal-was (act hold) (args ?chest)))
=>
(assert (goal-was (act hold) (args ?chest))))
(defrule put-chest-on-roof \"\"
(goal-was (act unlock) (args ?chest))
?Animal <- (Animal (loc ?place) (on-top-of ?on) (hold ?chest))
?thing <- (thing (name ?chest))
=>
(printout t \"Animal throws the \" ?chest \" off the \"
?on \" onto the roof.\" crlf)
(modify ?Animal (hold blank))
(modify ?thing (loc ?place) (on-top-of roof)))
(defrule get-key-to-unlock \"\"
(goal-was (act unlock) (args ?obj))
(thing (name ?obj) (on-top-of roof))
(chest (name ?obj) (unlocked-by ?key))
(Animal (hold ~?key))
(not (goal-was (act hold) (args ?key)))
=>
(assert (goal-was (act hold) (args ?key))))
(defrule move-to-chest-with-key \"\"
(goal-was (act unlock) (args ?chest))
(Animal (loc ?mplace) (hold ?key))
(thing (name ?chest) (loc ?cplace&~?mplace) (on-top-of roof))
(chest (name ?chest) (unlocked-by ?key))
(not (goal-was (act walk-to) (args ?cplace)))
=>
(assert (goal-was (act walk-to) (args ?cplace))))
(defrule unlock-chest-with-key \"\"
?goal <- (goal-was (act unlock) (args ?name))
?chest <- (chest (name ?name) (contents ?contents) (unlocked-by ?key))
(thing (name ?name) (loc ?place) (on-top-of ?on))
(Animal (loc ?place) (on-top-of ?on) (hold ?key))
=>
(printout t \"Animal opens the \" ?name \" with the \" ?key
\" revealing the \" ?contents \".\" crlf)
(modify ?chest (contents nothing))
(assert (thing (name ?contents) (loc ?place) (on-top-of ?name)))
(retract ?goal))
;;;*********************
;;;* HOLD OBJECT RULES *
;;;*********************
(defrule unlock-chest-to-hold-object \"\"
(goal-was (act hold) (args ?obj))
(chest (name ?chest) (contents ?obj))
(not (goal-was (act unlock) (args ?chest)))
=>
(assert (goal-was (act unlock) (args ?chest))))
(defrule use-ladder-to-hold \"\"
(goal-was (act hold) (args ?obj))
(thing (name ?obj) (loc ?place) (on-top-of ceiling) (mass light weight))
(not (thing (name ladder) (loc ?place)))
(not (goal-was (act move) (args ladder ?place)))
=>
(assert (goal-was (act move) (args ladder ?place))))
(defrule climb-ladder-to-hold \"\"
(goal-was (act hold) (args ?obj))
(thing (name ?obj) (loc ?place) (on-top-of ceiling) (mass light weight))
(thing (name ladder) (loc ?place) (on-top-of roof))
(Animal (on-top-of ~ladder))
(not (goal-was (act on) (args ladder)))
=>
(assert (goal-was (act on) (args ladder))))
(defrule grab-object-from-ladder \"\"
?goal <- (goal-was (act hold) (args ?.
2. The pressures of O2 and NO will be negligibleSolution 2. T.pdf
2. The pressures of O2 and NO will be negligible
Solution
2. The pressures of O2 and NO will be negligible.
More Related Content
Similar to #includeiostream#includecstdio#includecstdlib Node .pdf
#include iostream #includeData.h #includePerson.h#in.pdf
#include
#include\"Data.h\"
#include\"Person.h\"
#include\"Report.h\"
#include
#include
#include \"Menu.h\"
using namespace std;
/*
Programmers: Javier A. Molina, Eduardo Bonnet
Students #:79249
*/
int main()
{
int cnt;
int idx;
string fileName;
Report * telefonia;
Menu menu(\"Reports\");
bool fileNameExists(string fileName);
Report * addReport(Report * reports, int & totalReports);
Report * delReport(Report * reports, int & totalReports, int idx);
int displayReports(Report * reports, int totalReports);
menu.addItem(\"New report\");
menu.addItem(\"Delete a report\");
menu.addItem(\"Display a report\");
cnt = 0;
telefonia = NULL;
do {
cout << menu;
cin >> menu;
//cls();
switch (menu.getOption()) {
case 1:
cout << \"Enter report name (TE?????): \";
cin >> fileName;
if (fileNameExists(fileName + \".tel\")) {
telefonia = addReport(telefonia, cnt);
idx = cnt - 1;
telefonia[idx].setFileName(fileName);
// telefonia[idx].loadReport();
}
else {
cls();
cerr << \"Error: Report name \'\" << fileName << \"\' does not exists!\ \ \ \";
//pause();
}
break;
case 2:
if (telefonia != NULL) {
do {
cls();
cout << \"Delete a Report:\ \ \";
idx = displayReports(telefonia, cnt);
if (between(idx, 0, cnt - 1)) {
cls();
telefonia = delReport(telefonia, cnt, idx);
idx = 0;
// pause();
}
} while (idx != cnt);
}
else {
cerr << \"No reports available for deleting!\ \ \ \";
//pause();
}
break;
case 3:
char ans;
if (telefonia != NULL) {
do {
// cls();
cout << \"Display/Filed a Report:\ \ \";
idx = displayReports(telefonia, cnt);
if (between(idx, 0, cnt - 1)) {
// cls();
cout << \"Would you like the report to be display otherwise save into a file? \";
cin >> ans;
cls();
cin.ignore();
if (upper(ans) == \'Y\') {
cout << telefonia[idx] << endl;
}
else {
//telefonia[idx].saveReport();
cout << \"Report \'\" << telefonia[idx].getFileName() << \"\' saved as \'\" <<
telefonia[idx].getFileName() << \".rep\'.\ \ \";
}
//pause();
}
} while (idx != cnt);
}
else {
cerr << \"No reports available for displaying!\ \ \ \";
// pause();
}
break;
case 4:
cout << \"Thanks for using Telefonia Reports System!!!\ \ \ \";
break;
}
} while (menu.getLast() != menu.getOption());
delete[] telefonia;
return 0;
}
//Funcion que verifica si existe un archivo en disco
bool fileNameExists(string fileName) {
ifstream fin(fileName.c_str());
bool exists = !(fin.fail());
if (exists) fin.close();
return(exists);
}
//Anade dinamicamente objetos tipo Report al arreglo reports
Report * addReport(Report * reports, int & totalReports) {
if (totalReports == 0) {
reports = new Report[1];
}
else {
Report * tmp = new Report[totalReports];
for (int i = 0; i < totalReports; ++i) {
tmp[i] = reports[i];
}
delete[] reports;
reports = new Report[totalReports + 1];
for (int i = 0; i < totalReports; ++i) {
reports[i] = tmp[i];
}
delete[] tmp;
}
totalReports++;
return(reports);
}
//Borra objetos del arreglo reports segun el idx enviado
Report * delReport(Report * reports, int & totalReports, int idx) {
Report * tmp = new Report[tota.
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and doubly linked list. Use
inheritance to define singly linked list and doubly linked list. Add Node() Delete Node() Update
Node() Delete All() Size()
Solution
#include
using namespace std;
class List;
class Node
{
friend class List;
protected:
int Data;
Node *Link;
};
class List:public Node
{
friend class Node;
private:
Node *Start;
public:
List()
{
Start=NULL;
}
Node Insert(int x);
Node Delete(int &x);
void Display();
};
Node List::Insert(int x)
{
Node *New=new Node;
New->Data=x;
New->Link=Start;
Start=New;
return *this;
}
Node List::Delete(int &x)//deletes first node
{
Node *Del=Start;
Start=Start->Link;
delete Del;
return *this;
}
void List::Display()
{
Node *P=Start;
while(P!=NULL)
{
cout<Data<<\" \";
P=P->Link;
}
}
int main()
{
List L;
L.Insert(4);
L.Insert(64);
L.Insert(3);
L.Insert(90);
L.Insert(66);
L.Insert(13);
L.Display();
}
Double Linked List.
Ds 2 cycle
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.
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identities
Solution
import java.util.Scanner;
/* category Node */
class Node
creator */
public Node()
/* builder */
public Node(int d,Node n)
/* perform to line link to next Node */
public void setLink(Node n)
/* perform to line knowledge to current Node */
public void setData(int d)
/* perform to urge link to next node */
public Node getLink()
come back link;
}
/* perform to urge knowledge from current Node */
public int getData()
come back data;
}
}
/* category linkedList */
class linkedList
begin ;
protected Node finish ;
public int size ;
/* builder */
public linkedList()
begin = null;
finish = null;
size = 0;
}
/* perform to envision if list is empty */
public mathematician isEmpty()
come back begin == null;
}
/* perform to urge size of the list */
public int getSize()
come back size;
}
/* perform to insert part at the begining */
public void insertAtStart(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
begin = nptr;
}
size++ ;
}
/* perform to insert part at finish */
public void insertAtEnd(int val)
{
Node nptr = new Node(val,null);
nptr.setLink(start);
if(start == null)
{
begin = nptr;
nptr.setLink(start);
finish = start;
}
else
{
end.setLink(nptr);
finish = nptr;
}
size++ ;
}
/* perform to insert part at position */
public void insertAtPos(int val , int pos)
one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size++ ;
}
/* perform to delete part at position */
public void deleteAtPos(int pos)
one && pos == 1)
begin = null;
finish = null;
size = 0;
return ;
}
if (pos == 1)
begin = begin.getLink();
end.setLink(start);
size--;
return ;
}
if (pos == size)
whereas (s != end)
end = t;
end.setLink(start);
size --;
return;
}
Node ptr = start;
pos = pos - one ;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
}
size-- ;
}
/* perform to show contents */
public void display()
making object of linkedList */
linkedList list = new linkedList();
System.out.println(\"Circular individually coupled List Test\ \");
char ch;
/* Perform list operations */
do
{
System.out.println(\"\ Circular individually coupled List Operations\ \");
System.out.println(\"1. insert at begining\");
System.out.println(\"2. insert at end\");
System.out.println(\"3. insert at position\");
System.out.println(\"4. delete at position\");
System.out.println(\"5. check empty\");
System.out.println(\"6. get size\");
int selection = scan.nextInt();
switch (choice).
mainpublic class AssignmentThree { ย ย public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
Consider L = {a^nb^2nc^P p 0}. Prove L is not a context-free langu.pdf
Capital and Revenue Expenditures On February 13, Scanlon Co. paid $3,400 to repair the
transmission on one of its delivery vans.
In addition, Scanlon paid $20 to install a GPS system in its van.
Journalize the entries for the transmission. February 13? It should be two answers, Cr/Dr
Journalize the entry for GPS system expenditures. February 13? It should be two answers, Cr/Dr
Solution
Account Debit Credit Accumulated Depreciation- Delivery Van $3400 Cash $3400 To
record the repair of transmission on delivery vans.(Revenue Expenditure Delivery Van $20
Cash $20 (To record capital expenditure on Van (installing GPS).
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please include all header files and
main file with their own title.
Extend the class linkedListType by adding the following operations:
Write a function that returns the info of the kth element of the linked list. If no such element
exists, terminate the program.
Write a function that deletes the kth element of the linked list. If no such element exists,
terminate the program.
Provide the definitions of these functions in the class linkedListType. Also, write a program to
test these functions. (Use either the class unorderedLinkedList or the
class orderedLinkedList to test your function.)
Solution
C++ Code for the given problem is below.....
.....................................................
/*
* C++ Program to Implement Singly Linked List
*/
#include
#include
#include
//using namespace std;
/*
* Node Declaration
*/
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
/*
* Class Declaration
*/
class linkedListType
{
public:
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
int item,ch,kth;
node *ptr,*head,*temp;
};
/*
* Main :contains menu
*/
void main()
{
int item,ch,kth;
node *ptr,*head,*temp;
linkedListType s1;
clrscr();
while (1)
{
while(1)
{
cout<<\"PRESS (1) FOR INSERT INTO LIST\"<>ch;
switch(ch)
{
case 1:
cout<<\"ENTER THE VALUE \"<>item;
s1.insfrombeg(&head,item);
break;
case 2:
s1.traverse(head);
break;
case 3:
cout<<\"ENTER THE Kth Element which you want\'s to delete\"<>kth;
s1.delfromkth(&head,kth);
break;
case 4:
cout<<\"ENTER THE Kth Element which you want\'s to search \ \"<>kth;
s1.findthekthnode(head,kth);
break;
case 5:
exit(1);
}
}
// getch();
}
}
/*
* Inserting element in beginning
*/
void linkedListType::insfrombeg(node **head,int item)
{
temp= ( node * ) malloc (sizeof( node ));
temp->info= item;
temp->next= NULL;
if(*head == NULL)
{
temp->next= *head;
*head= temp;
}
else
{
temp->next= *head;
*head= temp;
}
}
/*
* Delete element at a given position
*/
void linkedListType::delfromkth(node **head,int kth)
{ node* temp1=*head,*temp2;
if(*head ==NULL)
{
cout<<\"LINK LIST IS EMPTY\ \"<next;
free(temp);
}
else
for(int j=0;jnext;
temp2= temp1->next;
temp1->next=temp2->next;
free(temp2);
}
/*
* Searching an element
*/
void linkedListType::findthekthnode(node *head,int kth)
{
ptr=head;
int i=1;
while((ptr!=NULL))
{
if(i==kth)
{
cout<<\"\ The Element at\"<< kth<< \"position with value is \\t
\"<info<info<next;
i++;
}
}
}
/*
* Traverse Link List
*/
void linkedListType::traverse(node *head)
{
ptr = head;
while((ptr->next)->next!=NULL)
{
cout<info<<\"\\t\";
ptr=ptr->next;
}
cout<
#include
#include
typedef struct nodetype
{
int info;
nodetype *next ;
} node;
int item,ch,kth,total=1;
node *ptr,*head,*temp;
void insfrombeg( node **head, int);
void delfromkth(node **head,int);
void findthekthnode(node *head,int);
void traverse(node *head);
void main()
{
clrscr();
while(1)
{
printf(\"PRESS .
Computer_Practicals-file.doc.pdf
The document contains examples of various C++ programs and SQL commands. Some of the C++ programs include binary search, linear search, bubble sort, selection sort, insertion sort, copy constructor, parametrized constructor, lower matrix, sum of matrices, nesting, pointers, linear queue, circular queue, reading and writing binary files. The SQL commands include showing databases, creating a database, creating and describing a table, inserting and selecting data, altering a table by adding or dropping a column, using LIKE in select statements, and ordering results.
Class โincrementโ
In object-oriented programming, a class is an extensible program-code-template for creating objects, providing initial values for state (member variables) and implementations of behavior (member functions or methods).
#include <stdio.h> #include <malloc.h> #define ISEMP.pdf
#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(\"\ EMPTY LIST:\");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == \'Y\'||ans == \'y\')
value = val;
newnode->next = NULL;
{return|come back|come\" id=\"tip_27\">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ Inserted\");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(\"\ ----INSERTED----\");
}
else
}
}
printf(\"\ ---Sorted List---\");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (
Solution
#include <stdio.h>
#include <malloc.h>
#define ISEMPTY printf(\"\ EMPTY LIST:\");
/*
* Node Declaration
*/
struct node
;
snode* create_node(int);
void insert_node_first();
void insert_node_last();
void insert_node_pos();
void sorted_ascend();
void delete_pos();
void search();
void update_val();
void display();
void rev_display(snode *);
typedef struct node snode;
snode *newnode, *ptr, *prev, *temp;
snode *first = NULL, *last = NULL;
/*
* Main :contains menu
*/
int main()
whereas (ans == \'Y\'||ans == \'y\')
value = val;
newnode->next = NULL;
{return|come back|come\" id=\"tip_27\">come newnode;
}
}
/*
* Inserting Node initially
*/
void insert_node_first()
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node eventually
*/
void insert_node_last()
printf(\"\ ----INSERTED----\");
}
/*
* Inserting Node at position
*/
void insert_node_pos()
if (pos == 1)
{
if (first == last && initial == NULL)
{
initial = last = newnode;
first->next = NULL;
last->next = NULL;
}
else
worker = first;
initial = newnode;
first->next = temp;
}
printf(\"\ Inserted\");
}
else if (pos>1 && pos<=cnt)
prev->next = newnode;
newnode->next = ptr;
printf(\"\ ----INSERTED----\");
}
else
}
}
printf(\"\ ---Sorted List---\");
for (ptr = first;ptr != NULL;ptr = ptr->next)
if (.
Help please!!(Include your modified DList.java source code file in.pdf
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.
I cant find the error in which my double linked list wont display .pdf
I can't find the error in which my double linked list won't display help me pls
#include
using namespace std;
typedef string Elem;
class DNode {
private:
Elem elem;
DNode* prev;
DNode* next;
friend class DLinkedList;
};
class DLinkedList {
public:
DLinkedList();
~DLinkedList();
bool empty() const;
const Elem& front() const;
const Elem& back() const;
void addFront(const Elem& e);
void addBack(const Elem& e);
void removeFront();
void removeBack();
void print(); // prints the doubly linked list
void insertElem(const Elem& e); // inserts element e in ascending order
void deleteElem(const Elem& e); // deletes element e
private:
DNode* header;
DNode* trailer;
protected:
void add(DNode* v, const Elem& e);
void remove(DNode* v);
};
DLinkedList::DLinkedList() {
header = new DNode;
trailer = new DNode;
header->next = trailer;
trailer->prev = header;
}
DLinkedList::~DLinkedList() {
while (!empty()) removeFront();
delete header;
delete trailer;
}
bool DLinkedList::empty() const {
return (header->next == trailer);
}
const Elem& DLinkedList::front() const {
return header->next->elem;
}
const Elem& DLinkedList::back() const {
return trailer->prev->elem;
}
void DLinkedList::add(DNode* v, const Elem& e) {
DNode* u = new DNode;
u->elem = e;
u->next = v;
u->prev = v->prev;
v->prev->next = v->prev = u;
}
void DLinkedList::addFront(const Elem& e) {
add(header->next, e);
}
void DLinkedList::addBack(const Elem& e) {
add(trailer, e);
}
void DLinkedList::remove(DNode* v) {
DNode* u = v->prev;
DNode* w = v->next;
u->next = w;
w->prev = u;
delete v;
}
void DLinkedList::removeFront() {
remove(header->next);
}
void DLinkedList::removeBack() {
remove(trailer->prev);
}
void DLinkedList::print() {
DNode* cur = header->next; // First element in the list is header->next
while (cur != trailer) { // Loop until the end is not reached
cout<elem<<" "; // Print the element
cur = cur->next; // Increment the pointer
}
cout<next;
while (cur != trailer && cur->elem < e) { // Loop until end of list or current element becomes
equal to or more than e
cur = cur->next;
}
add(cur, e); // Add e just before cur
}
void DLinkedList::deleteElem(const Elem& e) {
DNode* cur = header->next;
while (cur != trailer && cur->elem != e) { // Loop until end of list or current element matches e
cur = cur->next;
}
if (cur != trailer) { // If element is found
remove(cur); // Remove this node
}
}
int main() {
DLinkedList dlist;
dlist.addFront("c");
dlist.addFront("a");
dlist.addBack("d");
dlist.print(); // prints a c d
dlist.insertElem("b");
dlist.print(); // prints a b c d
dlist.deleteElem("d");
dlist.print(); // prints a b c
return 0;
}.
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
C program to insert a node in doubly linked list
This C program implements functions to create and manipulate a doubly linked list. It allows the user to choose from a menu to create a list, insert nodes at the beginning, end, or a specified position, and display the list. Functions are defined to create a list by dynamically allocating nodes and linking them together, insert nodes at different positions by updating next and prev pointers, and display the list by traversing from head to tail.
Lecture 3, c++(complete reference,herbet sheidt)chapter-13
Slide of C++(Complete Reference,Herbet Sheildt book)
CSE Department
Rajshahi Engineering Science and Technology College
Given BinaryNode.javapackage util;import java.util.;T.pdf
Given BinaryNode.java
package util;
import java.util.*;
/*
This class implements Binary Node for Binary Trees
Methods:
I) Two constructors
II) Two toString methods
III) height and size methods
IV) preorder, postorder, and inorder traversals
V) BFS and DFS traversal
*/
public class BinaryNode {
public E element;//data
public BinaryNode left;//left child
public BinaryNode right;//right child
//constructor for leaves
public BinaryNode(E element) {
this(element, null, null);
}
//constructor for internal nodes
public BinaryNode(E element, BinaryNode left, BinaryNode right) {
this.left = left;
this.right = right;
this.element = element;
}
public String toString2() {
if (left == null && right == null)//base case
return element + "";
return element + "(" + left + ", " + right + ")";
}
public int height() {
if (left == null && right == null)
return 0;
if (left == null)
return 1 + right.height();
if (right == null)
return 1 + left.height();
return 1 + Math.max(left.height(), right.height());
}
public int size() {
int size = 1;//counting root
if (left != null)//counting left subtree nodes
size += left.size();
if (right != null)//counting right subtree nodes
size += right.size();
return size;
}
public void printPreOrder() {
System.out.print(element + " ");
if (left != null)
left.printPreOrder();
if (right != null)
right.printPreOrder();
}
public void printPostOrder() {
if (left != null)
left.printPostOrder();
if (right != null)
right.printPostOrder();
System.out.print(element + " ");
}
public void printInOrder() {
if (left != null)
left.printInOrder();
System.out.print(element + " ");
if (right != null)
right.printInOrder();
}
public void printBFS() {//breadth first search traversal - non-recursive method
Queue q = new LinkedList<>();
q.add(this);
while (!q.isEmpty()) {
BinaryNode cur = q.remove();
System.out.print(cur.element + " ");
if (cur.left != null)
q.add(cur.left);
if (cur.right != null)
q.add(cur.right);
}
}
public void printDFS() {//depth first search traversal - equivalent to pre-order traversal
Stack stack = new Stack<>();
stack.add(this);
while (!stack.empty()) {
BinaryNode cur = stack.pop();
System.out.print(cur.element + " ");
if (cur.right != null)
stack.push(cur.right);
if (cur.left != null)
stack.push(cur.left);
}
}
public String toString() {
if (left == null && right == null && element == null)
return "";
Queue list = new LinkedList<>();
String result = "";
list.add(this);
list.add(null);
int level = (int) Math.pow(2, height());
BinaryNode dummy = new BinaryNode(null);
while (!list.isEmpty()) {
boolean allDummies = true;
for (BinaryNode b : list)
if (b != dummy && b != null) {
allDummies = false;
break;
}
BinaryNode cur = list.remove();
if (cur == null || allDummies)
break;
for (int i = 0; i < level - 1; i++)
result += '\t';
if (cur != dummy)
result += cur.element;
for (int i = 0; i < level + 1; i++)
result += '\t';
if (cur.left != null)
list.add(cur.left);
else
list.add(dummy);
if (cur.right != null)
list.add(cur.right);
else
list.add.
C# labprograms
The program defines a jagged array with 3 inner arrays of unspecified length. It initializes the inner arrays. It then iterates through the jagged array and sums all elements of the inner arrays. The total sum is returned.
ItemNodeh include ltiostreamgt include ltstring.pdf
ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Define InsertAtEnd() function that inserts a node
// to the end of the linked list
void InsertAtEnd(string item) {
ItemNode* newNode = new ItemNode(item);
if (nextNodeRef == NULL) {
nextNodeRef = newNode;
} else {
ItemNode* current = nextNodeRef;
while (current->nextNodeRef != NULL) {
current = current->nextNodeRef;
}
current->nextNodeRef = newNode;
}
}
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
int main() {
int numItems;
cin >> numItems;
ItemNode head;
ItemNode* current = &head;
for (int i = 0; i < numItems; i++) {
string item;
cin >> item;
current->InsertAtEnd(item);
current = current->GetNext();
}
current = head.GetNext();
while (current != NULL) {
current->PrintNodeData();
current = current->GetNext();
}
return 0;
}
main.cpp (only for viewing)
#include "ItemNode.h"
int main() {
ItemNode *headNode; // Create intNode objects
ItemNode *currNode;
ItemNode *lastNode;
string item;
int i;
int input;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
cin >> input;
for (i = 0; i < input; i++) {
cin >> item;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, define an
InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked
list. DO NOT print the dummy head node. Ex. if the input is: begin{tabular}{|l} hline 4 Kale Lettuce
Carrots Peanuts end{tabular} where 4 is the number of items to be inserted; Kale, Lettuce,
Carrots, Peanuts are the names of the items to be added at the end of the list. The output is:.
Similar to #includeiostream#includecstdio#includecstdlib Node .pdf (20)
#include iostream #includeData.h #includePerson.h#in.pdf
#include iostream #includeData.h #includePerson.h#in.pdf
ย
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and d.pdf
ย
using set identitiesSolutionimport java.util.Scanner; c.pdf
using set identitiesSolutionimport java.util.Scanner; c.pdf
ย
mainpublic class AssignmentThree { ย ย public static void ma.pdf
mainpublic class AssignmentThree { ย ย public static void ma.pdf
ย
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignme.pdf
ย
Consider L = {a^nb^2nc^P p 0}. Prove L is not a context-free langu.pdf
Consider L = {a^nb^2nc^P p 0}. Prove L is not a context-free langu.pdf
ย
Please need help on following program using c++ language. Please inc.pdf
Please need help on following program using c++ language. Please inc.pdf
ย
#include <stdio.h> #include <malloc.h> #define ISEMP.pdf
#include <stdio.h> #include <malloc.h> #define ISEMP.pdf
ย
Help please!!(Include your modified DList.java source code file in.pdf
Help please!!(Include your modified DList.java source code file in.pdf
ย
I cant find the error in which my double linked list wont display .pdf
I cant find the error in which my double linked list wont display .pdf
ย
This is the main file include itemh include itemList.pdf
This is the main file include itemh include itemList.pdf
ย
Lecture 3, c++(complete reference,herbet sheidt)chapter-13
Lecture 3, c++(complete reference,herbet sheidt)chapter-13
ย
Given BinaryNode.javapackage util;import java.util.;T.pdf
Given BinaryNode.javapackage util;import java.util.;T.pdf
ย
ItemNodeh include ltiostreamgt include ltstring.pdf
ItemNodeh include ltiostreamgt include ltstring.pdf
ย
More from gulshan16175gs
(deftemp Animalย ย (slot locย ย ย ย ย (default greencouch))ย ย (slot.pdf
(deftemp Animal
(slot loc
(default greencouch))
(slot on-top-of
(default roof))
(slot hold
(default nothing)))
(deftemp thing
(slot name
(default NONE))
(slot loc
(default NONE))
(slot on-top-of
(default roof))
(slot mass
(default light weight)))
(deftemp chest
(slot name
(default NONE))
(slot contents
(default NONE))
(slot unlocked-by
(default NONE)))
(deftemp goal-was
(slot act
(default NONE))
(multislot args))
(defrule hold chest to get of roof \"\"
(goal-was (act unlock) (args ?chest))
(thing (name ?chest) (on-top-of ~roof) (mass light weight))
(Animal (hold ~?chest))
(not (goal-was (act hold) (args ?chest)))
=>
(assert (goal-was (act hold) (args ?chest))))
(defrule put-chest-on-roof \"\"
(goal-was (act unlock) (args ?chest))
?Animal <- (Animal (loc ?place) (on-top-of ?on) (hold ?chest))
?thing <- (thing (name ?chest))
=>
(printout t \"Animal throws the \" ?chest \" off the \"
?on \" onto the roof.\" crlf)
(modify ?Animal (hold blank))
(modify ?thing (loc ?place) (on-top-of roof)))
(defrule get-key-to-unlock \"\"
(goal-was (act unlock) (args ?obj))
(thing (name ?obj) (on-top-of roof))
(chest (name ?obj) (unlocked-by ?key))
(Animal (hold ~?key))
(not (goal-was (act hold) (args ?key)))
=>
(assert (goal-was (act hold) (args ?key))))
(defrule move-to-chest-with-key \"\"
(goal-was (act unlock) (args ?chest))
(Animal (loc ?mplace) (hold ?key))
(thing (name ?chest) (loc ?cplace&~?mplace) (on-top-of roof))
(chest (name ?chest) (unlocked-by ?key))
(not (goal-was (act walk-to) (args ?cplace)))
=>
(assert (goal-was (act walk-to) (args ?cplace))))
(defrule unlock-chest-with-key \"\"
?goal <- (goal-was (act unlock) (args ?name))
?chest <- (chest (name ?name) (contents ?contents) (unlocked-by ?key))
(thing (name ?name) (loc ?place) (on-top-of ?on))
(Animal (loc ?place) (on-top-of ?on) (hold ?key))
=>
(printout t \"Animal opens the \" ?name \" with the \" ?key
\" revealing the \" ?contents \".\" crlf)
(modify ?chest (contents nothing))
(assert (thing (name ?contents) (loc ?place) (on-top-of ?name)))
(retract ?goal))
;;;*********************
;;;* HOLD OBJECT RULES *
;;;*********************
(defrule unlock-chest-to-hold-object \"\"
(goal-was (act hold) (args ?obj))
(chest (name ?chest) (contents ?obj))
(not (goal-was (act unlock) (args ?chest)))
=>
(assert (goal-was (act unlock) (args ?chest))))
(defrule use-ladder-to-hold \"\"
(goal-was (act hold) (args ?obj))
(thing (name ?obj) (loc ?place) (on-top-of ceiling) (mass light weight))
(not (thing (name ladder) (loc ?place)))
(not (goal-was (act move) (args ladder ?place)))
=>
(assert (goal-was (act move) (args ladder ?place))))
(defrule climb-ladder-to-hold \"\"
(goal-was (act hold) (args ?obj))
(thing (name ?obj) (loc ?place) (on-top-of ceiling) (mass light weight))
(thing (name ladder) (loc ?place) (on-top-of roof))
(Animal (on-top-of ~ladder))
(not (goal-was (act on) (args ladder)))
=>
(assert (goal-was (act on) (args ladder))))
(defrule grab-object-from-ladder \"\"
?goal <- (goal-was (act hold) (args ?.
2. The pressures of O2 and NO will be negligibleSolution 2. T.pdf
2. The pressures of O2 and NO will be negligible
Solution
2. The pressures of O2 and NO will be negligible.
# Imports# Include your imports here, if any are used. import.pdf
The document contains code for solving three puzzles: (1) the N-Queens puzzle using backtracking to find all solutions, (2) the Lights Out puzzle using breadth-first search to find a solution, and (3) the Linear Disk Movement puzzle to rearrange disks in a line using breadth-first search. Common data structures like queues and sets are used. Puzzles are modeled as classes with methods to get valid moves, check for solutions, and search the state space.
The OMe is a strong electron withdrawing group an.pdf
The OMe is a strong electron withdrawing group and the OSiMe3 is a good electron
donating group. Together they provide good regioselectivity because they make their Cs more
reactive to the nucleophile and electrophile respectively of the dienophile. Also the OSiMe3 is a
large substituent and can use steric hinderance to direct the regioselectivity.
Solution
The OMe is a strong electron withdrawing group and the OSiMe3 is a good electron
donating group. Together they provide good regioselectivity because they make their Cs more
reactive to the nucleophile and electrophile respectively of the dienophile. Also the OSiMe3 is a
large substituent and can use steric hinderance to direct the regioselectivity..
O bears three lone pairs and is bound to a H, thu.pdf
O bears three lone pairs and is bound to a H, thus it is sp3-hybrized.
Solution
O bears three lone pairs and is bound to a H, thus it is sp3-hybrized..
Nacl and H20 so, Salt & water .pdf
This short document discusses a solution made of salt and water. Sodium chloride or table salt is combined with water to form a solution. The document simply states that salt and water combine to make a solution.
In terms of ion charge, we notice that the charge.pdf
In terms of ion charge, we notice that the charge of elements increases by one as
you move from left to right. For example, Sodium, Na, has a plus 1+ charge in solution and
Calcium, Ca, has a 2+ charge. On the opposite side of the table, the elements are more likely to
gain and electron and have a negative charge than lose an electron and have a positive charge in
solution, so starting from the noble gases and moving towards the center, the elements tend to
gain a negative charge for each column. The halides, which include Chlorine, Fluorine, Bromine
and Iodine all tend to have a 1- charge, while Oxygen has a 2- and nitrogen, a 3-. The transition
metals in the middle of the table tend to form positive charges of different values, known as
oxidation states. These do not necessarily follow left to right trend.
Solution
In terms of ion charge, we notice that the charge of elements increases by one as
you move from left to right. For example, Sodium, Na, has a plus 1+ charge in solution and
Calcium, Ca, has a 2+ charge. On the opposite side of the table, the elements are more likely to
gain and electron and have a negative charge than lose an electron and have a positive charge in
solution, so starting from the noble gases and moving towards the center, the elements tend to
gain a negative charge for each column. The halides, which include Chlorine, Fluorine, Bromine
and Iodine all tend to have a 1- charge, while Oxygen has a 2- and nitrogen, a 3-. The transition
metals in the middle of the table tend to form positive charges of different values, known as
oxidation states. These do not necessarily follow left to right trend..
Here are four characteristics of acid a) A char.pdf
Here are four characteristics of acid: a) A characteristic sour taste b) ability to
change the color of litmus paper from blue to red c) react with certain metals to produce gaseous
H2 d) react with bases to form a salt and water
Solution
Here are four characteristics of acid: a) A characteristic sour taste b) ability to
change the color of litmus paper from blue to red c) react with certain metals to produce gaseous
H2 d) react with bases to form a salt and water.
Fe^3+(aq)Lewis acid H2O(l)Lewis baseereyedcommu .pdf
Fe^3+(aq)Lewis acid H2O(l)Lewis baseereyedcommu
Solution
Fe^3+(aq)Lewis acid H2O(l)Lewis baseereyedcommu.
wrongSolutionwrong.pdf
This very short document does not contain enough meaningful information to summarize in 3 sentences or less. It consists of only 4 words that do not provide any essential details or high-level context.
You can use the below function for linear interpolation i.e.#inclu.pdf
You can use the below function for linear interpolation i.e.
#include
int NearestIndex( double value, double *x, int len )
{
double dist;
int index;
int i;
index = -1;
dist = Double_Max;
for ( i = 0; i < len; i++ ) {
double newDist = value - x[i];
if ( newDist > 0 && newDist < dist ) {
dist = newDist;
index = i;
}
}
return index;
}
void linearinterpolation(double *x, int x_tem, double *y, double *xx, int xx_tem, double *yy)
{
double da, db, *slp, *inter;
int i, Envectorindice;
slp=(double *)calloc(x_tem,sizeof(double));
inter=(double *)calloc(x_tem,sizeof(double));
for(i = 0; i < x_tem; i++){
if(i
Solution
You can use the below function for linear interpolation i.e.
#include
int NearestIndex( double value, double *x, int len )
{
double dist;
int index;
int i;
index = -1;
dist = Double_Max;
for ( i = 0; i < len; i++ ) {
double newDist = value - x[i];
if ( newDist > 0 && newDist < dist ) {
dist = newDist;
index = i;
}
}
return index;
}
void linearinterpolation(double *x, int x_tem, double *y, double *xx, int xx_tem, double *yy)
{
double da, db, *slp, *inter;
int i, Envectorindice;
slp=(double *)calloc(x_tem,sizeof(double));
inter=(double *)calloc(x_tem,sizeof(double));
for(i = 0; i < x_tem; i++){
if(i.
These are the following tool to build a data model for an applicatio.pdf
These are the following tool to build a data model for an application :
PowerDesigner
PowerDesigner is arguably the industryโs leading data modelling tool. Its features include: fully
integrated models, different modelling techniques that cater to both an IT-centric audience and
non IT-centric. It also supports a powerful metadata repository and various output formats. It has
a nice and polished user interface with easily readable help documentation aiding the user to
quickly solve ad hoc problems.
ER/Studio
ER/Studio is an intuitive data modelling tool that supports single and multi-platform
environments, with native integration for big data platforms such as โ MongoDB and Hadoop
Hive. It can forward and reverse engineer models, includes a compare and merge function and is
able to create reports in various formats (XML, PNG, JPEG). Built-in features automate routine
tasks and supports the popular database platforms. ER/Studio is a great tool that that is easy to
start working with due to its intuitive design and good user support.
Sparx Enterprise Architect
Enterprise Architect is a feature rich data modelling tool that prides itself on being the cost-
efficient option. It helps business users build robust and maintainable systems quickly and can
easily scale to accommodate large teams collaborating on shared projects. Enterprise Architect
also has the capability of running a dynamic model simulations to verify the correctness of
models and provide better understanding of how specific business systems operate.
Oracle SQL Developer Data Modeler
Oracle data modeller is a free graphical tool to help business users with data modelling tasks.
This tool is robust, offering features and utilities centred around productivity. This includes
easily accessible report tool, DDL preview capabilities, built in quality check tool and a
sophisticated search engine.
CA ERwin
ERwin is one of the leading data modelling solutions that provides a simple, polished user
interface for a complex data environment. This solution provides business agility โ models and
metadata can be managed in a common repository to ensure consistency and security. ERwin
supports high customisation and automation allowing macro language, custom datatypes, APIs
and much more. It also has an extensive user community enabling consumers to share knowledge
and expertise.
IBM - InfoSphere Data Architect
InfoSphere is an innovative data modelling tool that runs on an open-source platform โ Eclipse.
Infopshere focuses on three key areas: efficiency, simplicity and integration. This tools helps
business users create logical and physical data model diagrams which can be used for a variety of
applications and systems. This end-to-end solution can be used to create, deploy and update data
models in a quick and efficient manner. It also provides easy integration with other related IBM
products.
Solution
These are the following tool to build a data model for an application :
PowerDesigner
PowerDesi.
Copper (II) Sulfate = CuSO4 Tin (IV) Oxide = SnO2.pdf
Copper (II) Sulfate = CuSO4 Tin (IV) Oxide = SnO2
Solution
Copper (II) Sulfate = CuSO4 Tin (IV) Oxide = SnO2.
Water is a good solvent due to its polarity. The oxygen atom in wate.pdf
Water is a good solvent due to its polarity. The oxygen atom in water attracts the electrons more
strongly than the hydrogen atoms. Hence the molecule has partial positive and partial negative
ends.
This allows water molecules to seperate polar solute molecules.
When a solute is dissolved in water, the solvent molecules surround the solute molecule. The
relative small size of water molecules enable many of them to surround one solute molecule.
Ionic substances dissociate to charged ions while covalent substances which are polar have
charged ends. This allows for water (a polar solvent) to easily dissolve such substances. Hence
ionic substance and polar covalent substances dissolve easily in water.
Solution
Water is a good solvent due to its polarity. The oxygen atom in water attracts the electrons more
strongly than the hydrogen atoms. Hence the molecule has partial positive and partial negative
ends.
This allows water molecules to seperate polar solute molecules.
When a solute is dissolved in water, the solvent molecules surround the solute molecule. The
relative small size of water molecules enable many of them to surround one solute molecule.
Ionic substances dissociate to charged ions while covalent substances which are polar have
charged ends. This allows for water (a polar solvent) to easily dissolve such substances. Hence
ionic substance and polar covalent substances dissolve easily in water..
V. The two types of larvae found in the life cycle of Diphyllobothri.pdf
V. The two types of larvae found in the life cycle of Diphyllobothrium spp are
1. Procercoid larva (tailed larva that develop in the body cavity of copepod)
2. Plerocercoid larvae (sparganum): occurs in the muscles of the fishes
VI The three types of larvae found in the life cycle of trematodes are:
1. Miracidium ( released from the egg)
2. Sporocyst ( forms inside the snail first intermediate host)
3. Redia ( also forms inside snail first intermediate host)
Solution
V. The two types of larvae found in the life cycle of Diphyllobothrium spp are
1. Procercoid larva (tailed larva that develop in the body cavity of copepod)
2. Plerocercoid larvae (sparganum): occurs in the muscles of the fishes
VI The three types of larvae found in the life cycle of trematodes are:
1. Miracidium ( released from the egg)
2. Sporocyst ( forms inside the snail first intermediate host)
3. Redia ( also forms inside snail first intermediate host).
The tolerance has been given as +-0.05 inchSolutionThe tolera.pdf
The tolerance for the part is +/-0.05 inches. The tolerance range allows for variations of 0.05 inches above or below the nominal dimension. The document states the tolerance as +/-0.05 inches.
The voltmeter reading indicates that Zn is the negative electrode an.pdf
The voltmeter reading indicates that Zn is the negative electrode and Fe is the positive electrode.
Current flows from Fe to Zn.
Zn is the anode (negative electrode where oxidation takes place)
Fe is the cathode (positive electrode where reduction takes place)
Electrons flow from Zn to Fe (opposite to current direction)
Zn is more active (Zn is oxidized more easily and electrons are produced at the Zn electrode)
Solution
The voltmeter reading indicates that Zn is the negative electrode and Fe is the positive electrode.
Current flows from Fe to Zn.
Zn is the anode (negative electrode where oxidation takes place)
Fe is the cathode (positive electrode where reduction takes place)
Electrons flow from Zn to Fe (opposite to current direction)
Zn is more active (Zn is oxidized more easily and electrons are produced at the Zn electrode).
The foreign exchange market facilitates the exchange of Currencies. .pdf
The foreign exchange market facilitates the exchange of Currencies. it facilitates the
international investment and capital flows.
Solution
The foreign exchange market facilitates the exchange of Currencies. it facilitates the
international investment and capital flows..
c. defendant that the complaint lacks true facts .pdf
c. defendant that the complaint lacks true facts
Solution
c. defendant that the complaint lacks true facts.
bonde order of NO in nitrate 1.33 in nitrite is 1.pdf
bonde order of NO in nitrate 1.33 in nitrite is 1.5 in NO+ is 3.0 in NO- is 2.0 j. NO+
> NO- > nitrite > nitrate is correct.
Solution
bonde order of NO in nitrate 1.33 in nitrite is 1.5 in NO+ is 3.0 in NO- is 2.0 j. NO+
> NO- > nitrite > nitrate is correct..
More from gulshan16175gs (20)
(deftemp Animalย ย (slot locย ย ย ย ย (default greencouch))ย ย (slot.pdf
(deftemp Animalย ย (slot locย ย ย ย ย (default greencouch))ย ย (slot.pdf
ย
2. The pressures of O2 and NO will be negligibleSolution 2. T.pdf
2. The pressures of O2 and NO will be negligibleSolution 2. T.pdf
ย
# Imports# Include your imports here, if any are used. import.pdf
# Imports# Include your imports here, if any are used. import.pdf
ย
The OMe is a strong electron withdrawing group an.pdf
The OMe is a strong electron withdrawing group an.pdf
ย
O bears three lone pairs and is bound to a H, thu.pdf
O bears three lone pairs and is bound to a H, thu.pdf
ย
In terms of ion charge, we notice that the charge.pdf
In terms of ion charge, we notice that the charge.pdf
ย
Here are four characteristics of acid a) A char.pdf
Here are four characteristics of acid a) A char.pdf
ย
Fe^3+(aq)Lewis acid H2O(l)Lewis baseereyedcommu .pdf
Fe^3+(aq)Lewis acid H2O(l)Lewis baseereyedcommu .pdf
ย
You can use the below function for linear interpolation i.e.#inclu.pdf
You can use the below function for linear interpolation i.e.#inclu.pdf
ย
These are the following tool to build a data model for an applicatio.pdf
These are the following tool to build a data model for an applicatio.pdf
ย
Copper (II) Sulfate = CuSO4 Tin (IV) Oxide = SnO2.pdf
Copper (II) Sulfate = CuSO4 Tin (IV) Oxide = SnO2.pdf
ย
Water is a good solvent due to its polarity. The oxygen atom in wate.pdf
Water is a good solvent due to its polarity. The oxygen atom in wate.pdf
ย
V. The two types of larvae found in the life cycle of Diphyllobothri.pdf
V. The two types of larvae found in the life cycle of Diphyllobothri.pdf
ย
The tolerance has been given as +-0.05 inchSolutionThe tolera.pdf
The tolerance has been given as +-0.05 inchSolutionThe tolera.pdf
ย
The voltmeter reading indicates that Zn is the negative electrode an.pdf
The voltmeter reading indicates that Zn is the negative electrode an.pdf
ย
The foreign exchange market facilitates the exchange of Currencies. .pdf
The foreign exchange market facilitates the exchange of Currencies. .pdf
ย
c. defendant that the complaint lacks true facts .pdf
c. defendant that the complaint lacks true facts .pdf
ย
bonde order of NO in nitrate 1.33 in nitrite is 1.pdf
bonde order of NO in nitrate 1.33 in nitrite is 1.pdf
ย
Recently uploaded
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
A Visual Guide to 1 Samuel | A Tale of Two Hearts
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(๐๐๐ ๐๐๐) (๐๐๐ฌ๐ฌ๐จ๐ง ๐)-๐๐ซ๐๐ฅ๐ข๐ฆ๐ฌ
๐๐ข๐ฌ๐๐ฎ๐ฌ๐ฌ ๐ญ๐ก๐ ๐๐๐ ๐๐ฎ๐ซ๐ซ๐ข๐๐ฎ๐ฅ๐ฎ๐ฆ ๐ข๐ง ๐ญ๐ก๐ ๐๐ก๐ข๐ฅ๐ข๐ฉ๐ฉ๐ข๐ง๐๐ฌ:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
๐๐ฑ๐ฉ๐ฅ๐๐ข๐ง ๐ญ๐ก๐ ๐๐๐ญ๐ฎ๐ซ๐ ๐๐ง๐ ๐๐๐จ๐ฉ๐ ๐จ๐ ๐๐ง ๐๐ง๐ญ๐ซ๐๐ฉ๐ซ๐๐ง๐๐ฎ๐ซ:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
A Independรชncia da Amรฉrica Espanhola LAPBOOK.pdf
Lapbook sobre independรชncia da Amรฉrica Espanhola.
Temple of Asclepius in Thrace. Excavation results
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...PsychoTech Services
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!ย
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
Benner "Expanding Pathways to Publishing Careers"
Benner "Expanding Pathways to Publishing Careers"National Information Standards Organization (NISO)
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.ย
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Stack Memory Organization of 8086 Microprocessor
The stack memory organization of 8086 microprocessor.
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
BรI TแบฌP Bแป TRแปข TIแบพNG ANH LแปP 9 Cแบข NฤM - GLOBAL SUCCESS - NฤM HแปC 2024-2025 - ...
BรI TแบฌP Bแป TRแปข TIแบพNG ANH LแปP 9 Cแบข NฤM - GLOBAL SUCCESS - NฤM HแปC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdaneย
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"National Information Standards Organization (NISO)
This presentation was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.ย
Recently uploaded (20)
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
ย
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
ย
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
ย
A Independรชncia da Amรฉrica Espanhola LAPBOOK.pdf
A Independรชncia da Amรฉrica Espanhola LAPBOOK.pdf
ย
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
ย
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
ย
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
ย
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
ย
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
ย
BรI TแบฌP Bแป TRแปข TIแบพNG ANH LแปP 9 Cแบข NฤM - GLOBAL SUCCESS - NฤM HแปC 2024-2025 - ...
BรI TแบฌP Bแป TRแปข TIแบพNG ANH LแปP 9 Cแบข NฤM - GLOBAL SUCCESS - NฤM HแปC 2024-2025 - ...
ย
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
Jemison, MacLaughlin, and Majumder "Broadening Pathways for Editors and Authors"
ย
#includeiostream#includecstdio#includecstdlib Node .pdf
- 1. #include #include #include /* * Node Declaration */ using namespace std; struct node { int info; struct node *next; struct node *prev; }*start; /* Class Declaration */ class double_llist { public: void create_list(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_dlist(); void count(); void reverse(); double_llist() { start = NULL; } }; /* * Main: Conatins Menu */
- 2. int main() { int choice, element, position; double_llist dl; while (1) { cout<>choice; switch ( choice ) { case 1: cout<<"Enter the element: "; cin>>element; dl.create_list(element); cout<>element; dl.add_begin(element); cout<>element; cout<<"Insert Element after postion: "; cin>>position; dl.add_after(element, position); cout<>element; dl.delete_element(element); cout<info = value; temp->next = NULL; if (start == NULL) { temp->prev = NULL; start = temp; } else { s = start; while (s->next != NULL) s = s->next; s->next = temp; temp->prev = s; }
- 3. } /* * Insertion at the beginning */ void double_llist::add_begin(int value) { if (start == NULL) { cout<<"First Create the list."<prev = NULL; temp->info = value; temp->next = start; start->prev = temp; start = temp; cout<<"Element Inserted"<next; if (q == NULL) { cout<<"There are less than "; cout<info = value; if (q->next == NULL) { q->next = tmp; tmp->next = NULL; tmp->prev = q; } else { tmp->next = q->next; tmp->next->prev = tmp; q->next = tmp; tmp->prev = q; } cout<<"Element Inserted"<info == value) { tmp = start; start = start->next;
- 4. start->prev = NULL; cout<<"Element Deleted"<next->next != NULL) { /*Element deleted in between*/ if (q->next->info == value) { tmp = q->next; q->next = tmp->next; tmp->next->prev = q; cout<<"Element Deleted"<next; } /*last element deleted*/ if (q->next->info == value) { tmp = q->next; free(tmp); q->next = NULL; cout<<"Element Deleted"<info<<" <-> "; q = q->next; } cout<<"NULL"<next; cnt++; } cout<<"Number of elements are: "<next; p1->next = NULL; p1->prev = p2; while (p2 != NULL) { p2->prev = p2->next; p2->next = p1; p1 = p2; p2 = p2->prev; } start = p1; cout<<"List Reversed"< Solution
- 5. #include #include #include /* * Node Declaration */ using namespace std; struct node { int info; struct node *next; struct node *prev; }*start; /* Class Declaration */ class double_llist { public: void create_list(int value); void add_begin(int value); void add_after(int value, int position); void delete_element(int value); void search_element(int value); void display_dlist(); void count(); void reverse(); double_llist() { start = NULL; } }; /* * Main: Conatins Menu */
- 6. int main() { int choice, element, position; double_llist dl; while (1) { cout<>choice; switch ( choice ) { case 1: cout<<"Enter the element: "; cin>>element; dl.create_list(element); cout<>element; dl.add_begin(element); cout<>element; cout<<"Insert Element after postion: "; cin>>position; dl.add_after(element, position); cout<>element; dl.delete_element(element); cout<info = value; temp->next = NULL; if (start == NULL) { temp->prev = NULL; start = temp; } else { s = start; while (s->next != NULL) s = s->next; s->next = temp; temp->prev = s; }
- 7. } /* * Insertion at the beginning */ void double_llist::add_begin(int value) { if (start == NULL) { cout<<"First Create the list."<prev = NULL; temp->info = value; temp->next = start; start->prev = temp; start = temp; cout<<"Element Inserted"<next; if (q == NULL) { cout<<"There are less than "; cout<info = value; if (q->next == NULL) { q->next = tmp; tmp->next = NULL; tmp->prev = q; } else { tmp->next = q->next; tmp->next->prev = tmp; q->next = tmp; tmp->prev = q; } cout<<"Element Inserted"<info == value) { tmp = start; start = start->next;
- 8. start->prev = NULL; cout<<"Element Deleted"<next->next != NULL) { /*Element deleted in between*/ if (q->next->info == value) { tmp = q->next; q->next = tmp->next; tmp->next->prev = q; cout<<"Element Deleted"<next; } /*last element deleted*/ if (q->next->info == value) { tmp = q->next; free(tmp); q->next = NULL; cout<<"Element Deleted"<info<<" <-> "; q = q->next; } cout<<"NULL"<next; cnt++; } cout<<"Number of elements are: "<next; p1->next = NULL; p1->prev = p2; while (p2 != NULL) { p2->prev = p2->next; p2->next = p1; p1 = p2; p2 = p2->prev; } start = p1; cout<<"List Reversed"<