KE
Ctrlk
  • dotNet Web 3.0
  • Engineering Management
    • Process Planning (SDLC)
    • Estimation
  • Requirements
    • Software Requirements Engineering
  • Design
    • OOD
    • DB Design
    • Modeling
    • Security
    • Algorithms
      • Algorithms complexity (understanding, big O notation, complexity of common algorithms)
      • Array sorting methods (bubble sort, quick sort, merge sort)
      • Tree structure (construction, traversal)
      • Binary search algorithm
      • Hash table (creating, collisions)
      • Stack, queue, linked list (construction, understanding, usage)
  • Construction Core
    • Programming language
    • Concurrency
    • Refactoring
    • Product deploying, software installation
    • Networking
  • Construction Web
    • Web server applications
    • Web Services
    • Microservices and Cloud
    • JavaScript, HTML, CSS
    • JavaScript Frameworks
  • Construction DB
    • SQL
    • Data Access Layer
  • Verification
    • Code Quality
    • Automated Testing (principles, patterns, and practices)
    • Automated Testing (Frameworks, Tools, Libraries)
  • Configuration Management
    • Product builds and Continuous Integration
    • Managing Versions
Powered by GitBook
On this page
  1. Design

Algorithms

Base algorithm knowledge that should be sufficient to implement basic tasks with necessary performance.

Algorithms complexity (understanding, big O notation, complexity of common algorithms)Array sorting methods (bubble sort, quick sort, merge sort)Tree structure (construction, traversal)Binary search algorithmHash table (creating, collisions)Stack, queue, linked list (construction, understanding, usage)
PreviousCSRF/XSRF protectionNextAlgorithms complexity (understanding, big O notation, complexity of common algorithms)

Last updated 6 years ago