0% found this document useful (0 votes)
40 views2 pages

Assigment KCA205 (DS)

This document contains two assignments for a Data Structures and Algorithms course. It provides details on the course outcomes and 5 questions each for two groups of students. The questions focus on key data structures like arrays, linked lists, stacks and queues. Students are asked to write algorithms and explain concepts like sparse matrices, different types of linked lists, representation of arrays in row major and column major order and operations on linked lists.

Uploaded by

varun.chaudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views2 pages

Assigment KCA205 (DS)

This document contains two assignments for a Data Structures and Algorithms course. It provides details on the course outcomes and 5 questions each for two groups of students. The questions focus on key data structures like arrays, linked lists, stacks and queues. Students are asked to write algorithms and explain concepts like sparse matrices, different types of linked lists, representation of arrays in row major and column major order and operations on linked lists.

Uploaded by

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

IMS Engineering College

NH-09, Adhyatmik Nagar, Near Dasna, Distt. Ghaziabad, U.P.


Tel: (0120) 4940000
Department of MCA
Subject Name & Code (2022-2023)
DATA STRUCTURES & ANALYSIS OF
ALGORITHMS (KCA205)
Assignment 1
SET A (Group 1)

Maximum Marks: 20 Submission Date: 4 May 2023


COURSE OUTCOMES

CO-1 Describe the features of a database system and its application and compare various types of data
models.
CO-2 Describe the applications of stacks and queues and implementation various operations on them using
arrays and linked list.

Q.No Question Marks CO


.
1. Write a short note on Data Structure. 2 1

2. What is Algorithm? Explain Algorithm Design Techniques. 2 1

3. What is Sparse Matrices and their representations? 2 1

4. What is Linked list? Explain all types of linked list with 7 1


example.
5. (I) Explain the Representation of Arrays. 7 1
a) Row Major Order, and b) Column Major Order

(II) Write an Algorithm to insert an element at the end of


Doubly Linked List.

SET B (Group 1)

Maximum Marks: 20 Submission Date: 4 May 2023


COURSE OUTCOMES
CO-1 Describe the features of a database system and its application and compare various types of data
models.
CO-2 Describe the applications of stacks and queues and implementation various operations on them using
arrays and linked list.

Q.N Question Marks CO


o
1. Define Algorithm. Write an algorithm to add two numbers. 2 1
2. Explain Singly Linked list with example. 2 1
3. Differentiate between array and linked list. 2 1

4. Write an algorithm to insert an element in circular linked 7 1


list at the specific position.
5. How you represent a polynomial in liked list? Add two 7 1
polynomials through linked list.
P(x)=5x3+8x2+6x+4 and q(x)=5x2+3x+9

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy