Hello everyone, my name is Tejas, welcome to my website. In this post I am going to share syllabus of 3rd Semester in Diploma in Computer Engineering.
There are lots of content in 3rd semester of Computer Engineering including various subjects. There are total 6 subjects. And all subjects are related to the Computer Engineering only.
You are free from subjects such as Basic and Applied Science, Applied Mathematics, etc. You are now going to focus on your branches core subjects.
In this semester you are going to face subjects such as Data structure using C Language, Database Management System, Digital Techniques, Object Oriented Programming using C++, Computer Graphics and Essence of Indian Consitution.
Make sure everyone, you should focus on all these subjects because this subjects will help in Engineering also when you are go for the undergraduate studies like Bachelor of Engineering or Bachelor of Technology.
List of Subjects in MSBTE Computer Engineering 3rd Semester
| Sr. No. | Abbrevation of Subject | Subject Code | Subject Name |
| 1 | DSU | 313301 | Data Structure using C |
| 2 | DMS | 313302 | Database Management System |
| 3 | DTE | 313303 | Digital Techniques |
| 4 | OOP | 313304 | Object Oriented Programming using C++ |
| 5 | CGR | 313001 | Computer Graphics |
| 6 | EIC | 313002 | Essence of Indian Constitution |
313301 Data Structure Using C Syllabus
| Unit – I Introduction to Data Structures |
| 1.1 Introduction: Concept and Need of Data Structure, Definition, Abstract Data Type 1.2 Types of Data Structures: (i) Linear Data Structures (ii) Non-Linear Data Structures 1.3 Operations on Data Structures: (i) Traversing (ii) Insertion (iii) Deletion |
| Unit – II Searching and Sorting |
| 2.1 Searching: Searching for an item in a data set using the following methods: (i) Linear Search (ii) Binary Search 2.2 Sorting: Sorting of data set in an order using the following methods: (i) Bubble Sort (ii) Selection Sort (iii) Insertion Sort (iv) Quick Sort (v) Merge Sort |
| Unit – III Linked List |
| 3.1 Difference between Static and Dynamic Memory Allocation. 3.2 Introduction to Linked List, Terminologies: Node, Address, Pointer, Information field / Data field, Next pointer, Null Pointer, Empty List. 3.3 Type of Lists: Linear List, Circular List, Representation of Doubly Linked List. 3.4 Operations on a Singly Linked List: Creating a Linked List, Inserting a new node in a Linked List, Deleting a node from a Linked List, Searching a key in Linked List, Traversing a Singly Linked List. 3.5 Applications of Linked List. |
| Unit – IV Stack |
| 4.1 Introduction to Stack: Definition, Stack as an ADT, Operations on Stack-(Push, Pop), Stack Operation Conditions – Stack Full / Stack Overflow, Stack Empty /Stack Underflow. 4.2 Stack Implementation using Array and representation using Linked List. 4.3 Applications of Stack: Reversing a List, Polish Notations, Conversion of Infix to Postfix Expression, Evaluation of Postfix Expression. 4.4 Recursion: Definition and Applications. |
| Unit – V Queue |
| 5.1 Introduction to Queue: Queue as an ADT, Queue representation in memory using Array and representation using a Linked List. 5.2 Types of Queues: Linear Queue, Circular Queue, Concept of Priority Queue, Double-Ended Queue. 5.3 Queue Operations: INSERT, DELETE, Queue Operation Conditions: Queue Full, Queue Empty. 5.4 Applications of Queue. |
| Unit – VI Tree |
| 6.1 Introduction to Trees Terminologies: Tree, Degree of a Node, Degree of a Tree, Level of a node, Leaf Node, Depth / Height of a Tree, In-Degree and Out-Degree, Path, Ancestor and Descendant Nodes. 6.2 Tree Types and Traversal methods, Types of Trees: General Tree, Binary Tree, Binary Search Tree (BST). Binary Tree Traversal: In-Order Traversal, Preorder Traversal, Post-Order Traversal. 6.3 Expression Tree, Heap |
Tips – Unit 6 Tree is suppose to hard for you. But don’t give up on that. Because most of the question is coming from the Tree when it comes to placement. Graphs also one of the toughest topic in programming rather than focusing on the toughness focus on watching the tutorial it will definitely help you.
313302 Database Management System Syllabus
| Unit – I Introduction To Database System |
| 1.1 Database concepts:-Data, Database, Database management system, File system Vs DBMS, Applications of DBMS, Data Abstraction, Data Independence, Database Schema, The Codd’s rules, Overall structure of DBMS 1.2 Architecture:- Two tier and Three tier architecture of database. 1.3 Data Models:- Hierarchical, Networking, Relational Data Models. |
| Unit – II Relational Data Model |
| 2.1 Relational Structure :- Tables (Relations), Rows (Tuples), Domains, Attributes, Entities 2.2 Keys :- Super Keys, Candidate Key, Primary Key, Foreign Key. 2.3 Data Constraints :- Domain Constraints ,Referential Integrity Constraints 2.4 Entity Relationship Model : – Strong Entity set, Weak Entity set, Types of Attributes, Symbols for ER diagram, ER Diagrams 2.5 Normalization:- Functional dependencies, Normal forms: 1NF, 2NF, 3NF |
| Unit – III Interactive SQL and Performance Tuning |
| 3.1 SQL: -Data-types, Data Definition Language (DDL), Data Manipulation language (DML), Data Control Language (DCL), Transaction Control Language (TCL). 3.2 Clauses & Join:- Different types of clauses – Where, Group by ,Order by, Having. Joins: Types of Joins, Nested queries. 3.3 Operators:- Relational, Arithmetic, Logical, Set operators. 3.4 Functions:- Numeric , Date and time, String functions, Aggregate Functions. 3.5 Views, Sequences, Indexes: -Views : Concept ,Create ,Update, Drop Views. Sequences :- Concept ,Create, Alter , Drop, Use of Sequence in table, Index: Concept ,Types of Index , Create ,Drop Indexes |
| Unit – IV PL/SQL Programming |
| 4.1 Introduction of PL/SQL: -Advantages of PL/SQL,The PL/SQL Block Structure, PL/SQL Data Types, Variable , Constant 4.2 Control Structure:- Conditional Control, Iterative Control, Sequential Control. 4.3 Exception handling: -Predefined Exception, User defined Exception. 4.4 Cursors:- Implicit and Explicit Cursors, Declaring, opening and closing cursor, fetching a record from cursor ,cursor for loops, parameterized cursors 4.5 Procedures:- Advantages, Create, Execute and Delete a Stored Procedure 4.6 Functions:- Advantages, Create, Execute and Delete a Function 4.7 Database Triggers :- Use of Database Triggers, Types of Triggers, Create Trigger, Delete Trigger |
| Unit – V Database Administration |
| 5.1 Introduction to database administration:- Types of database users, Create and delete users, Assign privileges to users 5.2 Transaction: Concept, Properties & States of Transaction 5.3 Database Backup: Types of Failures, Causes of Failure, Database backup introduction, types of database backups: Physical & Logical 5.4 Data Recovery – Recovery concepts , recovery techniques- roll forward ,Rollback 5.5 Overview of Advanced database concepts:- Data Warehouse ,Data lakes , Data mining, Big data ,Mongo DB , DynamoDB, |
313303 Digital Techniques
| Unit – I Number Systems |
| 1.1 Number Systems: Types of Number Systems (Binary, Octal, Decimal, Hexadecimal), conversion of number systems 1.2 Binary Arithemetic: Addition, Subtraction, Multiplication and Division 1.3 Subtraction using 1’s and 2’s complement method 1.4 Codes: BCD, Gray code, Excess-3 and ASCII code,Code conversions, Applications of codes. 1.5 BCD Arithemetic: BCD Addition, Subtraction using 9’s and 10’s complement |
| Unit – II Logic Gates and Boolean Algebra |
| 2.1 Logic Families: Characteristics Parameters of logic Families- Noise margin, Power dissipation, Figure of merit ,Fan in, Fan out, Speed of operation, maximum clock frequency supply voltage requirement ,power per gate , Comparison of TTL, CMOS and ECL logic family 2.2 Introduction to positive and negative logic systems, Logic Gates: Symbol ,Truth table of Basic logic gates(AND,OR,NOT),Universal gates(NAND,NOR) and Special purpose gates(EX-OR,EX-NOR) 2.3 Buffer: Tristate logic, Unidirectional and Bidirectional 2.4 Boolean algebra : Laws of Boolean algebra, Duality Theorem ,De-Morgan’s theorem |
| Unit – III Combinational Logic Circuits |
| 3.1 Standard Boolean expression: Sum of products [SOP] and Products of Sum [POS], Min-term and Max-term, SOP-POS form conversion, realisation using NAND/NOR gates 3.2 Boolean Expression reduction using K-map: Minimization of Boolean expressions (upto 4 variables) using SOP and POS form 3.3 Arithemetic circuits : design Half and Full Adder using K-maps, design Half and Full Subtractor using K-maps , n bit adder and n bit subtractor . 3.4 Encoder and Decoder: Functions of Encoder and Decoder, Block Diagram and Truth table, Priority Encoder (4:2, 8:3), BCD to 7 segment Decoder/Driver, Keyboard Encoder / decoder 3.5 Multiplexer and Demultiplexer: Working, Truth table and applications of MUX and DEMUX. MUX tree, DEMUX tree, DEMUX as Decoder |
| Unit – IV Sequential Logic Circuits |
| 4.1 Difference between Combinational and Sequential Logic circuits, Time independent (un-clocked )and Time dependent ( Clocked ) logic system , Flips- Flops and Latch, Basic memory cell ,RS-Latch using NAND and NOR, Triggering methods- Edge trigger and Level Trigger 4.2 Flip-Flops: S-R, J-K, T and D, Truth table and logic circuits of each flip-flop, Excitation table, applications 4.3 Race around condition in JK flip-flop, Master- Slave JK Flip Flop 4.4 Shift registers- Serial In Serial Out, Serial In Parallel Out, Parallel In Serial Out ,Parallel In Parallel Out,Bi-directional Shift register, 4-bit Universal Shift register 4.5 Counters- Synchronous and Asynchronous counters, Modulus of counter, Ripple counter, Ring Counter, Twisted Ring Counter, Up – down counter, Decade Counter, MOD-N counter, Timing Diagram |
| Unit – V Data Converters and Memories |
| 5.1 Digital to Analog Data Converter (DAC)- circuit diagram and working of Weighted resistor DAC and R-2R Ladder DAC, DAC Specification/Selection factors 5.2 Analog to Digital Data Converter (ADC) : Block Diagram, Types and Working of Dual Slope ADC, Successive Approximation, Flash Type ADC, ADC selection factors/ specifications 5.3 Memories: Types- Primary memory , Secondary Memory, Organization, Dimension, Memory Bank, Features , Applications: RAM (SRAM, DRAM), Volatile and Non-Volatile, ROM (PROM, EPROM, EEPROM), Flash Memory, Comparison of RAM and ROM,EPROM and Flash Memory, SIMM: Features, SSD memory: Features, |
313304 Object Oriented Programming using C++
| Unit – I Principles of Object Oriented Programming |
| 1.1 Procedure Oriented Programming (POP) verses Object Oriented Programming (OOP) 1.2 Features of Object Oriented Programming, Examples of Object Oriented languages, Applications of OOP 1.3 Data types, Type compatibility, Declaration of variable, Dynamic initialization of variable, Reference variable, Type casting 1.4 Special Operators in C++: Scope resolution operator, Memory management operators, Manipulators 1.5 Structure of C++ program, Basic Input /Output operators and functions in C++, Simple C++ Program 1.6 Class & Object: Introduction, Specifying a class, Access specifiers, Defining member functions: Inside class and Outside class, Creating objects, Memory allocations for objects |
| Unit – II Functions and Constructors |
| 2.1 Inline function, Static data members, Static member function, Friend function: Using two different classes , Using non-member function 2.2 Array of Objects, Object as function arguments 2.3 Concepts of Constructors, Types of constructors 2.4 Constructor overloading and Constructors with default arguments 2.5 Destructors |
| Unit – III Extending classes using Inheritance |
| 3.1 Introduction to Inheritance, Defining a derived class, Visibility modes and effects 3.2 Types of Inheritance : Single, Multilevel, Multiple, Hierarchical, Hybrid 3.3 Virtual base class, Abstract class, Constructor in derived class |
| Unit – IV Pointers and Polymorphism in C++ |
| 4.1 Concept of Pointer: Pointer declaration, Pointer operator, Address operator, Pointer arithmetic 4.2 Pointer to Object: Pointer to object, ‘this’ pointer, Pointer to derived class 4.3 Introduction of Polymorphism, Types of polymorphism 4.4 Compile time Polymorphism: Function overloading, Revision of constructor overloading, Operator overloading: Rules for operator overloading, Overloading of unary and binary operators 4.5 Run time polymorphism: Virtual function, Rules for virtual function, Pure virtual function |
| Unit – V File operations |
| 5.1 C++ stream classes, Classes for file stream operations 5.2 Detection of end of file, File modes 5.3 Opening files: Using constructors and open(), Closing files, Reading from and writing to files, Formatted Input/output functions in file 5.4 Types of file: Random access, Sequential access |
313001 Computer Graphics Syllabus
| Unit – I Basics of Computer Graphics |
| 1.1 Coordinate system 1.2 Graphics file formats: Basics, advantages, disadvantages – BMP – GIF – JPEG – TIFF – PCX 1.3 Graphics functions & standards: Text mode, Graphic mode, Shapes, Colors, Graphics standards. |
| Unit – II Raster Scan Graphics |
| 2.1 Line Drawing Algorithms : Digital Differential Analyzer algorithm, Bresenham’s algorithm. 2.2 Circle Generation- Symmetry of Circle, Bresenham’s algorithm 2.3 Polygon Filling : Seed Fill algorithms- Flood Fill algorithm, Boundary Fill algorithm. |
| Unit – III Overview of 2D And 3D Transformations |
| 3.1 Basic Transformations: Translation, Scaling, Rotation. 3.2 Matrix representations & homogeneous coordinates. 3.3 Composite transformations. 3.4 Three-dimensional transformation. 3.5 Other transformations: Reflection, Shear. |
| Unit – IV Windowing and Clipping Techniques |
| 4.1 Windowing concepts. 4.2 Line Clipping: Cohen Sutherland Line Clipping algorithm, Mid-Point Subdivision Line clipping algorithm. 4.3 Polygon Clipping: Sutherland Hodgeman Polygon clipping algorithm. |
| Unit – V Introduction to Curves and Projections |
| 5.1 Bezier and B-Spline Curves. 5.2 Projections: Perspective and Parallel Projection and its types. |
313002 Essence of Indian Constitutions
| Unit – I Constitution and Preamble |
| 1.1 Meaning of the constitution of India. 1.2 Historical perspectives of the Constitution of India. 1.3 Salient features and characteristics of the Constitution of India. 1.4 Preamble of the Constitution of India. |
| Unit – II Fundamental Rights and Directive Principles |
| 2.1 Fundamental Rights under Part-III. 2.2 Fundamental duties and their significance under part-IV-A. 2.3 Relevance of Directive Principles of State Policy under part-IV A. |
| Unit – III Governance and Amendments |
| 3.1 3.1 Amendment procedure of the Constitution and their types – simple and special procedures. 3.2 The Principle of Federalism and its contemporary significance along with special committees that were setup. 3.3 Major Constitutional Amendment procedure – 1st, 7th, 42nd, 44th, 73rd & 74th, 76th, 86th, 52nd & 91st, 102nd |
| Unit – IV Electoral Literacy and Voter’s Education |
| 4.1 Electoral rights , Electoral process of registration 4.2 Ethical electoral participation 4.3 Motivation and facilitation for electoral participation 4.4 Voter’s guide 4.5 Prospective empowered voter 4.6 Voting procedure 4.7 Voter awareness 4.8 Voter online registration https:/ /www.ceodelhi.gov.in/ELCdetails.aspx |
So, everyone in this post we had seen the Diploma in Computer Engineering 3rd semester k scheme syllabus. Also hope you like this post. If you find it help please comment on this post for upcoming post which you want. And also share with your Diploma friends finding this helpful for them also.