How to Solve it by Computer

{{short description|1982 book by R. G. Dromey}}

{{Infobox book

| italic title =

| name = How to Solve it by Computer

| image = How to Solve it by Computer.jpg

| image_size =

| border =

| alt =

| caption =

| author =

| audio_read_by =

| title_orig =

| orig_lang_code =

| title_working =

| translator =

| illustrator =

| cover_artist =

| country =

| language = English

| series =

| release_number =

| subject =

| genre =

| set_in =

| publisher = Prentice Hall

| publisher2 =

| pub_date = July 1, 1982

| english_pub_date =

| published =

| media_type =

| pages = 442

| awards =

| isbn = 978-0134340012

| isbn_note =

| oclc =

| dewey =

| congress =

| preceded_by =

| followed_by =

| native_wikisource =

| wikisource =

| notes =

| exclude_cover =

| website =

}}

How to Solve it by Computer is a computer science book by R. G. Dromey,{{cite book|last=Dromey|first=R. G.|title=How to Solve it by Computer|publisher=Prentice-Hall International|isbn=978-0-13-434001-2|year=1982}} first published by Prentice-Hall in 1982.

It is occasionally used as a textbook, especially in India.{{cite web

|url= http://cs.du.ac.in/Uploads/Syllabus/B.Sc._H_CS/BSc%28H%29_Struc_11.pdf

|publisher= Delhi University

|title=Syllabus of B.Sc.(H) Computer Science}}

{{Citation | url = http://www.cse.iitd.ernet.in/~ssen/csl101/details.html | title = CSL 101: Introduction to Computers and Programming | publisher = IIT Delhi }}

{{Citation | url = http://cse.iitkgp.ac.in/~pds/semester/index05.html | title = CS13002 Programming and Data Structures | publisher = IIT Kharagpur }}

{{cite web

|url=https://www.annauniv.edu/academic_courses/01.%2520UG%2520C%2520%26%2520S%2520WS%2520-%252020.08.14/04.%2520I%2520%26%2520C/20.%2520B.E.%2520ECE.pdf

|publisher=Anna University

|title=Syllabus of B.E. E.C.E

}}

It is an introduction to the whys of algorithms and data structures.

Features of the book:

1. The design factors associated with problems
2. The creative process behind coming up with innovative solutions for algorithms and data structures
3. The line of reasoning behind the constraints, factors and the design choices made.

The very fundamental algorithms portrayed by this book are mostly presented in pseudocode and/or Pascal notation.