Scribd Logo
Upload

Welcome to Scribd!

  • Master of Computer Application

    Uploaded by

    Simanta Kalita
    12 views1 page
    This document provides instructions for a 2-part assignment for an Advanced Data Structures course. It consists of 2 sets with 3 questions each, worth a total of 30 marks per set. Students must answer all questions from both sets, with the average score across the 2 sets counting as their internal assessment score. Questions 1-2 in Set 1 involve defining and explaining graph types and storage allocation methods. Question 3 discusses external storage devices. Set 2 includes questions on algorithms, complexity, queue implementations, and tree representations. Answers to 10-mark questions should be approximately 400 words.

    Original Description:

    Original Title

    MCA212.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for a 2-part assignment for an Advanced Data Structures course. It consists of 2 sets with 3 questions each, worth a total of 30 marks per set. Students must answer all questions from both sets, with the average score across the 2 sets counting as their internal assessment score. Questions 1-2 in Set 1 involve defining and explaining graph types and storage allocation methods. Question 3 discusses external storage devices. Set 2 includes questions on algorithms, complexity, queue implementations, and tree representations. Answers to 10-mark questions should be approximately 400 words.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views1 page

    Master of Computer Application

    Uploaded by

    Simanta Kalita
    This document provides instructions for a 2-part assignment for an Advanced Data Structures course. It consists of 2 sets with 3 questions each, worth a total of 30 marks per set. Students must answer all questions from both sets, with the average score across the 2 sets counting as their internal assessment score. Questions 1-2 in Set 1 involve defining and explaining graph types and storage allocation methods. Question 3 discusses external storage devices. Set 2 includes questions on algorithms, complexity, queue implementations, and tree representations. Answers to 10-mark questions should be approximately 400 words.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    ASSIGNMENT

    DRIVE SPRING- 2018


    PROGRAM MASTER OF COMPUTER APPLICATION
    SEMESTER II
    SUBJECT CODE & NAME MCA212- ADVANCED DATA STRUCTURE
    BK ID B1476
    NUMBER OF ASSIGNMNETS, 2, 4 Credits, 30 marks each
    CREDITS & MARKS

    Note –The Assignment is divided into 2 sets. You have to answer all questions in both sets.
    Average of both assignments score scored by you will be considered as your IA score. Kindly
    note that answers for 10 marks questions should be approximately of 400 words. Each question
    is followed by evaluation scheme.

    Assignment Set -1 Total


    Q.No Marks
    Questions Marks
    1 List and explain any Five types of graph. [5*2]
    10
    2 Explain [5+5] 10
    1. Fixed block storage allocation.
    2. Variable block storage allocation

    3 What is the use of external Storage Devices? Explain any [4+3+3] 10


    two external storage devices

    Assignment Set -2 Total


    Q.No Marks
    Questions Marks
    1 Define algorithm and write a note on Complexity and Time- [2+4+4]
    Space Tradeoff with example 10
    2 Define Queue and explain [2+4+4] 10
    a. Array implementation of queue
    b. Linked list implementation of queue

    3 List the Advantages and Disadvantages of Linear and [5+5] 10


    linked representation of tree.

    You might also like