Find Jobs
Hire Freelancers

btree shakespear

$30-250 USD

Cerrado
Publicado hace alrededor de 12 años

$30-250 USD

Pagado a la entrega
This project is about B-Tree in Advanced Data Structures. It needs to be done in C++. With different order values (m), searching for data in B-trees can take different execution times. In this project, for B-Trees, experimenting effects of different order values on searching is the main issue. Tests will be performed on Shakespeare's Sonnets dataset which is provided with project. Building the Tree: From command prompt, your b-tree builder implementation must take the order value (m). With respect to user-defined m, b-tree is built using Shakespeare's Sonnets dataset. This dataset contains one sentence in each row. You must built a B-tree with using words as keys (use words as keys – use strcmp() function for lexical order). Node n which is represented with word w (key of n is w), should contain the list with two integers x and y (x is the order of word in the sentence and y is the order of sentence in the text ). Then program stores b-tree in a file for later use (main experiment part). For example, suppose that word ‘advanced’ is placed in the 2th word of the 4nd sentence and 5th word of the 6th sentence. Then the node for key ‘Advanced’ contains following couples: (2,4), (5,6). For the first step, define a rule of heuristic for determining sentences (sentences must not be determined with 100% accuracy – it is ok). Split your sentences into words from spaces and then perform following operations on the words - Make all characters lowercase - Eliminate all characters except for letters Then build the B-tree considering the words finally obtained. Searching for the words: With using the stored B-tree with your B-Tree builder implementation, your searcher implementation searches n words which are given from command prompt. There is a node with given word in B-tree, program outputs the data which is contained by that node. Otherwise program outputs an error message for that search. Finally, program outputs the total execution time.
ID del proyecto: 1388078

Información sobre el proyecto

2 propuestas
Proyecto remoto
Activo hace 12 años

¿Buscas ganar dinero?

Beneficios de presentar ofertas en Freelancer

Fija tu plazo y presupuesto
Cobra por tu trabajo
Describe tu propuesta
Es gratis registrarse y presentar ofertas en los trabajos
2 freelancers están ofertando un promedio de $45 USD por este trabajo
Avatar del usuario
I am confident to handle your project. Please check your inbox for details, thank you.
$50 USD en 1 día
4,9 (60 comentarios)
5,5
5,5
Avatar del usuario
Dear sir, I am strong in advanced data structures and algorithm. I am familiar with B-tree and B+ tree mechanism and I have implemented them in C++ and java several time. I can do the project for you with high quality and efficiency. Wait for your response Thank you BR
$40 USD en 1 día
4,9 (18 comentarios)
5,2
5,2

Sobre este cliente

Bandera de TURKEY
istanbul, Turkey
5,0
1
Miembro desde ene 13, 2012

Verificación del cliente

¡Gracias! Te hemos enviado un enlace para reclamar tu crédito gratuito.
Algo salió mal al enviar tu correo electrónico. Por favor, intenta de nuevo.
Usuarios registrados Total de empleos publicados
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Cargando visualización previa
Permiso concedido para Geolocalización.
Tu sesión de acceso ha expirado y has sido desconectado. Por favor, inica sesión nuevamente.