Skip to content

Commit

Permalink
initial commit
Browse files Browse the repository at this point in the history
  • Loading branch information
sanjaykr5 committed Mar 27, 2019
1 parent c75a817 commit 6177281
Show file tree
Hide file tree
Showing 2 changed files with 34 additions and 0 deletions.
23 changes: 23 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,2 +1,25 @@
# Assignments
repo for assignment submission

# Submission Steps
1. Fork the Assignments Repository.
2. Now clone your forked repo.
3. Commmit/Push your assignment folder to your forked repo.
4. Make the pull request to the main repository.

# Submission Guidelines
1. The directory stucture should be as following:
.
├── Assignments
| ├── assignment_1 (assignment number)
| ├── x ( x is your assignment folder with your name)
| ├──readme.md
| └──(project files)....
| ├── y (y is another person's assignment folder with his name)
| ├── readme.md containing problem statement
| └──...
| ├── assignment_2
| └──....
├──readme.md

2. Try not to make any changes in another person's folder and maintain the directory stucture.
11 changes: 11 additions & 0 deletions assignment_2/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
# Problem Statement: Train a model to print the first `n` elements of the Fibonacci sequence starting at integers `a` and `b`. Note that `a` < `b`, and `n` <= 100 are user supplied arguments. You may not use the standard summing operation to print the next element.Example I/O:
Input: a=5, b=7, n=5
Output: 5, 7, 12, 19, 31
Input: a=7, b=41, n=6
Output: 7, 41, 49, 90, 139, 229

##
Submission Guidelines
1. Make a proper readme.md including the approach, dataset, model, experiments, results and steps to run the project.
2. Include requirement.txt file.
3. Make a predict.py file in which a user will input a,b,n and get the results.

0 comments on commit 6177281

Please sign in to comment.