The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
21-126 Introduction to Mathematical Softwa...
09-101 Introduction to Experimental Chemis...
15-410 Operating System Design and Impleme...
21-259 Calculus in Three Dimensions
15-213 Introduction to Computer Systems
15-212 Principles of Programming


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
21-126 Introduction to Mathematical Softwa...
09-101 Introduction to Experimental Chemis...
15-410 Operating System Design and Impleme...
15-213 Introduction to Computer Systems
21-259 Calculus in Three Dimensions
15-212 Principles of Programming


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
09-101 Introduction to Experimental Chemis...
21-126 Introduction to Mathematical Softwa...
15-410 Operating System Design and Impleme...
15-213 Introduction to Computer Systems
18-396 Signals and Systems
21-259 Calculus in Three Dimensions


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
09-101 Introduction to Experimental Chemis...
21-126 Introduction to Mathematical Softwa...
15-410 Operating System Design and Impleme...
18-396 Signals and Systems
15-213 Introduction to Computer Systems
21-259 Calculus in Three Dimensions


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
09-101 Introduction to Experimental Chemis...
21-126 Introduction to Mathematical Softwa...
15-410 Operating System Design and Impleme...
18-396 Signals and Systems
15-213 Introduction to Computer Systems
15-212 Principles of Programming


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.


  Popularity index
Rank for this semester:#13
Rank in this department:#5

  Students also scheduled
15-211 Fundamental Data Structures and Alg...
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
21-111 Calculus I
09-101 Introduction to Experimental Chemis...
21-126 Introduction to Mathematical Softwa...
15-410 Operating System Design and Impleme...
18-396 Signals and Systems
15-213 Introduction to Computer Systems
15-212 Principles of Programming


The Carnegie Pulse: Pulse Scheduler: 15-251 Great Theoretical Ideas in Computer Science
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


15-251 Great Theoretical Ideas in Computer Science

Units:12.0
Department:Computer Science
Prerequisites:(15-100 or 15-111) and 21-127
Related URLs:http://www.csd.cs.cmu.edu

This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming.

 Vie