1 / 30

ECS at UTD

ECS at UTD. Ivor Page Associate Dean for Undergraduate Education. Four degrees. TE. CS. EE. SE. Makeup of a degree:. 42 hours State mandated core curriculum (English/math/science/gov’t/history/soc’sci). Major required courses: 53 – 69 hrs. Electives: 12 – 21 hrs.

ivory-conner
Download Presentation

ECS at UTD

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ECS at UTD Ivor Page Associate Dean for Undergraduate Education

  2. Four degrees . TE CS EE SE

  3. Makeup of a degree: . 42 hours State mandated core curriculum (English/math/science/gov’t/history/soc’sci) Major required courses: 53 – 69 hrs Electives: 12 – 21 hrs Total hours: 120 – 128 hrs, must include 51 upper division hours.

  4. Computer Science Computer Architecture . Computer Graphics C++/Java Linear Algebra Programming languages Discrete Math Probability theory and Statistics Data Structures and Algorithms Automata Theory Operating Systems Telecomm’s Networks Software Engineering

  5. Electrical Engineering . Digital Systems Communication Systems Digital Circuits Probability Theory & Statistics Electronic Circuits Differential Equations Signals and Systems Electronic Devices Electromagnetic Engineering Electrical Network Analysis Systems and Controls Advanced Engineering Math

  6. Telecomm’s Engineering Differential Equations Computer Architecture . Digital Signal Processing Computer Networks Operating Systems Signals and Systems Digital Systems Discrete Mathematics Electrical Network Analysis Algorithms Data Structures Probability Theory & Statistics Communication Systems Advanced Engineering Math Wireless Communication Digital Communications Telecom Switching & Transmission

  7. Software Engineering C++/Java Computer Architecture . Linear Algebra Discrete Math Programming languages Operating Systems Probability theory and Statistics Data Structures and Algorithms Software Engineering Software Architecture Software Requirements Software Testing, Verification, Validation and QA

  8. The Fast Track Program • Seniors with good GPAs can take up to 15 hrs of graduate coursework while they are undergraduates. • On graduation, they automatically become MS students (no GRE requirement), and the graduate hours they have already taken are subtracted from their MS requirements. • The MS only requires a further 33-15 = 18 hours after the BSc.

  9. Why You Will Succeed at UTD • Experienced Faculty Instructors – no TAs Teaching ECS courses. • Great Tutorial Support From Students and From UTD’s Learning Resource Ctr. • Drop and Repeat Policies Designed to Give You a Second Chance.

  10. Great Professional Advisors To help you through the tough times To help you navigate the system and graduate on time.

  11. Why You Will Succeed at UTD • Great faculty advisors to help you with career choices and degree planning. • Research faculty – opportunities for you to contribute to finding new knowledge. • Work while you learn! One of the largest co-op programs in the nation. • If You Can Get Into UT Dallas, We’ll Work Hard to Help You Graduate.

  12. A Simple Puzzle. • At a school picnic there is a tug-of-war competition. There are N students and you know their individual weights. • Divide the students into two teams such that the number of students on each team differs by at most one and the total weights of the teams are as close as possible.

  13. A Simple Puzzle - Solution • The only known way to solve this problem is to try every possible way of halving the N students. That’s N! (N/2!)2 subsets, and for N=100, that’s about 2100 ≈ 1030subsets.

  14. Another simple puzzle Given a set of N positive integers. Is there any subset of these numbers whose sum equals some target value T? The only known way is to try all subsets. That’s 2N subsets in the worst case. If N=100. 2100 is about 1030. The age of the universe is only 1028 nano-seconds.

  15. It’s how you look at it: . Are these three views of the same cube?

  16. It’s how you look at it 1 1 1 1 1 1 R?

  17. It’s how you look at it Replace the rest of the network with Resistor R 1 1 R = 1 + R/(1+R) Solving for R, R = (1+√5)/2 R R (1+√5)/2 is known as the Golden Ratio, Ø . It occurs frequently in nature.

  18. It’s how you look at it Fibonacci Numbers are defined as: • Fibn+1 = Fibn + Fibn-1 : 1, 1, 2, 3, 5, 8, 13, … • The ratio of two consecutive Fibonacci Numbers approaches the Golden Ratio, Ø:1/1 = 1, 2/1 = 2, 3/2 = 1.5, 5/3 = 1.66’, 8/5 = 1.6, 13/8 = 1.625, 21/13 = 1.61538, • Ø = 1·618033989 • Binet's Formula: Fibn = round(Øn/√5 )

  19. Golden Ratio 1 1 + 1 1 + 1 1 + 1 1 + … Ø = Ø =√(1 + √(1 + √(1 + …)))

  20. Fibonacci Spirals Fib(n) = Øn/√5

  21. That darned fly: . Distance d Train B Traveling at y mph Train A Traveling at x mph A fly travels back and forth between the trains at speed z mph (z>x+y). How far does the flytravel before the trains crash? What if the track is an arbitrary shape?

  22. Forget the track shape • The fly and the shape of the track don’t matter if we know the distance traveled by the trains. • We only need the time at which the trains collide. • Then we take the speed of the fly and multiply by its flying time.

  23. Forget one of the trains • Convert the two-train problem into a 1-train problem by adding the speeds of the trains. • The new sub-problem is as follows: • How long does it take a train traveling at x+y mph to travel a distance d? • Then, we multiply by the speed of the fly, z.

  24. Moore’s Law • The logic density of silicon integrated circuits has closely followed the curve (bits per square inch) = 2^(t - 1962) where t is time in years; that is, the amount of information storable on a given amount of silicon has roughly doubled every year since the technology was invented.

  25. Moore’s Law • This relation, first uttered in 1964 by semiconductor engineer Gordon Moore (who co-founded Intel four years later) held until the late 1970s, at which point the doubling period slowed to 18 months. • Smaller chips mean faster speeds.

  26. Research Strengths I . Micro-Electronics:low power digital, analog, RF, Nano-scale components. Optical Fiber communications: high speed switching, WDM, new modes. Plasma research Quantum-well devices Wireless: propagation, modulation, CDMA, etc. Coding Theory Digital Signal Processing: fundamental algorithms, applications

  27. How small is small? Current integrated circuits have features that are smaller than 0.3 microns (millionths of a meter). Nano-devices have features 200 times smaller. A finger nail grows approximately 1/8 inch per week. That’s about 5 microns per second.

  28. Research Strengths II . Telecomm’s networks: Fundamental protocols, verification, network simulation Ad-hoc networks: clustering, routing, slot allocation Embedded Systems Component reuse Distributed Algorithms Computer Graphics, animation Programming Languages

  29. Research Strengths III . Graph Layout Multimedia Artificial Intelligence, computer vision Computability Traffic Light Controls Computer Arithmetic Computer Architecture Digital Forensics

More Related