answersLogoWhite

0

for psp

User Avatar

Wiki User

16y ago

What else can I help you with?

Continue Learning about Engineering

How do you fix the keypad of a water damaged Motorola V3 mobile phone?

I do not think that you can fix them. If the keypad isn't responding then you will have to take it to a local mobile phone shop, or your supplier.


What is the formula for the series-parallel connection?

/t=/t1=/t2=/t3... vt=v1+v2+v3... rt=r1+r2+r3... series formula....


What is a spindle motor?

Spindle Motors are V3 class low vibration 3 phase induction AC motor. Spindle motor has extra low vibration performance. They are specifically designed for grinding machines and low vibration applications


How is a motor rewound to operate on a different voltage?

For example, A motor voltage 3x230V to voltage 3x400V. Section of wires original / V3(1,73) Number of windings original x V3 (1,73) Connections of coils have to stay the same, as well as external connections. Most motors do have different voltage regarding the external connection. Most motors < 5,5kW = 3x230V/400V 5,5kW and higher : 3x400V/690V The difference between the voltage is in this case made by external connection (Delta/star) Delta : L1 = U1-W2, L2 = V1-U2, L3 = W1-V2 Star : L1 = U1, L2 = V1, L3 = W1 and connection between U2-V2-W2


Program that implements breadth first search algorithm?

#include <stdio.h> #include <conio.h> #include <malloc.h> #define TRUE 1 #define FALSE 0 #define MAX 8 struct node { int data ; struct node *next ; } ; int visited[MAX] ; int q[8] ; int front, rear ; void bfs ( int, struct node ** ) ; struct node * getnode_write ( int ) ; void addqueue ( int ) ; int deletequeue( ) ; int isempty( ) ; void del ( struct node * ) ; int main( ) { struct node *arr[MAX] ; struct node *v1, *v2, *v3, *v4 ; int i ; v1 = getnode_write ( 2 ) ; arr[0] = v1 ; v1 -> next = v2 = getnode_write ( 3 ) ; v2 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[1] = v1 ; v1 -> next = v2 = getnode_write ( 4 ) ; v2 -> next = v3 = getnode_write ( 5 ) ; v3 -> next = NULL ; v1 = getnode_write ( 1 ) ; arr[2] = v1 ; v1 -> next = v2 = getnode_write ( 6 ) ; v2 -> next = v3 = getnode_write ( 7 ) ; v3 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[3] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 2 ) ; arr[4] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[5] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 3 ) ; arr[6] = v1 ; v1 -> next = v2 = getnode_write ( 8 ) ; v2 -> next = NULL ; v1 = getnode_write ( 4 ) ; arr[7] = v1 ; v1 -> next = v2 = getnode_write ( 5 ) ; v2 -> next = v3 = getnode_write ( 6 ) ; v3 -> next = v4 = getnode_write ( 7 ) ; v4 -> next = NULL ; front = rear = -1 ; bfs ( 1, arr ) ; for ( i = 0 ; i < MAX ; i++ ) del ( arr[i] ) ; getch( ) ; return 0; } void bfs ( int v, struct node **p ) { struct node *u ; visited[v - 1] = TRUE ; printf ( "%d\t", v ) ; addqueue ( v ) ; while ( isempty( ) -1 ) return TRUE ; return FALSE ; } void del ( struct node *n ) { struct node *temp ; while ( n != NULL ) { temp = n -> next ; free ( n ) ; n = temp ; } }