Introduction to computer science
Learn the theoretical aspects of the foundation of computer science

Hot Sky
945 pages
Law
Hot Sky
945 pages
Law
172
/ 945
!
!
Introduction to Computer
Science
SENIOR CONTRIBUTING AUTHOR
DR. JEAN-CLAUDE FRANCHITTI, NYU COURANT INSTITUTE
/ 945
End of Document
172

Figures

Introduction To Computer Science WEB — Study where you want, what
Introduction To Computer Science WEB — Study where you want, what
Access. The future of education.
Senior contributing author: Dr. Jean-Claude Franchitti
Visit our
Computing is everywhere, affecting everyone, for better and for worse. (credit: modification of "Whereas design is
An abacus is one of the first calculators. (credit: “Traditional Chinese abacus illustrating the suspended bead use” by
The ARPANET, circa 1974, was an early predecessor to the Internet. It allowed computers at Pentagon-funded research
This image depicts women programmers holding boards used in computers such as the ENIAC, many of which were
only human computers, but also some of the first computer scientists for the early digital computers that
) itself has been criticized for presenting an oversimplified narrative, it still
Meteorologists collect data from a variety of sources and use the data, algorithms, and computers to predict the weather.
While Americans used to primarily get their news from newspapers, as technology has advanced their primary source of
(a) An artificial neural network consists of three key layers: the input layer, where raw data enters the system; the hidden
(a) Autopilot functions in self-driving cars generally identify roads and lanes using artificial intelligence to “see” road
The SARS-CoV-2 outbreak that began in 2020 displayed how quickly computer science could be harnessed by
A work environment, such as this modifiable “sp.ace” at Johnson Space Center where furniture can move and any surfaces
). However, it differentiates itself by being more definitely aware than mathematics
The three As—abstraction, automation, analysis—illustrate the power of computational thinking. (credit photo:
Users can explore the essence of computational thinking through decomposition, logical thinking, abstraction, and
details, providing a clearer image of the desired outcome. Simple tools like the Windows Paint program can be
When using GenAI, a user interacts with the interface while the application processes the prompt with layers of
using a diagram. Either way is fine, and it is a matter of personal preference. Basic templates for the flowchart
using programming keywords such as INPUT, OUTPUT, IF, THEN, ELSE, and START. The corresponding
N numbers. (attribution: Copyright Rice University, OpenStax,
The different layered architectures include tiered architectures, service-oriented architectures (SOA), and microservices
The EBA framework categories, including product, sales, and service, support the business organizations. (attribution:
This flowchart outlines the business process model for creating an order, checking availability, shipping, and payments.
The trading business process hierarchy includes activities such as customer management, product development, quality
The order to cash business process flows from order management through product fulfillment and payment.
This sample trading business model represents a process map diagram for the enter order process. (attribution:
A conceptual trading application architecture moves through various levels, including users, functions, enterprise
The logical trading application architecture illustrates each function block for the processing of customer orders.
This logical trading application architecture includes function callouts that identify the technologies used for this
Examining and learning from data is integral to an organization’s success, as outlined in this role of information
The enterprise conceptual data architecture for a fictitious insurance company highlights the different ways in which
. The diagram
This alternative physical trading application architecture outlines possible changes from the existing web solution.
TOGAF architectural dimensions include various levels of abstraction. (attribution: Copyright Rice University, OpenStax,
This TOGAF solutions continuum illustrates how each architecture guides and supports the others. (attribution:
The TOGAF architecture continuum can suggest extensions but may only be able to focus on one aspect at a time.
The logical application architecture of Microsoft Azure-hosted web applications allows for responsive web and mobile
The logical application architecture of React Native mobile web apps shows the back-end processes that allow both
illustrates how this is made possible by creating hybrid Web 2.0
The cloud-native application architecture view of a digital enterprise shows both client-side and server-side processes
IoT devices use sensors, applications, and connectivity to interact, collect, and exchange data. (attribution: Copyright
This diagram depicts an architecture of a body area network. (credit: modification of "Body Area Network" by
Online mapping applications represent places, locations, and map data while providing functionality to look around,
Lists and sets are common abstract data types used to represent complex data and can be in the form of integers or
A linked list maintains a link for each element to the next element in the list. (attribution: Copyright Rice University,
illustrates the structure
A binary search tree organizes elements least to greatest from left to right. (attribution: Copyright Rice University,
An AVL tree rotates nodes in a binary search tree to maintain balance. This sequence of steps illustrates the insertion of
A binary heap is the most common implementation of the priority queue abstract data type. The priority value of each
A sequential search can find the number 47 in an array by checking each number in order. (attribution: Copyright Rice
A binary search can find the number 47 in an array by determining whether the desired number comes before or after a
Sequential search needs to check every term to see if it matches the prefix “Sea,” whereas two binary searches can be
A flame graph shows which parts of a program require the most resources. The x-axis shows relative duration and
The best case for sequential search in a sorted list is to find the word at the top of the list, whereas the worst case is to
The order of growth of an algorithm is useful to estimate its runtime efficiency as the input size increases (e.g., constant,
This chart shows the time it would take for an algorithm with each of the given orders of growth to finish running on a
Merge sort is a divide and conquer algorithm that repeatedly makes two recursive calls on both halves of the sublist.
Greedy interval scheduling will not work if the simple rule repeatedly selects the shortest interval. (attribution: Copyright
the municipal broadband planning problem, we want to ensure that the next-cheapest connection that we
A reduction algorithm preprocesses the input data, passes it to another algorithm, and then postprocesses the
The problem of finding a minimum spanning tree in a graph with vertex weights can be reduced to the problem of
execution of the recursive algorithm, but in practice, for most of the inputs, the runtime is in O(
Heapsort uses the binary heap data structure to sort elements by adding and then removing all elements from the heap.
Hash tables data structures apply hashing to implement abstract data types such as sets and maps, but must handle
Depth-first search is a graph traversal algorithm that continues as far down a path as possible from a start vertex before
Depth-first search is a graph traversal algorithm that continues as far down a path as possible from a start vertex before
Kruskal’s algorithm repeatedly selects the next lightest edge that connects two independent "islands." (attribution:
Prim’s algorithm expands outward from the start vertex by repeatedly selecting the next lightest edge to an unreached
Three shortest paths trees of the lowest-cost way to get from the start vertex to every other vertex in the graph are
Dijkstra’s algorithm expands outward from the start vertex by repeatedly selecting the next lowest-cost path to an
The longest path in a graph maximizes the distance, which often (but not always) involves visiting many vertices along
(attribution: Copyright Rice University, OpenStax, under CC BY 4.0 license)
Low-level programming languages support little or no abstraction; they allow programmers to write software in
A standard CPU model shows how a program logic applies low-level instructions to an input to get an output; the program
A Random Access Machine has unlimited memory cells that can store any arbitrary value. (attribution: Copyright Rice
A neural Turing machine (NTM) leverages the pattern matching capabilities of neural networks in addition to more
Machine code, with its 0s and 1s, is the only computational model a computer can execute. (attribution: Copyright Rice
A computer chip is a computer’s central processing unit (CPU). (credit: modification of "IIci" by raneko/Flickr, CC BY 2.0)
An assembler is a program that translates assembly language source code into machine object code. (attribution:
As a rule, high-level languages are less laborious to write, and slower to execute, than low-level languages. High-level
Computation models fit onto a spectrum from low- to high-level. (attribution: Copyright Rice University, OpenStax, under
This diagram shows a functional programming example using Python. Here the function “LAMBDA” is used to increment
execution is difficult to understand when attempting to read the code. These sorts of programs are criticized
This procedural programming comparison relates a real-life scenario, such as making a sandwich, to the corresponding
This diagram demonstrates various functions used by the socket on both the client and the server side to establish and
The object-oriented use of a robot class instantiates robot objects that have attributes of age, name, and greeting and
Dennis Ritchie of Bell Labs invented the C programming language. (credit: “Dennis Ritchie 2011” by Denise Panyik-Dale/
A pointer is a variable whose value is another variable’s address in memory. (attribution: Copyright Rice University,
A typical work cycle includes multiple compilation steps after a program has been written and is ready for compilation.
The linking process that is used by languages to make them portable requires a number of different steps. (attribution:
Source files and separately compiled relocatable object files can be linked into an executable object file. (attribution:
). This step merges separate code and data
). This step merges separate code and data
The subcategories of Executable and Linkable modules are arranged in a hierarchy. (attribution: Copyright Rice
The code shown illustrates how the linker identifies local and global symbols. (attribution: Copyright Rice University,

You May Also Like