Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
lesson 6 final
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
# Object Oriented Design # Different forms of data structures length = 6 # number single = "A" # character name = "Faiha" # collection of characters list1 = [1,True,"Jim",-1213.211] # collection of objects # A list is a type of structure that can hold any type of object # A string is a type of structure that can ONLY hold characters list2 = [False,"Faiha", 0] list3 = list1 + list2 name = "Faiha"+" Al-Qahtani" # These are structures # We will create our OWN structure # 1. Give an idea about loops and conditions # 2. Exercises with loops/conditions and string manipulation # 3. Exercises with loops/conditions for sorting (sorting algorithms) # 4. Intro to creating our own data structures # a. Object Oriented Design - Stacks, Queues, Linked List # - Exercises using Stacks # - Exercises using Queues # - Linked List # b. Recursion # - Exercises using Recursion # 5. More algorithms using data structures (3 and 4) # 6. Trees (Binary Search Tree, AVL foundation for Decision Tree) # 7. Graphs (using 6 and 7, better prepared for Decision Tree)
[
+
]
Show input
Absolute running time: 0.34 sec, cpu time: 0.21 sec, memory peak: 6 Mb, absolute service time: 0,35 sec
edit mode
|
history
|
discussion