My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
TE 6385 (Overall) | |||||
A | |||||
TE 6385 Andras Farago | |||||
A | |||||
TE 6385 Neeraj Gupta | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
TE 6385 (Overall) | |||||
A | |||||
TE 6385 Andras Farago | |||||
A | |||||
TE 6385 Neeraj Gupta | |||||
Algorithmic Aspects of Telecommunication Networks
TE 6385
Erik Jonsson School of Engineering and Computer Science
This is an advanced course on topics related to the design, analysis, and development of telecommunications systems and networks. The focus is on the efficient algorithmic solutions for key problems in modern telecommunications networks, in centralized and distributed models. Topics include: main concepts in the design of distributed algorithms in synchronous and asynchronous models, analysis techniques for distributed algorithms, centralized and distributed solutions for handling design and optimization problems concerning network topology, architecture, routing, survivability, reliability, congestion, dimensioning and traffic management in modern telecommunication networks. 3 credit hours.
Prerequisites: CS 5343 and CS 5348 and (CS 3341 or ENGR 3341 or equivalent).
Offering Frequency: Each year
Grades: 7
Median GPA: A
Mean GPA: 3.714
Click a checkbox to add something to compare.
Algorithmic Aspects of Telecommunication Networks
TE 6385
Erik Jonsson School of Engineering and Computer Science
This is an advanced course on topics related to the design, analysis, and development of telecommunications systems and networks. The focus is on the efficient algorithmic solutions for key problems in modern telecommunications networks, in centralized and distributed models. Topics include: main concepts in the design of distributed algorithms in synchronous and asynchronous models, analysis techniques for distributed algorithms, centralized and distributed solutions for handling design and optimization problems concerning network topology, architecture, routing, survivability, reliability, congestion, dimensioning and traffic management in modern telecommunication networks. 3 credit hours.
Prerequisites: CS 5343 and CS 5348 and (CS 3341 or ENGR 3341 or equivalent).
Offering Frequency: Each year
Grades: 7
Median GPA: A
Mean GPA: 3.714
Click a checkbox to add something to compare.