Program 1 public class QueueUsingArray { private static final i.pdf

•

0 likes•1 view

Program 1 : public class QueueUsingArray { private static final int queueCapacity = 20; int arr[] = new int[queueCapacity]; int size = 0; int top = -1; int rear = 0; public void pushinQueue(int pushedElement) { if (top < queueCapacity - 1) { top++; arr[top] = pushedElement; System.out.println(\"Element \" + pushedElement + \" is pushed to Queue !\"); display(); } else { System.out.println(\"Overflow !\"); } } public void pop() { if (top >= rear) { rear++; System.out.println(\"Pop operation done !\"); display(); } else { System.out.println(\"Underflow !\"); } } public void display() { if (top >= rear) { System.out.println(\"Elements in Queue : \"); for (int i = rear; i <= top; i++) { System.out.println(arr[i]); } } } public static void main(String[] args) { QueueUsingArray obj = new QueueUsingArray(); obj.pop(); obj.pushinQueue(20); obj.pushinQueue(18); obj.pushinQueue(67); obj.pushinQueue(343); obj.pop(); obj.pushinQueue(203); obj.pushinQueue(348); obj.pushinQueue(637); obj.pushinQueue(343); obj.pop(); obj.pop(); obj.pop(); } } Result 1 : 348 Element 637 is pushed to Queue ! Elements in Queue : 18 67 343 203 348 637 Element 343 is pushed to Queue ! Elements in Queue : 18 67 343 203 348 637 343 Pop operation done ! Elements in Queue : 67 343 203 348 637 343 Pop operation done ! Elements in Queue : 343 203 348 637 343 Pop operation done ! Elements in Queue : 203 348 637 343 Program 2: import java.util.Random; public class InsertionSort { public static void main(String str[]){ Random rand = new Random(); int arr[] = new int[20]; for(int i=0;i<20;i++){ arr[i]=rand.nextInt(100); System.out.print(arr[i]+\" \"); } System.out.println(\"\"); insertionSOrt(arr); for(int i=0;i<20;i++){ System.out.println(\"arr[\"+i+\"] : \"+arr[i]); } } public static void insertionSOrt(int arr[]){ for(int i=1;i=0 && temp Solution Program 1 : public class QueueUsingArray { private static final int queueCapacity = 20; int arr[] = new int[queueCapacity]; int size = 0; int top = -1; int rear = 0; public void pushinQueue(int pushedElement) { if (top < queueCapacity - 1) { top++; arr[top] = pushedElement; System.out.println(\"Element \" + pushedElement + \" is pushed to Queue !\"); display(); } else { System.out.println(\"Overflow !\"); } } public void pop() { if (top >= rear) { rear++; System.out.println(\"Pop operation done !\"); display(); } else { System.out.println(\"Underflow !\"); } } public void display() { if (top >= rear) { System.out.println(\"Elements in Queue : \"); for (int i = rear; i <= top; i++) { System.out.println(arr[i]); } } } public static void main(String[] args) { QueueUsingArray obj = new QueueUsingArray(); obj.pop(); obj.pushinQueue(20); obj.pushinQueue(18); obj.pushinQueue(67); obj.pushinQueue(343); obj.pop(); obj.pushinQueue(203); obj.pushinQueue(348); obj.pushinQueue(637); obj.pushinQueue(343); obj.pop(); obj.pop(); obj.pop(); } } Result 1 : 348 Element 637 is pushed to Queue ! Elements in Queue : 18 67 343 203 348 637 Element 343 is pushed to Que.

Education

public static void main(String[] args) {
QueueUsingArray obj = new QueueUsingArray();
obj.pop();
obj.pushinQueue(20);
obj.pushinQueue(18);
obj.pushinQueue(67);
obj.pushinQueue(343);
obj.pop();
obj.pushinQueue(203);
obj.pushinQueue(348);
obj.pushinQueue(637);
obj.pushinQueue(343);
obj.pop();
obj.pop();
obj.pop();
}
}
Result 1 :
348
Element 637 is pushed to Queue !
Elements in Queue :
18
67
343
203
348
637
Element 343 is pushed to Queue !
Elements in Queue :
18
67
343
203
348
637
343

Pop operation done !
Elements in Queue :
67
343
203
348
637
343
Pop operation done !
Elements in Queue :
343
203
348
637
343
Pop operation done !
Elements in Queue :
203
348
637
343
Program 2:
import java.util.Random;
public class InsertionSort {
public static void main(String str[]){
Random rand = new Random();
int arr[] = new int[20];
for(int i=0;i<20;i++){
arr[i]=rand.nextInt(100);
System.out.print(arr[i]+" ");
}
System.out.println("");
insertionSOrt(arr);
for(int i=0;i<20;i++){
System.out.println("arr["+i+"] : "+arr[i]);
}

}
public static void insertionSOrt(int arr[]){
for(int i=1;i=0 && temp
Solution
Program 1 :
public class QueueUsingArray {
private static final int queueCapacity = 20;
int arr[] = new int[queueCapacity];
int size = 0;
int top = -1;
int rear = 0;
public void pushinQueue(int pushedElement) {
if (top < queueCapacity - 1) {
top++;
arr[top] = pushedElement;
System.out.println("Element " + pushedElement
+ " is pushed to Queue !");
display();
} else {
System.out.println("Overflow !");
}
}
public void pop() {
if (top >= rear) {
rear++;
System.out.println("Pop operation done !");
display();
} else {
System.out.println("Underflow !");
}
}
public void display() {
if (top >= rear) {
System.out.println("Elements in Queue : ");
for (int i = rear; i <= top; i++) {

System.out.println(arr[i]);
}
}
}
public static void main(String[] args) {
QueueUsingArray obj = new QueueUsingArray();
obj.pop();
obj.pushinQueue(20);
obj.pushinQueue(18);
obj.pushinQueue(67);
obj.pushinQueue(343);
obj.pop();
obj.pushinQueue(203);
obj.pushinQueue(348);
obj.pushinQueue(637);
obj.pushinQueue(343);
obj.pop();
obj.pop();
obj.pop();
}
}
Result 1 :
348
Element 637 is pushed to Queue !
Elements in Queue :
18
67
343
203
348
637
Element 343 is pushed to Queue !
Elements in Queue :
18
67
343

203
348
637
343
Pop operation done !
Elements in Queue :
67
343
203
348
637
343
Pop operation done !
Elements in Queue :
343
203
348
637
343
Pop operation done !
Elements in Queue :
203
348
637
343
Program 2:
import java.util.Random;
public class InsertionSort {
public static void main(String str[]){
Random rand = new Random();
int arr[] = new int[20];
for(int i=0;i<20;i++){
arr[i]=rand.nextInt(100);
System.out.print(arr[i]+" ");
}
System.out.println("");

insertionSOrt(arr);
for(int i=0;i<20;i++){
System.out.println("arr["+i+"] : "+arr[i]);
}
}
public static void insertionSOrt(int arr[]){
for(int i=1;i=0 && temp

Similar to Program 1 public class QueueUsingArray { private static final i.pdf

Stack array

rimshailyas1

Stack and Queue.pptx university exam preparation

RAtna29

stack and queue array implementation in java.

CIIT Atd.

stack and queue array implementation, java.

CIIT Atd.

java assignment

Jack Eastwood

Im having an issue with the simulateOPT() methodthis is the p.pdf

stopgolook

import java.util.Scanner;public class Main {private static i.pdf

stopgolook

ISCP internal.pdf

GANDHAMKUMAR2

Write the program in MIPS that declares an array of positive integer.pdf

arihanthtoysandgifts

14 thread

Bayarkhuu

ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

deepua8

Stack

Amrutha Rajan

CODE Data Structures

Sonia Pahuja

What is Stack, Its Operations, Queue, Circular Queue, Priority Queue

Balwant Gorad

#include<iostream> #include<cctype> using namespace std; class evalPostFix { public: int s[50]; int top; char str[50]; evalPostFix() { top=-1; } void push(int val) { top++; s[top]=val; } int pop() { int val=s[top]; top--; return val; } int oper(int x,int y,char op) { switch(op) { case '+':return x+y; case '-':return x-y; case '*':return x*y; case '/':return x/y; default: return 0; } } int calc(); }; int evalPostFix::calc() { int i=0; while(str[i]!='=') { if(isdigit(str[i])) { push(str[i]-'0'); } else { int x=pop(); int y=pop(); int r=oper(x,y,str[i]); push(r); } i++; } return pop(); } int main() { char answer; evalPostFix eval; do { cout<<"Enter a postfix expression:" << endl; cin>>eval.str; int r=eval.calc(); cout<<"Final Value : "<<r <<"\n"; cout << "Continue (Y or N)" << endl; cin >> answer; } while(answer!='N'); system("pause"); } Here is the output, but I do not want it to be like this. I want the output to be like this ...

#includeiostream#includecctypeusing namespace std;cl.docx

katherncarlyle

Sam wd programs

Soumya Behera

Stack.pptx

AliRaza899305

CS8391-Data Structures Unit 2

SIMONTHOMAS S

DS- Stack ADT

MythiliMurugan3

VTU Data Structures Lab Manual

Nithin Kumar,VVCE, Mysuru

Similar to Program 1 public class QueueUsingArray { private static final i.pdf (20)

Stack array

Stack and Queue.pptx university exam preparation

stack and queue array implementation in java.

stack and queue array implementation, java.

java assignment

Im having an issue with the simulateOPT() methodthis is the p.pdf

import java.util.Scanner;public class Main {private static i.pdf

ISCP internal.pdf

Write the program in MIPS that declares an array of positive integer.pdf

14 thread

ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

Stack

CODE Data Structures

What is Stack, Its Operations, Queue, Circular Queue, Priority Queue

#includeiostream#includecctypeusing namespace std;cl.docx

Sam wd programs

Stack.pptx

CS8391-Data Structures Unit 2

DS- Stack ADT

VTU Data Structures Lab Manual

More from Ankitchhabra28

frequency tableSolution frequency table.pdf

Ankitchhabra28

ublic class Elevator { private static final String DOWN = down.pdf

Ankitchhabra28

[Al+] [OH-]^3 = Ksp0.2 [OH-]^3 = 210^-32[OH-] = 4.64210^-1.pdf

Ankitchhabra28

As a CFO environment of internal control needs to put in place to ensure account balances are accurately valued and reported. For this first classification of account balances into high risk, medium risk and low risk is necessary and then such balances should be reconciled with general ledger. For low risk account balances, review is necessary in regard to their limit set. To ensure there is no material mistatement in reporting review at regular intervals is required. Solution As a CFO environment of internal control needs to put in place to ensure account balances are accurately valued and reported. For this first classification of account balances into high risk, medium risk and low risk is necessary and then such balances should be reconciled with general ledger. For low risk account balances, review is necessary in regard to their limit set. To ensure there is no material mistatement in reporting review at regular intervals is required..

As a CFO environment of internal control needs to put in place t.pdf

Ankitchhabra28

What are the financial markets and what purposes do they serve? A financial market is a broad term describing any marketplace where buyers and sellers participate in the trade of assets such as equities, bonds, currencies and derivatives. Financial markets are typically defined by having transparent pricing, basic regulations on trading, costs and fees, and market forces determining the prices of securities that trade. Financial markets can be found in nearly every nation in the world. Some are very small, with only a few participants, while others - like the New York Stock Exchange (NYSE) and the forex markets - trade trillions of dollars daily. Investors have access to a large number of financial markets and exchanges representing a vast array of financial products. Some of these markets have always been open to private investors; others remained the exclusive domain of major international banks and financial professionals until the very end of the twentieth century. What are financial intermediaries? How do these intermediaries function in the economy? Financial intermediaries channel funds from people who have extra money or surplus savings (savers) to those who do not have enough money to carry out a desired activity (borrowers). A financial intermediary is typically an institution that facilitates the channeling of funds between lenders and borrowers indirectly. That is, savers (lenders) give funds to an intermediary institution (such as a bank), and that institution gives those funds to spenders (borrowers). This may be in the form of loans or mortgages. Alternatively, they may lend the money directly via the financial markets, which is known as financial disintermediation. Financial intermediaries help circulating money in the system. If money is staying idle (e.g. under your bed pillow or as gold in your locker) then it is not good for the economy. Money must keep changing hands. If you look at this from a different angle: if nobody buys skin whitening creams then who will feed the families of those chemists who work there And the businessman who supplies raw material to that factory? They promote the habit of savings. Individual can use that saved money in bad times / emergency and earn profit in between. A needy businessman will easily get loans. When businessmen can get loans easily at a reasonable cost, they’ll start new business, expand existing business, hire more employees, increase production of goods / services = GDP increases. When people are making more money, they spend more money. A family goes to restaurant, poor waiter makes money. Family hires maid, gardener, driver. Family buys new car, mobile or bike- it breaks down, the repairman makes money. That’s how money trickles down from rich people to poor people. What is a federal government budget deficit? What is the national debt? How does a budget deficit affect the economy? The federal government budget deficit is when the Federal spending is greater than the tax reve.

What are the financial markets and what purposes do they serveA f.pdf

Ankitchhabra28

VI) Instruction set Architecture:- Instruction set is a collection of the instructions that are executed by the CPU or various different type of operations are performed in CPU according to this instructions. and it is the part of the processor that is visible to the compiler writer. It acts as boundary between software and hardware.And it includes a specification of the set of opcodes, and the native commands. Instruction set Architecture as Abstract interface:- The hierarchy of the layers is consisted by the both software and hardware.From the above layer each lower layer hide the details. The main theme for the abstraction is used for both hardware and software is complexity of computer systems. One key interface between the levels of abstraction is the instruction set architrecture. That means the interface between hardware and low-level software. This abstract interface enables many implementations of varying cost and performance to run identical software. MIPS instructions:- 1.R-type instructions 2.I-type instructions 3.J-type instructions These are the 3-types of MIPS instructions. R-type instructions means register type instructions. We are using various type of registers to perform this type of instruction. It is a complex one. Ex:-R[d]=R[s]+R[t] I-type instructions are immediate type instructions. EX:-R[t]=R[s]+(IR15)16 IR15-0. J-type instructions are jump type instructions. Ex:-PC<-PC31-28 IR25-0 00 Importance of Standardized ISA:- Standardized ISA are very important for software. why because it has a high chance to use in open architecture for industry implementations.and also the main theme is this type ISA provides modular and simpler instruction set architecture. For example if you take RISC. It is also a instruction set architecture that was designed to support computer architecture research but it become a standardized architecture for computer software. because it is simpler and modular. so more organizations are happy by using this instruction set architrecture. VII)The computer mainly consists of the five classic components 1.Input unit. 2.Output unit. 3.Memory. 4.ALU 5.Control unit. 1.Input unit:- It is an interaction between the user and the computer which accepts the input from the user and give it to the computer. Ex:-Mouse. 2.Output unit:-It is an interaction between the computer and the user which takes the value from the computer and present it to the user. Ex:-Monitor 3. Memory:-Memory is used to store the programms. Ex:-RAM 4.ALU:-All arithmetic and logical operations are performed on the programs by using Arithmetic and logic unit. 5.Control unit:-Which transfers the control signals to perform the required operations. VIII. Memory:- The memory is used to store the programs. They are two types of memorys are there 1.RAM 2.ROM RAM is temporary memory which are used to store the temporary program. ROM is a permanent memory which are used to store the permanent program. RAM memory can be divided into two types 1.Stat.

VI) Instruction set Architecture- Instruction set is a colle.pdf

Ankitchhabra28

waitSolutionwait.pdf

Ankitchhabra28

The OSI(Open System Interconnection) contains 7 layers. 1.Physical layer 2.Data link layer 3.Network layer 4.Transport layer 5.Session layer 6.Presentaion layer 7.Application layer In above layers, media converter opreates at layer1, Physical layer . The physical layer translates the frames into the bits and the bits are transmitted to tramission medium Since physical layer transmits the data as signals which are in the form of bits (electrical singals). Therefore, media converter operates at physical layer. Solution The OSI(Open System Interconnection) contains 7 layers. 1.Physical layer 2.Data link layer 3.Network layer 4.Transport layer 5.Session layer 6.Presentaion layer 7.Application layer In above layers, media converter opreates at layer1, Physical layer . The physical layer translates the frames into the bits and the bits are transmitted to tramission medium Since physical layer transmits the data as signals which are in the form of bits (electrical singals). Therefore, media converter operates at physical layer..

The OSI(Open System Interconnection) contains 7 layers.1.Physica.pdf

Ankitchhabra28

the following statements are true Ubiquinone is a small, hydrophobic protein containing a metal group that acts as an electron carrier.Mitochondrial electron carriers with the highest redox potential generally contain copper ions and/or heme groups. Solution the following statements are true Ubiquinone is a small, hydrophobic protein containing a metal group that acts as an electron carrier.Mitochondrial electron carriers with the highest redox potential generally contain copper ions and/or heme groups..

the following statements are true Ubiquinone is a small, hydrophob.pdf

Ankitchhabra28

The evolution of one species is driven by the evolution of the other species. In this, two groups of organisms exert selective pressures on each other, which drives the co-evolution of genes, this may occur within the species or between the species. The co-evolution of certain insects and flowering plants is driven by their symbiotic relationship. Increased chances of pollination and seed dispersal by animals and other vectors, and all other factors that increased the fitness of plants. The co-evolved animals and plants share certain characteristics the benefit each other. Fruits are formed after pollination. The animal pollinator get some reward when it visit its coevolved plant. For example, the co- evolution of flowers with deep fragrance and UV-reflecting pigments. Bees have a keen sense of smell and they can also see UV light, so the flowers with these characteristics attract bees and thus, promotes pollination. In this case, the bees carry the pollen and nectar, pollen is transported to the other plants or used by bees and nectar is utilized as a food source by the bees (mutual benefit in coevolution). Solution The evolution of one species is driven by the evolution of the other species. In this, two groups of organisms exert selective pressures on each other, which drives the co-evolution of genes, this may occur within the species or between the species. The co-evolution of certain insects and flowering plants is driven by their symbiotic relationship. Increased chances of pollination and seed dispersal by animals and other vectors, and all other factors that increased the fitness of plants. The co-evolved animals and plants share certain characteristics the benefit each other. Fruits are formed after pollination. The animal pollinator get some reward when it visit its coevolved plant. For example, the co- evolution of flowers with deep fragrance and UV-reflecting pigments. Bees have a keen sense of smell and they can also see UV light, so the flowers with these characteristics attract bees and thus, promotes pollination. In this case, the bees carry the pollen and nectar, pollen is transported to the other plants or used by bees and nectar is utilized as a food source by the bees (mutual benefit in coevolution)..

The evolution of one species is driven by the evolution of the other.pdf

Ankitchhabra28

Student choosed wrong subject. Question was not showning.Solutio.pdf

Ankitchhabra28

S(sulfur) atom Glucose molecule and compound Oxygen atom DN.pdf

Ankitchhabra28

Question not visible..please post the imageSolutionQuestion no.pdf

Ankitchhabra28

PrimeRange.java import java.util.Scanner; public class PrimeRange { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); System.out.println(\"Enter low range:\"); int low = scan.nextInt(); System.out.println(\"Enter high range:\"); int high = scan.nextInt(); for(int i=low; i<=high; i++){ if(isPrime(i)) System.out.print(i+\" \"); } } public static boolean isPrime(int n){ for (int f = 2; f < n / 2; f++) { if (n % f == 0) { return false; } } return true; } } Output: Enter low range: 10 Enter high range: 30 11 13 17 19 23 29 Solution PrimeRange.java import java.util.Scanner; public class PrimeRange { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); System.out.println(\"Enter low range:\"); int low = scan.nextInt(); System.out.println(\"Enter high range:\"); int high = scan.nextInt(); for(int i=low; i<=high; i++){ if(isPrime(i)) System.out.print(i+\" \"); } } public static boolean isPrime(int n){ for (int f = 2; f < n / 2; f++) { if (n % f == 0) { return false; } } return true; } } Output: Enter low range: 10 Enter high range: 30 11 13 17 19 23 29.

PrimeRange.java import java.util.Scanner;public class PrimeRan.pdf

Ankitchhabra28

opps no format is there...Solutionopps no format is there....pdf

Ankitchhabra28

Note: Given Code modified as required and required methods added. Code: // class node class Node { // declare the required variable String data; Node next; // constructor Node(){} // constructor with arguments Node(String data) { this.data = data; next = null; } // method to get the data public String getData() { return data; } // method to set the data public void setData(String data) { this.data = data; } // method to get the next data public Node getNext() { return next; } // method to set the next data public void setNext(Node next) { this.next = next; } } // class for a linked list class MyLInkedList { Node head;alue into a list // method to add the v public void add(String num) { if (head == null) { head = new Node(num); } else{ Node temp = new Node(num); Node current = head; if (current != null) { while (current.getNext() != null) { current = current.getNext(); } current.setNext(temp); } } } // method to search a value from a list public void search(String num) { Node current = head; boolean flag=true; if (current != null) { while (current != null) { if(current.getData() == num) { System.out.println(\"Search value \"+ current.getData()+\" is available\"); flag=false; } current = current.getNext(); } if (flag==true) { System.out.println(\"Search value \"+ current.getData()+\" is not available\"); } } else { System.out.println(\"Linked list is empty\"); } } // method to delete a value from a list public void delete(String num) { //Node current = head; boolean flag=true; if (head == null) { System.out.println(\"Can\'t Delete, Linked list is empty\"); return; } if(head.getData() == num) { head=head.getNext(); return; } Node temp = new Node(num); Node cr = head; Node prev=null; while ((cr != null) && !(cr.getData() == num)) { prev=cr; cr = cr.getNext(); } prev.setNext(cr.getNext()); } // method to print the list public void print() { Node current = head; if (current != null) { while (current != null) { System.out.println(current.getData()); current = current.getNext(); } } } } // method to test the class public class MyLInkedListTester { // main method to perform the linked list operatrions public static void main(String args[]) { MyLInkedList llist = new MyLInkedList(); // insert the values into list llist.add(\"1\"); llist.add(\"2\"); llist.add(\"3\"); llist.add(\"4\"); // print the list values llist.print(); // sear the values in a list llist.search(\"1\"); llist.print(); // delete the value from a list llist.delete(\"4\"); System.out.println(\"List after deletion:\"); llist.print(); } } Result: 1 2 3 4 Search value 1 is available 1 2 3 4 List after deletion: 1 2 3 Solution Note: Given Code modified as required and required methods added. Code: // class node class Node { // declare the required variable String data; Node next; // constructor Node(){} // constructor with arguments Node(String data) { this.data = data; next = null; } // method to get the data public String getData() { return data; } // method to set the data public void se.

Note Given Code modified as required and required met.pdf

Ankitchhabra28

No, weight is not the measure of quantity of matter.Quantity of ma.pdf

Ankitchhabra28

Two. The pyruvate with carbons 4-6 will go throu.pdf

Ankitchhabra28

Listing.javaimport java.util.Scanner;public class Listing { .pdf

Ankitchhabra28

is rightSolutionis right.pdf

Ankitchhabra28

More from Ankitchhabra28 (20)