Polytechnic Diploma in Computer Engineering 3rd Semester
3rd Semester Polytechnic Computer Engineering Syllabus MSBTE Course and Classes in Nagpur G Scheme
Atlanta Computer Institute Nagpur conducts Tuition Classes for third semester Polytechnic Computer Engineering Diploma in Nagpur for Computer Engineering Branch for third Semester in Nagpur India . The Following syllabus is of MSBTE g scheme. Final Year Projects Training is also given to Diploma Students.
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION, MUMBAI
TEACHING AND EXAMINATION SCHEME FOR POST S.S.C. DIPLOMA COURSES
COURSE NAME : COMPUTER ENGINEERING GROUP
COURSE CODE : CO/CD/CM/CW/IF
DURATION OF COURSE : 6 SEMESTERS For CO/CM/CW/IF ( 8 SEMESTERS for CD) WITH EFFECT FROM 2012-13
SEMESTER : THIRD DURATION : 16 WEEKS
FULL TIME / PART TIME : FULL TIME SCHEME : G
Applied Mathematics
Data Structure Using C
Electrical Technology
Relational Database Management System
Digital Techniques
Graphical User Interface (GUI) Programming
Professional Practices-I
MSBTE – Final Copy 14/01/2013 1
w.e.f Academic Year 2012-13 G Scheme Course Name : All Branches of Diploma in Engineering & Technology Course Code : AE/CE/CH/CM/CO/CR/CS/CW/DE/EE/EP/IF/EJ/EN/ET/EV/EX/IC/IE/IS/ ME/MU/PG/PT/PS/CD/CV/ED/EI/FE/IU/MH/MI
Semester : Third
Applied Mathematics
Topic-1 Applications of Derivative Specific objectives : Find slope, curvature, maximum and minimum value of functions related to different engineering applications. •Examples for finding slope , equations of tangent and normal to the curve •Maxima and minima. •Radius of curvature.
Topic-2 Integral Calculus
2.1 Integration ------------------------- 20 Specific objectives : Integrate function using different method. •Definition of integration as anti derivative, rules of integration. •Integration of standard functions •Methods of integration Integration by substitution. Integration by partial fractions. Integration by parts and generalized rule by parts.
2.2 Definite Integrals ---------------------------------- 16 Specific objectives : Solve problems on definite integrals using the properties. • Definite integral- Definition, examples. • Properties of definite integrals without proof and simple examples.
2.3 Application of Definite Integrals --------------------- Specific objectives : Find area. 1. Area under a curve. 2. Area between two curves.
Topic 3 - Differential Equation.
3.1 Differential equation Specific objectives : Solve the differential equation of first order and first degree Solve different engineering problems using differential equation •Differential equation- Definition, order and degree of a differential equation. Formation of differential equation containing single constant. •Solution of differential equation of first order and first degree for following types Variable separable form, Equation reducible to variable separable form. Linear differential equation. Homogeneous differential equation. Exact differential equation. 10 20
w.e.f Academic Year 2012-13 G Scheme
Topic 4 - Probability
4.1 Probability Specific objectives : ----------------------------08 Solve different engineering problems related to probability process. •Definition of random experiment, sample space, event, occurrence of event and types of event (impossible, mutually exclusive, exhaustive, equally likely) •Definition of probability, addition and multiplication theorems of probability.
4.2 Probability Distribution ---------------------- 12 •Binomial distribution •Poisson’s Distribution •Normal distribution
w.e.f Academic Year 2012-13 G Scheme
Course Name : Computer Engineering Group
Course Code : CO/CM/IF/CD/CW
Semester : Third
Data Structure Using C
1 Introduction to Data Structure Specific Objective: To understand data structure organization & classification To understand operations on data structure. To understand approaches to design an algorithm. Knowing the complexity of an algorithm 1.1 Basic Terminology •Elementary data structure organization •Classification of data structure 1.2 Operations on data structures •Traversing, Inserting, deleting •Searching, sorting, merging 1.3 Different Approaches to designing an algorithm •Top-Down approach •Bottom-up approach 1.4 Complexity •Time complexity •Space complexity 1.5 Big ‘O’ Notation
2 Sorting and Searching Specific Objective: To understand and apply sorting algorithms on data. To understand and apply searching algorithms on data. 2.1 Sorting Techniques •Introduction •Selection sort •Insertion sort •Bubble sort •Merge sort •Radix sort ( Only algorithm ) •Shell sort ( Only algorithm ) •Quick sort ( Only algorithm ) 2.2 Searching •Linear search •Binary search
3 Stacks Specific Objective: To understand and apply the knowledge of the data structure – ‘stack’ in the application programs. 3.1 Introduction to stack •Stack as an abstract data type •Representation of stack through arrays 3.2 Applications of Stack •Reversing a list •Polish notations •Conversion of infix to postfix expression •Evaluation of postfix expression
•Converting an infix into prefix expression •Evaluation of prefix expression •Recursion
4 Queues Specific Objective: To understand and apply the knowledge of the data structure – ‘Queue’ in the application programs. 4.1 Introduction •Queues as an abstract data type •Representation of a Queue as an array 4.2 Types of Queue •Circular Queue •Double Ended Queue •Priority Queue •Dequeues 4.3 Applications of Queue
5 Linked List Specific Objective: To understand and apply the knowledge of the data structure – ‘Linked List’ in the application programs. 5.1 Introduction •Terminologies: node, Address, Pointer, Information, Next, Null Pointer, Empty list etc. 5.2 Type of lists •Linear list •Circular list •Doubly list 5.3 Operations on a singly linked list ( only algorithm) •Traversing a singly linked list •Searching a linked list •Inserting a new node in a linked list •Deleting a node from a linked list
Trees Specific Objective: To understand and apply the knowledge of the data structure – ‘Trees’ on data. 6.1 Introduction --------------------- 06 Marks •Terminologies: tree ,degree of a node, degree of a tree, level of a node, leaf node, Depth / Height of a tree, In-degree & out-Degree, Directed edge, Path, Ancestor & descendant nodes.
6 6.2 Tree Types and Traversal Methods ------------- 12 Marks Type of Trees •General tree •Binary tree •Binary search tree (BST). Binary tree traversal ( only algorithm ) •In order traversal •Preorder traversal •Post order traversal Expression tree
w.e.f Academic Year 2012-13 G Scheme
7 Graph and Hashing Specific Objective: To understand and apply the knowledge of ‘graph’ and ‘hashing’ function on data. 7.1 Introduction •Terminologies: graph, node (Vertices), arcs (edge), directed graph, in-degree, out-degree, adjacent, successor, predecessor, relation, weight, path, length. 7.2 Representations of a graph •Array Representation •Linked list Representation 7.3 Traversal of graphs •Depth-first search (DFS). •Breadth-first search (BFS). 7.4 Applications of Graph 7.5 Hashing •Hash function •Collision resolution techniques
w.e.f Academic Year 2012-13 G Scheme
Course Name : Computer Engineering Group Course Code : CO/CM/IF/CD/CW Third Semester
Electrical Technology
Topic 1: D.C. Circuits Specific Objectives Understand practical use of KCL and KVL Represent complicated network by single equivalent resistance Contents: 1.1 Concept of Emf , Potential Difference, D.C. Current & D.C.Voltage (Symbols and Units) 1.2 Basic Laws and their application: •Ohm’s Law •Kirchhoff’s Current & Voltage Law •Mesh Loop Current Method (Two loops only) •Node Voltage Method (Two nodes only) 1.3 Simplification of Networks •Series & Parallel Circuits •Star-Delta & Delta-Star Conversion •(Simple Numerical on 1.2 and 1.3) 08 12
Topic 2: A.C. Fundamentals Specific Objectives Understand nature of sine waveform & calculate its parameters Identify inductive and capacitive load Contents: 2.1 Basics of Electromagnetism •Concept of magnetic Flux •Concept of Reluctance •Faraday’s Law of Electromagnetic Induction •Lenz’s law •Statically &Dynamically Induced EMF. •Concept of Inductance, Capacitance, Inductive &Capacitive Reactance 2.2 Sinusoidal Representation With Equation of Alternating V & I (08) •Concept of Angular Velocity, Frequency, Cycle & Time Period •Concept of Peak Value, Average Value & RMS Value •Concept of Form &Peak Factor 2.3 Phase of AC Quantities (Definition & phasor representation) •Phase and Phase Difference •In-Phase Quantity •Lagging Quantity •Leading Quantity 2.4 Behavior of AC Circuits ( Waveforms, Equations & Phasor Diagrams) •AC Circuits Containing Resistance Only •AC Circuits Containing Inductance Only •AC Circuits Containing Capacitance Only •(Simple Numerical on 2.2 & 2.4)
Topic 3: AC Series Circuit Specific Objectives Understand concept of impedance Distinguish between active, reactive and apparent power Contents: 3.1Concept of Impedance and Impedance Triangle 3.2 Concept of Power Factor and Its Significance 3.3 Phasor Diagram, Voltage and Current Equation •RL Series Circuit •RC Series Circuit •RLC Series Circuit and series resonance 3.4 Active, Reactive and Apparent power, Power Triangle 3.5 Measurement of single phase power using Dynamometer Type wattmeter (Simple Numerical on 3.3 and 3.4)
Topic 4: Three Phase Circuits Specific Objectives Distinguish between 1 phase and 3 phase a.c. nature Develop balanced load. Contents: 4.1 Advantages of Three Phase Circuits over single phase circuits 4.2 Concept of Three Phase Supply, Its Waveforms Representations & Phase Sequence, Concept of Balanced Load. 4.3 Star Connected Balanced System •Relation Between Phase and line Current •Relation Between Phase and line Voltage •Equation for Three Phase Power •Phasor Diagram 4.4 Delta Connected Balanced System •Relation Between Phase and Line Current •Relation Between Phase and line Voltage •Equation for Three Phase Power •Phasor Diagram (Simple Numerical on 4.3 & 4.4)
Topic 5: Electrical Machines Specific Objectives Able to select motor depending on application Able to specify transformer w.r.t. specifications. Contents: 5.1 Single Phase Induction Motor : Principle of Working, Operation and Application of •Resistance Split Phase Motors •Capacitor Start Motors •Shaded Pole Motors •Universal Motors 5.2 Transformer Construction •Construction and Working Principle •Classification of Transformers 5.3 Transformer Operation •Emf Equation (No Derivation) •Voltage and Current Ratio •Efficiency and Voltage Regulation 5.4 Auto Transformer •Construction and Working •Comparison With Two Winding Transformer
Topic 6: Electrical Safety
w.e.f Academic Year 2012-13 G Scheme
Specific Objectives Aware about earthing need Able to identify cause of problem Contents: 6.1 Earthing of Electrical Equipment •Pipe earthing •Plate earthing 6.2 Fuses •Classification of Fuses and basic terms related with it •Miniature Circuit Breaker •Comparison between fuse and MCB 6.3 Electric shock and its effects •Factors Affecting Lethality of Electric shock •Precautions Against Electric Shock •Handling Shock Victims
w.e.f Academic Year 2012-13 G Scheme
Course Name : Computer Engineering Group
Course Code : CO/CM/IF/CD/CW Third Semester
Relational Database Management System
01 Database System Concept Specific Objectives: State the importance of DBMS effectiveness and database tools. State the advantages of using database system to store operational data. Explain the concept of RDBMS .Describe the overall structure of DBMS & Architecture of Client/Server system. Explain the concept of data mining and data warehousing 1.1 An Introduction to database. Data, database, DBMS, Disadvantages of file processing system, advantages of DBMS over file processing system , Application of database. 1.2 What is RDBMS, Difference between DBMS and RDBMS 1.3 Names of various DBMS and RDBMS softwares 1.4 Data abstraction, Database languages, Instance and schema, Data independence - Logical and Physical Independence. 1.5 Components of DBMS and overall Structure of DBMS. Database Users, functions of Database Administrator. 1.6 Introduction to client server architecture. Two/Three tier Architecture. 1.7 The 12 Rules (Codd’s laws) for fully functional RDBMS. 1.8 Introduction to Distributed database, Introduction to data mining & data warehousing 08 16 02 Relational Data Model and Security and Integrity Specification Specific Objectives: Explain the commercial data processing applications by using various data models. Implement the Concept of E-R Model. Describe the process of Normalization & Design database structure using various Normal forms to reduce redundancy. Explain the various data constraints. Explain the need of data security. 2.1----------------------------------- (10 Marks) Data Model •Network Model •Hierarchical Model •Relational Model Relational Model: - Basic Concepts Attributes and Domains. Key Concepts:- Candidate key, Primary key, Foreign key and Super key. E-R model, Components of ER Model, Types of attributes, role indicator, weak & strong entity set. Enhanced ER Model: Introduction, Specialization & Generalization 2.2 ----------------------------------- (12 Marks) Relational Algebra and Relational Calculus. Database Design: Relational database Design, Functional dependencies, Normalization based on functional dependencies, Normal forms: 1NF, 2NF, 3NF, BCNF. Normalization based on multivalued dependencies, Normalization based on Join dependencies. Integrity Constraints: Domain Integrity Constraints, Entity integrity Constraints, Referential Integrity Constraints & on delete cascade Database Security: introduction, Data security requirements. 14 22 03 Interactive SQL Specific Objectives: Design SQL queries to Create Relational database and apply data constraints. Design the queries for data manipulation. Implement the queries using various operators & functions Design the queries for controlling in Database. Explain the concept of transaction processing. 3.1 ----------------------------------- (10 Marks) Introduction to SQL Data Types in SQL DDL Commands: CREATE, ALTER, DROP, TRUNCATE, DESC, RENAME, Truncate, Creating a User, Use of data constraints DML Commands: INSERT, UPDATE,DELETE,CALL 3.2 ----------------------------------- (16 Marks) SQL Operators: Arithmetic Operators, Comparison Operators, Logical Operators, Set Operators, Range Searching operators-Between, Pattern matching operators-Like. Oracle Functions: String, Arithmetic, Date and time, Aggregate Functions and Miscellaneous Functions. Conversion Functions, Special Date formats using To_char() function Queries using Group by, having, and Order by clause, Joins, Types of Joins, Sub queries. DCL Commands: COMMIT, SAVEPOINT, ROLLBACK, GRANT, REVOKE. DQL Commands: SELECT. Transaction Processing: The concept of Transaction, ACID properties, States of Transaction, Concurrent execution of Multiple transaction, Serializability. 18 26 04 Advance SQL: SQL Performance Tuning Specific Objectives: Design SQL queries for implementation of VIEWS, SEQUENES, INDEXES, SNAPSHOT and SYNONYM. 4.1 Views: What are Views? The Create View Command, Updating Views, Views and Joins, Views and Sub queries, What Views cannot do? , Dropping Views. 4.2 Sequences: Creating Sequences, Altering Sequences, Dropping Sequences. 4.3 Indexes: Index Types, Creating of an Index: Simple Unique, and Composite Index, Dropping Indexes. 4.4 Snapshots: Creating a Snapshot, Altering Snapshot, Dropping a Snapshot. 4.5 Synonyms: Creating a Synonyms, Dropping a Synonyms.
w.e.f Academic Year 2012-13 G Scheme
05 PL/SQL , Database Objects & Security Specific Objectives: State the features and components of the PL/SQL. Write simple PL/SQL Code using control structure and handle various exceptions. Create stored procedures and implement functions & create database trigger using PL/SQL. Provide security to database using Locks in PL./SQL 5.1 ----------------------------------- (08 Marks) Introduction of PL/SQL, Advantages of PL/SQL, The PL/SQL Block Structure, PL/SQL execution environment, PL/SQL data Types, Variables, Constants Control Structure: Conditional Control, Iterative Control, Sequential Control. 5.2 ----------------------------------- (16 Marks) Exception handling: Predefined Exception, User defined Exception. Cursors: Implicit and Explicit Cursors, Declaring, Opening and Closing a Cursor, Fetching a Record from Cursor, Cursor for loops, Parameterized Cursors. Procedures: Advantages, Creating, Executing and Deleting a Stored Procedure. Functions: Advantages, Creating, Executing and Deleting a Function. Database Triggers: Use of Database Triggers, How to apply database Triggers, Types of Triggers, Syntax for Creating Trigger, Deleting Trigger. PL/SQL security-Locks, Types of Locks-shared & exclusive. Locking strategy-Implicit &Explicit
w.e.f Academic Year 2012-13 G Scheme Course Name : Computer Engineering Group Course Code : CO/CM/IF/CD/CW Third Semester
Digital Techniques
Introduction to Digital Techniques ¾ Understand the Digital Systems and Logic Families. Identification and conversion of different number systems. 1.1 Digital signal , Digital systems- Positive and Negative Logic, Advantages , Disadvantages and Applications of Digital Systems 1.2 Logic families- Characteristics, Classification - TTL, CMOS, ECL (Comparison only) (No circuits) 1.3 Number System- Classification -Binary, Octal, Decimal, Hexadecimal number system, Conversion of number systems, 1’s complement and 2’s complement, Binary arithmetic, BCD code, BCD arithmetic.
Logic Gates Understand Boolean Laws and concept of Logic Gates. 2.1 •Basic gates (AND,OR, NOT), Universal gates(NAND, NOR), Derived gates(EX-OR, EX-NOR) - Logical symbol, logical expression and truth table of gates-Deriving all gates using universal gates, Multiple input gates (3 -inputs) •Boolean laws- De Morgan’s theorems. (10 Marks) 2.2 •Application of Boolean laws to simplify the Boolean expressions. •Construction of logical circuits by simplifying the Boolean Expression.
Combinational Logic Circuits ¾ Reduction of Boolean expression using K-map Understanding and designing of Multiplexer, Demultiplexer, Encoder, and Decoder 3.1 SOP & POS – Concept, Standardization. •K-map representation of logical functions minimization using 2, 3, variables. •Designing of (a) Half adder and Half subtractor (b) Full adder and Full subtractor using K-map, basic gates and universal gates. •Multiplexer – Block diagram, Truth table, Logical expression and logic diagram of Multiplexers (2:1, 4:1, 8:1and 16:1), Multiplexer Tree. •Demultiplexer – Block diagram, Truth table, Logical expression and logic diagram of Demultiplexer (1:2, 1:4, 1:8and 1:16), Demultiplexer Tree. (16 Marks)
3.2 •Priority Encoders - Decimal to BCD Encoder (IC 74147) and Octal to Binary (IC 74148) -Block diagram, Truth table. •Decoder - BCD to 7-segment Decoder (IC 7447) - Block diagram, Truth table. •Digital comparator IC (7485) - Block diagram, Truth table. •ALU 74181 (10 Marks)
Sequential Logic Circuit Understanding the concept one bit memory cell – Flip-flop and their Applications. 4.1 •Introduction to Sequential Logic Circuit – Difference between combinational and sequential circuit •One-bit memory cell, clock signal – Triggering methods: edge triggering and level triggering (Positive and Negative) •Flip Flops - R S flip-flop, Clocked R S flip flop, J-K flip flop, Master slave J-K flip flop, D- flip flop and T-flip flop - using NAND gates - Symbol , Logic diagram, working, truth table and Timing diagram. (10 Marks) 4.2 •Applications of flip flops – a) Counters – Concept, Modulus:- Types of counters, Comparison Asynchronous counter (3 bit, 4 bit), mod N-counter, Synchronous counter (3-bit) -Designing, Working, Truth Table, Timing diagram and Applications. b) Shift register - SISO, SIPO, PISO, PIPO (4-bit) -Block diagram, Working, Truth Table, Timing diagram and Applications. Universal Shift register (IC 7495) (Only pin diagram) (14 Marks) 4.3 •Memories – Classification – Explanation of RAM, ROM, PROM, EPROM, E2PROM.
A-D And D-A Converters (No Mathematical Derivations) To understand different Analog to Digital and Digital to Analog Conversion Techniques. •DAC - Weighted resistor and R-2R Ladder -Circuit diagram, working, Advantages and Disadvantages- DAC specifications •ADC - Ramp, Dual slope and Successive approximation -Circuit diagram, working, Advantages and Disadvantages-ADC Specifications.
w.e.f Academic Year 2012-13 G Scheme Course Name : Computer Engineering Group Course Code : CO/CM/IF/CD/CW Third Semester
Graphical User Interface (GUI) Programming
•Introduction to GUI Environment Theory Introduction of GUI, Environment of VB, Concept of VB Program, Project forms and Controls. Activity 1 •VB 6.0 Installation with demonstration. •Introduction of different windows of VB, Windows forms and Controls. Theory •Use of Class, Object, Property, Methods and events. •Drag & Drop Operations, Validating and Processing, user inputs, managing with menus. Activity 2 •Perform mathematical operation using Textbox and Labels. 2
•Introduction to Basic Concept of Visual Basic. Theory Understand the basic concepts such as, •Data types, Variants. •Variables, Constants. •Arrays – REDIM statement, Array related functions. •Collection, procedure, functions. •Argument passing and return values. •Input box and message box. •Control flow statement. •Loop statement. •Nested control structure. •Exit statement. •Operators – arithmetic, logical, relational, string. •Functions – String, Math’s, Date and Time. •Date and time formats. •Control loops (do, for, while) •Control statements (if-then, if-then-else, Selection option) •Using text box, Command button, Label, options, combo box, input and message box. Activity 3 •To use date, time, string, mathematical function and control statement by using different controls. 3
•Working with Controls & Events. Theory •Command Buttons, Checkboxes, Option Button. •Scroll bars and Sliders. •Picture Boxes and Image Controls. •Chart and Grid Control Activity 4 •To change height, width of Image using Image control, picture box and Scrollbars. Theory
w.e.f Academic Year 2012-13 G Scheme
w.e.f Academic Year 2012-13 G Scheme
• File system controls – drive, file, directory list box • Container – frame. • Events- load, Click, etc. Activity 5 •Design a form using directory, drives, file list and dialog box controls. Theory •Text Box and Rich Text boxes •List Box, Combo Box, Dialog Box. Activity 6 •Design text Editor. •Perform Cut, Copy, Paste, replace text and save file. Theory •Timer Control •Basic controls like – line, shape, circle, RGB, Paint picture. •Events- load, Click, etc Activity 7 •Design Timer Control Application. •Check Start, stop events in Timer. 3
•Module, Class Module, MDI, Menu Editor And Graphics Theory •Concept of module, class module, MDI, DLL’s and how to use them. •Creating own menu using menu editor, popup menu. •Advanced controls: Common dialog box, Tree view, List view, rich text box Control, windows common controls, status bar, tab control, image list, MSchart. •Concept of class module, module MDI, DLL and how to use them Using RTF Control. Activity 8 •Design MDI Form. •Drag & Drop Menu Bar, status bar & tool bar on MDI. 2
•Introduction to Database Connectivity and Report Generation. Theory •Concept of database, record, record set, connection DSN and DSN less connection •Data bound controls – text box, combo box, list box, DB grid, DB Combo, MS flex grid. •Visual Data Manager. •Database Controls- ADO, DAO, RDO. •Object connection, record set, parameter, cursor types, lock types. Activity 9 •Use different database controls such as ADO, RDO, DAO to perform insert, delete, update operation on database records. Theory Concept of Crystal Report & Data report. Activity 10 •Design Crystal Report. •Use crystal report in application. •It should get print by particular search criteria.
w.e.f Academic Year 2012-13 G Scheme Course Name : Computer Engineering Group Course Code : CO/CM/IF/CD/CW Semester : Third
Professional Practices-I
Information Search : Collect information from internet / newspaper / periodicals / magazines etc. Groups (4 to 5 students) have to search/collect information about any one of the following topic. Students will have to submit a report of about 5-10 pages. i) Manufacturing and costing of Computer hardware and software. ii) Advances in software Technology. iii) Information search related to IT Companies (Working Environment) iv) Information search related to Hardware & Networking Companies (Products and Features) v) E-Business. vi) Making a business plan. Vii) Information about Legendary Personalities through suitable websites (eg. youtube).
Lectures by Professional / industrial Expert to be organized from the following areas (any one) 1. Project presentation tips. 2. Spoken English. 3. Personality development. 4. Current trends in IT. 5. How to develop positive thinking.
Market Survey: a) A group of four students is expected to Collect 4 to 6 advertises showing job opportunities for C++, RDBMS, Java ,VB, .Net, hardware engineer etc. from newspaper and online resources as well as personally visiting the relevant industries and offices. b) Visit any one industry and find the knowledge and skills required for C++, RDBMS, Java Technologies. May also Visit related website.
Seminar: Seminar on any one of the following topics suggested below: A Group of students (4 to5)has to search / collect information about the topic through literature survey, visit and discussions with experts/ concerned persons: Student will have to submit a report of about 5- 10 pages and deliver a seminar for 10 minutes. 1) 3G/4G Technology. 2) Cloud Computing. 3) Hacking. 4) Robotics. 5) DNA Computing. 6) Nano Technology. 7) Robot Surgery. 8) HD Technology. 9) Smartphones. 10) ERP/SAP. Faculty can suggest any other latest topic.
List of Mini Projects (Any One). 1. Hotel reservation software ( may use-C,C++,RDBMS,VB) 2. Library management software ( may use C ,C++, RDBMS, VB )
BCA Bachelor Of Computer Application, BCCA, Bachelor of Commerce & Computer Application BE IT/CS, Information technology/Computer Science MCA, Master of Computer Application MCM, Master of Computer Management Diploma , Polytechnic Others,
Basic Programming
C / C++ ,
Testing
Software Testing,
Hardware & Networking
CCNA,
MCSE,
Hardware,
Networking
