Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8038659
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T03:18:20+00:00 2026-06-05T03:18:20+00:00

I have a hashmap where I am reading a text file and storing the

  • 0

I have a hashmap where I am reading a text file and storing the unique words into key and the number of frequency of that specific word in another textfile in the value field.

Now, I have to keep track of the probability of the word occurring in another text file. I don’t need to know how to calculate the probability, but however, what I need to figure out is, how do I store the probability associated with every key (word) when the value field is already taken (frequency of words).

Do you suggest I make another hashmap with the same keys but replace the values with the probability?
Thanks!

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-05T03:18:22+00:00Added an answer on June 5, 2026 at 3:18 am

    You should make a class that holds both pieces of information, and store that class in a single hashmap.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a HashMap where the key is a word and the value is
I have a hashmap with some information(key and value) in a perl file. I
Im reading values from a file and storing these values in a hashmap, using
I have a HashMap that I'm using in Processing and I'd like to increment
i have a hashmap where every key has many values(stored in a arraylist). How
I have a hashmap that contains multiple string arrays. I am trying to output
I have a HashMap with the addresses and the names of the clients that
If I have a HashMap that looks like this: HashMap<String, MyObject> where the String
i am reading the bytes from binary file and now i have to get
I have hashmap and its keys are like folder/1.txt,folder/2.txt,folder/3.txt and value has these text

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.