WIPRO

About wipro
Wipro Limited is a leading global information
technology, consulting and business process services
company.
Selection Process
Every eligible candidate must go through below online
assessment, below details appended for your
reference.
Online Assessment comprising of 3 sections:
Verbal & Analytical Aptitude Test
(30 questions/ 45 minutes)
Programming Test (45 minutes) This test will help us assess
the skillset of a candidate to diagnose and identify any bugs in
a given code and fix them. The Programming Test will be
based on following types of questions/ problems: Syntactical
error correction i.e. to correct the syntax of the given code
without changing its logic.
Logical error correction i.e. to fix all logical errors in the given
code.
Code reuse i.e. to complete the given code by reusing existing
functions/ helper code.
Please note: Earlier Programming Test pattern, preset in a
simulated environment wherein candidates were evaluated on
their ability to write the program in any of the programming
languages, compile and run test cases, is no longer applicable.
It has been revised as per above guidelines.
 Written Communication Test (20 minutes)
Upon selection in the Online Assessment, candidates will be
required to go through Technical Interview followed by HR
interview.

Upon selection in the Online Assessment, candidates will be

required to go through Technical Interview followed by HR
interview.

Ref: https://careers.wipro.com/campus-engineering.aspx
Wipro Elite NLTH 2019 Recruitment
Wipro brings a great opportunity for all the 2019 Batch
Freshers through the Elite National Level Talent Hunt 2019
(NLTH).
Furthermore, this Wipro Elite NLTH 2019 is a fresher’s hiring
leadership to invite all the best students to their organization
among our country.
 Wipro NLTH 2019 Recruitment Overview
Name of the Company Wipro
Name Of The Event Elite National Level Talent Hunt 2019 (NLTH)
Year Of Passing 2019 Pass outs

Qualification BE, B.Tech, 5 Year Integrated – M.Tech

Designation Project Engineer

Experience Freshers
Branch Of Study All Streams
Category IT Jobs
Venue Name Wipro Hiring
Official Website www.wipro.com
Wipro Elite NLTH Eligibility Criteria
candidates who fulfill the below conditions can apply for this Wipro Elite NLTH
Recruitment 2019 Freshers.
10th Standard: 60% or above
12th Standard: 60% or above
Graduation: 60% or CGPA Equivalent to 60% or above as applicable by the university
guidelines.
Wipro Elite NLTH Selection Process

Online Assessment Test

Technical Interview
HR Interview
 Wipro Elite NLTH 2019 Syllabus & Test
Pattern
. Wipro Elite NLTH 2019 – Online Assessment Test Pattern
Name Topics Duration
Logical Ability, Quantitative
Aptitude Test 60 Minutes
Ability, English (Verbal) Ability
Two programs for Coding
(Candidate can choose any one
Programming Test of programming language for 60 Minutes
coding test: Java, C, C++ or
Python)
Written Communication test Essay writing 20 Minutes

Ref: https://www.freshersnow.com/wipro-elite-nlth/
 Wipro Computer Programming Syllabus

Marks not considered for wipro. but if you give AMCAT OOPs
off Campus you may choose to give this test, some
other companies may consider your score for this ◦ Polymorphism
section
◦ Abstraction
Basic Programming ◦ Encapsulation
◦ Data Types ◦ Complexity Theory
◦ Iteration, Recursion, Decision
◦ Procedure, functions and scope
Data Structures
◦ Arrays, Linked Lists, Trees, Graphs
◦ Stacks, Queues
◦ Hash Tables
◦ Heaps
◦ Searching and Sorting

Ref: https://prepinsta.com/wipro-syllabus/
Wipro Written Test Cut off via AMCAT scores 2019

Wipro AMCAT
Score based
Call <60 <70 <80 <90 95
Expectancy vs
Percentile
Verbal 13 Ques 16 Ques 18 Ques 20 Ques 21 Ques
Aptitude 10 Ques 12 Ques 15 Ques 16 Ques 17 Ques
Logical 10 Ques 11 Ques 12 Ques 14 Ques 16 Ques
1 Full and 1
Coding 0 Outputs 1 Partial 1 Full 2 Full
Partial
Written
English(Marks 5 6 7 8 9
in 10)
Thank you
String Question
Strings
A string is a sequence of characters treated as a group.
Representing strings in C
◦ stored in arrays of characters
◦ array can be of any length
◦ end of string is indicated by a delimiter, the zero character ‘\0’

"A String" A S t r i n g \0
Changing String Variables
Cannot change space string variables connected to, but can use
pointer variables that can be changed
Example:
char *str1 = “hello”; /* str1 unchangeable */
char *str2 = “goodbye”; /* str2 unchangeable */
char *str3; /* Not tied to space */
str3 = str1; /* str3 points to same space s1 connected to */
str3 = str2;
Changing String Variables (cont)
Can change parts of a string variable
char str1[6] = “hello”;
str1[0] = ‘y’;
/* str1 is now “yello” */
str1[4] = ‘\0’;
/* str1 is now “yell” */
Important to retain delimiter (replacing str1[5] in the original string
with something other than ‘\0’ makes a string that does not end)
Have to stay within limits of array
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i;
for(i=0;i<11;i=i+2)
printf("\n%c","Hello world!"[i] );
return 0;
}
1. Program to find the frequency of characters in a string. Given a string,
the frequency of occurrence of each character is displayed as output.

Input Format:
Input consists of 1 string.

Sample Input & Output:

Input: google
Output:
e1
g2
l1
o2
/* C Program to Find the Frequency of
Characters in a String */
#include <stdio.h>
#include <string.h>
int main()
{ for(i = 0; i < 256; i++)
char str[100]; {
int i; if(freq[i] != 0)
int freq[256] = {0}; {
gets(str); printf(“%c %d\n”, i, freq[i]);
}
}
for(i = 0; str[i] != ‘\0’; i++)
{ return 0;
freq[str[i]]++; }
}
2. Write a program to Find the highest occurrences of a character in the String.

Input String : National

Output: a=2

Input String : $money$

Output: $=2
/* C Program to Find the highest occurance of Characters in a pos = str[0];
String */
for(i = 0; i < 256; i++)
#include <stdio.h>
{
#include <string.h>
if(freq[i] != 0)
int main()
{
{
printf("%c %d\n", i, freq[i]);
char str[100];
}
int i;
if ( most < freq[i])
int freq[256] = {0};
{
gets(str);
most = freq[i];
for(i = 0; str[i] != '\0'; i++)
pos = (char)i ;
{
}
freq[str[i]]++;
}
}
printf("%c = %d", pos,most);
int most;
return 0;
char pos;
}
most = freq[str[0]];
3. Program to check if two strings are anagrams or not. Two strings are given as input
and those strings have to be checked if they are anagrams or not.
Anagram means that both strings contain the same character set, only their order is
different. Therefore, in both strings, the frequency of each letter must be the same. For
example, strings “act” and “cat” are anagrams.

Input: Enter two string?

act
cat
Output : Anagrams

Input: Enter two string?

cool
fool
Output : Not Anagrams
#include <stdio.h> int check_anagram(char a[], char b[]) c++;
#include <string.h> { }
int check_anagram(char [], char []); int first[26] = {0}, second[26] = {0}, // Comparing frequency of
c=0; characters
int main()
// Calculating frequency of for (c = 0; c < 26; c++)
{ characters of first string
{
char a[100], b[100]; while (a[c] != '\0')
if (first[c] != second[c])
printf("Enter two strings : \n"); {
return 0;
gets(a); first[ a[c]-'a‘ ]++;
}
gets(b); c++;
return 1;
if (check_anagram(a, b) == 1) }
}
printf("The strings are anagrams\n"); c = 0;
else while (b[c] != '\0')
printf(“Not anagrams\n"); {
return 0; } second[b[c]-'a']++;
4. How do you count a number of vowels and consonants in a given string
Input String : NEC Computer Science
Output :
Vowels : 7
Consonants : 11
Input String : vowels and consonants
Output :
Vowels : 6
Consonants : 13
#include <stdio.h> for(c = 0; c < d ; c++)
#include <string.h> {
ch=s[c];
int main() if (ch == 'a' || ch == 'A' || ch == 'e' || ch == 'E' || ch ==
'i' || ch == 'I' || ch =='o' || ch=='O' || ch == 'u' || ch ==
{ 'U')
char s[100]; cv++;
int ch,c,cv, cc, d; else if ( ch == ' ')
cv=cc=d=0; printf("");
gets(s); else
d = strlen(s); cc++;
}
printf("\n No. of Vowel is %d",cv);
printf("\n no. of consonants %d",cc);
}
5. Program to toggle each character in a string. A string is given as input in which
all the lower case letters are converted to upper case and the upper case letters
are converted to lower case.

Input: Computer Science

Output: cOMPUTER sCIENCE

Input: NEC - Kovilpatti

Output: nec – kOVILPATTI
// C program to toggle each character in a string // ASCII 65-> A to 90 -> Z and 97->a and 122
-> z only 32 is difference
#include <stdio.h>
#define MAX_SIZE 100
void toggleCase(char * str); void toggleCase(char * str)
{
int main() while(*str)
{ {
char str[MAX_SIZE]; if(*str >= ‘a’ && *str <= ‘z’)
printf(“\nEnter the string : “); ------------------------- /* Fill the Statement */
scanf(“%s”, &str); else if(*str >= ‘A’ && *str <= ‘Z’)
toggleCase(str); ------------------------- /* Fill the Statement */
printf(“\nReplaced string after toggling str++;
characters : “); }
printf(“%s\n”, str); }
return 0;
}
Program to find all the patterns of 0(1+)0 in the given string. Given a string containing 0’s and
1’s, find the total number of 0(1+)0 patterns in the string and output it.

0(1+)0 – There should be at least one ‘1’ between the two 0’s.
For example, consider the following string.

Input: 01101111010
Output: 3
Explanation:

01101111010 – count = 1
01101111010 – count = 2
01101111010 – count = 3
#include <stdio.h> /* Store the last character */
#include <stdlib.h> last = str[i];
i++;
/* Function to count the patterns */ }
int find_pattern(char str[]) return counter;
{ }
char last = str[0];
int i = 1, counter = 0; int main()
while (i < strlen(str)) {
{ char str[50];
/* We found 1 and last character was ‘0’, state change*/ printf(“\nEnter the string : “);
if (str[i] == ‘1’ && last == ‘0’) gets(str);
{ printf(“\nNumber of patterns found : %d”,
while (str[i] == ‘1’) find_pattern(str));
i++;
printf(“\n”);
/* After the stream of 1’s, we got a ‘0’, counter return 0;
incremented*/ }
if (str[i] == ‘0’)
counter++;
}
Missing characters to make a string Pangram
Pangram is a sentence containing every letter in the English alphabet. Given a string, find all characters that are

missing from the string,

i.e., the characters that can make string a Pangram. We need to print output in alphabetic order.

Examples:

Input : abcd efgh ijkl mnop

Output : qrstuvwxyz

Input : The quick brown fox jumps

Output : adglvyz
#include <stdio.h> char alpha[26]={0};
#define MAX_SIZE 100 while(*str)
void checkmissing(char *str); {
int main() if(*str >= 'a' && *str <= 'z')
{ alpha[*str - 'a']=1;
char str[100]; else if(*str >= 'A' && *str <= 'Z')
printf("\nEnter the string : "); alpha[*str-'A']=1;
gets(str); else
printf("\n%s\n",str); printf("");
checkmissing(str); str++;
return 0; }
} for (int i=0; i<26;i++)
// ASCII 65-> A to 90 -> Z and 97->a and 122 -> z if (alpha[i]==0)
only 32 is difference
printf("%c",'a'+i);
void checkmissing(char * str)
}
{