NDSS Academy

Computer Science & Engineering

Diploma Engineering · Semester 3

6 MonthsDuration 8Subjects 42Chapters 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.

    Data Structures using CDigital ElectronicsDatabase Management SystemsComputer Organisation and ArchitectureObject Oriented Programming using C++
  3. 3
    Labs, practicals & project workलैब, प्रैक्टिकल और प्रोजेक्ट

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

    Data Structures LabDBMS LabC++ Programming Lab
  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 · पाठ्यक्रम

8 subjects · 42 chapters · 197 topics

Data Structures using C5 chapters · 6 Months Subject page →
01Unit 1: Introduction, Arrays and Pointers 5 topics
  1. Data structure classification and ADT
  2. Algorithm and complexity: Big O
  3. One and two dimensional arrays, address calculation
  4. Pointers and structures
  5. Dynamic memory: malloc, calloc, realloc, free
02Unit 2: Stacks and Queues 5 topics
  1. Stack operations: push, pop, peek
  2. Array implementation of stack
  3. Infix to postfix conversion and postfix evaluation
  4. Recursion
  5. Queue, circular queue, deque and priority queue
03Unit 3: Linked Lists 4 topics
  1. Singly linked list: insert, delete, traverse
  2. Doubly linked list
  3. Circular linked list
  4. Stack and queue using linked list
04Unit 4: Trees and Graphs 5 topics
  1. Tree terminology
  2. Binary tree and binary search tree
  3. Inorder, preorder and postorder traversal
  4. Graph terminology and representation
  5. BFS and DFS
05Unit 5: Searching and Sorting 5 topics
  1. Linear and binary search
  2. Bubble, selection and insertion sort
  3. Quick sort and merge sort
  4. Comparison of complexities
  5. Hashing basics
Digital Electronics5 chapters · 6 Months Subject page →
01Unit 1: Number Systems and Codes 4 topics
  1. Binary, octal, decimal and hexadecimal systems
  2. Conversion between number systems
  3. Binary arithmetic, 1's and 2's complement
  4. BCD, excess-3, Gray and ASCII codes
02Unit 2: Logic Gates and Boolean Algebra 5 topics
  1. Basic gates: AND, OR, NOT
  2. Universal gates: NAND and NOR
  3. XOR and XNOR gates
  4. Boolean laws and De Morgan's theorems
  5. SOP and POS forms, Karnaugh map up to 4 variables
03Unit 3: Combinational Circuits 5 topics
  1. Half adder and full adder
  2. Half and full subtractor
  3. Multiplexer and demultiplexer
  4. Encoder and decoder
  5. Comparator and parity generator
04Unit 4: Sequential Circuits 4 topics
  1. Latch and flip-flop
  2. SR, JK, D and T flip-flops
  3. Race-around condition and master-slave JK
  4. Edge triggering
05Unit 5: Counters, Registers and Memories 6 topics
  1. Asynchronous (ripple) counters
  2. Synchronous counters and MOD-N counters
  3. Shift registers: SISO, SIPO, PISO, PIPO
  4. Ring and Johnson counters
  5. Logic families (TTL, CMOS), ADC and DAC
  6. RAM, ROM and their types
Database Management Systems5 chapters · 6 Months Subject page →
01Unit 1: Introduction to DBMS 4 topics
  1. File system vs DBMS
  2. Three-schema architecture and data independence
  3. Data models: hierarchical, network, relational
  4. DBMS users and DBA
02Unit 2: Entity-Relationship Model 5 topics
  1. Entities, attributes and relationships
  2. Types of attributes
  3. Cardinality and participation
  4. Keys: super, candidate, primary, foreign
  5. Weak entity and ER to table conversion
03Unit 3: Relational Model and Normalization 5 topics
  1. Relation, tuple, attribute, domain, degree, cardinality
  2. Integrity constraints
  3. Relational algebra: select, project, join, union, difference
  4. Functional dependency
  5. 1NF, 2NF, 3NF and BCNF
04Unit 4: SQL 5 topics
  1. DDL, DML, DCL and TCL commands
  2. SELECT with WHERE, ORDER BY
  3. Aggregate functions, GROUP BY and HAVING
  4. Joins and subqueries
  5. Views and indexes
05Unit 5: Transactions, Concurrency and Security 5 topics
  1. Transaction and ACID properties
  2. Transaction states and schedules
  3. Concurrency problems and locking (2PL)
  4. Deadlock
  5. Recovery, backup and GRANT / REVOKE
Computer Organisation and Architecture5 chapters · 6 Months Subject page →
01Unit 1: Basic Structure of Computers 6 topics
  1. Functional units of a computer
  2. Von Neumann architecture and stored program concept
  3. Bus structures - data, address and control bus
  4. Data representation - fixed point and floating point
  5. Register transfer language
  6. Arithmetic, logic and shift micro-operations
02Unit 2: Central Processing Unit 7 topics
  1. General register organisation
  2. Stack organisation - register stack and memory stack
  3. Instruction formats - zero, one, two and three address
  4. Addressing modes
  5. Arithmetic Logic Unit
  6. Hardwired and microprogrammed control unit
  7. RISC and CISC characteristics
03Unit 3: Memory Organisation 7 topics
  1. Memory hierarchy
  2. Main memory - RAM and ROM chips, SRAM and DRAM
  3. Auxiliary memory - magnetic disk and optical disk
  4. Associative memory
  5. Cache memory - direct, associative and set-associative mapping
  6. Hit ratio and average access time
  7. Virtual memory - paging and page replacement
04Unit 4: Input-Output Organisation 6 topics
  1. Peripheral devices and I/O interface
  2. Asynchronous data transfer - strobe and handshaking
  3. Programmed I/O
  4. Interrupt-driven I/O and priority interrupt
  5. Direct Memory Access (DMA)
  6. Input-output processor
05Unit 5: Pipelining and Parallel Processing 6 topics
  1. Parallel processing concepts
  2. Arithmetic pipeline and instruction pipeline
  3. Pipeline speed-up and throughput
  4. Pipeline hazards - structural, data and control
  5. Flynn's classification - SISD, SIMD, MISD, MIMD
  6. Multiprocessors and interconnection basics
Object Oriented Programming using C++5 chapters · 6 Months Subject page →
01Unit 1: Principles of Object Oriented Programming 7 topics
  1. Procedure oriented vs object oriented programming
  2. Objects, classes, encapsulation, abstraction, inheritance, polymorphism
  3. Structure of a C++ program
  4. Tokens, data types, operators and scope resolution operator
  5. cin, cout and manipulators
  6. Reference variables and inline functions
  7. Default arguments and function overloading
02Unit 2: Classes and Objects 7 topics
  1. Defining a class, data members and member functions
  2. Access specifiers - private, public, protected
  3. Arrays of objects and objects as function arguments
  4. Static data members and static member functions
  5. Friend functions and friend classes
  6. Constructors - default, parameterised, copy
  7. Destructors
03Unit 3: Inheritance 6 topics
  1. Base and derived classes
  2. Visibility modes in inheritance
  3. Single, multiple, multilevel, hierarchical and hybrid inheritance
  4. Virtual base class
  5. Constructors in derived classes
  6. Abstract classes
04Unit 4: Polymorphism and Pointers 6 topics
  1. Compile-time and run-time polymorphism
  2. Operator overloading - unary and binary
  3. Overloading using friend functions
  4. Pointers to objects and the this pointer
  5. Pointers to derived classes
  6. Virtual functions and pure virtual functions
05Unit 5: Templates, Exceptions and File Handling 6 topics
  1. Function templates and class templates
  2. Exception handling - try, throw, catch
  3. Stream classes in C++
  4. Opening and closing files - ifstream, ofstream, fstream
  5. File modes and file pointers
  6. Reading and writing objects to files
Data Structures Lab6 chapters · 6 Months Subject page →
01Arrays and Strings 3 topics
  1. Traversal, insertion and deletion in a 1-D array
  2. Matrix addition and multiplication using 2-D arrays
  3. String operations without library functions
02Stacks and Queues 4 topics
  1. Stack using array - push, pop, peek
  2. Infix to postfix conversion
  3. Evaluation of a postfix expression
  4. Linear queue and circular queue using array
03Linked Lists 4 topics
  1. Singly linked list - create, insert, delete, display
  2. Stack and queue using linked list
  3. Doubly linked list operations
  4. Circular linked list
04Trees 3 topics
  1. Create a binary search tree
  2. Inorder, preorder and postorder traversal
  3. Search and delete a node in a BST
05Searching and Sorting 4 topics
  1. Linear search and binary search
  2. Bubble sort, selection sort and insertion sort
  3. Quick sort and merge sort
  4. Counting comparisons and comparing algorithms
06Graphs 3 topics
  1. Adjacency matrix and adjacency list representation
  2. Breadth First Search
  3. Depth First Search
DBMS Lab5 chapters · 6 Months Subject page →
01SQL Basics and DDL 3 topics
  1. Installing MySQL and using the command line client
  2. Data types
  3. CREATE, ALTER, DROP, TRUNCATE and RENAME table
02DML and Constraints 3 topics
  1. INSERT, UPDATE and DELETE
  2. Primary key, foreign key, unique, not null, check and default constraints
  3. COMMIT, ROLLBACK and SAVEPOINT
03Queries and Functions 5 topics
  1. SELECT with WHERE, BETWEEN, IN, LIKE
  2. ORDER BY
  3. Aggregate functions - COUNT, SUM, AVG, MIN, MAX
  4. GROUP BY and HAVING
  5. String, numeric and date functions
04Joins, Subqueries and Views 4 topics
  1. Inner join, left and right outer join, self join
  2. Nested subqueries with IN and EXISTS
  3. Creating and using views
  4. Set operations - UNION
05Database Design Mini Exercise 4 topics
  1. Drawing an ER diagram for a library or student database
  2. Converting the ER diagram to tables
  3. Normalisation up to 3NF
  4. Users, GRANT and REVOKE
C++ Programming Lab6 chapters · 6 Months Subject page →
01C++ Basics 3 topics
  1. Programs using cin, cout and manipulators
  2. Inline functions and default arguments
  3. Function overloading - area of different shapes
02Classes and Objects 4 topics
  1. Student / bank account class with member functions
  2. Array of objects
  3. Static data member counting objects
  4. Friend function to add data of two classes
03Constructors and Destructors 3 topics
  1. Default, parameterised and copy constructors
  2. Constructor overloading
  3. Destructor demonstration
04Inheritance 3 topics
  1. Single and multilevel inheritance
  2. Multiple inheritance
  3. Hybrid inheritance with a virtual base class
05Polymorphism 4 topics
  1. Unary and binary operator overloading
  2. Overloading using friend function
  3. Virtual functions with base class pointers
  4. Abstract class with pure virtual function
06Templates, Exceptions and Files 4 topics
  1. Function template for swapping / finding maximum
  2. Class template
  3. try, throw, catch - division by zero
  4. Writing and reading records in a text file

About this course

You will be able to

  • Complete Data Structures using C syllabus with regular tests
  • Complete Digital Electronics syllabus with regular tests
  • Complete Database Management Systems syllabus with regular tests
  • Complete Computer Organisation and Architecture syllabus with regular tests
  • Complete Object Oriented Programming using C++ syllabus with regular tests
  • Complete Data Structures Lab syllabus with regular tests
  • Complete DBMS Lab syllabus with regular tests
  • Complete C++ Programming Lab syllabus with regular tests

Who it is for

  • Diploma Computer Science & Engineering students of Semester 3 (BTEUP)
  • Polytechnic students of other boards studying the same subject who want unit-wise coaching

What you need

  • Programming in C of earlier semesters
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 does the Data Structures using C course follow?

It follows the BTEUP (Board of Technical Education, Uttar Pradesh) diploma syllabus for Data Structures using C (Computer Science & Engineering, Semester 3). If your own board's or institute's syllabus differs, the centre follows your own syllabus.

Will this help in the semester examination?

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

Are programs written in the lab?

Yes. Every data structure is implemented in C and run on Turbo C / GCC / Code::Blocks along with the theory.

Which syllabus does this course follow?

It follows the BTEUP (Board of Technical Education, Uttar Pradesh) syllabus of Digital Electronics (Semester 3 / 4). Where your polytechnic follows a different board or a revised syllabus, the centre follows your own syllabus.

Will it help in the semester examination?

Yes. Every unit is covered with solved examples, unit-wise MCQs and previous-year style questions for the BTEUP theory and practical exams.

Is the Digital Electronics Lab covered too?

The lab is a separate course; here every circuit is explained with its truth table so that lab experiments become easy.

Which syllabus does the Database Management Systems course follow?

It follows the BTEUP (Board of Technical Education, Uttar Pradesh) diploma syllabus for Database Management Systems (Computer Science & Engineering, Semester 3). If your own board's or institute's syllabus differs, the centre follows your own syllabus.

Which database software is used?

SQL is practised on MySQL (or Oracle / PostgreSQL where the institute uses 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.