Optima’12-NATIONAL INSTIUTE OF TECHNOLOGY
DEPARTMENT OF COMPUTER APPLICATION
venue: NIT TRICHY
OPTIMA is the National Technical Symposium conducted by students of MSc.,(OPERATIONS RESEARCH AND COMPUTER APPLICATION ) to enhance the technical skills in the domain of operations research (OR) and computers.
M.Sc.(Operation Research & Computer Application) is two year postgraduate consisting of four semesters with equal weightage for subjects in the areas of Opeartion Research and Computer Applications. This programme is Unique combination of Operation REsearch,Computer Application and Management subjects.
The programme has two decadeshistory of developement to the present form. In view of current trends and National needs,the M.Sc. in Applied Mathematics has been restructured as M.Sc(OR & CA) in 1993. Subsiquently the curriculum has been revised every year. The objective of the programme is fulfil the emerging need for Operation Research and System Management specialist in Computer Applications. Besides the class room lectures and seminars the students participate in group discussions,project training,guest lectures etc.
BUG WAR (Debugging)
Debugging is an event to find out and correct the errors in the programs. It’s also applicable to fixing all kinds of problems. Your system may have been designed wrong, built wrong, used wrong, or, just plain got broken; in any case, these techniques will help you get to the heart of the problem quickly.
1. Maximum of two members per Team.
2. The event comprises of two rounds
3. The Preliminary round comprises of 25 questions including 5 tie breaker questions.
4. The questions will be from C, C++ and java.
5. Top 6 teams qualify for Finals.
6. The Final round will be coding round.
7. Judges decision will be Final.
1.Only one participant is permitted
2.Time duration for preliminary round is 30 minutes and for final round is 45 minutes
3.Preliminary round may contain multiple choice as well as logic implementation
4.Final round contain code debugging and logic implementation
DESIGN-O-GEMZ (Poster Presentation) :
This is the event for Poster Presentation. This event consists of two processes.
A topic will be given to the participants. They have to create a relevant poster and send it to our mailid:firstname.lastname@example.org. Participants will be shortlisted on the basis of rules and regulations. They will be intimated through mail .
Shortlisted participants should come to OPTIMA’12 with their softcopy and hardcopy of their posters. A topic will be given to them and they have to do it in MS-Paint.
Both the posters will be analysed by the judge and prizes will be given accordingly.
Ø The topic for this event is ‘Humanity attachment to Mother Earth’.
Ø Participants have to send their posters on or before 25th march 2012.
Ø It should be in the format of .psd or .jpg.
Ø Shortlisted participants should come with their softcopy and hardcopy of their posters.
Ø The contestants are required to send only a soft copy of their entry along with an abstract (not more than 100 words) with subject “paper presentation “by our mail id.
Ø Those who are selected will be sent the confirmation to their respective mail id.
Ø Only 20 Entries will be entertained in the first come first serve basis.
Ø Submission Deadline: 25:03:2012
Ø Date of intimation: 28:03:2012
Ø Mail id: email@example.com
Ø Each team/entrant must formally present his or her paper at the day of the event. Presentations must be no longer than 10 minutes (8 min presentation and 2 min queries).
Ø The question-and-answer period will follow the presentation of the paper. Questions may be posted by judges and/or students attending the presentation.
Ø An alarm will be given after 8 minutes.
Ø Bring a soft copy and two hard copies.
Ø Team size is restricted to maximum of two members.
Ø All participants should specify their mail id & contact number
Ø The paper must be typed single-spaced in 12-point Times New Roman or Arial font and be no more than 12 pages. Only text directly related to the item being presented and any accompanying illustration, tables, figures, etc., will count towards the 12-page limit. Title pages, tables of contents, and bibliography or using plagiarized material will be automatically disqualified.
The Topics For the presentation are
2. Fingerprint recognition system by neural networks
3. Mobile computing and wireless communication
4. Embedded web server for remote access
5. Discrete Mathematics in Computer Science
6. Inventory theory
Other paper presentation topics not confined to the above .
VRAGENSPEL is the quiz competetion composed of 3 rounds.It is acombination of both maths and computer science questions.Each teamshould consists of 2 members from a college.There will be elimination on each round based on the scores of the teams.The brief decription about the rounds is as follows:
a)2 members per team
b)50 questions will be asked
c)Each question carries 1 mark
d)Time limit is 60 minutes
ROUND2-ORAL QUESTIONS ROUND:
a)To the shortlisted teams questions will be asked orally and they have to answer it with a time limit of 1 minute.
b)Each correct answer carries 2 marks.
ROUND3-VISUAL QUESTIONS ROUND:
a)Here the shortlisted teams will be provided with pictures visually upon which the questions will be asked.
b)The participants have to answer it within 1 minute.
c)Each correct answer without clues will carry 5 marks.
d)If a team doesnot know the answer they will be provided with clues.Based on the number of clues provided the marks will be reduced .
A solution to solve today’s real life problem or creates new future technology, of real time use by applying Computer Science Technique or Mathematical Technique.
1. There should be Three Participants in a Team.
2. The idea should be more creative and innovative.
3. PowerPoint presentations are not allowed.
4. The idea should be presented manually by using; Thermocol or Objects need to represent your exact
5. Before presenting your idea on the final day, your idea must be mailed to us on or before 25-03-
LOGICIEL – ESILLUS(Software Presentation) :
Problem: Find maximal flow/minimal cut values between all pairs of nodes in a graph
G=(V,E), where n = |V|. Any pair of nodes can serve as the source and the sink.How many min-cut computations are needed ?
This is the Event of Software Presentation. The Participants have to send their source code for the above given problem to the website optima.nitt.edu. Shortlisting will be made based on the rules given below. Shortlisted Participants will be intimated through mail.
ü There should be two participants in the team.
ü Code should be in anyone of the language(C/C++/Java).
ü The Code should be Clear, simple coding, Minimum Time complexity and efficient.
ü Code should have Dynamic Memory Allocation.
ü Bonus mark will be given, if your code includes Graphics representation.
ü Your code should not exceed above 300 lines.
ü Last date for submission:25/03/12
ü Mail id :firstname.lastname@example.org
Your code should be work with the following platform
For C and C++: Dev C++
For Java: jdk1.6.0_25
(No further software will be provided)
for more details contact us
Send your full papers with abstracts to both event email id as well as one CC copy to our email id email@example.com for our reference
More Information Please Click here
Note: When submitting your papers please type subject name as technicalsymposium.com and Your Paper title.
(Because then only all college students&staffs will know our website and our free services.So please type.Thank you)
Source:Information(s) Provided By mscorca10 team