NDSS Academy

Computer Science & Engineering

B-Tech · Semester 3

6 MonthsDuration 10Subjects 51Chapters OnlineTests & result
Enquire now Nearest centre Syllabus PDF

Your roadmap · आपका रोडमैप

  1. 1
    Admission & first meetingप्रवेश और पहली मुलाकात

    Enquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.

  2. 2
    Semester 3 — subject classesसेमेस्टर 3 — विषयवार कक्षाएँ

    Every theory subject of the term, unit by unit, with notes, numericals and doubt classes.

    Engineering Mathematics-IVTechnical CommunicationData StructureComputer Organization and ArchitectureDiscrete Structures and Theory of LogicCyber Security
  3. 3
    Labs, practicals & project workलैब, प्रैक्टिकल और प्रोजेक्ट

    Experiments / jobs / project work as in the syllabus, with practical file and viva preparation.

    Data Structure LabComputer Organization LabWeb Designing WorkshopMini Project or Internship Assessment-I
  4. 4
    Unit tests & mid-termयूनिट टेस्ट और मिड-टर्म

    A test after every unit and a mid-term in the university / board pattern.

  5. 5
    Semester 3 mock testमॉक टेस्ट

    A full mock test of all subjects before the exam, with analysis.

  6. 6
    Semester 3 exam (university / board)सेमेस्टर / वार्षिक परीक्षा

    Previous papers, important questions and full revision.

  7. 7
    Online tests & resultऑनलाइन टेस्ट और रिज़ल्ट

    Take the tests online; your marks and result show in your student login and at the centre.

Syllabus · पाठ्यक्रम

10 subjects · 51 chapters · 254 topics

Engineering Mathematics-IV5 chapters · 6 Months Subject page →
01Unit 1: Sets, Relations and Functions 5 topics
  1. Sets, operations and Venn diagrams
  2. Power set and cardinality
  3. Relations and their properties
  4. Equivalence relations and partial orders
  5. Functions: one-one, onto, inverse and composition
02Unit 2: Logic, Counting and Recurrence Relations 5 topics
  1. Propositions, connectives and truth tables
  2. Tautology, contradiction and logical equivalence
  3. Permutations and combinations
  4. Pigeonhole and inclusion-exclusion principles
  5. Linear recurrence relations and their solution
03Unit 3: Probability and Random Variables 5 topics
  1. Classical and axiomatic probability
  2. Conditional probability and independence
  3. Bayes' theorem
  4. Discrete and continuous random variables
  5. Expectation, variance and moment generating function
04Unit 4: Probability Distributions 4 topics
  1. Binomial distribution
  2. Poisson distribution
  3. Normal distribution and standard normal tables
  4. Exponential and uniform distributions
05Unit 5: Statistical Techniques and Testing of Hypothesis 5 topics
  1. Correlation and rank correlation
  2. Lines of regression
  3. Curve fitting by least squares
  4. Sampling, null hypothesis and level of significance
  5. t-test, chi-square test and F-test
Technical Communication5 chapters · 6 Months Subject page →
01Unit 1: Fundamentals of Technical Communication 5 topics
  1. Meaning, features and importance of technical communication
  2. Process and levels of communication
  3. Flow of communication: downward, upward, horizontal and diagonal
  4. Barriers to communication
  5. General vs technical communication
02Unit 2: Forms of Business Correspondence 5 topics
  1. Business letters: parts and formats (block, modified block)
  2. Job application and resume
  3. Memo, notice and circular
  4. Agenda and minutes of meetings
  5. E-mail writing
03Unit 3: Technical Reports and Proposals 5 topics
  1. Types of reports: informational, analytical, feasibility, progress
  2. Structure of a formal report: preliminary, main and supplementary parts
  3. Executive summary
  4. Technical proposals: types and structure
  5. Graphics and tables in reports
04Unit 4: Technical Writing Style, Research Papers and Manuals 5 topics
  1. Style: clarity, conciseness, objectivity and accuracy
  2. Use of passive voice and technical vocabulary
  3. Research paper structure (IMRaD) and abstract
  4. Referencing and citation styles (IEEE, APA)
  5. Instruction manuals and technical descriptions
05Unit 5: Oral Presentation and Non-Verbal Communication 5 topics
  1. Planning and delivering technical presentations
  2. Audience analysis and use of visual aids
  3. Handling questions
  4. Kinesics, proxemics, paralanguage and chronemics
  5. Seminars and conferences
Data Structure5 chapters · 6 Months Subject page →
01Unit 1: Introduction, Arrays and Linked Lists 7 topics
  1. Basic terminology, data types, ADT
  2. Algorithm efficiency, time-space trade-off
  3. Asymptotic notations: Big-O, Omega, Theta
  4. Arrays: 1-D, 2-D, n-D; row-major and column-major address formulas
  5. Sparse matrices
  6. Singly, doubly and circular linked lists and their operations
  7. Polynomial representation and addition
02Unit 2: Stacks and Queues 5 topics
  1. Stack ADT, array and linked implementation
  2. Infix, prefix, postfix conversion and evaluation
  3. Recursion, Tower of Hanoi, tail recursion
  4. Queue ADT, array and linked implementation
  5. Circular queue, deque and priority queue
03Unit 3: Searching, Hashing and Sorting 6 topics
  1. Sequential, index-sequential and binary search
  2. Hashing: hash functions and collision resolution
  3. Insertion, selection and bubble sort
  4. Quick sort and merge sort
  5. Heap sort and radix sort
  6. Comparison of sorting methods
04Unit 4: Graphs 6 topics
  1. Graph terminology
  2. Adjacency matrix, adjacency list and multilist
  3. BFS and DFS traversal, connected components
  4. Spanning trees, Prim's and Kruskal's algorithms
  5. Transitive closure and Warshall's algorithm
  6. Dijkstra's shortest path
05Unit 5: Trees 7 topics
  1. Tree terminology, binary trees and their representation
  2. Complete and extended binary trees
  3. Inorder, preorder, postorder traversal; tree from traversals
  4. Threaded binary trees
  5. Binary search tree operations
  6. AVL trees and rotations
  7. B-trees, binary heaps and Huffman coding
Computer Organization and Architecture5 chapters · 6 Months Subject page →
01Unit 1: Introduction, Buses and Addressing Modes 6 topics
  1. Functional units of a digital computer and their interconnection
  2. Buses, bus architecture, types of buses
  3. Bus arbitration: daisy chaining, polling, independent requests
  4. Register, bus and memory transfer (RTL)
  5. General register organisation and stack organisation
  6. Addressing modes
02Unit 2: Arithmetic and Logic Unit 6 topics
  1. Look-ahead carry adders
  2. Signed operand multiplication and Booth's algorithm
  3. Array multiplier
  4. Division (restoring and non-restoring) and logic operations
  5. Floating point representation and IEEE 754
  6. Floating point arithmetic and ALU design
03Unit 3: Control Unit and Pipelining 6 topics
  1. Instruction types and formats
  2. Instruction cycle, fetch and execute sub-cycles, micro-operations
  3. Program control, RISC and CISC
  4. Pipelining: basic concepts, data and instruction hazards
  5. Hardwired control
  6. Microprogrammed control: sequencing, next-address field, horizontal and vertical microprogramming
04Unit 4: Memory Organisation 5 topics
  1. Memory hierarchy
  2. Semiconductor RAM, 2D and 2.5D organisation, ROM
  3. Cache memory: performance, mapping and replacement
  4. Auxiliary memory: magnetic disk, tape, optical disk
  5. Virtual memory concept and implementation
05Unit 5: Input-Output Organisation 6 topics
  1. Peripheral devices, I/O interface and I/O ports
  2. Interrupts: hardware, types and exceptions
  3. Programmed I/O and interrupt-initiated I/O
  4. Direct Memory Access (DMA)
  5. I/O channels and processors
  6. Synchronous and asynchronous serial communication, standard interfaces
Discrete Structures and Theory of Logic5 chapters · 6 Months Subject page →
01Unit 1: Sets, Relations, Functions and Proof Methods 6 topics
  1. Sets, combination of sets, multisets, ordered pairs, set identities
  2. Relations: operations, properties, composite relations, closure
  3. Equivalence relations and partial orders
  4. Functions: types, composition, inverse, growth of functions
  5. Mathematical induction and its variants
  6. Proof by contradiction and counter-example
02Unit 2: Algebraic Structures 6 topics
  1. Algebraic structures and their properties
  2. Groups, subgroups and order of an element
  3. Cyclic groups and cosets
  4. Lagrange's theorem and normal subgroups
  5. Permutation and symmetric groups, homomorphism
  6. Rings, integral domains and fields
03Unit 3: Lattices and Boolean Algebra 6 topics
  1. Partially ordered sets and Hasse diagrams
  2. Lattices: bounded, complemented, distributive, modular and complete
  3. Boolean algebra: axioms and theorems
  4. Algebraic manipulation of Boolean expressions
  5. Simplification using Karnaugh maps
  6. Logic gates and digital circuits
04Unit 4: Propositional and Predicate Logic 6 topics
  1. Propositions, connectives and well-formed formulas
  2. Truth tables, tautology, contradiction and satisfiability
  3. Algebra of propositions and normal forms
  4. Theory of inference
  5. Predicates, quantifiers and their negation
  6. Inference theory of predicate logic
05Unit 5: Trees, Graphs, Recurrence and Combinatorics 6 topics
  1. Trees, binary trees and binary search trees
  2. Graph terminology, representation, multigraphs and bipartite graphs
  3. Planar graphs, isomorphism and homeomorphism
  4. Euler and Hamiltonian paths, graph colouring
  5. Recurrence relations and generating functions
  6. Sum and product rules, permutations and combinations, pigeonhole principle
Cyber Security5 chapters · 6 Months Subject page →
01Unit 1: Introduction to Cyber Crime and Information Security 5 topics
  1. Information systems and their security needs
  2. Confidentiality, integrity and availability (CIA triad)
  3. Cyber crime: definition and origins
  4. Classification of cyber crimes
  5. Cyber criminals and their motives
02Unit 2: Cyber Offenses and Social Engineering 6 topics
  1. How criminals plan attacks: reconnaissance, scanning, attack
  2. Passive and active attacks
  3. Social engineering
  4. Cyberstalking and cyber bullying
  5. Botnets and attack vectors
  6. Cloud and mobile device threats
03Unit 3: Tools and Methods Used in Cyber Crime 6 topics
  1. Proxy servers and anonymisers
  2. Phishing and identity theft
  3. Password cracking, keyloggers and spyware
  4. Virus, worms and Trojan horses
  5. DoS and DDoS attacks
  6. SQL injection and buffer overflow
04Unit 4: Cyber Laws, Policies and Forensics 5 topics
  1. Information Technology Act 2000 and the 2008 amendment
  2. Important sections: 43, 66, 66C, 66D, 66E, 66F, 67
  3. Digital signatures and certifying authorities
  4. Organisational security policies
  5. Basics of cyber forensics and digital evidence
05Unit 5: Security Measures and Safe Computing 6 topics
  1. Firewalls and intrusion detection systems
  2. Antivirus and patch management
  3. Cryptography basics: symmetric and public-key
  4. Secure web browsing, HTTPS and safe online payments
  5. Password policy and two-factor authentication
  6. Reporting cyber crime: 1930 helpline and cybercrime.gov.in
Data Structure Lab6 chapters · 6 Months Subject page →
01Arrays and Searching 4 topics
  1. Insertion and deletion in an array
  2. Linear search
  3. Binary search (iterative and recursive)
  4. Matrix operations and sparse matrix
02Sorting 6 topics
  1. Bubble sort
  2. Selection sort
  3. Insertion sort
  4. Quick sort
  5. Merge sort
  6. Heap sort
03Linked Lists 4 topics
  1. Singly linked list: insert, delete, display, reverse
  2. Doubly linked list operations
  3. Circular linked list
  4. Polynomial addition using linked list
04Stacks and Queues 5 topics
  1. Stack using array and linked list
  2. Infix to postfix conversion
  3. Postfix evaluation
  4. Linear and circular queue
  5. Queue using linked list
05Trees 3 topics
  1. Binary search tree: insert, search, delete
  2. Inorder, preorder and postorder traversal
  3. Counting nodes and height
06Graphs 4 topics
  1. Adjacency matrix and list representation
  2. BFS and DFS traversal
  3. Prim's / Kruskal's minimum spanning tree
  4. Dijkstra's shortest path
Computer Organization Lab5 chapters · 6 Months Subject page →
01Logic Gates and Adders 4 topics
  1. Verification of AND, OR, NOT, NAND, NOR, XOR gates
  2. Universal gate realisation
  3. Half adder and full adder
  4. 4-bit binary adder-subtractor
02Combinational Circuits 4 topics
  1. Multiplexer and demultiplexer
  2. Encoder and decoder
  3. Code converters (binary to Gray)
  4. Comparator
03Flip-Flops, Registers and Counters 3 topics
  1. SR, JK, D and T flip-flops
  2. Shift registers (SISO, SIPO, PISO, PIPO)
  3. Synchronous and asynchronous counters
04ALU Design 3 topics
  1. Design of 1-bit and 4-bit ALU
  2. Arithmetic and logic operation selection
  3. Status flags
05Memory and Simulation 4 topics
  1. Design of RAM using flip-flops / Logisim
  2. Memory read and write
  3. Booth's multiplier simulation
  4. Simple CPU data path in a simulator
Web Designing Workshop5 chapters · 6 Months Subject page →
01HTML Basics and Page Structure 6 topics
  1. Structure of an HTML5 document
  2. Headings, paragraphs and text formatting
  3. Ordered, unordered and description lists
  4. Hyperlinks and images
  5. Tables with rowspan and colspan
  6. Semantic tags: header, nav, section, footer
02HTML Forms and Media 4 topics
  1. Form elements and input types
  2. Labels, select, textarea and buttons
  3. GET and POST methods
  4. Audio, video and iframe
03CSS Styling and Box Model 5 topics
  1. Inline, internal and external CSS
  2. Selectors, specificity and inheritance
  3. Colours, fonts and backgrounds
  4. Box model: margin, border, padding
  5. Display and position properties
04CSS Layout and Responsive Design 4 topics
  1. Flexbox layout
  2. CSS Grid layout
  3. Media queries and mobile-first design
  4. Introduction to Bootstrap
05JavaScript, DOM and Mini Website 5 topics
  1. JavaScript syntax, variables and data types
  2. Functions and events
  3. DOM selection and manipulation
  4. Form validation
  5. Building and hosting a mini website (GitHub Pages)
Mini Project or Internship Assessment-I5 chapters · 6 Months Subject page →
01Topic or Internship Selection 3 topics
  1. Identifying an interest area and a guide / industry mentor
  2. Choosing a feasible mini project topic or internship organisation
  3. Getting departmental approval
02Synopsis and Planning 4 topics
  1. Problem statement and objectives
  2. Literature / product survey
  3. Methodology, tools and resources
  4. Timeline (Gantt chart) and expected outcomes
03Execution of Work / Training 4 topics
  1. Carrying out design, coding, fabrication, survey or site work
  2. Daily diary / log book
  3. Weekly review with guide or mentor
  4. Testing, observations and results
04Report Writing 4 topics
  1. Report format as per university guidelines
  2. Certificate, acknowledgement, abstract and contents
  3. Chapters: introduction, work done, results, conclusion
  4. References and plagiarism check
05Presentation and Viva 4 topics
  1. Preparing a 10 - 15 minute presentation
  2. Demonstration of model / software / photographs
  3. Answering viva questions
  4. Final assessment by the departmental committee

About this course

You will be able to

  • Complete Engineering Mathematics-IV syllabus with regular tests
  • Complete Technical Communication syllabus with regular tests
  • Complete Data Structure syllabus with regular tests
  • Complete Computer Organization and Architecture syllabus with regular tests
  • Complete Discrete Structures and Theory of Logic syllabus with regular tests
  • Complete Cyber Security syllabus with regular tests
  • Complete Data Structure Lab syllabus with regular tests
  • Complete Computer Organization Lab syllabus with regular tests

Who it is for

  • B.Tech second-year students (Semester 3) of Computer Science & Engineering and Information Technology under AKTU
  • Students building a mathematical base for data science, algorithms and machine learning

What you need

  • Engineering Mathematics-I and II
  • Scientific calculator and statistical tables
Online tests & result Practice and unit tests online; marks and result show in your student login and at the centre. Student login →

Questions

Which syllabus is followed?

The current AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus of Engineering Mathematics-IV (Semester 3, CSE and IT). If your university or college follows a different syllabus, the centre teaches from your own university syllabus.

Is this useful for programming?

Yes. Logic, counting, recurrences and probability are used directly in algorithms, data science and machine learning.

Are statistical tables taught?

Yes. Use of normal, t and chi-square tables is practised with solved examples.

Will this help with my project report?

Yes. Report structure, abstracts and referencing taught here are used directly for mini project and final project reports.

Is grammar taught?

Common grammar and usage errors in technical writing are corrected through regular writing tasks.

Which syllabus does the Data Structure course follow?

It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Data Structure. If your own university's syllabus differs, the centre follows your university syllabus.

Will this help in the university examination?

Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.

Which language is used for programs?

C is used, as in the AKTU lab; the same logic is shown in C++ / Python when a student needs it.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? Enquire now — our centre will call you.