U hv to enter a range from a and b and search hw many no.
of times a pattern n. occurs between the range a and b.
Eg :i/p:enter range :0 100
Enter pattern: 13
o/p: the no. times 13 occurred betwwn 0 to 100:1
Eg :i/p:enter range :100 1000
Enter pattern: 13
o/p: the no. times 13 occurred betwwn 100 to 1000:
(in this 13,113,131,132,133…139,213,313,…913 all these will
be counted)
. Remove all the blank spaces between
character.Matrix is of 10* 10.
eg: INPUT
------------------------------------
| N | A | | V | |T
-------------------------------------
| |G | U | |P |
--------------------------------------
|T | | | A | |
------------------------------------
OUTPUT:
------------------------------------
| N | A | V | T | |
-------------------------------------
|G |U | P | | |
--------------------------------------
|T | A | | | |
------------------------------------
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
Seat Reservation prog for the theatre. Write a function for
seat allocation for the movie tickets. Total no of seats
available are 200. 20 in each row. Each row is referred by
the Character, "A" for the first row and 'J' for the last.
And each seat in a row is represented by the no. 1-20. So
seat in diffrent rows would be represented as
A1,A2....;B1,B2.....;........J1,J2... Each cell in the
table represent either 0 or 1. 0 rep would seat is
available , 1 would represent seat is reserved.
Booking should start from the last row (J) to the first
row(A). At the max 20 seats can be booked at a time. if
seats are available, then print all the seat nos like "B2"
i.e (2 row, 3 col) otherwise Print "Seats are not
available." and we must book consecutive seats only.
We need to write the function to check the password
entered is correct or not based on the following
conditions..
a) It must have atleast one lower case character and one
digit.
b)It must not have any Upper case characters and any
special characters
c) length should be b/w 5-12.
d) It should not have any same immediate patterns like
abcanan1 : not acceptable coz of an an pattern
abc11se: not acceptable, coz of pattern 11
123sd123 : acceptable, as not immediate pattern
adfasdsdf : not acceptable, as no digits
Aasdfasd12: not acceptable, as have uppercase character
I have a file which contains so many lines and variable
number of lines are treated as a record. For example
*first ooooo xxxxx
ttttt mmmm vvvvvvv
*end uuu bbbb
*first kkkkvvvvvv
nnnn mmmmm kkkkk
fffff gggg ffff
kkkk
lllll
*end.
Here the lines from *first to *end are treated as a record.
The number of lines between *first and *end is not same for
all the records.
Suppose there are 100 records (or number of records are not
predefined)like the format given in the above example. Now
the entire file needs to split into two files, first having
40 and remaining in the second file.
Can we split using sort utility? If possible then what is
the sort card?
Common UI for Multiple web applications. Suppose there are
35 websites using same third party controls.These 3rd party
controls are made together that all 35 websites can use
these controls.If we put all 3rd party controls and use its
dll in 35 websites,only class files will be accessable. But
I want to use CSS,images also in all 35 websites. how I can
design the N-tier solution for this project.
How to run the Result Intemation System project in java for
collage student in which result of internal exam marks send
on parents mobile using SMS? what software required to run
this project? please reply immediately...
How to get the version(major,minor,revision ) of VB6.0
delphi code .I am able to fetch dll file of vb6.0 but not
vba file .Can u send me the code snippet in delphi to get
the value for vb6.0.
363
Performance
Algorithm A performs 10n2 basic operations and algorithm B
performs 300 lg n basic operations. For what value of n does
algorithm B start to show its better performance?
Common UI for Multiple web applications. Suppose there are
35 websites using same third party controls.These 3rd party
controls are made together that all 35 websites can use
these controls.If we put all 3rd party controls and use its
dll in 35 websites,only class files will be accessable. But
I want to use CSS,images also in all 35 websites. how I can
design the N-tier solution for this project.
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
i am doing my final year project about programming use
verilog ,i am new about it so got problem,i want to record
the readings of a waveform every 2us use the verilog
code ,every ten readings i need to add them together after
that i need to compare this series of number to get which
one is the biggest , right now i don't know how to use
code to store the readings every 2us on a waveform ,pls
help me thanks a lot .
118
Given 1 to n random number, find top 10 maximum numbers and
explain the time complexity of the algorithm.
To Refer this Site to Your Friends 
Site Map
