Word completion problem using nearly optimal binaty search tree by A.Shravan Kumar and B.Narender; Supervised by S.Durga Bhavani

Shravan Kumar, A.
Call Number
PR001.6 Sh83W
Author
Shravan Kumar, A.
Title
Word completion problem using nearly optimal binaty search tree by A.Shravan Kumar and B.Narender; Supervised by S.Durga Bhavani
Publication
Hyderabad: University of Hyderabad, 2012.
Physical Description
26 p.
Notes
Project report (M.C.A.) - Computer Science - CIS - School of MCIS - University of Hyderabad.
Added Author
S.Durga Bhavani; Supervisor
Subject
COMPUTER SCIENCE - PROJECT REPORT
Total Ratings: 0
Location Call Number Barcode Item Class Units Copy Number Status  
IGM Library PR001.6 Sh83W PR6635 Project Reports 1 Non-Circulating
 
 
 
00873nam a2200205 a 4500
001
 
 
vtls001535696
003
 
 
VRT
005
 
 
20250708151200.0
008
 
 
121011                  m    000 0 eng d
039
9
$a 202507081512 $b Pad $c 201607261427 $d madhuk $c 201310251531 $d prasanna $c 201307221102 $d prasanna $y 201210110924 $z venikln
082
4
$a PR001.6 $b Sh83W
100
1
$a Shravan Kumar, A.
245
1
$a Word completion problem using nearly optimal binaty search tree $c by A.Shravan Kumar and B.Narender; Supervised by S.Durga Bhavani
260
$a Hyderabad: $b University of Hyderabad, $c 2012.
300
$a 26 p.
500
$a Project report (M.C.A.) - Computer Science - CIS - School of  MCIS - University of Hyderabad.
650
0
$a COMPUTER SCIENCE - PROJECT REPORT
700
1
$a S.Durga Bhavani; Supervisor
999
$a VIRTUA40
999
$a VTLSSORT0080*0820*1000*2450*2600*3000*5000*6500*7000*9992
No Reviews to Display
Notes
Project report (M.C.A.) - Computer Science - CIS - School of MCIS - University of Hyderabad.
Subject
COMPUTER SCIENCE - PROJECT REPORT