Red Hat Linux : the complete reference / Richard Petersen

By: Petersen, RichardMaterial type: TextTextPublication details: New York : Osborne\McGraw-Hill, 2002Edition: 2nd edDescription: xxx,1117p. : illus ; + 1 CD-ROM (4 3/4 in.)ISBN: 0072191783Subject(s): Operating systems | Computer Programming | LinuxDDC classification: 005.362Lin Subject: Computer Science
Item type Current library Call number Copy number Status Date due Barcode Item holds
Book's CD/DVD Book's CD/DVD Independent University Bangladesh, Library.
Book CD/DVD Shelf
005.362Lin P484r (Browse shelf (Opens below)) 1 Available CD00374
Books Books Independent University Bangladesh, Library.
Reference Stacks
005.362Lin P484r (Browse shelf (Opens below)) 1 Not For Loan 011795
Book's CD/DVD Book's CD/DVD Independent University Bangladesh, Library.
Book CD/DVD Shelf
005.362Lin P484r (Browse shelf (Opens below)) 2 Available CD00375
Books Books Independent University Bangladesh, Library.
General Stacks
005.362Lin P484r (Browse shelf (Opens below)) 2 Available 011796
Book's CD/DVD Book's CD/DVD Independent University Bangladesh, Library.
Book CD/DVD Shelf
005.362Lin P484r (Browse shelf (Opens below)) 3 Available CD00376
Book's CD/DVD Book's CD/DVD Independent University Bangladesh, Library.
Book CD/DVD Shelf
005.362Lin P484r (Browse shelf (Opens below)) 4 Available CD00377
Total holds: 0
Browsing Independent University Bangladesh, Library. shelves, Shelving location: Reference Stacks Close shelf browser (Hides shelf browser)
005.133MATLAB C466m MATLAB Programming for Engineers / 005.2768Unix S846u UNIX Network Programming : 005.30425SPSS G347s SPSS for Windows Step by Step : 005.362Lin P484r Red Hat Linux : 005 J42d Design for Trustworthy Software : 005.1 B214e E-Commerce : 005.1 C811i 2009 Introduction to algorithms /

Computer Science

10\18\03

Patron comment on 27/06/2012

This book is suitable for linux learning

to post a comment.

 

Last Updated November 15 2020
Copyright © IUB Library
Independent University, Bangladesh.
Library Home | About Library | Services | FAQS | Contact