Rezumat articol ediţie STUDIA UNIVERSITATIS BABEÅž-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.1 din 2004  
         
  Articol:   JAMES A. STORER, “AN INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS”, BIRKHÄUSER BOSTON, C/O SPRINGER-VERLAG, NEW YORK, 2002.

Autori:  CLARA IONESCU. 		 
       
         
  Rezumat:  This book deals with one of the most challenging subjects of Computer Science. A lot of universities from the whole world are using such books during preparing their students in Computer Sciences. One of the most famous of these books is Introduction to Algorithms written by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein from MIT. So, what is new in this book, written by James A. Storer, from the Department of Computer Science of the Brandeis University, USA? First of all it is a wonderful support for students who are attending accompanying lectures on data structures and algorithms. Except for the introduction, exercises, and notes for each chapter, page breaks have been put in manually and the format corresponds to a lecture style with ideas presented in "digestible" page-size quantities. Algorithms are presented with pseudo-code, not programs from a specific language, let the reader to implement them in which language he or she whish to do it.  
         
     
         
         
      Revenire la pagina precedentă