Write an algorithm to find outputs number of cars, Data Structure & Algorithms

Assignment Help:

A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted during survey.

Write an algorithm, using an algorithm, that:

inputs all 10000 responses
Outputs number of cars, buses and Lorries that passed by the junction during survey
Outputs number of vehicles which weren't cars, buses or Lorries during survey

Related Discussions:- Write an algorithm to find outputs number of cars

Data communication, #question.explain different types of errors in data tra...

#question.explain different types of errors in data transmission.

Tape sort based on fibonacci distribution, how does we get fibonacci table ...

how does we get fibonacci table in tape sort

Binary tree creation, Binary tree creation struct NODE { struct N...

Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new ) { if(new->val

What are the dynamic arrays, What are the Dynamic arrays Dynamic arrays...

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Explain in brief the asymptotic notations, Question 1 Write the different ...

Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e

Explain what is stack. describe ways to execute stack. , ST AC K is ...

ST AC K is explained as follows : A stack is one of the most usually used data structure. A stack is also called a Last-In-First-Out (LIFO) system, is a linear list in

Red black tree, red black tree construction for 4,5,6,7,8,9

red black tree construction for 4,5,6,7,8,9

Define linked list ?, Linked lists are among the most common and easiest da...

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

Order os quick sort in worst case, In worst case Quick Sort has order O...

In worst case Quick Sort has order O (n 2 /2)

Circular linked list, In a circular linked list There is no beginning a...

In a circular linked list There is no beginning and no end.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages