Wednesday, September 23, 2009

Aspirations2020 :INFOSYS campus connect details & resources

The Campus Connect Programming Contest will be held in the following 5 rounds.
  1. Teaser Round
    • Open to all the students of the participating colleges.
    • The 30 top scorers from each college will be recommended by Infosys to form teams for the next rounds.

  2. College Round
    • Open to the teams formed by the selected students from the teaser round from the participating colleges.
    • Top 30 students in each college will be formed into 10 teams of 3 each and each team will participate in this round.
    • 2 teams from each college will be selected for the inter-college round.

  3. Inter-College Round
    • Below teams will be selected based on their performance in the Inter-College round to participate in the DC-Final Round. Short listing of students, In a DC,
    • If there is one zone, 6 best teams will be shortlisted from each zone.
    • If there are 2 zones, 3 best teams will be shortlisted from each zone.
    • If there are 3 zones, 2 best teams will be shortlisted from each zone.
    • If there are 5 zones, 1 best team will be shortlisted from each zone.

  4. DC Finals
    • The DC Finals Round will be organized at Infosys DC(s).
    • Infoscions will proctor the teams.
    • Based on the scores, DC Finals winner and runner up teams will be selected.

  5. National Finals
    • National Finals will be organized at Infosys DC.
    • Infoscions will proctor the teams.
    • Based on the scores, National Finals winner and runner up teams will be selected.


There are 114 Colleges participating in this event from the State of Andhra Pradesh. The Contest will be conducted in five stages.
Registration Start Date September 10th , 2009 -Online at your college
Registration End Date October 15th, 2009
Teaser Round September 10th , 2009 to October 15, 2009-Online at your College
College Round October 25, 2009 to November 15, 2009-Online at your College
Inter – College Round December 15th, 2009 to December 31st, 2009- Online at your College
DC Finals January 2010 -At Infosys DC
National Finals March 2010- At Infosys DC


Campus Connect Online Programming Contest FAQs

How many questions does the participant have to solve in all the rounds?
How many students from each college can participate in the teaser round?
How are students selected for College Round?
Is Teaser round individual or team event?
In which round of programming contest students participate as a team?
Can a team work on more than one DevSquare Application?
Can I attempt the programming contest in more than one language?
How do I know my results?

How many questions does the participant have to solve in the all the rounds?
You can attempt and solve as many questions as possible in the given time. All the rounds will have differential marks for the problems, which would be based on the level of difficulty of the problems.

How many students from each college can participate in the Teaser round?
There is no limit to the number of participants from each college for the Teaser round.

How are students selected for the College Round? Are Teaser round scores considered for the same?
The 30 top scorers from each college will be selected to form 10 teams from a college to go to the college round.

Is Teaser round individual or a team event?
The Teaser round is for an individual. Each individual has to participate separately.

In which round of programming contest students participate as a team?
The participants have to form teams from the College round onwards. A team should have 3 members. Same team need to continue up to National Finals.

Can a team work on more than one DevSquare Application?
Only one DevSquare Application is allowed to be open for a login of team or an individual participant.

Can I attempt the programming contest in more than one language?
You are allowed to attempt the programming contest in ONLY one of the languages for each round.

How do I know my results?
The results will be communicated to your college.The respective coordinator will notify you about the results after every round.



RESOURCES:

  1. DevSquare Resources
  2. Please familiarize yourself with the DevSquare application and the types of questions asked in the contest. This would help you perform better during the actual contest.

    • DevSquare Application:
      You would be new to the DevSquare Application. Thats why we have an array of resources ready for you to get yourself familiarized.
      1. You can go through the flash demos for programming in Java, C/C++ or C#. These flash demos have audio and demonstrates each and every step clearly.
      2. For a quick review of the DevSquare Application, you can check the application screenshots.
      3. You can go through the detailed documentation on the DevSquare Environment .

    • Sample Question and solution:
      You can get an idea of a sample DevSquare question and its solution in Java and C/C++

    • Practice Test:
      To try the DevSquare application, make sure to take a practice test in a language of your choice. Please check that your local browser/security settings are set correctly.

    • DevSquare FAQs:
      If you have any clarifications about the DevSquare application, please review the DevSquare FAQs.

  3. Tutorials & Programming Resources
  4. If you are new to the programming, or, even if you have done programming before, the following tutorials & programming resources will help you sharpen your skills so that you are ready when the contest starts.

  5. Coding Conventions and Standards

Wednesday, September 9, 2009

GATE 2010 syllabus & pattren (updated)

hi friends...GATE2010 notification has came... the pattren of exam has changed..
this info may be useful to you....


Common Component of General Aptitude (GA) introduced in GATE 2010:
Each GATE paper shall have a common General Aptitude (GA) component carrying 15 marks from GATE2010.


you can download the prospectus from here....(click the link below)

gate 2010 prospectus

or from below link
http://groups.google.com/group/qiscet-cse


Computer Science and Information Technology


ENGINEERING MATHEMATICS



Mathematical Logic: Propositional Logic; First Order Logic.

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies: HTML, XML, basic concepts of client-server computing.

Tuesday, September 8, 2009