Subjects>Auto>Auto Parts

What is N-level?

Anonymous

∙ 14y ago

Updated: 10/25/2022

The "General Certificate of Education 'Normal' Level Examination", otherwise known as the "GCE 'N' Level" or the "'N' Levels", are examinations conducted annually in Singapore taken by students after four years (Secondary Four) in the Normal Academic or Normal Technical streams, with a possibility of leading to the "Singapore-Cambridge General Certificate of Education 'Ordinary' Level Examination" in their fifth-year.

The University of Cambridge Local Examinations Syndicate(UCLES) is the examining authority for subjects conducted in the English language, foreign languages and Non-Tamil Indian Languages. The examining authority for other subjects such as the mother tongue languages is the Ministry of Education, Singapore.

Wiki User

∙ 14y ago

What else can I help you with?

Write a program in c to implement the depth first traversal?

#include <iostream.h> #include <conio.h> class graph { private:int n; int **a; int *reach; int *pos; public:graph(int k=10); void create(); void dfs(); void dfs(int v,int label); int begin(int v); int nextvert(int v); }; void graph::graph(int k) { n=k; a=new int *[n+1]; reach=new int[n+1]; pos=new int [n+1]; for(int i=1;i<=n;i++) pos[i]=0; for(int j=1;j<=n;j++) a[j]=new int[n+1]; } void graph::create() { for(int i=1;i<=n;i++) { cout<<"Enter the "<<i<<"th row of matrix a: "; for(int j=1;j<=n;j++) cin>>a[i][j]; } for(int k=1;k<=n;k++) reach[k]=0; } void graph::dfs() { int label=0; for(int i=1;i<=n;i++) if(!reach[i]) { label++; dfs(i,label); } cout<<" The contents of the reach array is: ; for(int j=1;j<=n;j++) cout<<reach[j]<<" "; } void graph::dfs(int v,int label) { cout<<v<<" "; reach[v]=label; int u=begin(v); while(u) { if(!reach[u]) dfs(u,label); u=nextvert(v); } } int graph::begin(int v) { if((v<1)&&(v>n)) cout<<"Bad input "; else for(int i=1;i<=n;i++) if(a[v][i]==1) { pos[v]=i; return i; } return 0; } int graph::nextvert(int v) { if((v<1)&&(v>n)) cout<<"Bad input "; else for(int i=pos[v]+1;i<=n;i++) if(a[v][i]==1) { pos[v]=i; return i; } return 0; } void main() { clrscr(); int x; cout<<"Enter the no of vertices: "; cin>>x; graph g(x); g.create(); cout<<"dfs is....."; g.dfs(); getch(); }

Trending Questions

How do you replace a fuel pump in a 1993 Corsica? Where to find coolant sensor on Chevy Silverado? What is a positive action throttle cable do? What order do i attach jumper cables to charge battery? What is the purpose of module? How is photochemical smog created? What is firing order of cylinders? Does the windshield washer pump on a 2000 Mazda Protege have a fuse? How often do you need to change the transmission oil in a harley heritage softail? How do you replace a power steering pump on a 1990 Oldsmobile Calais? Is it ok to top up with 10w-40 with 5w-30 in engine? Which radiator hose goes to the engine? How do you replace ignition switch actuator rod? What is the fork oil capacity for Yamaha srx 250? Can a rack and pinion be bad if it makes a humming noise when steering? How do you change shocks on a 97 Toyota Camry? 2002 Jaguar X-Type 3.0 Sport has a groaning noise in the passenger rear side area when turning right. Had power steering fluid flushed and filled still no luck how can this be fixed? Why is a fork lever? Why won't my hi beams work on my 1996 firebird I pull back the turn indicator nothing happens no click noise and no hi beams? How do you check the cause of the check engine light on a 2004 Cadillac?

What is N-level?

What else can I help you with?

Write a program in c to implement the depth first traversal?

Resources

Top Categories

Product

Company