Is program coding part of computer science?
I read a quote by Bjarne Stroustrup which said that computer science was the study of computers in the same way astronomy is the study of telescopes.

Computer science does indeed study coding in the abstract, particularly among the study of algorithms and data structures. Both of these fields are highly mathematical in nature, and seek to understand the idea of the abstract data type more fully. Of course, practical lessons can be learned and applied to various computers languages, systems, and applications, particularly answering questions like:


  
  Can it be done?  
  What's the way to do it fastest with the least amount of memory?  
  How do I compare two different ways to code the same solution to a problem?  
  


When studying algorithms, for instance, Big-O Notation is presented as a way at looking at the computational complexity of an algorithm? Will it finish in linear time? What about polynomial time? In fact, in computational comlexity theory a tremendously important question about what can be solved abstractly with coding is the question of NP-completeness.

When studying coding abstractly, often pseudocode is used to represent instructions as opposed to an implemented language. For example:


  Procedure DoIt()
  &nbsp;&nbsp;&nbsp;&nbsp; Loop from 1 to 100
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;If num is divisible by 3
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Print that its divisible by 3
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;If num is divisible by 5
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Print that its divisible by 5
  End  


Other ways of studying algorithms and data structures include diagrams and graphs, often using tree data structures.