Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.
Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidable.
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
Is the programme fees mentioned in the enrollment option inclusive of GST?
No, 18% GST will be applicable in addition to the programme fees mentioned in the enrollment option.
Can the lectures be viewed on a mobile device?
Yes, you can download our Mobile App - http://bit.ly/SPAppDownload.
Mobile app also provides the feature to download the lectures and watch them offline.
the lectures can also be viewed on a mobile device by using Chrome browser.
How many times can I watch a lecture?
A lecture at SuperProfs can be watched any number of times till the end of the subscription
How can I get my doubts addressed?
At SuperProfs, you get 24 x 7 access to "Doubt Forum". You can post your doubt and the same shall be handled by the professor within 2 working days.
How To Enroll for the Course?
You can enroll for this course by making an online payment. After payment, you shall get a call from our course management team for your orientation on how to get best results from this unique course.
Accepting payments through Credit/Debit cards from all major banks.
EMI on Credit Card
Split the payment of the course fee across 3 or more
is available for all plans. Instalment information available on the payment
Seamless payment through Internet banking accepting payments from over 59 banks.