Scribd
Upload
25 views2 pages

Data Structures Question Bank

The document is a question bank for Data Structures at Prakasam Engineering College, covering various topics across five units. It includes theoretical questions and programming exercises related to constants, data types, arrays, functions, linked lists, stacks, queues, sorting algorithms, and binary trees. Each unit contains both conceptual questions and practical programming tasks to reinforce learning.

Uploaded by

Krâñthï Choppara
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
25 views2 pages

Data Structures Question Bank

The document is a question bank for Data Structures at Prakasam Engineering College, covering various topics across five units. It includes theoretical questions and programming exercises related to constants, data types, arrays, functions, linked lists, stacks, queues, sorting algorithms, and binary trees. Each unit contains both conceptual questions and practical programming tasks to reinforce learning.

Uploaded by

Krâñthï Choppara
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

PRAKASAM ENGINEERING COLLEGE (AUTONOMOUS)

Data Structures Question Bank


Unit-1
1.What is constant? Explain different types of constants with an examples?
2.Explain primitive data types in c language with their size & range?
3.Explain bitwise operators with an examples?
4.Explain conditional statements ( simple if, if..else, nested if..else , else if ladder &
switch..case) with example programs?
5.Explain iterative statements with example programs?
6.Explain break and continue statements with examples?
7. What is an array? How to declare and initialize and access elements of one dimensional
array? Explain with an example program?
programs
1. write a c program to find the largest elements of an array.
2. Write a c program to find the roots of a quadratic equation using if statement.
3.write a c program to test whether a number is prime or not.
4.write a c program to calculate the factorial of a given number.
5.write a c program whether a number is Armstrong number or not.
6.write a c program to multiply two matrices
UNIT-2
1.What is a function ?Explain various categories of user defined functions?
2. Explain recursion with an example program?
3.what is pointer? how to declare and initialize a pointer with an example?
4. Explain different arithmetic operations that can be performed on pointers?
5.what is dynamic memory allocation and deallocation with example program
6.Differences between structures and unions?
7.Explain Nested structures with example programs?
8.what is a file? how to open and close the files? Explain with examples
9.Explain call by value and call by address with examples?
Programs
1.write a c program to find sum and average of elements stored in an array using pointers
2.write a c program to copy contents of one file into another file.

UNIT-III
1) Define Single Linked List. Write algorithms to insert a node at the beginning, ending, and
after the given key element.
2) Define Single Linked List. Write algorithms to delete a node at the beginning, ending, and
a node whose data is equals to given key value.
3. Define double linked list. Write algorithms to insert a node at the beginning, ending, and
after the given key element.
4. Define double linked list. Write algorithms to delete a node at the beginning, ending, and a
node whose data is equals to given key value.
5) Discuss the implementation of a circular linked list.
UNIT-IV
1. What is a Stack? Explain the implementation of Stack Operations using arrays.
2. What is a Stack? Explain the implementation of Stack Operations using Linked List
3. Define stack and give one application? Convert the given infix expression to its postfix
Expression ((A+((B^C)-D))*(E-(A/C)))
4. Write an algorithm to evaluate given postfix expression. Explain with example.
5. What is a Queue? Explain the implementation of Queue Operations using arrays.
UNIT - 5
1.Define Sorting? Sort the following elements using Quick Sort? Give the time complexity
of quicksort? 9, 17, 5, 28, 3, 11, 7, 78, 1, 33, 8, 45, 2, 4, 12, 6, 34
2.Outline the concept of divide and conquer. Give an algorithm for Merge Sort & trace the
steps for sorting the following list with time complexity. 39, 9, 81, 45, 90, 27, 72, 18
3.Explain the Binary Tree representation using Arrays & Linked List.
4.Write and explain Binary Tree Traversals in a recursive approach.
5.What is a Binary Search Tree? Draw a binary search tree when the following keys are
inserted in order 43, 75, 19, 36, 8, 62, 49, 84, 12, 18, 29.

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