This class was created by Brainscape user Megan Estrada. Visit their profile to learn more about the creator.

Decks in this class (23)

Computer science paper 1
Integer 1,
Real float 2,
Boolean 3
18  cards
CS Paper 1
String manipulation length 1,
String manipulation position 2,
String manipulation substring 3
16  cards
CS paper 1..
Subroutines and stack frames 1,
Before calling subroutine what sy...,
Data structures 3
21  cards
cs paper 1
Linear seach 1,
Binary search 2,
Bubbles sort 3
15  cards
cs paper 1
Regular expresssions 1,
Metacharacters 2,
Syntax 3
19  cards
cs paper 1...
Tree 1,
Rooted trees 2,
Applications of rooted tree 3
15  cards
cs paper 1 - past paper questions
Recursive subroutine 1,
Heuristic technique 2,
Difference between static and dyn...
25  cards
paper 3 econ
Trade unions macro effects 1,
Trade unions micro effects 2,
Strike action macro effects 3
33  cards
cs 1.1
Integer 1,
Real float 2,
Boolean 3
32  cards
cs 1.2.
Procedural programming paradigm 1,
Advantages of structured approach 2,
Hierarchy charts 3
3  cards
cs 4.1.
Algorithm 1,
Sequence 2,
Abstraction 3
13  cards
cs 4.2.
Fsm 1,
State transition diagrams 2,
State transition table 3
3  cards
CS 1.1. (ALEVEL)
Role of stack frame in subroutine...,
Recursive subroutine 2,
Base case 3
3  cards
cs 1.2 (OOP) (ALEVEL)
Objects 1,
Class 2,
Private methods property 3
12  cards
CS 2.1 -definitions (ALEVEL)
Multi dimensional arrays 1,
Single dimensional arrays 2,
Dictionaires 3
28  cards
cs 2.1 data structures (ALEVEL)
Linear queues 1,
Queues operations 2,
Circular queue 3
14  cards
CS 3.1. (ALEVEL) - Graph Traversal
Depth first search 1,
Breadth first search 2
2  cards
CS 3.2. (ALEVEL) Tree-Traversal
Pre order 1,
In order 2,
Post order 3
3  cards
CS 3.3. (ALEVEL) - Reverse polish
Why rpn is used 1,
Ways to make infix into rpn 2
2  cards
CS 3.4. (ALEVEL) -Searching algorithms
Linear search 1,
Binary search 2,
Binary tree search 3
3  cards
CS 3.5. (ALEVEL) - Sorting Algorithms
Bubble sort 1,
Merge sort 2
2  cards
CS 3.6. (ALEVEL) - Optimisation Algorithm
Dijkstra s algorithm 1,
Application of dijkstra s algorit...
2  cards
CS 4.2. (ALEVEL) - Regular Languages
Blank 1
1  cards

More about
Practical cs

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Megan Estrada's Practical cs flashcards now!

How studying works.

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Add your own flashcards.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

What's Brainscape anyway?

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

Looking for something else?

a - cs
  • 30 decks
  • 1064 flashcards
  • 2 learners
Decks: Chapter 1 Information Representation, Chapter 2 Networks, Chapter 2 Internet, And more!
CS 115 Computer Science
  • 30 decks
  • 997 flashcards
  • 776 learners
Decks: Chapter 1 Checkpoint, Chapter 1 Notes Pt 1, Chapter 1 Notes Pt 2, And more!
!!!!CS/UX: Software Engineering
  • 26 decks
  • 3019 flashcards
  • 52 learners
Decks: Non Linear Data Structures, Linear Data Structures, Algorithms, And more!
CS 372
  • 13 decks
  • 683 flashcards
  • 221 learners
Decks: Final, Export Week 1 1, Export Week 2, And more!
Make Flashcards