Scribd
Upload
135 views

Python Assignment

The document describes an online debate portal application that allows registered users to participate in debates on various topics. It outlines the key modules and constraints of the application, including user roles and permissions, debate functionality, and user profiles. It also provides details on tasks for the assignment, such as creating an architecture diagram, database schema, class structure, and prototype GUI.

Uploaded by

ABHIJEET RAI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
135 views

Python Assignment

The document describes an online debate portal application that allows registered users to participate in debates on various topics. It outlines the key modules and constraints of the application, including user roles and permissions, debate functionality, and user profiles. It also provides details on tasks for the assignment, such as creating an architecture diagram, database schema, class structure, and prototype GUI.

Uploaded by

ABHIJEET RAI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Python Assignment

Question1. Online Debate Portal

Application: Online Debate Portal


=================================

Application Summary: ODP is an open web based debate portal, where registered users can
start debating (for the motion or against the motion) on a provided list of running debates.

Application Modules:
· Debate List
· User Profile
· Debate Result

Application Constraints:
· Application will have ACL based on user roles.
· Application will support Administrator, Moderator, Debater and Guest roles
· Application will only allow registered and logged in users to debate
· Guest users can only read the debates list but cannot participate in any debate
· Moderators will be responsible for maintaining the debate content, manage an altercation,
keeping track of user infractions and banning a volatile user
· Administrators can post a new debate topic, close an old topic, add or delete a user, assign
user a particular role, choose the winners of a debate, close a running debate and if required
open a closed debate
· Debaters will be able to post their views over a debate, they can challenge another debater
over any running debate topic, can choose the debate side (for the motion or against the
motion) once per debate topic.
· Debates will be one on one, if the participants changes the same debate topic will host a new
debate automatically
· Other debaters can vote up or vote down a debater's point of view
· User profile will be visible to all, and it will carry information regarding, debates participated in,
debates won, debates lost, points earned
· A user with good number of points will be chosen as moderator by the site administrator
· Debater can suggest a new debate topic
· Debaters should be searchable
· Debate List should be searchable

Assignment Details:
· Draw and Application Architecture for the Debate Portal
· Class diagram for the Application
· Draw an ER schema OR Database Schema OR Database Diagrams
· Draw a Class Structure OR UML diagram
· Clearly write all the possible functions or API definition
· Draw a workflow OR flowchart for the application
· Prototype the Application GUI
· Project plan and timelines are worked upon

Question 2. Programming

Mr. Walker is a person who is known for his ability to walk fast. He accepts an attractive offer to
get as much free land as he can cover by a walk on an open uneven huge piece of land within a
specified time and following certain conditions. A walk is a sequence of paths, starting at a
marked spot on the land and ending at the same spot where the walk starts. The first path in a
walk begins at the marked spot and extends in one of the four directions: North (N), South (S),
East (E) or West (W). It ends at the point where the direction changes. Each of the other
paths in a walk begins at the point where the previous path ends and ends either at a
point where the direction changes or when the walk ends. Mr. Walker may change directions, as
and when he feels like, depending on the constraint of time and/or quality/quantity of
the land he decides to get. When he changes a direction he must keep the direction
always to one of the four directions N, S, E or W. Paths are distinct and
nonintersecting; for example, a path in E or W direction cannot cross another in N or S
direction.
Given a walk, you are required to write a program that finds the area of land covered by the
walk.

Input (Question 2.in)


The input consists of multiple test cases.
First line will be number of test cases, followed by the test cases, one per line.
The line gives a walk defined by a sequence of paths. A direction followed, without any space,
by a distance represents a path. A direction is denoted by one of the four letters N, S, E or W
while a distance is measured in meters and is denoted by an integer.
A space character appears between two paths in the given sequence.

Output (Question 2.out)


For each test case print the area of land covered by the given walk.

Sample Input
3
N3 W4 S8 E4 N5
W6 N2 E9 S6 W3 N4
W6 N2 W3 S4 W5 S4 E14 N6
Sample Output
3
Case #1 = 32
Case #1 = 30
Case #1 = 80

You might also like