Tuesday, January 2, 2018

Punjab Govt Pooled B.Tech Drive - 18th & 19th JAN 2018 @ SBSSTC, Ferozepur

Greetings from Wipro!

We are glad to inform you that we are organizing Punjab Govt Pooled B.Tech 2018 drive to be held at SBSSTC , Ferozepur on the 18th and 19th Jan 2018.

In continuation with the long lasting relationship that we have with your institute, we would like you to participate in this pooled campus placements of the 2018 Engineering Graduates.

Please find below the eligibility criteria and the selection process for this season.

Qualification: BE/B Tech
Year of Passing: 2018
Gaps: Maximum 3 years
Backlogs: No backlogs
Streams: CS/IT, Circuital(Electrical, Electronics, Instrumentation), Mechanical/Automobile/Production
Eligibility: 10th – 60%       12th – 60%          UG   - 65%**
Selection Process: Online Assessment(Verbal, Analytical, Coding, Written communication test) =>> Technical Interview =>> HR Interview

PFA the process note for the detailed coding syllabus.

Registration Link would be shared soon.

Some important guidelines while registering are as follows:
v  Complete the registration through desktop/laptop only ( Kindly ensure smart phones are not used for this purpose )

v  In the SSLC Marksheet Registration Number column , write the 10th class roll no.

v  If the field is not applicable write NA in the respective field.

v  Students those who don’t have the last name , please write NA in last name field

v  Once the form is filled please save and ensure the profile percentage on the top of registration page is 100% and then only go for submission

Please ensure the registration completes 2 days prior to the event
**Please note in case of CGPA Marks, 65% should be met as per the conversion norms of the Board/ University (6.5 CGPA will not be considered as 65%)

Kindly let me know for any clarifications.

http://marketing.wiprodigital.com/apps/wipro-esig/assets/images/logo-01.png
Vikram Goyal
Recruitment Lead
Global Campus Hiring Team
Wipro Limited
Plot No 480-481, Udyog Vihar, Phase – III, Gurgaon – 122016, India



cid:image002.png@01D2EF40.83A5C3F0
cid:image003.png@01D2EF40.83A5C3F0
                         Wipro Campus Hiring Process Note -Engineering
cid:image004.png@01D2EF40.83A5C3F0
cid:image002.png@01D2EF40.83A5C3F0
cid:image005.png@01D2EF40.83A5C3F0

Dear Academic Partner,

Greetings from Wipro!

As per our previous email communication, sharing you the curriculum for the coding segment of our online assessment.


Data Structure Concepts




          Array and Matrices
1D array
Array Rotations
Arrangement and rearrangement of elements of array
Properties of matrices
Strassen’s algorithm for matrix multiplication
Inverting matrices
Transpose of the matrix

                Linked list
Basic operations on linked list
Circular linked list
Doubly linked list


                     Tree
Binary Tree
Binary Search tree
n-ary Tree
Heap





                     Graph
Basic graph concepts
BFS
DFS
Undirected graph, directed graph
Minimum Spanning tree
Shortest path algorithm
Topological sort
Connectivity in the graph
    String processing and manipulation
Basic string operations
Pattern searching


                Stack/Queue
Basic stack operations
Basic queue operations
Application of stack
Application of queue

        Sorting and Searching
linear and binary search
various sorting concepts

  
Advanced Design and Analysis Techniques




Dynamic Programming
Overlapping Subproblems Property
Optimal Substructure Property
Longest Common Subsequence
Longest Common Substring
Optimal binary search trees
Matrix-chain multiplication
0 1 knapsack


           Greedy Algorithms
activity-selection problem
Huffman codes
task-scheduling problem
fractional knapsack

Minimum Spanning Trees
Kruskal
Prim


Shortest Paths Algorithms
Bellman-Ford algorithm
Single-source shortest paths in directed acyclic graphs
Dijkstra’s algorithm
Johnson’s algorithm


      String Matching
The naive string-matching algorithm
The Rabin-Karp algorithm
Knuth-Morris-Pratt algorithm
Manacher algorithm

         Divide and Conquer
Sorting algorithms
Binary Search

Disjoint Sets
Disjoint-set operations
Disjoint-set forests


Computational Geometry
Line-segment properties
Intersection of line segment
Finding the convex hull
Closest pair of points


Wishing you a very successful hiring season ahead.

Regards,
Lavanam Amballa | National Campus Manager | Talent Acquisition | Wipro Ltd.,
+91 897 13 88840  | lavanam.amballa@wipro.com

cid:image002.png@01D2EF40.83A5C3F0


id:image008.jpg@01D2C812.E8F73F90

id:image009.jpg@01D2C812.E8F73F90
id:image010.jpg@01D2C812.E8F73F90
id:image011.jpg@01D2C812.E8F73F90
id:image012.jpg@01D2C812.E8F73F90











cid:image002.png@01D2EF40.83A5C3F0
cid:image003.png@01D2EF40.83A5C3F0
                         Wipro Campus Hiring Process Note -Engineering
cid:image004.png@01D2EF40.83A5C3F0
cid:image002.png@01D2EF40.83A5C3F0
cid:image005.png@01D2EF40.83A5C3F0

Dear Academic Partner,

Greetings from Wipro!

We are glad to announce the onset of the Engineering Campus Hiring Season 2017-18 from the month of September. We would like to keep you informed about the changes we made in the eligibility criteria and the selection process for the upcoming hiring season.

The changes that have been made are aligned to hire candidates who have a flair for coding. To provide clarity on the same we will further communicate to you with a detailed content note so that you may prepare the aspiring students accordingly.


Details about the hiring is given below :

cid:image006.jpg@01D31291.9D84F290
  
Wishing you a very successful hiring season ahead.

Regards,
Lavanam Amballa | National Campus Manager | Talent Acquisition | Wipro Ltd.,
+91 897 13 88840  | lavanam.amballa@wipro.com

cid:image002.png@01D2EF40.83A5C3F0


id:image008.jpg@01D2C812.E8F73F90

id:image009.jpg@01D2C812.E8F73F90
id:image010.jpg@01D2C812.E8F73F90
id:image011.jpg@01D2C812.E8F73F90
id:image012.jpg@01D2C812.E8F73F90










*THIS INFORMATION IS EXLUSIVELY FOR MIMIT STUDENTS ONLY Regards Training and Placement Cell MIMIT Malout