Scribd
Upload
3 views5 pages

DSA With Full Stack Specialization

The document outlines a comprehensive syllabus covering various topics in Data Structures and Algorithms, Object-Oriented Programming, Operating Systems, Database Management Systems, Computer Networks, and Full Stack Specialization (MEAN Stack). Each section includes key concepts, problem-solving techniques, and algorithms relevant to the respective field. The syllabus is designed to provide a solid foundation for understanding computer science fundamentals and practical applications.

Uploaded by

Fayaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views5 pages

DSA With Full Stack Specialization

The document outlines a comprehensive syllabus covering various topics in Data Structures and Algorithms, Object-Oriented Programming, Operating Systems, Database Management Systems, Computer Networks, and Full Stack Specialization (MEAN Stack). Each section includes key concepts, problem-solving techniques, and algorithms relevant to the respective field. The syllabus is designed to provide a solid foundation for understanding computer science fundamentals and practical applications.

Uploaded by

Fayaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

DSA & Computer Fundamental Syllabus

❖ Basics of Programming and Data Structures

o Introduction to problem solving and Math’s used in programming.


o Recursion basics
o Problems on Recursion
o Time and space complexity analysis (Master’s theorem)
o Array and problems on array
o Prefix sum in array and problems related to that.
o Subset, subsequence and subarray
o Problems on Subset, Subsequence and Subarray
o 2-D Array (Metrices)
o Problems on metrices
o Bit Manipulation and Problems on bit manipulation
o Sorting and all types of sorting
o Problems on sorting
o Searching and problems on searching
o Hashing and problems on hashing
o Linked List and its types
o Problems and patterns on LinkedList
o Stack and Queue
o Problems on Stack and Queue

❖ Advance Data Structures and Algorithms

o Introduction to tree and tree traversals


o Tree views and Lowest common ancestor
o Binary search tree and problems on BST
o Problems on trees
o Segment tree and problems on segment tree
o Trie and Ternary search tree
o Problems on Trie & TST
o Heap/Priority queue
o Problems on Heap
o Introduction to Graph, classification of graph, Adjacency list and Adjacency
matrix

Website: https://www.algotutor.io E-mail Id: [email protected] Phone: +91-7260058093


o Graph traversals, cycle detection in graph, Island detection using connected
component method
o Topological sort and problems on topological sorting
o Shortest path algorithms (Dijkstra's and Bellman ford algorithm)
o Minimum spanning tree algorithm
o Greedy Algorithm and problems on greedy algorithm
o Backtracking and its basics
o Problems on backtracking (N queen problem, Rat in a maze problem etc.)
o Dynamic programming basics
o Basic problems on DP (Fibonacci, Staircase problem etc.)
o Problems on DP
o Problems on DP
o Problems on DP

❖ Object Oriented Programming Concepts

o Object
o Classes
o Abstraction
o Encapsulation
o Inheritance
o Polymorphism (Runtime and Compile Time Polymorphism)

❖ Operating System Concepts

o Types of Operating System


o Multiprogramming OS
o Multitasking OS
o System call
o Kernel system call
o User system call
o CPU Scheduling
o Round Robin, SJF, FCFS
o Schedulers
o Process and thread
o Synchronization
o Semaphore & Symphore

Website: https://www.algotutor.io E-mail Id: [email protected] Phone: +91-7260058093


o Deadlock
o Banker Algorithm
o Memory Management
o Paging
o Segmentation
o Multilevel paging
o Virtual Memory
o Page replacement techniques
o File System
o UNIX File System
o Disc Scheduling
o Disc Scheduling Techniques

❖ Database Management System (DBMS)

o Database Design

o Introduction to keys
o Codd rules
o Overview of Functional Dependencies and Armstrong rules
o Closure and Canonical covers
o Lossless Join and Dependency Preserving Decomposition
o Normal Forms

o ER Model

o Basic Terminologies
o Mapping Constraints
o Decomposition into Higher Normal Form

o Relation Algebra

o Basic Operators
o Derived Operators
o Deriving Expression for Queries

o Relational Calculus

o Tuple Relational Calculus

Website: https://www.algotutor.io E-mail Id: [email protected] Phone: +91-7260058093


o Domain Relational Calculus

o SQL (Structured Query Language)

o Data Definition language


o Data Manipulation Language
o Nested Queries
o Aggregate Functions

o File Organization

o Types of index
o Multilevel Indexing
o B/B+ tree

o Transaction and Concurrency Control

o ACID properties and state transition diagram


o Checkpoints
o Schedules and Types of Schedules
o Serializability
o Recoverability
o Locking Protocols

❖ Computer Networks

o Application Layer

o DNS
o SMTP
o HTTP
o FTP, TFTP
o TELNET

o Transport layer

o TCP Protocol

Website: https://www.algotutor.io E-mail Id: [email protected] Phone: +91-7260058093


o UDP Protocol
o State transition diagram in TCP
o Congestion Control policies

o Network layer

o IPv4
o IPv6
o IP addressing
o Routing Protocols
o Fragmentation

o Data Link Layer

o Flow Control Policies


o Error Control Policies
o Framing
o Ethernet
o CSMA
o ALOHA

❖ Full stack specialization (MEAN Stack)

o HTML
o CSS
o JavaScript
o Advanced JavaScript concepts (OOPS and concurrency)
o Angular
o How internet works (TCP, UDP, HTTP, Layering architecture)
o API design
o Node JS
o Express JS
o MongoDB
o Backend architecture
o Project

Website: https://www.algotutor.io E-mail Id: [email protected] Phone: +91-7260058093

You might also like