Basic CS-Data Structures [TCS Placement]: Sample Questions 8 - 10 of 28

Get unlimited access to the best preparation resource for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 8

Data Structures
Edit

Write in Short

Short Answer▾

Minimum number of queues needed to implement the priority queue?

Explanation

  • Priority queues not only store data but also corresponding priorities.
  • Two queues could implement priority queue- One queue is used for actual storing of data and another for storing priorities.
Given the Image is Define the Priority Queues

Question 9

Data Structures
Edit

Describe in Detail

Essay▾

List out the areas in which data structures are applied extensively?

Explanation

Areas include

  • Compiler Design
  • Operating System
  • Database Management System
  • Statistical analysis package
  • Numerical Analysis
  • Graphics
  • Artificial Intelligence
  • Simulation

Question 10

Data Structures
Edit

Describe in Detail

Essay▾

What is data structure?

Explanation

A data structure:

  • Organizes data based on their relationship to each other.
  • Uses knowledge about the relationship between data items for designing efficient algorithms for the manipulation.
  • Provides a scheme for organizing related pieces of information.
  • Provides convenient mechanism for storing, accessing, transferring, and archiving data.
  • Ensures efficient processing for example, in lists, arrays, stacks, queues or trees.
  • Primitive types line Integer, Float, Boolean, Char etc. are called Primitive Data Structures.
  • On the other hand, Complex Data Structures store large and connected data. Such Abstract Data Structure include:
  • Linked List
  • Tree
  • Graph
  • Stack, Queue etc.
Given the Image is Define the Data Structure and Types of Operations

Developed by: