WIPRO Hiring Freshers-Candidates Registration Link for Freshers

Fresher Batch WIPRO Eligibility Criteria

1. EDUCATION QUALIFICATION: BE/B.Tech /MCA

2. ACADEMIC PERCENTAGE: EQUAL TO OR ABOVE 60% IN 10TH, 12TH AND IN GRADUATION

3. ADDITIONAL REQUIREMENT: SHOULD HAVE STUDIED MATHEMATICS IN 12TH.

4. A BACKGROUND IN MATHS OR SCIENCE IS A MUST IN DEGREE

5. NOT MORE THEN ONE YEAR OF GAP BETWEEN YEARS OF STUDY.

WASE ENTRANCE EXAM (WET)

THE WRITTEN TEST IS AGAIN 90 MINUTES OF VERBAL, ANALYTICAL AND MATHEMATICS.

QUESTIONS ON TRIGONOMETRY, CALCULUS, DIFFERENTIATION, ALGEBRA, INTEGRATION,

MATRICES, COORDINATE GEOMETRY IS ASKED.

-THIS IS FOLLOWED BY THE HR INTERVIEW.

Wipro campus recruitment Criteria

Registration Details , Eligibility Criteria For Placement in WIPRO 2016 :

MORE THAN 60% IN BE/B.Tech .

MORE THAN 60% IN 10TH AND 12TH .

TEST – THE WIPRO TEST CONSISTS OF 3 SECTIONS NAMELY ANALYTICAL, VERBAL AND TECHNICAL.

TIME – 60 MINUTES

STYLE – THE TEST IS USUALLY CONDUCTED ONLINE.

INTERVIEW – TECHNICAL INTERVIEW AND HR

Comments

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION HTML CSS WEB APPLICATION FUNDAMENTALS Unit II XML Unit III JQuery JSON Java Script Unit IV AngularJS Unit V MEAN Stack SMACK Stack LAB PROGRAMS: Click Here Important Question for MID I : Click here WAD Previous Question : Click Here TEXT BOOK: Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective: Ø To develop dynamic web applications using the concepts of HTML 5.0 and CSS Ø To understand the document structure and schemas and represent data in t...

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester (A & B Sections) –PC 603 CS Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Why is an algorithm analysis required? 2. State about UNION & FIND operations. 3. List out the UNION algorithm using weighting rule. 4. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5. List and define operations performed on sets? 6. What do you mean by performance analysis of an algorithm? Explain. 7. ...

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Explain linear probing in Hashing with an example. 2. Define Heap. 3. List out the collision resolution techniques in hashing. 4. Why is an algorithm analysis required? 5. State about UNION & FIND operations. 6. List out the UNION algorithm using weighting rule. 7. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8. List and define operations performed on sets? 9. What do you mean by performance analysi...

Best Information for Learners

Search This Blog