Headquartered in Teaneck, New Jersey (U.S.), Cognizant combines a passion for client satisfaction, technology innovation, deep industry and business process expertise and a global, collaborative workforce that embodies the future of work. With over 50 delivery centers worldwide and approximately 211,500 employees as of December 31, 2014, Cognizant is a member of the NASDAQ-100, the S&P 500, the Forbes Global 2000 and the Fortune 500 and is ranked among the top performing and fastest growing companies in the world.

PASSION FOR OUR CLIENTS’ SUCCESS

We're driven by a passion to help our clients build stronger, more agile and more innovative businesses.

Cognizant enables global enterprises to address a dual mandate: to make their current operations as efficient and cost-effective as possible and to invest in innovation to unleash new potential across their organizations.

What makes Cognizant unique is our ability to help clients meet both challenges. We help them enhance productivity by ensuring that vital business functions work faster, cheaper and better. And, our ability to conceptualize, architect and implement new and expanded capabilities allows clients to transform legacy models to take their business to the next level.

Click To Follow

Francisco D'Souza, Chief Executive OfficerDuring Mr. D’Souza’s tenure as CEO, Cognizant’s employee base has grown from 55,000 to over 200,000. As a result of this strong growth, Cognizant has been named a member of the S&P 500, the Fortune 500, the Forbes Global 2000 and one of Forbes Fastest Growing Tech Companies.

Mr. D’Souza joined Cognizant as a co-founder in 1994 – the year it was started as a division of The Dun & Bradstreet Corporation. Francisco is a member of the Board of Directors of General Electric Company. He serves on the Board of Trustees of Carnegie Mellon University, the Board of Trustees of The New York Hall of Science and the Board of Trustees of the US India Business Council. He is a member of the

World Economic Forum, the Business Round Table and the Science Visiting Council for the acclaimed PBS science program, NOVA.

CHALLENGING, CHANGING AND GROWING

As Cognizant marks 20 years in business, we can look back with pride at our achievements: partnering with clients to spark entrepreneurship and innovation, providing leadership and direction through two decades of technology shifts and economic cycles and driving profitable growth and rising business value. We deeply appreciate the loyalty of our clients, the dedication of our employees and the confidence of our stakeholders throughout our history and we look forward to many more years of progress.

The voluminous growth of data and devices, the continued digitization of our clients’ markets and the exciting potential for social, mobile, analytical and cloud-enabled enterprises have combined to make business more IT-intensive than ever before. As a result, we anticipate another year of industry-leading growth in 2014. To support that growth, we will continue to invest in new service platforms, delivery centers and global talent, to enhance our value to existing and prospective clients, extend our track record of outperformance and deliver on our commitments to clients, employees, stakeholders and society.

Educational opportunity

Through our Outreach program, associates are also channeling their talents and energy into education—volunteering their time to enhance educational opportunities around the world, with Cognizant's financial and administrative support. Outreach Councils are operating in India, the Philippines, Singapore, Australia, Hungary, Netherlands, U.K. and North America.  Cognizant Foundation has funded 18 education projects,  plus 14 healthcare projects.

Cognizant strives to be a great place to work and build a career. We focus on maintaining—and continually enhancing—leading-edge programs to attract and cultivate talent, promote diversity and ensure a safe and healthy workplace.

Diversity and inclusion are keystones of our business. Our diversity and inclusion principles are unified in a platform called Completely Cognizant, built upon four pillars: People, Culture, Clients and Community. Another key diversity program, Women Empowered, aims to attract, develop and promote qualified female employees.

Envoi stewardardship

we began purchasing meaningful amounts of renewable energy for several facilities in India. 12% of our global energy consumption is now sourced from wind and biomass. And our "paperless offices" program has made great strides in reducing paper usage across our operations worldwide.

The attributes of Cognizant BusinessCloud solutions include:

Rapid onboarding Metered pricing Lower TCO Ecosystem extensibility Configurable Scalable Secure and compliant Powered by Cloud360

Products and platforms assetSERV ClaimSphere™ HEDIS® Cloud360 Cognizant S3P fastest GeoLocus Human Capital Management LifeEngage Mobile Risk Engineering Solution OptimaWrite OrderServ Security Management as a Service SKUView SmartTrials targetSERV TruMobi WellSERV PHM WorkPort Zero Deviation Life Cycle

Services Analytics Application Services Business Process Services Cloud Cognizant Digital Works Consulting Customer Relationship Management

Engineering & Manufacturing Solutions Enterprise Risk & Security Solutions Interactive IT Infrastructure Services Mobility Portals & Content Management Quality Engineering & Assurance Social

Supply Chain Managemt

palindromeain(){ int n, reverse = 0, temp;  printf("Enter a number to check if it is a palindrome or not\n"); scanf("%d",&n);  temp = n;  while( temp != 0 ) { reverse = reverse * 10; reverse = reverse + temp%10; temp = temp/10; }  if ( n == reverse ) printf("%d is a palindrome number.\n", n); else printf("%d is not a palindrome number.\n", n);  return 0;

int main(){ char a[100], b[100];  printf("Enter the string to check if it is a palindrome\n");

gets(a);  strcpy(b,a); strrev(b);  if( strcmp(a,b) == 0 ) printf("Entered string is a palindrome.\n"); else printf("Entered string is not a palindrome.\n");  return 0;

star patternnt main(){ int row, c, n, temp;  printf("Enter the number of rows in pyramid of stars you wish to see "); scanf("%d",&n);  temp = n;  for ( row = 1 ; row <= n ; row++ ) { for ( c = 1 ; c < temp ; c++ ) printf(" ");  temp--;  for ( c = 1 ; c <= 2*row - 1 ; c++ ) printf("*");  printf("\n"); }  return 0;

}

*

***

*****

*******

*********

*

*A*

*A*A*

*A*A*A*

main(){ int n, c, k, space, count = 1;  printf("Enter number of rows\n"); scanf("%d",&n);  space = n;  for ( c = 1 ; c <= n ; c++) { for( k = 1 ; k < space ; k++) printf(" ");  for ( k = 1 ; k <= c ; k++) { printf("*");  if ( c > 1 && count < c) { printf("A"); count++; } }   printf("\n"); space--; count = 1; } return 0;}

1

232

34543

4567654

567898765

main(){

int n, c, d, num = 1, space;  scanf("%d",&n);  space = n - 1;  for ( d = 1 ; d <= n ; d++ ) { num = d;  for ( c = 1 ; c <= space ; c++ ) printf(" ");  space--;  for ( c = 1 ; c <= d ; c++ ) { printf("%d", num); num++; } num--; num--; for ( c = 1 ; c < d ; c++) { printf("%d", num); num--; } printf("\n");  }  return 0;}

For example 371 is an armstrong number as 33 + 73 + 13 = 371. Some other armstrong numbers are: 0, 1, 153, 370, 407.

Fibonacci seriesint main(){ int n, first = 0, second = 1, next, c;  printf("Enter the number of terms\n"); scanf("%d",&n);  printf("First %d terms of Fibonacci series are :-\n",n);  for ( c = 0 ; c < n ; c++ ) { if ( c <= 1 ) next = c; else

{ next = first + second; first = second; second = next; } printf("%d\n",next); }  return 0;}

Binary search

int main(){ int c, first, last, middle, n, search, array[100];  printf("Enter number of elements\n"); scanf("%d",&n);  printf("Enter %d integers\n", n);  for ( c = 0 ; c < n ; c++ ) scanf("%d",&array[c]);  printf("Enter value to find\n"); scanf("%d",&search);  first = 0; last = n - 1; middle = (first+last)/2;  while( first <= last ) { if ( array[middle] < search ) first = middle + 1; else if ( array[middle] == search ) { printf("%d found at location %d.\n", search, middle+1); break; } else last = middle - 1;  middle = (first + last)/2; } if ( first > last ) printf("Not found! %d is not present in the list.\n", search);  return 0; }

/* Bubble sort code */ 

#include <stdio.h> int main(){ int array[100], n, c, d, swap;  printf("Enter number of elements\n"); scanf("%d", &n);  printf("Enter %d integers\n", n);  for (c = 0; c < n; c++) scanf("%d", &array[c]);  for (c = 0 ; c < ( n - 1 ); c++) { for (d = 0 ; d < n - c - 1; d++) { if (array[d] > array[d+1]) /* For decreasing order use < */ { swap = array[d]; array[d] = array[d+1]; array[d+1] = swap; } } }  printf("Sorted list in ascending order:\n");  for ( c = 0 ; c < n ; c++ ) printf("%d\n", array[c]);  return 0;}

/* insertion sort ascending order */ #include <stdio.h> int main(){ int n, array[1000], c, d, t;  printf("Enter number of elements\n"); scanf("%d", &n);  printf("Enter %d integers\n", n);  for (c = 0; c < n; c++) { scanf("%d", &array[c]); }  for (c = 1 ; c <= n - 1; c++) { d = c; 

while ( d > 0 && array[d] < array[d-1]) { t = array[d]; array[d] = array[d-1]; array[d-1] = t;  d--; } }  printf("Sorted list in ascending order:\n");  for (c = 0; c <= n - 1; c++) { printf("%d\n", array[c]); }  return 0;}

Selection sort algorithm implementation in c#include <stdio.h> int main(){ int array[100], n, c, d, position, swap;  printf("Enter number of elements\n"); scanf("%d", &n);  printf("Enter %d integers\n", n);  for ( c = 0 ; c < n ; c++ ) scanf("%d", &array[c]);  for ( c = 0 ; c < ( n - 1 ) ; c++ ) { position = c;  for ( d = c + 1 ; d < n ; d++ ) { if ( array[position] > array[d] ) position = d; } if ( position != c ) { swap = array[c]; array[c] = array[position]; array[position] = swap; } }  printf("Sorted list in ascending order:\n");  for ( c = 0 ; c < n ; c++ ) printf("%d\n", array[c]);

  return 0;}

Download Selection sort program

1

1 1

1 2 1

1 3 3 1

Pascal triangle in c#include <stdio.h> long factorial(int); int main(){ int i, n, c;  printf("Enter the number of rows you wish to see in pascal triangle\n"); scanf("%d",&n);  for (i = 0; i < n; i++) { for (c = 0; c <= (n - i - 2); c++) printf(" ");  for (c = 0 ; c <= i; c++) printf("%ld ",factorial(i)/(factorial(c)*factorial(i-c)));  printf("\n"); }  return 0;} long factorial(int n){ int c; long result = 1;  for (c = 1; c <= n; c++)

result = result*c;  return result;}

Sariska

 The reserve was declared a wildlife sanctuary in 1958 and came under the "Project Tiger" as a Sariska tiger reserve in 1979. 

Travel to Sariska and you will feel the centuries old history of the place. The history of Sariska is as old as 5th century BC when it was mentioned in the Hindu sacred texts that the Pandavas took shelter in Sariksa during the years of seclusion. Under the Mughul rule in the middle ages, the Knakwari Fort was used by Aurangazeb to imprison his brother. During the 8th to 12th century. The rich residents of Sariska constructed a number of temples in the region which still stand as symbols of the glorious past of Sariska. Maharaja Jai Singh started the campaign of converting the region to a protected area in the 20th century which led to Sariska being declare a wildlife sanctuary by the Government in 1958.In 1979, It became a part of the prestigious Tiger project