Scribd
Upload
9 views2 pages

Assignment 1

Uploaded by

Kishore Kumar
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
9 views2 pages

Assignment 1

Uploaded by

Kishore Kumar
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

Dr.

Ambedkar Institute of Technology, Bangalore – 560056


An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum
DEPARTMENT OF ARTIFICIAL INTELIGENCE AND MACHINE LEARNING

ASSIGNMENT-I

SEM: VI
SUBJECT: INTRODUCTION TO DATA STRUCTURES
SUBJECT CODE: 22AIT604A

SI.NO QUENSTIONS COs BTLs


1 Define data structure. List the classifications of data structures. CO1 L2
2 What are primitive data structures? Explain CO1 L1
3 What are non-primitive data structures? Explain CO1 L1
4 What is an array? What are the various operations that can be performed CO1 L2
on arrays? Explain with an examples.
5 Define sorting and searching? What are the various sorting and searching CO1 L2
techniques?
6 What is binary search? What is the necessary condition for binary CO1 L2
search? Write a function to search for an element using linear search.
7 What are pointer variables? How to declare a pointer variable? CO1 L1
8 What is dynamic memory allocation? Give the syntax and discuss the CO1 L2
various functions used for dynamic memory allocation .
9 Differentiate between the following with suitable example: CO1 L2
i) structure and union
ii) nested structure and self referenced structure
10 Define stack? List the applications of stack. CO2 L1
11 Define strings? List and explain the any four string handling functions CO2 L2
with an example.
12 “What is pattern matching? What are different pattern matching CO2 L1
techniques?”
13 Design a KMP algorithm for pattern matching with an suitable example? CO2 L2
14 Define expression, Infix expression, Postfix expression, and prefix CO2 L2
expression, Precedence and associativity with an example.
15 Convert the infix expression given below to postfix expression using CO2 L2
stack.
i) A – B / ( C * D +E )
ii) ( A+B*C/D)+E*F-G
16 Apply the postfix evaluation algorithm to evaluate the following postfix CO2 L2
expression using stack.
i) 1 2 3 + * 3 2 1 - + *
ii) 6 3 2 – 5 * + 1 $ 7 +
17 Develop a C program to read ten integers and store them in an array CO1 L3
using pointers. Print their sum and average.
18 Explain polynomial representation using arrays with examples. CO1 L2
19 Differentiate between static and dynamic memory allocation CO1 L2
20 Develop a program using pass by reference to swap two characters using CO1 L3
Dr. Ambedkar Institute of Technology, Bangalore – 560056
An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum
DEPARTMENT OF ARTIFICIAL INTELIGENCE AND MACHINE LEARNING

ASSIGNMENT-I

SEM: VI
SUBJECT: INTRODUCTION TO DATA STRUCTURES
SUBJECT CODE: 22AIT604A

pointer.
21 Define a linear queue. Design a C code to implement insert, delete, and CO2 L2
display functions on linear queue.
22 Define a circular queue. Implement a circular queue in C . CO2 L3

You might also like