Introduction
Infosys is well-known worldwide for its technology consulting, analysis, and services. In every project they undertake, they emphasize digital transformation and innovation. Their knowledge and reputation make their competition a must-see for every coder.
When Infosys holds a #HackWithInfy challenge to identify the developer who can break them all, it's a whole new universe. This program allows you to put your creative thinking and problem-solving abilities to the test. It's like being in a room full of the top programmers from across the country, and you get to compete against them to test your programming skills.
Infosys' InfyTQ is a next-generation learning and engagement platform for engineering students in India, designed to help them improve their technology quotient and graduate industry-ready. Infosys, a pioneer in transforming fresh campus recruits into quality software professionals through its world-renowned training program, has launched InfyTQ to allow students to interact closely with the company while studying technologies that are important for today and tomorrow. Through a continual transfer of digital skills and expertise from the Infosys innovation ecosystem, students can benefit from the always-on, anytime-anywhere learning provided by InfyTQ.
This blog will give you a complete syllabus analysis for HWI.
Syllabus
There are three online rounds of the competition. It is only open to a few Indian universities and colleges. The Infosys Syllabus 2022 does not include any specific disciplines.
Round 1 and round 2 includes 3 coding problems, and the questions are based on these critical topics-
Analysis of Algorithms:
- Growth of functions
- Asymptotic Notations
- Recursion
- Space Complexity
Arrays:
-
Array Operations
- Insertion
- Deletion
- Reversal
- Sort
Hashing:
- Introduction to Hashing
- Direct Address Table
- Collision Handling
- Chaining
- Open Addressing
- Double Hashing, Chaining Vs. Open Addressing
String Manipulation:
- Changing
- Slicing
- Pasting
- Analysis of strings
Sorting:
- Stability in Sorting Algorithm
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Different Partition Schemes in QuickSort, MergeSort, Heap Sort, Counting Sort, Radix Sort, Bucket Sort
Searching:
- Linear Search,
- Binary Search (Iterative and Recursive)
Linked List:
- Drawbacks of Arrays,
- Introduction to Linked List and Implementation
- Application of Linked List
- Traversal
- Insertion
- Deletion
- Reversal(Iterative and Recursive)
Circular Linked List:
- Traversal, Insertion (Head, End),
- Deletion (Head, Kth Node)
Doubly Linked List:
- Traversal, Insertion (Head, End)
- Deletion (Head, End)
- Reversal
- Circular Doubly Linked List
Stack:
- Introduction to Stack Data Structure
- Implement using an array
- Implementation using Linked List
- Stack Applications.
Queue:
- Introduction to Queue Data Structure
- Implementation using an array
- Implementation using Linked List.
Dequeue:
- Introduction to Deque Data Structure
- Implementations using Array
- Implementation using Linked List
Tree:
- Implementation
- Traversals: preorder, postorder, inorder, level order(Iterative & Recursive)
- Construction & Conversion
- Binary Tree: Height, Size, Level
BST:
- Implementation
- Search
- Insertion
- Deletion
- Self Balancing BST
- AVL Tree (Introduction and applications)
- Red-Black Tree (Introduction and applications)
- Applications of BST
Heap:
- Implementation
- Insertion
- Heapify
- Extract in Heap
- Delete
- Build Heap
Note: The difficulty level rises with each round, meaning Round 1 is the easiest level, and the Top 7000 students get to qualify for Round 2.
Based on previous year's Hack With Infy competition analysis, the guide to Infosys Syllabus 2022 also includes the following subjects which help achieve success in round-2 :
Data Structures: Recognising types of data and analyzing which operations can take place on them.
Hashing Concepts: The process of transforming a given key into a smaller value for O(1) retrieval time is known as hashing. This is accomplished by using a function or technique known as a hash function to translate data to an encrypted or simplified representative value known as a "hash code" or "hash."
Game Theory: The process of modeling strategic interaction between two or more players. It is the study of how interacting choices of economic actors produce results that are related to the preferences (or utility) of those agents, even if none of the agents intended the outcomes in the issue.
Mathematical coding problems: It helps to modify, innovate, and form abstract concepts. Examples could be GCD and LCM, Prime Factorization and Divisors, Fibonacci Numbers, Catalan Numbers, Modular Arithmetic, etc.
8+ registered 