Write the following function in C.
stripos — Find position of first occurrence of a case-
insensitive string
int stripos ( char* haystack, char* needle, int offset )
Returns the numeric position of the first occurrence of
needle in the
haystack string. Note that the needle may be a string of
one or more
characters. If needle is not found, stripos() will return -
1.
The function should not make use of any C library function
calls.
pgm to find number of words starting with capital letters
in a file(additional memory usage not allowed)(if a word
starting with capital also next letter in word is capital
cann't be counted twice)
pgm to find number of words starting with capital letters
in a file(additional memory usage not allowed)(if a word
starting with capital also next letter in word is capital
cann't be counted twice)
pgm to reverse string using arrays i.e god is love becomes
love is god)
(assumption:only space is used for seperation of words)
no addtional memory used.i.e no temporary arrays can used.
Write a program to generate prime factors of a given integer?
32
Read N characters in to an array . Use functions to do all
problems and pass the address of array to function.
1. Print only the alphabets . If in upper case print in
lower case vice versa.
2. Enter alphanumeric characters and form 2 array alphaets
and digits.Also print the count of each array.
3. Find the count of a certain character.
4. Print the positions where a certain character occured.
5. Print the characters between successive array elements.
6. Find the largest and smallest charcter. How many times
it each one occured.
7. Enter a certain range. Print out the array elements
which occured between these range.
8. Reverse a character array without using another array.
9. Reverse an array region.
10. Replace a the array elements with it next character .
Use a after z.
11. Code the array element with certain character as first
alphabet.
12. Duplicate all the vowels in a character array. What is
the new count.
13. Delete the vowels in a character array. What is the new
array count.
14. Print the count of all characters in the array.
15. Enter n alphabets and store a upto tht
charcter in array.What is the array count?
16. Sort a character array.
17. Merge 2 character arrays largearray,smallarray.
18. Find the pair with largest number of characters in between.
19. Find the numerical value of a charcter array.
20. Store n numeral characters in an arrray. Insert another
numeral character in a certain position.
21. Insert a character in a sorted array.
22. Merge 2 sorted arrays in sorted fashion.
23. Duplicate the least occuring character.
24. Write a menu driven program to circular right/left shift
an array of n elements.
25. Is the character array palindrome? if not make it
palindrome.
26. Concatenate the first n charaters to the end of the string.
27. Print all n group of chracters which are palindrome.
28. Concatneate the reverse of last n characters to the array.
98
Describe advantages and disadvantages of the various stock
sorting algorithms
Is there any algorithm to search a string in link list in
the minimum time?(please do not suggest the usual method of
traversing the link list)
20
1)
write a program to generate 1st n fibonacci prime numbers
using Nested if
2)
write a program to generate twin prime numbers from m to n
using nested if
3)
write a program to check whether a given integer is a strong
number or not using nested if
4)
Write a program to generate prime factors of a given integer
using nested if
5)write a program to generate prime numbers from m to n
using nested if
6)write a program to generate perfect numbers from m to n
using nested if
7)write a program to generate the pallindromes from m to n
using neste if
8)write a program to generate armstrong numbers from m to n
using nested if
9)write a program to generate strong numbers from m to n
using nested if
50
how we can make 3d venturing graphics on outer interface
3. When do you say that a digraph is acyclic
A)if and only if its first search does not have back arcs
B)a digraph is acyclic if and only if its first search does
not have back vertices
C)if and only if its first search does not have same
dfnumber
D)None of these
a) Identify the following declarations.
Ex.
int i
(integer variable) float a[l0](array of 10 real nos)
int (*f())()
void *f
int (*f()) []
void *f
int f[] [] []
char *(*f) ()
int (*f[]) []
float(*f) [] []
float **f
int ******f
18
WHICH TYPE OF JOBS WE GET BY WRITING GROUPS .WHEN THE EXAMS
CONDUCTED IS THIS EXAMS ARE CONDUCTED EVERY YEAR OR NOT.PLS
TELL ME THE ANSWER
7
in iso what are the common technological language?
22
how to determine the complexity of an algorithm as log(n)
what is real time system?what is the differance between hard
and soft real time systems
16
Give basis knowledge of web designing ...
34
Read N characters in to an array . Use functions to do all
problems and pass the address of array to function.
2. Enter alphanumeric characters and form 2 array alphaets
and digits.Also print the count of each array.
Ask Questions on ANYTHING, that arise in your Daily Life at 
Site Map