answersLogoWhite

0


Best Answer

In this Method number of operations are counted. The actual time is proportional to this count.

The highest order of the frequency count variable in the total time expression is known as Order of the complexity denoted by Big Oh notation i.e O().

Less the order of complexity , more efficient is the algorithm.

Vinay kr. sharma

(Mtech)

(Sr. Faculty in Uptron Acl- South x-I)

User Avatar

Wiki User

11y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

12y ago

How much time a particular instruction will execute is frequency count.

for whole algorithm it is sum of all step's frequency.

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

nobody knows...

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is a frequency count in data structure?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What are the subject-matters of data structure?

types of data structure types of data structure


How do you amend a data structure?

How do you amend a data structure?


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is a homogeneous data structure and why is this a weakness for RDBMS?

in homogeneous data structure all the elements of same data types known as homogeneous data structure. example:- array


You need a sample code of word frequency count in c plus plus?

For this you will need a node structure that stores a word and its frequency. The frequency is initially 1 (one), and the constructor should just accept the word. You then create a list from this structure. As you parse the text, extract each word and search the list. If the word does not exist, push a new structure for the word onto the list, otherwise increment the frequency for the word. When you've parsed the file, you will have your frequency count for each word in the list. The basic structure for each node is as follows (you may wish to embellish it further by encapsulating the word and its frequency). struct node { std::string m_word; unsigned long long m_freq; node(std::string wrd): m_word(wrd), m_freq(1) {} }; When parsing your text, remember to ignore whitespace and punctuation unless it is part of the word (such as contractions like "wouldn't"). You should also ignore capitalisation unless you wish to treat words like "This" and "this" as being separate words.

Related questions

What are the subject-matters of data structure?

types of data structure types of data structure


What is an 'ungrouped frequency table'?

A frequency distribution of numerical data where the raw data is not grouped.


Can frequency distribution contain qualitative data?

frequency distribution contain qualitative data


What is the data item with the greatest frequency called?

The data item with the greatest frequency is the mode.


What has the author Roy E Leake written?

Roy E. Leake has written: 'Alphabetic word list with frequency count (raw data)' 'Word list classified alphabetically' 'Word list in order of descending frequency'


The number of times a data occurs?

the answer is frequency. the answer is frequency.


What is a diagram that shows the frequency of data?

A frequency diagram!


How do you amend a data structure?

How do you amend a data structure?


What is homogeneous data structure?

collection of dissimilar type of data is called non homogeneous data structure as for example structure .


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


If a coin is flipped 5 times and a head comes up 3 times what is the relative frequency of a head coming up?

A frequency count is a measure of the number of times that an event occurs. To compute relative frequency, one obtains a frequency count for the total population and a frequency count for a subgroup of the population. ... Thus, a relative frequency of 0.50 is equivalent to a percentage of 50%. 0.60 or 60 percent.


What is the weakness of Data structure diagram?

weakness of data structure diagrams