Placement Papers for All Companies

3i infotech
Abacus Infotech
Abatix
Abaxis
ABB
ACC Limited
Accel Frontline
Accenture
Aditi Technologies
Adobe System
ADP
Agilysys
AgreeYa
AIG
AirNet
Alanco Technologies
Alle Technologies
Allfon
Alter Systems
Amazon
AMDL
Amdocs
AMI
Amiti Software Technologies
ANZ
Apple
Applied Materials
Apps Associates
Aricent
ASDC
Ashok Leyland Ltd
Asian Paints
Aspire System
AT & T
Atlas Copco
Atos Origin
AXA Technology Services
Axes Technology
Bain
Bajaj
Bayer
Bharti Airtel Ltd
Bhawan Cybertek
Birlasoft
Blue Star Infotech
BMC
BOB
Brakes India
C-DOT
CA Technologies
Cadence
Calsoft
Canarys
Capgemini
Caterpillar
Celstream
CGI Group
Changepond Technologies
Cimtrix Systems
Cisco system
Citicorp Overseas Software Ltd
ClinTech
CMC Limited
CMS
Cognizant
Compaq
Consagous Technologies
Convergys
CORDYS
CRISIL
Crompton Greaves
CSC
CSFB
CtrlS Datacenters Ltd
Cummins
Cyient
Daffodil
Daimler
Dell
Deloitte
Delphi-TVS
Dharma Systems
Directi
DSRC
Eicher
ELGI
ELICO
EMC Corporation
Emphasis
Ericsson
Ernst & Young
ESKO
Essar
Facebook
Fanuc Corporation
Fidelity
Flextronics
Flipkart
Freescale
Fujitsu
Gajshield
GE
Genpact India
Geodesic
Geometric Limited
GlobalEdge
GlobalLogic
GMR Group
Godrej Infotech
Google
Grapecity
Harita - TVS
HCL
HCL Technologies
Headstrong
Healthasyst
HEC Ltd
Hexaware
HFCL
Holool
Honeywell
HP
HTC Global Services
Huawei
Hughes
Hyundai
IBM
IBS Software Services
IGate
Ikanos
IKOS
Impetus
iNautix
Indecomm
IndiaBulls Power Limited
Inductis-EXL
Industrial Alliance
Infineon
Infogain
Infosys
Intec
Integra
Intel
Intergraph
ITC Infotech
Jindal Steel and Power Limited
KPIT
L & T
L & T Infotech
LG Soft
Linde India Ltd
LnT Emsys
LnT-ECC
Lucas - TVS
Mahindra Engineering Services Ltd
Mahindra Ltd
Maruti
Matrix
Maveric Systems
McAfee
Microland
Microsoft
Mindtree
Miraclesoft
MKCL
Motorola
Mu-Sigma
Nagarro
NASSCOM
NCR Corporation
Ness Technologies
Neudesic
NIIT Technologies
Novell
Nvidia
Oracle
Persistent
Philips
Planetasia
Polaris
Poornam Info Vision
PSI Data Systems Limited
Quest-Global
Quinnox
R Systems
Redpine
Reliance Energy
Robert Bosch
RS Software
Samsung
SAP labs India
Sapient
Sasken Communications
Schneider India
Serco
Siemens
Sierra Atlantic
SkyTECH
Soliton
Sonata Software
Sony India
SQL Star
Steria
Subex Limited
Sutherland Global Services
Syntel
Talisma
Tata motors
Tata technologies
Tata-ELXSI
TCE
TCS
Tech Mahindra
Temenos
Tesco
Texas Instruments
Thermax
ThoughtWorks
Torry Harris
Triad
Trianz
Trilogy
TVS Motor
Unisys
UnitedHealth Group
UST Global
UTC Aerospace System
Valuelabs
Vedanta
Verifone
Verizon
Virtusa
Vision Infotech
Vizual
VMware
Wipro
Yahoo
YASH Technologies
Zenith
Zensar Technologies
ZTE

Verizon C programming Questions - 08 October 2011

Posted on :10-02-2016
Verizon C programming  Questions - 08 October 2011:-

Q1. What should be the output so that the following code snippet prints?

HelloWorld?
if()
printf (Hello);
else
printf(World);


Q2. Write a C Program to reverse a stack in place using recursion. You can only use the following ADT functions on stack: IsEmpty, IsFull, Push, Pop, Top.


Q3. You are given a sequence of numbers from 1 to n-1 with one of the numbers repeating only once; e.g. 1 2 3 3 4 5. How can you find the repeating number?


Q4. Find the midpoint of a singly-linked list in a single pass through the list. Changing the list elements or links is not allowed.


Q5. Write a C function that will take an int parameter and print on stdout numbers 1 to n, one per line. The function must not use while, for, do-while loops, goto statement, recursion, or switch statement.


Q6. Write an efficient C function f to count the number of bits set in an unsigned integer. For example: f (0) = 0, f (1) = 1, f (2) = 1, f (3) = 2.


Q7. Given strings s1 and s2, write a snippet to say whether s2 is a rotation of s1 using only one call to the strstr function. For example, given

 s1 = ABCD and s2 = CDAB, return true; given s1 = ABCD, and s2 = ACBD, return false.


Q8. Describe an algorithm for reversing the words in a string; for example My name is Amit Agarwal becomes Agarwal Amit is name My. An O (n) and in-place solution is appreciable.


Q9. Given a circular singly-linked list of sufficiently large number of nodes (say more than 1), delete the node P given the pointer to it. Suggest the most efficient algorithm to delete the node, without going around the list.


Q10. You are provided with two stacks, as well as Pop and Push functions over them. Implement queue i.e. Enqueue and Dequeue using the available operations.


Q11. Write a small C program, which while compiling takes another program from input terminal, and on running gives the result for the second program. (Hint: Think UNIX.) Suppose the program is 1.c; then compiling and executing the program should have the following effect:

# cc -o 1 1.c
int main()
{
printf(Hello World );
}
^D
# ./1
Hello World


Q12. Change/add only one character so that the following program prints * exactly 20 times. (There are at least 3 solutions to this problem.)

int main()
{
int i, n = 20;
for (i = 0; i < n; i--)
printf(*);
return 0;
}


Q13. Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, . . . shows the first 11 ugly numbers. By convention, 1 is included. Write a program to find and print the 1500th ugly number.

[Note: These numbers are also known as Hamming numbers or 5-smooth numbers.]


Q14. You are given have a data type, say X in C. Determine the size of the data type, without declaring a variable or a pointer variable of that type, and, of course without using the size of operator!


Q15. Write a C program which when compiled and run, prints out a message indicating whether the compiler that it is compiled with allows /* */ comments to nest.


  
   






FreshersLive - No.1 Job site in India. Here you can find latest 2016 government as well as private job recruitment notifications for different posts vacancies in India. Get top company jobs for both fresher and experienced. Job Seekers can get useful interview tips, resume services & interview Question and answer. Practice online test free which is helpful for interview preparation. Register with us to get latest employment news/rojgar samachar notifications. Also get latest free govt and other sarkari naukri job alerts daily through E-mail.

closepop
closepop