Course Overview

new java course

FAQ

FAQ area empty

    Requirment

    Requirment area empty

    Outcomes

    Outcomes area empty

Computer Science Pick a LanguagePythonGoC#RustC++CJavaData StructuresLinked ListStackQueueHash TableArrayTreeBinary TreeBinary Search TreeFull Binary TreeComplete Binary Tree Balanced TreeUnbalanced TreeGraphDirected GraphUndirected GraphSpanning TreeRepresentationAdjacency MatrixAdjacency ListHeapAsymptotic NotationBig OBig-ThetaBig OmegaCommon RuntimesConstantLogarithmicLinearPolynomialExponentialFactorialCommon AlgorithmsRecursionTail RecursionNon-Tail RecursionCachesLRU CacheMFU CacheSearchingBinary SearchLinear SearchSortingBubble SortSelection SortInsertion SortHeap SortQuick SortMerge SortTreePre-Order TraversalIn-Order TraversalPost Order TraversalBreadth First SearchDepth First SearchGraphsBreadth First SearchDepth First SearchBellman Ford's AlgorithmDijkstra's AlgorithmA* AlgorithmBack TrackingFinding Hamiltonian PathsSolving N Queen ProblemMaze Solving ProblemThe Knight's Tour ProblemGreedy AlgorithmsDijkstra's AlgorithmHuffman CodingKruskal's AlgorithmFord-Fulkerson AlgorithmPrim's AlgorithmRabin-Karp AlgorithmLFU CacheString Search & ManipulationsSearch Pattern in TextSuffix ArraysBrute Force SearchKnuth-Morris PrattBoyer-MooreRobin-KarpSubstring SearchFloating Point MathEndianessBig EndianLittle EndianCommon UML DiagramsUnicodeASCIICharacter EncodingsClass DiagramsUsecase DiagramsActivity DiagramsStatemachine DiagramsSequence DiagramsDesign PatternsGoF Design PatternsArchitectural PatternsDependency InjectionNull Object PatternType Object PatternBasic Math SkillsProbabilityCombinatoricsComplexity ClassesPNPNP HardNP CompleteP = NPTravelling Salesman ProblemKnapsack ProblemLongest Path ProblemTriesBalanced Search TreesAVL TreesRed / Black Trees2 3 Search Trees2 3 4 TreesK-ary / M-ary TreeB-TreeSystem DesignHorizontal vs Vertical ScalingLoad BalancingClusteringCachingCDNProxyCAP TheoremQueuesArchitectural StylesRESTGraphQLgRPCCloud Design PatternsLong PollingShort PollingWeb SocketsSSEDatabasesSQL vs NoSQL DatabasesNormalization / DenormalizationEntity-Relationship ModelDDLDMLDQLDCLLockingACID ModelBASECAP TheoremPACELCIndexesViewsTransactionsStored ProceduresDatabase FederationReplicationShardingNetworkingOSI ModelTCP/IP ModelDNSHTTPTLS & HTTPSSocketsSecurityPublic Key CryptographyHashing / Encryption / EncodingHashing AlgorithmsOWASP Top 10How Computers WorkHow CPU Executes ProgramsHow Computers CalculateRegisters and RAMInstructions and ProgramsCPU CacheProcesses and ThreadsProcess ForkingMemory ManagementLock / Mutex / SemaphoreConcurrency in Multiple CoresScheduling AlgorithmsCPU InterruptsProcesses vs ThreadsK-D TreesSkip Lists Co-NPBitwise Operators

Internships

Knewtontech

krishnagiri

Last Date to Apply: 2025-04-08

Free 1-Month Web Development Internship

Are you passionate about web development and eager to gain real-world experience? Our free 1-month internship is designed to provide hands-on training in HTML, CSS, and JavaScript, helping you build real projects under expert guidance.

Knewtontech

krishnagiri

Last Date to Apply: 2025-04-08

Free 1-Month Javascript Internship

Are you passionate about web development and eager to gain real-world experience? Our free 1-month internship is designed to provide hands-on training in HTML, CSS, and JavaScript, helping you build real projects under expert guidance.

Course curriculum

KT Nest

  • 14 Courses
  • 1 year ago
  • 53 Students

(3.5 Stars)
View Details
0.0 out of 5.0
5 Star 0%
4 Star 0%
3 Star 0%
2 Star 0%
1 Star 0%

No Reviews found

Submit Reviews

Rate this course :

Remove all
7.jpg
₹11.00

₹1.00

Course Details
  • 10 Students
  • 22h 15m
  • English
  • beginner Level

Share on social media

TOP SELLING COURSE