- CS Project
- MBA Project
- Certification
- Interview
- Download
- Tips
- Forum
- SMU
- SMU Assignments
- SMU Question, Answers
- SMU Projects
- SCDL
- SCDL Assignments
- SCDL Projects
- IGNOU
- IGNOU Assignemnts
- IGNOU Qusetion Paper
- IGNOU Projects

- SMU
- SMU Assignments
- SMU Question, Answers
- SMU Projects
- SCDL
- SCDL Assignments
- SCDL Projects
- IGNOU
- IGNOU Assignemnts
- IGNOU Qusetion Paper
- IGNOU Projects

Home > Download > SMU - Question Paper > MCA > MC0068

This is the collection of
Sikkim Manipal University (SMU) question and answers for Data Structures using C. It will help
to prepare your examination. All question paper are
classified as per semester, subject code and question type of Part A, Part B and Part C with
multiple
choice options
as same as actual examination. SMU question papers includes
year 2019, 2018, 2017 Sem I, II, III, IV, V, VI examinations
of all subjects.

SMU question test set of old,
last and previous year are updated
regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net,
Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested
you kindly send me the question paper of Data Structures using C, SMU - Master of Computer Application.

__Course Name__
MCA (Master of Computer Application)

__Subject Code__ MC0068 (Data Structures using C)

__Get Questions__
__PART - A__
__PART - B__
__PART - C__

**Data Structures using C Syllabus. **

**Part 1: Arrays, Pointers and Structures
**Introduction; Definition and concept of an Array: Array Used in „C‟
Language, Single – Dimensional Arrays (One Dimensional Array), Two Dimensional
Arrays. [Matrix]; Pointers; Declaring a pointer variable,: Pointer Operators;
Pointers and Arrays; Pointers used in function; Pointers used in an Array;
Structures: Declaration of structure, Initialization of structure, Processing of
Structure, Structure used with an Array.

Implementation methods; Non Linear Data Structures: Trees, Binary Tree, Hash Tables.

**Part 5: Linked Lists
**Introduction; Linear list; Linked list: Typical basic linked-list
operations, Singly-Linked Lists; Circular singly linked list: Insert a node at
the front end, Insert a node at the rear end, Delete a node from the front end,
Delete a node from the rear end; Doubly linked lists: Insert a node at the front
end, Insert a node at the rear end, Delete a node from the front end.

Binary search tree (BST): Insertion Operation, Searching, Other operations, To find maximum value in a tree BST, To find minimum value in a BST, Height of tree, Count nodes in a tree, Count leaves in a tree, Delete a node from the tree.

**Part 10: Advanced Topics in Trees and Their Applications
**Introduction; Analyzing the BST Search Algorithm; Inserting Nodes into a BST;
The Order of Insertion Determines the BST's Topology; Deleting Nodes from a BST;
Traversing the Nodes of a BST: Preorder Traversal, Inorder Traversal, Postorder
Traversal; The Cost of Recursion; Binary Search Trees in the Real-World; Big-O
Notation: Application of Big-O notation to algorithm analysis; Big- and
Big-:Properties of the sets O(f(n)) and (f(n)), Other useful mathematical
formulae; Height Balanced Trees: AVL Trees, Red-Black Trees, Lemma, Insertion
into a red-black tree, Deletions from a Red-Black tree; The A-A tree; AVL Trees:
Definition, Worst case height of an AVL tree with n Nodes; The Binary Heap:
Definition, Insertions into a Binary Heap, Deletions from a Binary Heap,
Analysis of Insertion Algorithm, Build Heap -- building a tree from a collection
of forests.

**Part 13: Graphs and their Applications – II
**Introduction; Depth First Search (DFS) Algorithm: Sample Problem: n Queens
[Traditional], Depth First Search (DFS) Implementation, Complexity; Breadth
First Search (BFS): Sample Problem: Knight Cover [Traditional], Breadth First
Search (BFS) Implementation, Complexity; Depth First with Iterative Deepening
(DF-ID): Complexity; Comparison of DFS, BFS & DFS+ID; Sample Problems:
Super-prime Rib, Betsy's Tour , Udder Travel , Desert Crossing, Addition Chains;
Informed Search: Best First Search, A* Search; An Application of Graph;
Amortized Analysis: Aggregate Analysis, The potential method, Properties of the
Potential Function, The Dynamic Hash Table, A Dynamic Hash Table that both
expands and contracts.

Home > Download > SMU - Question Paper > MCA > MC0068

© 2006 - 2019, RM Solution.