Skip Navigation

University of Nebraska–Lincoln

iLOG

Intelligent Learning Object Guide

Learning Objects

    All learning objects are playable online on Moodle. Please send an email to ilog_support@cse.unl.edu for an account to access Moodle. You can also download the zipped file of Learning Objects by sending an email request to ilog_support@cse.unl.edu.

  • Functions
  • Functions It discusses the definition of function and the gain of using function in programs. Encapsulation, code reuse, and problem decomposition are also discussed.

  • Searching
  • Searching It discusses the purpose of searching and the difference between searching a sorted list and unsorted list.

  • Sorting
  • Sorting It discusses the purpose of sorting and describes some basic methods for sorting a list.

  • Advanced Logic
  • Advanced Logic It discusses the representation of AND, OR, and NOT in most programming languages as well as the way to create compound Boolean expressions. It also covers short-circuit evaluation.

  • Arrays
  • Arrays It discusses the necessity and advantages of using arrays. Topics like zero indexing, information storage in arrays, common mistakes of using arrays and memory garbage are also covered.

  • Conditionals
  • Conditionals It discusses the need of using conditional statement. Topics about nested conditionals and the syntax of different types of conditional statements are also covered.

  • Logic
  • Logic It discusses the definition and assignment of Boolean variables as well as the advantage of using Boolean data type.

  • Looping
  • Looping It discusses the definition of different types of loops such as for loops, while loops and do-while loops. The main components, similarities and differences among different loops are also discussed. Common mistakes when people are using loops are mentioned, too.

  • Advanced Recursion
  • AdvRecursion It discusses ways in which recursion can be applied to some complex problems. It also highlights the difference between a tail recursive and a non-tail recursive function. There is an example about traversing through a tree/ graph using recursion.

  • Algorithm
  • Algorithm It discusses the definition of algorithm, the benefit of using algorithms in programming and the ways of creating and translating algorithms into working Java code.

  • Debugging
  • Debugging It discusses the common errors that programmers usually encounter, the way a debugger works and some good programming practices that can help prevent errors.

  • Non-Object-Oriented Problem Analysis
  • NonOOProblemAnalysis It discusses the way to break down a large problem into smaller problems, and handle each smaller problem as its own module to solve the large problem, and the benefits of this problem-decomposition approach to solving problems.

  • Numeric Data
  • NumericData It discusses how to determine when to use each numeric data type and how to evaluate arithmetic expressions involving precedence rules and different data types.

  • Object-Oriented Problem Analysis
  • OOProblemAnalysis It discusses what objects/classes are needed for a problem, attributes/data members the objects need to have and the actions that can be performed on those objects.

  • Recursion
  • Recursion It discusses the concept of recursion and also when recursive algorithms are applied. It also covers the way to identify a recursive function and its components. The ways to write a recursive function are discussed as well.

  • Variable and Constant
  • VariableConstant It discusses the concept of variable and constant, the way to declare them and difference between passing a variable by value and by reference.

  • Advanced Logic (Matlab)
  • AdvLogicMatlab It discusses the representation of AND, OR, and NOT in most programming languages as well as the way to create compound Boolean expressions. It also covers short-circuit evaluation.

  • Algorithm (Matlab)
  • AlgorithmMatlab It discusses the definition of algorithm, the benefit of using algorithms in programming and the ways of creating and translating algorithms into working Java code.

  • Arrays (MatLab)
  • ArraysMatLab It discusses the necessity and advantages of using arrays. Topics like zero indexing, information storage in arrays, common mistakes of using arrays and memory garbage are also covered.

  • Conditionals (MatLab)
  • ConditionalsMatLab It discusses the need of using conditional statement. Topics about nested conditionals and the syntax of different types of conditional statements are also covered.

  • Logic (MatLab)
  • LogicMatLab It discusses the definition and assignment of Boolean variables as well as the advantage of using Boolean data type.

  • Looping (MatLab)
  • LoopingMatLab It discusses the definition of different types of loops such as for loops, while loops and do-while loops. The main components, similarities and differences among different loops are also discussed. Common mistakes when people are using loops are mentioned, too.

  • Numeric Data (MatLab)
  • NumericDataMatLab It discusses how to determine when to use each numeric data type and how to evaluate arithmetic expressions involving precedence rules and different data types.

  • Recursion (MatLab)
  • RecursionMatLab It introduces the concept of recursion and also when recursive algorithms are applied. It also covers the way to identify a recursive function and its components. The ways to write a recursive function are discussed as well.

  • Searching (MatLab)
  • SearchingMatLab It discusses the purpose of searching and the difference between searching a sorted list and unsorted list.

  • Sorting (MatLab)
  • SortingMatLab It discusses the purpose of sorting and describes some basic methods for sorting a list.

  • Variable Constant (MatLab)
  • VariableConstantMatLab It discusses the concept of variable and constant, the way to declare them and difference between passing a variable by value and by reference.