From 6177281a42590c7d81fadeac920fbc19319c151d Mon Sep 17 00:00:00 2001 From: sanjaykr5 Date: Wed, 27 Mar 2019 21:51:57 +0530 Subject: [PATCH] initial commit --- README.md | 23 +++++++++++++++++++++++ assignment_2/README.md | 11 +++++++++++ 2 files changed, 34 insertions(+) create mode 100644 assignment_2/README.md diff --git a/README.md b/README.md index 0d59e26..201d04d 100644 --- a/README.md +++ b/README.md @@ -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. diff --git a/assignment_2/README.md b/assignment_2/README.md new file mode 100644 index 0000000..97f659a --- /dev/null +++ b/assignment_2/README.md @@ -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.