Searching for queues : 24 results found | RSS Feed for this search

1

15.072J Queues: Theory and Applications (MIT) 15.072J Queues: Theory and Applications (MIT)

Description

This class deals with the modeling and analysis of queueing systems, with applications in communications, manufacturing, computers, call centers, service industries and transportation. Topics include birth-death processes and simple Markovian queues, networks of queues and product form networks, single and multi-server queues, multi-class queueing networks, fluid models, adversarial queueing networks, heavy-traffic theory and diffusion approximations. The course will cover state of the art results which lead to research opportunities. This class deals with the modeling and analysis of queueing systems, with applications in communications, manufacturing, computers, call centers, service industries and transportation. Topics include birth-death processes and simple Markovian queues, networks of queues and product form networks, single and multi-server queues, multi-class queueing networks, fluid models, adversarial queueing networks, heavy-traffic theory and diffusion approximations. The course will cover state of the art results which lead to research opportunities.

Subjects

modeling | modeling | queueing | queueing | queues | queues | queueing systems | queueing systems | communications | communications | manufacturing | manufacturing | computers | computers | call centers | call centers | service industries | service industries | transportation | transportation | applications | applications | birth-death processes | birth-death processes | markovian queues | markovian queues | networks | networks | single-server | single-server | multi-server | multi-server | multi-class queueing | multi-class queueing | fluid models | fluid models | adversarial queueing | adversarial queueing | heavy-traffic theory | heavy-traffic theory | diffusion approximations | diffusion approximations

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Readme file for Object-Oriented Software Design

Description

This readme file contains details of links to all the Object-Oriented Software Design module's material held on Jorum and information about the module as well.

Subjects

ukoer | class design | queues | linked lists | object-oriented software design process | object oriented design process | java notes | java practical | java reading material | object-oriented design process reading material | object-oriented software design process lecture | object-oriented software design process reading material | array lecture | linked list lecture | queue lecture | design reading material | class design reading material | class design lecture | case study | classes lecture | objects lecture | gui lecture | software design pattern lecture | inheritance reading material | polymorphism reading material | inheritance lecture | polymorphism | java object serialization reading material | data file lecture | java | review of java | introduction to java | arrays | object-oriented design process | testing | java classes | java objects | inheritance | abstract classes | gui | software design | java object serialization | object-oriented software design | java class | java object | class testing | introduction to java reading material | introduction to java practical | introduction to java lecture | review of java reading material | review of java practical | review of java lecture | java lecture | object-oriented design process practical | object-oriented design process lecture | object oriented design process reading material | object oriented design process practical | object oriented design process lecture | object-oriented software design process practical | object oriented software design process reading material | object oriented software design process practical | object oriented software design process lecture | arrays reading material | arrays practical | arrays lecture | linked lists reading material | linked lists practical | linked lists lecture | queues reading material | queues practical | queues lecture | class design practical | testing reading material | testing practical | testing lecture | java classes reading material | java classes practical | java classes lecture | java objects reading material | java objects practical | java objects lecture | inheritance practical | abstract classes reading material | abstract classes practical | abstract classes lecture | gui reading material | gui practical | software design reading material | software design practical | software design lecture | polymorphism practical | polymorphism lecture | java object serialization lecture | object-oriented software design reading material | object-oriented software design practical | object-oriented software design lecture | object oriented software design lecture | java class reading material | java class practical | java class lecture | java object reading material | java object lecture | class testing reading material | class testing practical | class testing lecture | java object practical | g400 | oosd | g400 reading material | g400 practical | g400 lecture | oosd reading material | oosd practical | oosd lecture | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.204 Computer Algorithms in Systems Engineering (MIT) 1.204 Computer Algorithms in Systems Engineering (MIT)

Description

This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized. This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized.

Subjects

databases | databases | data structures | data structures | divide and conquer algorithm | divide and conquer algorithm | greedy algorithm | greedy algorithm | dynamic programming | dynamic programming | branch and bound | branch and bound | linear optimization | linear optimization | nonlinear optimization | nonlinear optimization | approximate queues | approximate queues | network designs | network designs

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-transportation.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT) 1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics. The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

1.203 | 1.203 | 6.281 | 6.281 | 15.073 | 15.073 | 16.76 | 16.76 | ESD.216 | ESD.216 | logistics | logistics | transportation | transportation | hypercube models | hypercube models | barrier example | barrier example | operations research | operations research | spatial queues | spatial queues | queueing models | queueing models | network models | network models | TSP | TSP | heuristics | heuristics | geometrical probabilities | geometrical probabilities | Markov | Markov | quantitative techniques | quantitative techniques | transportation systems analysis | transportation systems analysis | urban service systems | urban service systems | emergency services | emergency services | random variables | random variables | multi-server queueing theory | multi-server queueing theory | spatial location theory | spatial location theory | network analysis | network analysis | graph theory | graph theory | simulation | simulation | urban OR | urban OR

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.225J Transportation Flow Systems (MIT) 1.225J Transportation Flow Systems (MIT)

Description

Design, operation, and management of traffic flows over complex transportation networks are the foci of this course. It covers two major topics: traffic flow modeling and traffic flow operations. Sub-topics include deterministic and probabilistic models, elements of queuing theory, and traffic assignment. Concepts are illustrated through various applications and case studies. This is a half-term subject offered during the second half of the semester. Design, operation, and management of traffic flows over complex transportation networks are the foci of this course. It covers two major topics: traffic flow modeling and traffic flow operations. Sub-topics include deterministic and probabilistic models, elements of queuing theory, and traffic assignment. Concepts are illustrated through various applications and case studies. This is a half-term subject offered during the second half of the semester.

Subjects

transportation | transportation | transportation flow systems | transportation flow systems | traffic | traffic | traffic flow | traffic flow | networks | networks | transportation networks | transportation networks | flow modeling | flow modeling | flow operations | flow operations | deteministic models | deteministic models | probabilistic models | probabilistic models | queuing theory | queuing theory | queues | queues | traffic assignment | traffic assignment | case studies | case studies | cumulative plots | cumulative plots | airport runway capacity | airport runway capacity | runway capacity | runway capacity | road traffic | road traffic | shortest paths | shortest paths | optimizations | optimizations | highway control | highway control | ramp metering | ramp metering | simulation models | simulation models | isolated signals | isolated signals | operations | operations | operational problems | operational problems | air traffic operation | air traffic operation | air | air | road | road | component | component | 1.225 | 1.225 | ESD.205 | ESD.205

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

6.087 Practical Programming in C (MIT) 6.087 Practical Programming in C (MIT)

Description

This course provides a thorough introduction to the C programming language, the workhorse of the UNIX operating system and lingua franca of embedded processors and micro-controllers. The first two weeks will cover basic syntax and grammar, and expose students to practical programming techniques. The remaining lectures will focus on more advanced concepts, such as dynamic memory allocation, concurrency and synchronization, UNIX signals and process control, library development and usage. Daily programming assignments and weekly laboratory exercises are required. Knowledge of C is highly marketable for summer internships, UROPs, and full-time positions in software and embedded systems development. This course provides a thorough introduction to the C programming language, the workhorse of the UNIX operating system and lingua franca of embedded processors and micro-controllers. The first two weeks will cover basic syntax and grammar, and expose students to practical programming techniques. The remaining lectures will focus on more advanced concepts, such as dynamic memory allocation, concurrency and synchronization, UNIX signals and process control, library development and usage. Daily programming assignments and weekly laboratory exercises are required. Knowledge of C is highly marketable for summer internships, UROPs, and full-time positions in software and embedded systems development.

Subjects

writing C programs | writing C programs | compiling C programs | compiling C programs | variables and datatypes | variables and datatypes | control flow | control flow | input and output | input and output | pointers and memory addressing | pointers and memory addressing | arrays and pointer arithmetic | arrays and pointer arithmetic | memory allocation | memory allocation | stacks and queues | stacks and queues | hash tables | hash tables | C standard library | C standard library | dynamic memory allocation | dynamic memory allocation | multithreading | multithreading | concurrency | concurrency | asynchronous input/output | asynchronous input/output

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

6.006 Introduction to Algorithms (MIT) 6.006 Introduction to Algorithms (MIT)

Description

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

Subjects

algorithms | algorithms | python | python | python cost model | python cost model | binary search trees | binary search trees | hashing | hashing | sorting | sorting | searching | searching | shortest paths | shortest paths | dynamic programming | dynamic programming | numerics | numerics | document distance | document distance | longest common substring | longest common substring | dijkstra | dijkstra | fibonacci | fibonacci | image resizing | image resizing | chaining | chaining | hash functions | hash functions | priority queues | priority queues | breadth first search | breadth first search | depth first search | depth first search | memoization | memoization | divide and conquer | divide and conquer

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Java Remedies

Description

Java Remedies" topic in the Object-Oriented Software Design module

Subjects

ukoer | object-oriented software design process reading material | queues | linked lists | arrays | object-oriented software design process | software design | object oriented software design process reading material | arrays reading material | linked lists reading material | queues reading material | object-oriented software design reading material | software design reading material | g400 | oosd | object-oriented software design | g400 reading material | oosd reading material | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Java Remedies

Description

Java Remedies" topic in the Object-Oriented Software Design module

Subjects

ukoer | queues | java practical | linked lists | arrays | object-oriented software design process | object-oriented software design | software design | object-oriented software design process practical | object oriented software design process practical | arrays practical | linked lists practical | queues practical | object-oriented software design practical | software design practical | g400 | oosd | g400 practical | oosd practical | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Java Remedies

Description

Java Remedies" topic in the Object-Oriented Software Design module.

Subjects

ukoer | object-oriented software design process | array lecture | linked list lecture | queue lecture | queues | linked lists | arrays | object-oriented software design | software design | object-oriented software design process lecture | object oriented software design process lecture | arrays lecture | linked lists lecture | queues lecture | object-oriented software design lecture | software design lecture | object oriented software design lecture | g400 | oosd | g400 lecture | oosd lecture | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Java Remedies

Description

Java Remedies" topic in the Object-Oriented Software Design module.

Subjects

ukoer | linked lists | design reading material | queues | arrays | object-oriented software design process | object-oriented software design | software design | object-oriented software design process reading material | object oriented software design process reading material | arrays reading material | linked lists reading material | queues reading material | object-oriented software design reading material | software design reading material | g400 | oosd | g400 reading material | oosd reading material | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT) 1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics. The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

logistics | logistics | transportation | transportation | hypercube models | hypercube models | barrier example | barrier example | operations research | operations research | spatial queues | spatial queues | queueing models | queueing models | network models | network models | TSP | TSP | heuristics | heuristics | geometrical probablities | geometrical probablities | Markov | Markov | 1.203 | 1.203 | 6.281 | 6.281 | 15.073 | 15.073 | 16.76 | 16.76 | ESD.216 | ESD.216

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

15.072J Queues: Theory and Applications (MIT)

Description

This class deals with the modeling and analysis of queueing systems, with applications in communications, manufacturing, computers, call centers, service industries and transportation. Topics include birth-death processes and simple Markovian queues, networks of queues and product form networks, single and multi-server queues, multi-class queueing networks, fluid models, adversarial queueing networks, heavy-traffic theory and diffusion approximations. The course will cover state of the art results which lead to research opportunities.

Subjects

modeling | queueing | queues | queueing systems | communications | manufacturing | computers | call centers | service industries | transportation | applications | birth-death processes | markovian queues | networks | single-server | multi-server | multi-class queueing | fluid models | adversarial queueing | heavy-traffic theory | diffusion approximations

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

logistics | transportation | hypercube models | barrier example | operations research | spatial queues | queueing models | network models | TSP | heuristics | geometrical probablities | Markov | 1.203 | 6.281 | 15.073 | 16.76 | ESD.216

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

1.203 | 6.281 | 15.073 | 16.76 | ESD.216 | logistics | transportation | hypercube models | barrier example | operations research | spatial queues | queueing models | network models | TSP | heuristics | geometrical probabilities | Markov | quantitative techniques | transportation systems analysis | urban service systems | emergency services | random variables | multi-server queueing theory | spatial location theory | network analysis | graph theory | simulation | urban OR

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allportuguesecourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

1.203 | 6.281 | 15.073 | 16.76 | ESD.216 | logistics | transportation | hypercube models | barrier example | operations research | spatial queues | queueing models | network models | TSP | heuristics | geometrical probabilities | Markov | quantitative techniques | transportation systems analysis | urban service systems | emergency services | random variables | multi-server queueing theory | spatial location theory | network analysis | graph theory | simulation | urban OR

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allspanishcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

6.087 Practical Programming in C (MIT)

Description

This course provides a thorough introduction to the C programming language, the workhorse of the UNIX operating system and lingua franca of embedded processors and micro-controllers. The first two weeks will cover basic syntax and grammar, and expose students to practical programming techniques. The remaining lectures will focus on more advanced concepts, such as dynamic memory allocation, concurrency and synchronization, UNIX signals and process control, library development and usage. Daily programming assignments and weekly laboratory exercises are required. Knowledge of C is highly marketable for summer internships, UROPs, and full-time positions in software and embedded systems development.

Subjects

writing C programs | compiling C programs | variables and datatypes | control flow | input and output | pointers and memory addressing | arrays and pointer arithmetic | memory allocation | stacks and queues | hash tables | C standard library | dynamic memory allocation | multithreading | concurrency | asynchronous input/output

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allthaicourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Elementary Data Structures

Description

In this course, the student will learn the theoretical and practical aspects of algorithms and Data Structures. The student will also learn to implement Data Structures and algorithms in C/C++, analyze those algorithms, and consider both their worst-case complexity and practical efficiency. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Computer Science 201)

Subjects

elementary data | data | arrays | c++ | implementation | stacks | queues | pointers | dynamic | memory | allocation | class | algorithm efficiency | hashtables | Computer science | I100

License

Attribution 2.0 UK: England & Wales Attribution 2.0 UK: England & Wales http://creativecommons.org/licenses/by/2.0/uk/ http://creativecommons.org/licenses/by/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

logistics | transportation | hypercube models | barrier example | operations research | spatial queues | queueing models | network models | TSP | heuristics | geometrical probablities | Markov | 1.203 | 6.281 | 15.073 | 16.76 | ESD.216

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.204 Computer Algorithms in Systems Engineering (MIT)

Description

This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized.

Subjects

databases | data structures | divide and conquer algorithm | greedy algorithm | dynamic programming | branch and bound | linear optimization | nonlinear optimization | approximate queues | network designs

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.203J Logistical and Transportation Planning Methods (MIT)

Description

The class will cover quantitative techniques of Operations Research with emphasis on applications in transportation systems analysis (urban, air, ocean, highway, pick-up and delivery systems) and in the planning and design of logistically oriented urban service systems (e.g., fire and police departments, emergency medical services, emergency repair services). It presents a unified study of functions of random variables, geometrical probability, multi-server queueing theory, spatial location theory, network analysis and graph theory, and relevant methods of simulation. There will be discussion focused on the difficulty of implementation, among other topics.

Subjects

1.203 | 6.281 | 15.073 | 16.76 | ESD.216 | logistics | transportation | hypercube models | barrier example | operations research | spatial queues | queueing models | network models | TSP | heuristics | geometrical probabilities | Markov | quantitative techniques | transportation systems analysis | urban service systems | emergency services | random variables | multi-server queueing theory | spatial location theory | network analysis | graph theory | simulation | urban OR

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

1.225J Transportation Flow Systems (MIT)

Description

Design, operation, and management of traffic flows over complex transportation networks are the foci of this course. It covers two major topics: traffic flow modeling and traffic flow operations. Sub-topics include deterministic and probabilistic models, elements of queuing theory, and traffic assignment. Concepts are illustrated through various applications and case studies. This is a half-term subject offered during the second half of the semester.

Subjects

transportation | transportation flow systems | traffic | traffic flow | networks | transportation networks | flow modeling | flow operations | deteministic models | probabilistic models | queuing theory | queues | traffic assignment | case studies | cumulative plots | airport runway capacity | runway capacity | road traffic | shortest paths | optimizations | highway control | ramp metering | simulation models | isolated signals | operations | operational problems | air traffic operation | air | road | component | 1.225 | ESD.205

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

6.087 Practical Programming in C (MIT)

Description

This course provides a thorough introduction to the C programming language, the workhorse of the UNIX operating system and lingua franca of embedded processors and micro-controllers. The first two weeks will cover basic syntax and grammar, and expose students to practical programming techniques. The remaining lectures will focus on more advanced concepts, such as dynamic memory allocation, concurrency and synchronization, UNIX signals and process control, library development and usage. Daily programming assignments and weekly laboratory exercises are required. Knowledge of C is highly marketable for summer internships, UROPs, and full-time positions in software and embedded systems development.

Subjects

writing C programs | compiling C programs | variables and datatypes | control flow | input and output | pointers and memory addressing | arrays and pointer arithmetic | memory allocation | stacks and queues | hash tables | C standard library | dynamic memory allocation | multithreading | concurrency | asynchronous input/output

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

6.006 Introduction to Algorithms (MIT)

Description

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

Subjects

algorithms | python | python cost model | binary search trees | hashing | sorting | searching | shortest paths | dynamic programming | numerics | document distance | longest common substring | dijkstra | fibonacci | image resizing | chaining | hash functions | priority queues | breadth first search | depth first search | memoization | divide and conquer

License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata