Kuesioner Browse

Kurikulum 2013
Kode Kuliah EL2008
Nama Kuliah Pemecahan Masalah dengan C
SKS 3
Tahun Ajaran 2016/2017
Semester 1
Urutan Pertanyaan Question
1 Introduction  Introduction 
2 Programming Construct : Variables, types, expressions, and assignment Simple I/O  Programming Construct : Variables, types, expressions, and assignment Simple I/O 
3 Programming Construct : Conditional Structures  Programming Construct : Conditional Structures 
4 Programming Construct : Iterative control structures, Pointers  Programming Construct : Iterative control structures, Pointers 
5 Programming Construct : Functions and parameter passing, File I/O  Programming Construct : Functions and parameter passing, File I/O 
6 Algorithms and problem-solving  Algorithms and problem-solving 
7 Data Structure : Arrays and Records Strings and string processing  Data Structure : Arrays and Records Strings and string processing 
8 Data Structure : Data representation in memory Static, stack, and heap allocation Runtime storage management Linked structures  Data Structure : Data representation in memory Static, stack, and heap allocation Runtime storage management Linked structures 
9 Data Structure : Implementation strategies for stacks, queues, and hash tables Implementation strategies for graphs and trees  Data Structure : Implementation strategies for stacks, queues, and hash tables Implementation strategies for graphs and trees 
10 Recursion  Recursion 
11 Basic Algorithm Analysis : Asymptotic analysis of upper and average complexity bounds Identifying differences among best, average, and worst case behaviors  Basic Algorithm Analysis : Asymptotic analysis of upper and average complexity bounds Identifying differences among best, average, and worst case behaviors 
12 Basic Algorithm Analysis : Big \"O,\" little \"o,\" omega, and theta notation Empirical measurements of performance Time and space tradeoffs in algorithms  Basic Algorithm Analysis : Big \"O,\" little \"o,\" omega, and theta notation Empirical measurements of performance Time and space tradeoffs in algorithms 
13 Algorithm Strategy : Brute-force/exhaustive search algorithms Greedy algorithms  Algorithm Strategy : Brute-force/exhaustive search algorithms Greedy algorithms 
14 Algorithm Strategy : Divide-and-conquer Backtracking  Algorithm Strategy : Divide-and-conquer Backtracking 
15 Computing Algorithm : Simple numerical algorithms  Computing Algorithm : Simple numerical algorithms 
16 Computing Algorithm : Sequential and binary search algorithms Sorting algorithms Hash tables Binary search trees  Computing Algorithm : Sequential and binary search algorithms Sorting algorithms Hash tables Binary search trees 
17 Intro to Parallel and Distributed  Intro to Parallel and Distributed