Ask
Login

Computer Science And Engineering

Top Users

gravatar for apsareena
apsareena • 660
visited 2.2 years ago
IN
apsareena • 660
IN
gravatar for gayathris
gayathris • 130
visited 4.9 years ago
IN
gayathris • 130
IN
gravatar for visvas333
visvas333 • 60
visited 2.2 years ago
IN
visvas333 • 60
IN
gravatar for Shaik_Sumiya_34
Shaik_Sumiya_34 • 40
visited 2.4 years ago
IN
Shaik_Sumiya_34 • 40
IN
gravatar for xchikux
xchikux • 20
visited 7.5 years ago
IN
xchikux • 20
IN
gravatar for gurramsravani664
gurramsravani664 • 20
visited 19 months ago
gurramsravani664 • 20
gravatar for yashshirsath2127
yashshirsath2127 • 20
visited 19 months ago
yashshirsath2127 • 20
gravatar for sumankhara144
sumankhara144 • 20
visited 13 months ago
IN
sumankhara144 • 20
IN
gravatar for vidya
vidya • 20
visited 10 weeks ago
IN
vidya • 20
IN
gravatar for akrambasha.009
akrambasha.009 • 0
visited 7.4 years ago
akrambasha.009 • 0
gravatar for kjrock09
kjrock09 • 0
visited 7.4 years ago
kjrock09 • 0
gravatar for krishnarekha97
krishnarekha97 • 0
visited 7.3 years ago
krishnarekha97 • 0
gravatar for yogeshkumbhar378
yogeshkumbhar378 • 0
visited 7.1 years ago
yogeshkumbhar378 • 0
gravatar for kumarishabh226
kumarishabh226 • 0
visited 7.0 years ago
kumarishabh226 • 0
gravatar for swarnadas18
swarnadas18 • 0
visited 7.0 years ago
swarnadas18 • 0
gravatar for shiva50gokul
shiva50gokul • 0
visited 6.9 years ago
shiva50gokul • 0
gravatar for khursheedchaudhary
khursheedchaudhary • 0
visited 5.8 years ago
IN
khursheedchaudhary • 0
IN
gravatar for samkroll83
samkroll83 • 0
visited 6.5 years ago
samkroll83 • 0
gravatar for ravichandran.rc502
ravichandran.rc502 • 0
visited 6.5 years ago
ravichandran.rc502 • 0
gravatar for lovelyjhadwal13
lovelyjhadwal13 • 0
visited 6.5 years ago
lovelyjhadwal13 • 0

Top Posts

Posts by Users

<prev • 107 results • page 1 of 11 • next >
0
votes
0
answers
676
views
0
answers
(Duplicate) Find Longest Common Subsequence(LCS) for given strings X= ABACABB Y=BABCAB
analysis of algorithms updated 2.0 years ago by yashshirsath2127 • 20
2
votes
1
answer
7.0k
views
1
answer
Let n=4 Profit={1, 2, 5, 6} Weight= {2, 3, 4, 5} M=8 Find solution to 0/1 Knapsack Problem using Dynamic Programming.
analysis of algorithms updated 3 months ago by binitamayekar ★ 6.4k
0
votes
0
answers
507
views
0
answers
(Duplicate) Find maximum profit using Fractional Knapsack approach(Greedy Method) n=6, m=13, P={18, 5, 9, 10, 12, 7}, W={7, 2, 3, 5, 3, 2}
analysis of algorithms updated 2.0 years ago by yashshirsath2127 • 20
0
votes
0
answers
414
views
0
answers
(Duplicate) What is Longest Common Subsequence Problem? Find out the longest Common subsequence for the given data String-1:- TATA String-2:- BATA
analysis of algorithms updated 2.0 years ago by yashshirsath2127 • 20
2
votes
1
answer
15k
views
1
answer
Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6
analysis of algorithms updated 2.0 years ago by binitamayekar ★ 6.4k
2
votes
1
answer
2.0k
views
1
answers
A: On a simple paging system with 2^24 bytes of physical memory ,256 pages of logic
updated 2.3 years ago by apsareena • 660
0
votes
1
answer
8
views
1
answers
A: Program in "C" to implement merge sort.
updated 2.3 years ago by apsareena • 660
1
vote
1
answer
117
views
1
answers
A: What type of solutes will dissolve readily in gasoline?
updated 2.4 years ago by apsareena • 660
0
votes
2
answers
33
views
2
answers
A: Security algorithms in GSM
updated 2.4 years ago by Shaik_Sumiya_34 • 40
1
vote
1
answer
34
views
1
answers
A: Explain Term Mobile Computing.
updated 2.4 years ago by Shaik_Sumiya_34 • 40

Recommendations

Nothing to show.