Scribd
Upload
89 views2 pages

C++ OOP Concepts & Algorithms Guide

The document outlines the course units for two subjects: Design and Analysis of Algorithm Laboratory and Object Oriented Programming Laboratory. Unit I of DAA Lab covers graph traversal algorithms like BFS and DFS. Units II covers minimum spanning tree algorithms like Kruskal's and Prim's. Unit III covers shortest path algorithms like Bellman-Ford, Dijkstra, and Floyd-Warshall. Unit IV covers flow algorithms like Ford-Fulkerson. Unit V covers greedy, dynamic programming, and backtracking algorithms. OOP Lab's Unit I covers basic OOP concepts in C++. Unit II covers polymorphism. Unit III covers file handling. Unit IV covers packages and interfaces in Java. Unit V covers

Uploaded by

Ankit Gautam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views2 pages

C++ OOP Concepts & Algorithms Guide

The document outlines the course units for two subjects: Design and Analysis of Algorithm Laboratory and Object Oriented Programming Laboratory. Unit I of DAA Lab covers graph traversal algorithms like BFS and DFS. Units II covers minimum spanning tree algorithms like Kruskal's and Prim's. Unit III covers shortest path algorithms like Bellman-Ford, Dijkstra, and Floyd-Warshall. Unit IV covers flow algorithms like Ford-Fulkerson. Unit V covers greedy, dynamic programming, and backtracking algorithms. OOP Lab's Unit I covers basic OOP concepts in C++. Unit II covers polymorphism. Unit III covers file handling. Unit IV covers packages and interfaces in Java. Unit V covers

Uploaded by

Ankit Gautam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT-I

Object oriented programming concepts – objects – classes – methods and messages –abstraction and
encapsulation – inheritance – abstract classes – polymorphism.
Introduction to C++ – classes – access specifiers – function and data members – defaultarguments –
function overloading – friend functions – const and volatile functions –staticmembers – Objects –
pointers and objects – constant objects – nested classes – localclasses

UNIT-II
Constructors – default constructor – Parameterized constructors – Constructor with dynamic
allocation – copy constructor – destructors – operator overloading – overloading through friend
functions – overloading the assignment operator – type conversion – explicit constructor

UNIT-III
Function and class templates - Exception handling – try-catch-throw paradigm –exception specification
– terminate and Unexpected functions – Uncaught exception.

UNIT-IV
Inheritance – public, private, and protected derivations – multiple inheritance–virtualbase class –
abstract class – composite objects Runtime polymorphism – virtualfunctions – pure virtual functions.

UNIT-V
Streams and formatted I/O – I/O manipulators - file handling – random access – object
serialization – namespaces - std namespace – ANSI String Objects – standard template
library.

Text Book:
1. Object Oriented Programming with C++ by E Balaguruswamy

Reference Book:
1. The Complete Reference C++ by Herbert Schildt

DESIGN AND ANALYSIS OF ALGORITHM LABORATORY UCS04P03

L T P
Prerequisites:
0 - 0 - 3 : 2 Credits

Programme to implement the following:

1) Traversing a graph using BFS and DFS


2) Growing a minimum spanning tree using Kruskal’s and Prims’salgoeithm
3) Bellman Ford and Dijkstra’s algorithm
4) Floyd Warshall algorithm
5) Ford Fulkerson method
6) Implement Activity Selection problem, Huffman Coding and Fractional Knapsack using Greedy Approach.
7) Implement 0 – 1 Knapsack, Matrix – Chain, Optimal BST and Longest Common Subsequence using Dynamic
Programming method

27
8) Implement Activity Selection, 15 puzzle game, Travelling Salesperson Problem using Branch and Bound
Technique
9) Implement 4 queen problem, sum – of – subset problem, graph coloring and Hamiltonian cycle problem using
Backtracking method.
10) Few programmes based on Approximation method.

UCS04P04
OBJECT ORENTED PROGRAMMING LABORATORY
L T P
Prerequisites: None
0 - 0 - 3 :2 Credits

UNIT I: Program using functions- functions with default arguments- implementation of call by value,
address, reference -simple classes for understanding objects, member functions & constructors- classes
with primitive data members- classes with arrays as data members- classes with pointers as data
members- classes with constant data members- classes with static member functions

UNIT II: Compile time polymorphism- operator overloading- function overloading- Run time
polymorphism- inheritance- virtual functions- virtual base classes- templates

UNIT III: Regular Expressions and Filters: sequential access-random access

UNIT IV: Simple java applications for understanding references to an instant of a class- handling strings
in JAVA-Simple package creation- developing user defined packages in java

UNIT V: Interfaces- developing user defined interfaces- use predefined interfaces-Threading creation
of threading in java applications-multi threadingexception handling mechanism in java handling
predefined exceptions- handling user defined exceptions

Fifth Semester

COMPUTER ARCHITECTURE AND ORGANIZATION UCS05B10

L T P
Prerequisites: UCS03B03
3- 1 - 0 : 4 Credits

PART-I

UNIT-I

The Concept of Computer Architecture – Architecture at Micromachine (for Microprogrammed


processors), processor, and computer system levels – Abstract (or logical) and concrete (or physical)
architectures.

28

You might also like