Scribd
Upload
36 views

Specialist Programmer

The document discusses how to prepare for an Infosys online test. It provides details on the test format, including three questions of varying difficulties to be completed in three hours. It also gives information on how to prepare for each difficulty level, with easy questions involving greedy algorithms, medium involving dynamic programming, and hard requiring further dynamic programming skills.

Uploaded by

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

Specialist Programmer

The document discusses how to prepare for an Infosys online test. It provides details on the test format, including three questions of varying difficulties to be completed in three hours. It also gives information on how to prepare for each difficulty level, with easy questions involving greedy algorithms, medium involving dynamic programming, and hard requiring further dynamic programming skills.

Uploaded by

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

INFOSYS ONLINE TEST

TEST FORMAT
Test will contain 3 questions that will have to be solved in 3 hours
Test will have sectional cut-off as well as total cut-off
Each question will belong to a different difficulty level:
Easy – Simple questions that can be solved by basic application of aptitude
and all the test cases should pass (Greedy Algorithms)
Medium – Usually a question based on Dynamic Programming
Hard – Usually a question based on Dynamic Programming
Code can be written for each question using one of the programming
languages from C/C++/C#/Java/Python/JavaScript

1
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - EASY
A Greedy algorithm is any algorithm that follows the problem-solving
heuristic of making the locally optimal choice at each stage

Types of Greedy algorithm:

1. Pure greedy algorithms


2. Orthogonal greedy algorithms
3. Relaxed greedy algorithms

Check out GeeksforGeeks portal to learn more about Greedy algorithms:


https://www.geeksforgeeks.org/greedy-algorithms

2
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - HARD
Dynamic Programming (DP) is an algorithmic technique for solving an
optimization problem by breaking it down into simpler subproblems and
utilizing the fact that the optimal solution to the overall problem depends
upon the optimal solution to its subproblems.

Principles of Dynamic Programming:


• Breaking the problem down into subproblems and calculating their
values. Next time, upon encountering the same subproblem, the value
can be reused instead of recalculation
• Avoid repeated work by remembering partial results, a common
approach for performance enhancement

3
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - HARD
Characteristics of a Dynamic Programming problem

Following are the two main properties of a problem that suggest the given
problem can be solved using Dynamic Programming:

1. Overlapping subproblems
A problem has overlapping sub-problems if its solution involves solving the
same subproblem multiple times.
2. Optimal substructure properties
The overall optimal solution can be constructed from the optimal solutions
of its subproblems.

4
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - HARD
Dynamic Programming methods
There are two different ways to store values for an overlapping
subproblem so that the values can be reused:
1. Top-down with Memorization
To solve a bigger problem, in this approach we recursively find the solution
to the smaller sub-problems and its result is cached. So next time the same
sub-problem is tried to solve, the cached memorized result is returned.
2. Bottom-up with Tabulation
In this approach, we solve the problem “bottoms-up” i.e., by filling up an
n-dimensional table. Based on the results in the table, the solution to the
top/original problem is then computed.

5
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - HARD
Some examples of Dynamic Programming
• Knapsack problem
• Fibonacci Numbers
• Palindromic Subsequence
• Longest Common Substring
• Dijkstra's algorithm

Check out GeeksforGeeks portal to learn more about DP:


https://www.geeksforgeeks.org/dynamic-programming

6
INFOSYS ONLINE TEST – HOW TO PREPARE
DIFFICULTY OF QUESTION - HARD

7
INFOSYS VIRTUAL INTERVIEW
This round will access your technical and behavioral skills.
STRUCTURE
Total duration will be around 1 hour

You will have to solve a problem based on algorithms using language of


your choice

Students from CS/IT branch might be tested on: Algorithms, Data


structures, Automata theory, Compiler, Computer Network, Computer
Organization, Operating Systems, Digital Signal Processing and Object-
oriented programming

Students from other branches might be tested on: Algorithms, Data


structures, Computer Network, Digital Electronics, Digital Signal
Processing, Mathematics, Object-oriented programming and Control
8
system
Process for the Hubli DC hiring program
1. One hour connect every week between 4:00 P.M to 5:00 P.M

2. Before each connect, topic relevant to the connect will be shared.


Students are expected read and come about the topic.

3. The connect will concentrate on problem solving and how to approach


the problems on the topic.

4. At the end of each session, we will share f the problem statement which
students can solve on platform.

5. Student can practice other problems also of similar topics and come
with questions or mail the questions before the session.

6. It is advisable that student spend at least 2hrs a day, every day to brush
up and prepare.
9
Data Structures
•Array, Linkedlist, Dictionary (Map), Queue, Stack, Sets
and other basic data structures
•Segment tree​
•Fenwick tree (or suffix array)​
•Red-Black tree​
•Radix tree​
•KD tree​
•B, B+ tree​
•Any other on similar lines

10
A DP problems
• Backtracking
• Bit-mask
• Hashing
• Lazy propagation
• Prefix sum
• Experimental
• Sum over subsets
• MO's algorithm
• Graph theory
• Graph families e.g., Bi-partite, flow networks
• Any other on similar lines

11

You might also like