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
497
Device an algorithm for weiler-atherton polygon clipping,
where the clipping window can be any specified polygon
475
Write a C program to fill a rectangle using window scrolling
324
‘ C’ PROGRAME TO SHOW THE TYPE OF TRANGLE BY ACCEPTING IT’S
LENGTH .
28
which is the best antivirus and how to update it
40
Explain what?s happening in the first constructor: public
class c{ public c(string a) : this() {;}; public c() {;} }
How is this construct useful?
589
what is reason of your company position's in india no. 1.
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.
Hi how many types of software editions are there and their
difference (like home editions, enterprise, standard etc)
can u please help me
49
Hai what is the different types of versions and their
differences
55
Technical Ability Test:
This was difficult. three questions to be attempted in 60
min. The Coplete Technical Paper was as follows:
Write the Pseudo code for the following:
1. Wrie a function which returns the most frequent number
in a list of integers. Handle the case of more than one
number which meets this criterion.
public static int[] GetFrequency(int[] list)
2. Counting in Lojban, an artificial language developed
over the last fourty years, is easier than in most languages
The numbers from zero to nine are:
0 no
1 pa
2 re
3 ci
4 vo
5 mk
6 xa
7 ze
8 bi
9 so
Larger numbers are created by gluing the digit togather.
For Examle 123 is pareci
Write a program that reads in a lojban string(representing
a no less than or equal to 1,000,000) and output it in
numbers.
3. Where now stands that small knot of villages known as
the Endians, a mighty forest once stood. Indeed, legand has
it that you could have stoodon the edge of the wood and
seen it stretch out for miles, were it not for the trees
getting in the way.
In one section of the forest, the trees stood in a row and
were of hight from 1 to n, each hight occurring once and
once only.
A tree was only visible if there were no higher trees
before it in the row.
For example, if the heights were 324165, the only visible
trees would have been those of height 3,4 & 6.
Write a Program that takes an array of integers
representing the heights of the trees in the row as input
and prints the list of the visible trees.
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
//////////////////
Ques1: Given an array containing k nos in the range 1..n
and another scratch array of size n. Write an program to
remove the duplicates from the array.
Ques2: Given a table of the form:
Product Sold on
A 1/1/1980
B 1/1/1980
C 1/1/1980
A 1/1/1980
B 1/1/1980
C 2/1/1980
A 2/1/1980
There are 30 products and 10,000 records of such type. Also
the month period during which sales happened is given to u.
Write the program to display the result as:
Product Month No. of copies
A January 12
A February 15
A March 27
B January 54
B February 15
B March 10
C January 37
Ques3: Definition of priority queue was given. We have to
implement the priority queue using array of pointers with
the priorities given in the range 1..n.
The array could be accessed using the variable top. The
list corresponding to the array elements contains the items
having the priority as the array index.
Adding an item would require changing the value of top if
it has higher priority than top.
Extracting an item would require deleting the first element
from the corresponding queue.
The following class was given:
Ques4: An array of size 5X5 is given to us. The elements
from 1 to 25 are to be inserted in the array, such that
starting from a particular position for an element i, the
next element i+1can be inserted only at the mentioned
positions (u,v), and if these all positions are occupied
then it returns giving a count of how many positions have
been occupied in the array:
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
//////////////////
Example: if the starting element is 1 with the given
positions (1,2), then next element 2 can be placed at any
one of the positions marked with *.
_ _ _ _ _
1 _ _ _ *
_ _ _ _ _
_ _ * _ _
* _ _ _ _
2. Four questions of programming in c++, questions were:(
1:30 hr)
a) Bubble sort through recursion
b) Display Pattern:
1
2 3
4 5 6 7
8 9 10 11 12 13 14 15
…
c) Perform the functionality of 2-D array through 1-D array
and in it the functions to be performed were:
(1) Display the array in 2-D format
(2) Display a particular element
(3) Display a particular row
(4) Display a particular column
d) Give an efficient program for string matching like:
Text: this is the code in the text which you have
to search by code
Pattern: Code
Count the no. of occurrences of the pattern to be
searched
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
//////////////////
a) suppose u r given a 4*3 rectangle like (take these
values from user)
Now u have to calculate the no. of squares in this
rectangle like:
No. of squares of dimension 1 is 12
No. of squares of dimension 2 is 6
No. of squares of dimension 3 is 2
No. of squares of dimension 4 is 0
Total no. of squares are 20.
b) Suppose u r given a string. U have to find the
occurance of the characters A-Z in that string. Each
character must appear in the string and must appear only
once. If It that occurs in string more than one time return
1 showing it is a perfect string otherwise return 0 showing
it is not a perfect string.
c) Suppose u r given 10000 marks. U have to pick up
top 20 top marks from them and display it on the screen.
(Use the optimal sorting algorithm)
d) Suppose u have a chess board. U have to insert 8
queens on the chessboard in the style that the queens don’t
intersect in the diagonals, columns and rows. If they
intersect return 1 else return 0.(that is no more than one
queen should be present either in row or column or
diagonals.)
If the queen is inserted at a position in the chessboard,
its count is 1.
Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is
sorted and A[n+1] ... A[n+m] is
sorted. Design a linear time algorithm to obtain A[1...n+m]
sorted using only O(1) extra space.
Time Complexity of your algorithm should be O(n) and Space
Complexity O(1).
along with your userid / name. ThanQ
Site Map
