C++ for You++: An introduction to programming and computer science/ by Maria Litvin and Gary Litvin
Material type:
- 0-9654853-9-0
- B.C. 005.133 L737c
Item type | Home library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
Bansalan Circulation1 | UM Bansalan College LIC | BCir. 005.133 L737c 1998 (Browse shelf(Opens below)) | Available | 2130 |
Browsing UM Bansalan College LIC shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
BCir. 005.133 D36j 2002 Java: How to program/ | BCir. 005.133 K82t 1995 Turbo pascal/ | BCir. 005.133 K82t 1995 Turbo pascal/ | BCir. 005.133 L737c 1998 C++ for You++: | BCir. 005.133 M28d 1997 Data Structures & other objects: | BCir. 005.133 Sa947t 1993 Turbo pascal/ | BCir. 005.133 Sa947t 1993 Turbo pascal/ |
Includes appendix and index.
Contents:Part 1. Programs: Syntax and style --2. A first look at a c++ program --3.Variables and constants --4. Arithmetic expressions --5. Arrays, apvector and apmatrix classes --6.Logical expressions and if-else statements --7.Iterative statements:while,for,do-while --8.The switch statement --9.Algorithms --10.Monte carlo methods --11.Pointers,references,dynamic memory allocation --12.Strings --13.Structure --14.Modularity --15. Classes --16. Templates --17.Linked lists --18. Stacks --19. Recursion --20. Queues --21. Classes: More advanced features --22.Trees --23.Expression trees --24.Heaps --25.Analysis of algorithms --26.Searching and hashing --27.Sorting --28.Inheritance.
There are no comments on this title.