By permanently locking in stakeholder requirements during a project's planning phase. -through highly detailed process documentation that is updated following every work cycle.
Answer:
moment of inertia = 4.662 * 10^6 
Explanation:
Given data :
Mass of machine = 400 kg = 400 * 9.81 = 3924 N
length of span = 3.2 m
E = 200 * 10^9 N/m^2
frequency = 9.3 Hz
Wm ( angular frequency ) = 2
= 58.434 rad/secs
also Wm =
------- EQUATION 1
g = 9.81
deflection of simply supported beam
t = 
insert the value of t into equation 1
W
=
make I the subject of the equation
I ( Moment of inertia about the neutral axis ) = 
I =
= 4.662 * 10^6 
Answer:
Angle of discharge make at the edge of tube=64.9 degrees.
Answer:
Using linkedlist on C++, we have the program below.
Explanation:
#include<iostream>
#include<cstdlib>
using namespace std;
//structure of linked list
struct linkedList
{
int data;
struct linkedList *next;
};
//print linked list
void printList(struct linkedList *head)
{
linkedList *t=head;
while(t!=NULL)
{
cout<<t->data;
if(t->next!=NULL)
cout<<" -> ";
t=t->next;
}
}
//insert newnode at head of linked List
struct linkedList* insert(struct linkedList *head,int data)
{
linkedList *newnode=new linkedList;
newnode->data=data;
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
struct linkedList *temp=head;
while(temp->next!=NULL)
temp=temp->next;
temp->next=newnode;
}
return head;
}
void multiplyOddPosition(struct linkedList *head)
{
struct linkedList *temp=head;
while(temp!=NULL)
{
temp->data = temp->data*10; //multiply values at odd position by 10
temp = temp->next;
//skip odd position values
if(temp!= NULL)
temp = temp->next;
}
}
int main()
{
int n,data;
linkedList *head=NULL;
// create linked list
head=insert(head,20);
head=insert(head,5);
head=insert(head,11);
head=insert(head,17);
head=insert(head,23);
head=insert(head,12);
head=insert(head,4);
head=insert(head,21);
cout<<"\nLinked List : ";
printList(head); //print list
multiplyOddPosition(head);
cout<<"\nLinked List After Multiply by 10 at odd position : ";
printList(head); //print list
return 0;
}