Skip to content

This is the first project in the course Data Structures & Algorithms Nanodegree Program with Udacity.

Notifications You must be signed in to change notification settings

Weaam20/Unscramble_Computer_Science_Problems_Udacity

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project 1 | Unscramble Computer Science Problems

Description :

In this project, we have two .csv files we have to do some tasks on these files.

The files :

  • The first file (calls.csv) contains (5213) records of all calls with caller and receiver numbers the date and time of the call and the number of seconds spent on the call.
  • The second file (texts.csv) contains (9072) records of all texts with sender and receiver number and the date of the message.

The tasks :

  • Task 0 : What is the first record of texts? what is the last record of calls?

  • Task 1 : How many different telephone numbers are there in the records?

  • Task 2 : What is the number of the longest call that received during a period of time?

  • Task 3 :

    • Part A : Find all of the area codes and mobile prefixes called by people in Bangalore.

    • Part B : What is the percentage of calls from fixed lines in Bangalore to fixed lines as well in Bangalore?

  • Task 4 : The telephone company wants to identify numbers that might be doing telephone marketing. Create a set of possible telemarketers these are numbers that make outgoing calls but never send texts, receive texts or receive incoming calls.

About

This is the first project in the course Data Structures & Algorithms Nanodegree Program with Udacity.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages