Home > Search Results

basic principles


sort by: Relevancy | Title try advanced search for more options

  1. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  2.   How billions of interconnected cells in the brain can interpret and regulate all our bodily functions as well as mediate our experiences of interactions with and responses to the world around us is a huge and fascinating question that many different disciplines have attempted to tackle. This lecture will consider what we have learned so far about the principles of neural encoding and how they may begin to explain our memories, emotions...more

  3. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  4. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  5. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  6. He never took a business course. Or finance. Or marketing. But InCube Labs CEO Mir Imran rose to the occasion, and he has gone on to own 20 different ventures, almost all of which were entirely successful. He encourages student entrepreneurs to pick up basic business skills early in their career - including financial and accounting skills as well as strategy concepts - to exceed in their chosen field.

  7. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  8. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  9. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  10. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  11. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  12. Professor Shankar introduces the course and answers student questions about the material and the requirements. He gives an overview of Newtonian mechanics and explains its two components: kinematics and dynamics. He then reviews basic concepts in calculus through two key equations: x0 + v0t + ½ at2 and v2 = v02+ 2 a (x-x0), tracing the fate of a particle in one dimension along the x-axis.