DATA STRUCTURES USING C

Size: px
Start display at page:

Download "DATA STRUCTURES USING C"

Transcription

1 DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give the general form to represent one dimensional array. 8. Give the location to store address of an element in 1-D array. 9. Define merging. 10. Write the statement in C to declare a 2-D array and initialize. 11. Define range. 12. How to calculate the maximum elements in a 2-D array? 13. Name the different methods used to implement 2-D Array. 14. Define base address. 15. Define string. 16. Give the general form to represent string. 17. What is meant by string terminator? 18. What is meant by pattern matching? 19. Give any two string operations. 20. Name the two components required to obtain the address of any location of an array and its size. 1. Classification of data structures. 2. Memory allocation in 1-D array. 3. Traversing in an array. 4. Inserting in an array. 5. Deleting in an array. 6. Sorting in an array. 7. Searching in an array. 8. Merging in an array. 9. Representing 2-D array with header. 10. Row major & column major implementation. 11. String operations. 12. Pattern matching.

2 UNIT II 1. Define stack. Give the initial condition of stack. 2. Define queue. Give the initial condition of queue. 3. Which statuses have to be checked during PUSH and POP operations? 4. When the stack is called empty and full? 5. Define expression. What are the types of expression? 6. Define infix expression. Give an e.g. 7. Define postfix expression. Give an e.g. 8. Define prefix expression. Give an e.g. 9. What are the applications of stack? 10. What is meant by matching of nested parentheses? 11. Define recursion. Give its formula. 12. When the queue is called empty and full? 13. Define circular queue. 14. Define priority queue. 15. Define de queue. 16. Name the primitive operations of stack. 17. Name the primitive operations of queue. 1. Write the algorithm for stack full, stack empty. 2. Write the algorithm for PUSH and POP operations. 3. Write the algorithm for queue full, queue empty. 4. Priority queue. 5. Circular queue. 6. Transforming infix to postfix notation. 7. Evaluation of postfix notation. 8. Matching of nested parentheses.

3 UNIT III : 1. Define linked list. 2. What are the types of addresses in a linked list? 3. Define external address. 4. Define internal address. 5. Define null address. 6. Define SLL. How to declare SLL. 7. Define DLL. How to declare DLL. 8. What is meant by freeing a node? 9. Define dangling pointer. 10. Define garbage collection. 11. Give any two differences between SLL and DLL. 12. Describe the purpose of the link fields of a doubly linked list. 13. What are the fields in SLL? 14. What are the fields in DLL? : 1. Linked list implementation. 2. Advantages and disadvantages of linked list. 3. Algorithm for SLL creation. 4. Algorithm for SLL insertion & deletion at head position. 5. Algorithm for SLL insertion & deletion at specified position. 6. Algorithm for SLL insertion & deletion at end position. 7. Algorithm for DLL creation. 8. Algorithm for DLL insertion & deletion at head position. 9. Algorithm for DLL insertion & deletion at specified position. 10. Algorithm for DLL insertion & deletion at end position. 11. Difference between SLL and DLL. 12. Circular linked list.

4 UNIT IV 1. Define binary tree. 2. When the binary tree is said to be full binary tree? 3. When the binary tree is said to be complete binary tree? 4. What are the representations of binary tree? 5. Define binary tree traversal. 6. Define expression tree. 7. Define binary search tree. 8. Define tree. 9. Define graph. 10. What are the different types of graph? 11. What are the representations of graph? 1. Tree terminologies. 2. Binary tree. 3. Binary tree traversal. 4. Tree representation of arithmetic expression. 5. Finding inorder from expression tree. 6. Finding preorder from expression tree. 7. Finding postorder from expression tree. 8. Graph terminologies. 9. Graph representation. 10. Comparison of graph representation. 11. Explain about binary search tree.

5 UNIT V 1. Define sequential search. 2. How to calculate the mid position? 3. What are the two types of sorting? 4. Define hashing. 5. Define hash table. 6. Define hash function. 7. Define collision. 8. Define extendible hashing. 9. Define rehashing. 10. What are the methods of collision resolution? 11. Define separate chaining. 12. Define open addressing. 13. What are the different types of hash function? 14. Give the general form for division, mid square & folding method hash function. 1. Explain about Sequential search. 2. Explain about Binary search. 3. Explain about Bubble sort. 4. Explain about selection sort. 5. Explain about insertion sort. 6. Explain about quick sort. 7. Explain about radix sort. 8. Explain about collision resolution methods. 9. Explain extendible hashing. 10. Explain about hash table and hash function.

GOVERNMENT POLYTECHNIC HIMATNAGAR Information Technology

GOVERNMENT POLYTECHNIC HIMATNAGAR Information Technology GOVERNMENT POLYTECHNIC HIMATNAGAR Information Technology Subject:Data Structures Subject Code:3330704 Semester: III Assignment-1 1.What is Data Structure? Explain Primitives & Non-Primitive data structure

More information

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate

More information

Paper Full Marks : 75

Paper Full Marks : 75 Paper 3 2008 Full Marks : 75 Paper- 4 2008 Full Marks : 75 Paper - 4 2010 Time: 3 hours Full Marks: 75 Candidates are required to give their answers in their own words as far as practicable. The questions

More information

PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore

PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore 560 100 Department of MCA COURSE INFORMATION SHEET 1. GENERAL INFORMATION: Data Structures Using C (16MCA11) Academic Year:

More information

CS1201-Data Structures

CS1201-Data Structures SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. CS1201-Data Structures UNIT I FUNDAMENTALS OF ALGORITHMS 1. Define Algorithm. 2. Define

More information

10CS35: Data Structures Using C

10CS35: Data Structures Using C CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a

More information

Data Structure [Question Bank]

Data Structure [Question Bank] Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:

More information

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: 3330704)

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: 3330704) GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT Course Curriculum DATA STRUCTURES (Code: 3330704) Diploma Programme in which this course is offered Semester in which offered Computer Engineering,

More information

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1. is compulsory and is of 20 marks. Attempt one out of two questions from remaining four units.

More information

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

More information

R13. II B. Tech I Semester Supplementary Examinations, June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

R13. II B. Tech I Semester Supplementary Examinations, June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) SET - 1 II B. Tech I Semester Supplementary Examinations, June - 2015 DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) Time: 3 hours Max. Marks: 70 Note: 1. Question Paper consists of two parts (Part-A

More information

Data Structures. A Pseudocode Approach with С. Richard F. Gilberg De Anza College. Behrouz A. Forouzan De Anza College I(T)P. PWS Publishing Company

Data Structures. A Pseudocode Approach with С. Richard F. Gilberg De Anza College. Behrouz A. Forouzan De Anza College I(T)P. PWS Publishing Company Data Structures A Pseudocode Approach with С Richard F. Gilberg De Anza College Behrouz A. Forouzan De Anza College PWS Publishing Company I(T)P An International Thomson Publishing Company Boston 'Albany

More information

COURSE: B.TECH-ECE. IV Sem. Data structure Using C. b) Deletion of element in an array

COURSE: B.TECH-ECE. IV Sem. Data structure Using C. b) Deletion of element in an array COURSE: B.TECH-ECE. IV Sem Data structure Using C 1. Determine the formula to find the address location of an element in three dimensions array, suppose each element takes four bytes of space & elements

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 0 0 DEPARTMENT OF INFORMATION TECHNOLOGY & COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CS0 PROGRAMMING AND DATA STRUCTURES I (Common

More information

PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC QUESTION BANK PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

More information

DEPARTMENT OF SCIENCE AND HUMANITIES CS6202-PROGRAMMING AND DATA STRUCTURES I QUESTION BANK

DEPARTMENT OF SCIENCE AND HUMANITIES CS6202-PROGRAMMING AND DATA STRUCTURES I QUESTION BANK DEPARTMENT OF SCIENCE AND HUMANITIES Sem/Year/Branch: II/I/CSE CS6202-PROGRAMMING AND DATA STRUCTURES I QUESTION BANK UNIT I 1. Give two examples of C preprocessors with syntax.(apr/may 2015) 2. What are

More information

BHARATHIDASAN ENGINEERING COLLEGE Nattarampalli CS6202/IT PROGRAMMING & DATA STRUCTURES-I C PROGRAMMING FUNDAMENTALS- A REVIEW.

BHARATHIDASAN ENGINEERING COLLEGE Nattarampalli CS6202/IT PROGRAMMING & DATA STRUCTURES-I C PROGRAMMING FUNDAMENTALS- A REVIEW. BHARATHIDASAN ENGINEERING COLLEGE Nattarampalli 635852 CS6202/IT6202 - PROGRAMMING & DATA STRUCTURES-I UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW Part - A 1. What is the difference between WHILE and DO

More information

V.S.B. ENGINEERING COLLEGE, KARUR. Academic Year: (ODD Semester) Department of Computer Science and Engineering

V.S.B. ENGINEERING COLLEGE, KARUR. Academic Year: (ODD Semester) Department of Computer Science and Engineering V.S.B. ENGINEERING COLLEGE, KARUR Academic Year: 2016-2017 (ODD Semester) Department of Computer Science and Engineering Question Bank (2013 Regulations) S.No. Name of the Subject / Lab Semester Page No.

More information

B. V.Patel Institute of Business Management, Computer & Information Technology

B. V.Patel Institute of Business Management, Computer & Information Technology Sr. No. B. V.Patel Institute of Business Management, Allocated Hours Problem statements to be perform in laboratory List of Problems 1. 2 1. Write a program to insert 10 elements into array and Perform

More information

FUNDAMENTALS OF DATA STRUCTURES IN C++

FUNDAMENTALS OF DATA STRUCTURES IN C++ FUNDAMENTALS OF DATA STRUCTURES IN C++ Ellis Horowitz University of Southern California Sartaj Sahni University of Florida Dinesh Mehta University of Tennessee COMPUTER SCIENCE PRESS An imprint of W. H.

More information

Note: The paper consists of two sections. Section A and Section B. Section A is compulsory. In Section B attempt any one question from each unit.

Note: The paper consists of two sections. Section A and Section B. Section A is compulsory. In Section B attempt any one question from each unit. Model Answer B.Tech. (Fourth Semester) Examination 2013 (Information Technology) Data Structure and Programming Methodology (IT2202) Time Allowed: Three hours Maximum Marks: 60. Note: The paper consists

More information

Introduction to C language. Features of C History Structure of C Program Keyword, Identifiers & Constants. Data types

Introduction to C language. Features of C History Structure of C Program Keyword, Identifiers & Constants. Data types C to C language Features of C History Structure of C Program Keyword, Identifiers & Constants Data types Primitive Data Types Aggregated Data Types Operators Binary Operators Unary Operators Ternary Operators

More information

Marks : 10X1. Note: Question Number 1 is compulsory.

Marks : 10X1. Note: Question Number 1 is compulsory. MODEL ANSWER B.Sc, computer Science, Integrated U.G/P.G(sixth Semester) Examination,2014 Subject: Introduction to Data-structure (PCSC-603) [Time: Three Hours] [Maximum Marks : 30] Note: Question Number

More information

Data Structures 2016

Data Structures 2016 Unit-1 Introduction Short Questions:- 1. Define data structure. 2. Define algorithm. 3. List out areas in which data structures are applied. 4. List out structure of algorithm. 5. List out properties of

More information

Chapter 13: Data structures

Chapter 13: Data structures Chapter 13: Data structures ANSWERS TO QUESTIONS IN THE STUDENT S BOOK Page 160 1. Explain what is meant by the following terms: (a) list (b) stack (c) queue (d) array (a) A list organises data by index

More information

VIDYARTHIPLUS - Anna University Students Online Community CS6202-PROGRAMMING AND DATASTRUCTURES I IMPORTANT 2 MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more than

More information

Data Structures and Algorithms Using Python

Data Structures and Algorithms Using Python Data Structures and Algorithms Using Python Ranee D. Necaise Department of Computer Science College of William and Mary WILEY JOHN WILEY & SONS, INC. Contents Preface xiii Chapter 1: Abstract Data Types

More information

Course Outline. TERM EFFECTIVE: Spring 2016 CURRICULUM APPROVAL DATE: 04/27/2015

Course Outline. TERM EFFECTIVE: Spring 2016 CURRICULUM APPROVAL DATE: 04/27/2015 5055 Santa Teresa Blvd Gilroy, CA 95023 Course Outline COURSE: CSIS 46 DIVISION: 50 ALSO LISTED AS: TERM EFFECTIVE: Spring 2016 CURRICULUM APPROVAL DATE: 04/27/2015 SHORT TITLE: C++ PROGRAMMING II LONG

More information

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should Use better data structures

More information

UNIT-1 UNIT-2. done using Malloc()? in all three notations. 11.Define the following: a)space complexity b)time complexity

UNIT-1 UNIT-2. done using Malloc()? in all three notations. 11.Define the following: a)space complexity b)time complexity UNIT-1 1. What is pointer variable? How to declare a pointer variables?. 2. What are the various memory allocation techniques? Explain how dynamic allocation is done using Malloc()? 3. What is recursion?

More information

Data Structures Interview / VIVA Questions and Answers This Content is Provided by JNTU World

Data Structures Interview / VIVA Questions and Answers This Content is Provided by JNTU World Data Structures Interview / VIVA Questions and Answers This Content is Provided by 1. What is data structure? The logical and mathematical model of a particular organization of data is called data structure.

More information

Advanced Topics in C. Core Concepts in. Data Structures. mmm. Apress- Noel Kalicharan

Advanced Topics in C. Core Concepts in. Data Structures. mmm. Apress- Noel Kalicharan Advanced Topics in C Core Concepts in Data Structures mmm Noel Kalicharan Apress- Contents J About the Author About the Technical Reviewer Preface xiii xv xvii Chapter 1: Sorting, Searching, and Merging

More information

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes. 1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

More information

Data structures & Algorithms - Multiple Choice Questions (MCQs) - Objective Set 1

Data structures & Algorithms - Multiple Choice Questions (MCQs) - Objective Set 1 Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks,

More information

JAVA COURSE. Curriculum >>>

JAVA COURSE. Curriculum >>> JAVA COURSE Curriculum >>> CSS TEC W E C H A N G E L I V E S Introductory Java Language Features Packages and Classes Types and Identifiers Identifiers Built-in Types Storage of Numbers Hexadecimal Numbers

More information

NORTH MAHARASHTRA UNIVERSITY,

NORTH MAHARASHTRA UNIVERSITY, NORTH MAHARASHTRA UNIVERSITY, JALGAON Syllabus for S. Y. B. Sc. (Semester Pattern) Computer Science (w. e. f. June 2013) SCIENCE FACULTY North Maharashtra University, Jalgaon S. Y. B. Sc.(Computer Science)

More information

INTERNATIONAL EDITION. Problem Solving with C++ Data Abstraction & SIXTH EDITION. Walls and Mirrors. Frank M. Carrano Timothy Henry

INTERNATIONAL EDITION. Problem Solving with C++ Data Abstraction & SIXTH EDITION. Walls and Mirrors. Frank M. Carrano Timothy Henry INTERNATIONAL EDITION Data Abstraction & Problem Solving with C++ Walls and Mirrors SIXTH EDITION Frank M. Carrano Timothy Henry Operator Meaning Associativity Usage * multiply left expr * expr / divide

More information

Java Software Structures

Java Software Structures INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition

More information

C++ Saumyendra Sengupta Carl Phillip Korobkin. Object-Oriented Data Structures BJJL

C++ Saumyendra Sengupta Carl Phillip Korobkin. Object-Oriented Data Structures BJJL Saumyendra Sengupta Carl Phillip Korobkin C++ Object-Oriented Data Structures With 165 Illustrations Diskette Included Taehnische Hochschule Darmstadt FACHBERE5CH IKFORMATIK BJJL Inventar-Nr.: Sachgebiete:

More information

Data Structures 2014

Data Structures 2014 Unit-1 Introduction Short Questions:1. Define data structure. 2. Define algorithm. 3. List out areas in which data structures are applied. 4. List out structure of algorithm. 5. List out properties of

More information

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM UNIVERSITY

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM UNIVERSITY DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 Subject Code

More information

Data Structures Using Java

Data Structures Using Java Data Structures Using Java D. S. Malik P. S. Nair THOMSON COURSE TECHNOLOGY Australia Canada Mexico Singapore Spain United Kingdom United States TABLE OF Contents PREFACE XXV 1.Software Engineering Principles

More information

Data Structures and Algorithms in Java

Data Structures and Algorithms in Java 2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Data Structures and Algorithms in Java Fourth Edition Michael T.

More information

SRIDEVI, ASSISTANT PROFESSOR (O.G)

SRIDEVI, ASSISTANT PROFESSOR (O.G) SRM NAGAR, KATTANKULATHUR 60 0 IN REVISED BLOOM S TAXONOMY ACADEMIC YEAR: 06-7 SEMESTER: ODD BRANCH: MCA YEAR: I SEMESTER: I SUBJECT CODE AND NAME: MC70 DATA STRUCTURES AND ALGORITHMS NAME OF THE FACULTY

More information

Data Structure Using C

Data Structure Using C 1 (i) Describe the following terms (a) Pointer (b) Structure (c) Array (d) Function (e) Pointer to Structure (f) Pointer to array (g) Header linked list (ii) Write the program for : (any two) 10 (a) Linear

More information

AP Computer Science AB Syllabus 1

AP Computer Science AB Syllabus 1 AP Computer Science AB Syllabus 1 Course Resources Java Software Solutions for AP Computer Science, J. Lewis, W. Loftus, and C. Cocking, First Edition, 2004, Prentice Hall. Video: Sorting Out Sorting,

More information

Summary. Pre requisition. Content Details: 1. Basics in C++

Summary. Pre requisition. Content Details: 1. Basics in C++ Summary C++ Language is one of the approaches to provide object-oriented functionality with C like syntax. C++ adds greater typing strength, scoping and other tools useful in object-oriented programming

More information

Chapter 12: Advanced Implementations of Tables

Chapter 12: Advanced Implementations of Tables Chapter 12: Advanced Implementations of Tables Data Abstraction & Problem Solving with C++ Fifth Edition by Frank M. Carrano Balanced Search Trees The efficiency of the binary search tree implementation

More information

Definition A tree is either empty or consists of one node called the root and zero or more subtrees.

Definition A tree is either empty or consists of one node called the root and zero or more subtrees. Binary Trees Introduction We extend the concept of linked data structures to structure containing nodes with more than one self-referenced field. Definition A tree is either empty or consists of one node

More information

Q1 Define searching process? A1 searching is the process of finding an element within the list of elements stored in any order or randomly.

Q1 Define searching process? A1 searching is the process of finding an element within the list of elements stored in any order or randomly. Model Viva Questions for Name of the Lab: Data Structure of lab Common to: CS 4 th sem Title of the Practical: Program to search an element of array using linear search. Q1 Define searching process? A1

More information

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) -----------------------------------------

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) ----------------------------------------- =============================================================================================================================== DATA STRUCTURE PSEUDO-CODE EXAMPLES (c) Mubashir N. Mir - www.mubashirnabi.com

More information

Code No: X0523 II B.Tech I Semester (R07) Supply Examinations, May

Code No: X0523 II B.Tech I Semester (R07) Supply Examinations, May SET - 1 1. a) What do you mean by static variable and static function? Give an example? b) Write short notes on copy constructor. 2. Explain the pitfalls of a) operator overloading. b) Abstract class.

More information

12 Abstract Data Types

12 Abstract Data Types 12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

More information

UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE

UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE STUDENT IDENTIFICATION NO UNIVERSITI MALAYSIA SARAWAK 94300 KOTA SAMARAHAN SARAWAK FAKULTI SAINS KOMPUTER & TEKNOLOGI MAKLUMAT (Faculty of Computer Science & Information Technology) Diploma in Multimedia

More information

CS 6202 PROGRAMMING & DATA STRUCTURES-I PART-B UNIT-I ANNA UNIVERSITY QUESTIONS

CS 6202 PROGRAMMING & DATA STRUCTURES-I PART-B UNIT-I ANNA UNIVERSITY QUESTIONS PART-B UNIT-I 1. Write a function that returns a pointer to the maximum value of an array of double s.if the array is empty,return null? (8) Double*maximum(double*a,int size); 2. Write a c program to find

More information

BCA-2 nd year. Paper 208: Data Structure Using C. Assignment 1

BCA-2 nd year. Paper 208: Data Structure Using C. Assignment 1 BCA-2 nd year Paper 208: Data Structure Using C Assignment 1 1. What is array? Define memory representation of array. 2. Write a sort note on data structure. 3. What is queue? Write algorithms for queue

More information

Cpt S 122 Data Structures. Custom Templatized Data Structures in C++

Cpt S 122 Data Structures. Custom Templatized Data Structures in C++ Cpt S 122 Data Structures Custom Templatized Data Structures in C++ Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Topics Introduction Self Referential Classes

More information

Unit Wise Important Questions UNIT-1(10M) Unit-1 (2M & 3M)

Unit Wise Important Questions UNIT-1(10M) Unit-1 (2M & 3M) Unit Wise Important Questions UNIT-1(10M) 1. Define Linked List? Explain the operations on Linked List? 2. Define Double Linked List? Explain the operations on Double Linked List? 3. Define Circular Linked

More information

Bhakta Kavi Narsinh Mehta University, Junagadh

Bhakta Kavi Narsinh Mehta University, Junagadh Bhakta Kavi Narsinh Mehta University, Junagadh Draft Syllabus for B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1) Effective From June - 2016 B.Sc. (C.S.) (Semester - 1) CS-101:

More information

SECTION 1 DATA AND FILE STRUCTURES LAB MANUAL

SECTION 1 DATA AND FILE STRUCTURES LAB MANUAL SECTION 1 DATA AND FILE STRUCTURES LAB MANUAL Data and File Structures Lab Manual Structure Page No. 1.0 Introduction 5 1.1 Objectives 6 1.2 Arrays 6 1.3 Structures 7 1.4 Linked Lists 7 1.5 Stacks 8 1.6

More information

Standard Version of Starting Out with C++, 4th Edition. Binary Trees. Copyright 2003 Scott/Jones Publishing

Standard Version of Starting Out with C++, 4th Edition. Binary Trees. Copyright 2003 Scott/Jones Publishing Standard Version of Starting Out with C++, 4th Edition Binary Trees Copyright 2003 Scott/Jones Publishing Topics Definition and Application of Binary Trees Binary Search Tree Operations Template Considerations

More information

Lecture: #9-10. Binary Trees

Lecture: #9-10. Binary Trees Lecture: #9-10 Binary Trees Topics 1. Definition and Application of Binary Trees 2. Binary Search Tree Operations 3. Template Considerations for Binary Search Trees 19-2 1. Definition and Application of

More information

1. Course Title (Course Code) Data Structure and Algorithms (2291) 2. Instructor. Muhammad Wannous, Ph.D. 3. Term. Spring Outline and Objectives

1. Course Title (Course Code) Data Structure and Algorithms (2291) 2. Instructor. Muhammad Wannous, Ph.D. 3. Term. Spring Outline and Objectives 1. Course Title (Course Code) Data Structure and Algorithms (2291) 2. Instructor Muhammad Wannous, Ph.D. 3. Term Spring 1 4. Outline and Objectives Good organization of information (Data Structures) and

More information

by Pearson Education, Inc. All Rights Reserved. 2

by Pearson Education, Inc. All Rights Reserved. 2 The program of Figs. 20.16 20.17 creates a Queue class template (Fig. 20.16) through private inheritance (line 9) of the List class template (Fig. 20.4). The Queue has member functions enqueue (lines 13

More information

UTTARAKHAND OPEN UNIVERSITY

UTTARAKHAND OPEN UNIVERSITY MCA Second Semester MCA-05 Computer Organization and Architecture MCA-06 Data Structure through C Language MCA-07 Fundamentals of Database Management System MCA-08 Project I MCA-P2 Practical MCA-05 Computer

More information

Class Test Solution. Which of the following shows the number of disk moves for the six disk towers of Hanoi problem?

Class Test Solution. Which of the following shows the number of disk moves for the six disk towers of Hanoi problem? Class Test Solution What is the postfix form of the infix expression ((+)*C (-E))^(F+G)?. ^-*+C EF+G. ^-*+C E+FG C. -^*+C E+FG. -^*+C EFG+ Which of the following shows the number of disk moves for the

More information

5. (a) Write a C++ function to remove max element form max heap. (b) Write a C++ function to insert an element into min heap.

5. (a) Write a C++ function to remove max element form max heap. (b) Write a C++ function to insert an element into min heap. Set No.1 1. (a) How does a C++ structure differ from a C++ class? (b) What is a class? How does it accomplish the data hiding? (c) Write a C++ program to create a bank account which includes account number,

More information

Trees and Binary Relations. Debdeep Mukhopadhyay IIT Madras

Trees and Binary Relations. Debdeep Mukhopadhyay IIT Madras Trees and Binary Relations Debdeep Mukhopadhyay IIT Madras Outline Tree : definition and its relation with binary relations Properties Expressions: Balancedness Infix, Postfix and Prefix Expression Trees

More information

Data Structures. Lecture 6 : Linked List (Part 1)

Data Structures. Lecture 6 : Linked List (Part 1) 0 Data Structures Lecture 6 : Linked List (Part 1) Dr. Essam Halim Houssein Lecturer, Faculty of Computers and Informatics, Benha University http://bu.edu.eg/staff/esamhalim14 2 If the memory is allocated

More information

MT211 ITC450 A hash function which squares the key and takes three digits from the middle.

MT211 ITC450 A hash function which squares the key and takes three digits from the middle. MT211 ITC450 M@C A pointer variable is avariable whose content is a) Text value b) An address, or memory location Syntax to declare pointed variable a. datetype *indetifier; b. *datatype identifier A list

More information

How do hashes work? Sunday, December 05, :28 PM

How do hashes work? Sunday, December 05, :28 PM Trees Page 1 How do hashes work? 5:28 PM How do Perl hashes work? So far, we've found out that Perl hashes can do most anything. But how do they work? Key to how hashes work: associating a key with a value.

More information

Chapter 20: Binary Trees

Chapter 20: Binary Trees Chapter 20: Binary Trees 20.1 Definition and Application of Binary Trees Definition and Application of Binary Trees Binary tree: a nonlinear linked list in which each node may point to 0, 1, or two other

More information

Unit 1. 5. Write iterative and recursive C functions to find the greatest common divisor of two integers. [6]

Unit 1. 5. Write iterative and recursive C functions to find the greatest common divisor of two integers. [6] Unit 1 1. Write the following statements in C : [4] Print the address of a float variable P. Declare and initialize an array to four characters a,b,c,d. 2. Declare a pointer to a function f which accepts

More information

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1 Data Structure By Ajay Raiyani Yogidham, Kalawad Road, Rajkot. Ph : 572365, 576681 1 Linked List 4 Singly Linked List...4 Doubly Linked List...7 Explain Doubly Linked list: -...7 Circular Singly Linked

More information

Any large information source (data base) can be thought of as a table (with multiple fields), containing information.

Any large information source (data base) can be thought of as a table (with multiple fields), containing information. NOTES ON HASHING Author: Jayakanth Srinivasan jksrini@mit.edu Introduction Any large information source (data base) can be thought of as a table (with multiple fields), containing information. For example:

More information

BCS2B02: OOP Concepts and Data Structures Using C++

BCS2B02: OOP Concepts and Data Structures Using C++ SECOND SEMESTER BCS2B02: OOP Concepts and Data Structures Using C++ Course Number: 10 Contact Hours per Week: 4 (2T + 2P) Number of Credits: 2 Number of Contact Hours: 30 Hrs. Course Evaluation: Internal

More information

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. 1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated

More information

Explores stacks, queues, lists, hash tables, graphs, trees and sorting over data structures.

Explores stacks, queues, lists, hash tables, graphs, trees and sorting over data structures. Course Code : 15ACS04 Course Title : Data Structures Course Structure : Lectures Tutorials Practicals Credits 4 0-4 Course Coordinator : Sri V Sunil Babu Team of Instructors : Mr. G.Murali I. Course Overview

More information

Lecture Notes 15 - Trees CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson

Lecture Notes 15 - Trees CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson Lecture Notes 15 - Trees CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson Reading: Carrano, Chapter 10.1-10.2 Introduction to trees The data structures we have seen so far

More information

Data Structures. Level 6 C30151. www.fetac.ie. Module Descriptor

Data Structures. Level 6 C30151. www.fetac.ie. Module Descriptor The Further Education and Training Awards Council (FETAC) was set up as a statutory body on 11 June 2001 by the Minister for Education and Science. Under the Qualifications (Education & Training) Act,

More information

DATA AND FILE STRUCTURE USING C

DATA AND FILE STRUCTURE USING C Krantiguru Shyamji Krishna Verma Kachchh University Mundra Road BHUJ : 370 001 SYLLABUS ( CBCS ) BCA Semester III : (THREE) DATA AND FILE STRUCTURE USING C Code No : BCA301 Effective from June 2012 Page

More information

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Questions 1 through 25 are worth 2 points each. Choose one best answer for each. Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in

More information

MODULE 3: TREES BASIC TERMINOLOGY

MODULE 3: TREES BASIC TERMINOLOGY MODULE 3: TREES BASIC TERMINOLOGY Trees are very flexible, versatile and powerful non-liner data structure that can be used to represent data items possessing hierarchical relationship between the grand

More information

AS-2342 M.C.A.1 st Semester, Examination-2013 Paper fourth Subject-Data structure with algorithm

AS-2342 M.C.A.1 st Semester, Examination-2013 Paper fourth Subject-Data structure with algorithm AS-2342 M.C.A.1 st Semester, Examination-2013 Paper fourth Subject-Data structure with algorithm Time: Three Hours] [Maximum Marks: 60 Note: attempt all questions. Q. no. 1 is compulsory. Answer any four

More information

INF 2220: algorithms and data structures Series 1

INF 2220: algorithms and data structures Series 1 Universitetet i Oslo Institutt for Informatikk D. Karabeg, I. Yu INF 2220: algorithms and data structures Series 1 Høst 2014 19. 08. 2014 Topic: Function growth & estimation of running time, trees (Exercises

More information

CMSC 132: Object-Oriented Programming II

CMSC 132: Object-Oriented Programming II CMSC 132: Object-Oriented Programming II Linear Data Structures Department of Computer Science University of Maryland, College Park Linear data structures General properties Implementations Array Linked

More information

Algorithms and Data Structures

Algorithms and Data Structures Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2

More information

Model answer for Data Structure using C PART-A

Model answer for Data Structure using C PART-A Model answer for Data Structure using C PART-A 1. a) The best case and wrst case time complexity of binary search is O(1) and O(log 2 n ). b) The following structure is ued to implement a node in a linked

More information

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit Data Structures Page 1 of 24 A.1. Arrays (Vectors) n-element vector start address + ielementsize 0 +1 +2 +3 +4... +n-1 start address continuous memory block static, if size is known at compile time dynamic,

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN ERODE SENGUNTHAR ENGINEERING COLLEGE (Approved by AICTE, New Delhi, Permanently Affiliated to Anna University - Chennai & Accredited by NAAC & National Board of Accreditation (NBA), New Delhi, Accredited

More information

Data Structure using 'C' Hashing

Data Structure using 'C' Hashing Data Structure using 'C' Hashing Department of CSE & IT C.V. Raman College of Engineering Bhubaneswar 1 Introduction and Definition Hash Tables as a Data Structure Choosing a hash Function Truncation Method

More information

City University of Hong Kong Course Syllabus. offered by Department of Electronic Engineering with effect from Semester A in 2015/2016

City University of Hong Kong Course Syllabus. offered by Department of Electronic Engineering with effect from Semester A in 2015/2016 City University of Hong Kong Course Syllabus offered by Department of Electronic Engineering with effect from Semester A in 2015/2016 Part I Course Overview Course Title: Data Structures and Algorithms

More information

MODULE 4: TREES DEFINITION TERMINOLOGY

MODULE 4: TREES DEFINITION TERMINOLOGY MODULE 4: TREES DEFINITION A tree is a finite set of one or more nodes such that There is a specially designated node called root. The remaining nodes are partitioned into n >= 0 disjoint set T1,,Tn, where

More information

Chapter 6. Binary Trees. Data Structures and Algorithms in Java

Chapter 6. Binary Trees. Data Structures and Algorithms in Java Chapter 6 Binary Trees Data Structures and Algorithms in Java Objectives Discuss the following topics: Trees, Binary Trees, and Binary Search Trees Implementing Binary Trees Searching a Binary Search Tree

More information

Harcourt Butler Technological Institute, Kanpur (An Autonomous Institute Affiliated to U. P. Technical University, Lucknow) Revised Syllabus

Harcourt Butler Technological Institute, Kanpur (An Autonomous Institute Affiliated to U. P. Technical University, Lucknow) Revised Syllabus Harcourt Butler Technological Institute, Kanpur- 208002 (An Autonomous Institute Affiliated to U. P. Technical University, Lucknow) Revised Syllabus First Year Master of Computer Applications (Effective

More information

Hi Hsiao-Lung Chan Dept Electrical Engineering Chang Gung University, Taiwan

Hi Hsiao-Lung Chan Dept Electrical Engineering Chang Gung University, Taiwan Trees Hi Hsiao-Lung Chan Dept Electrical Engineering Chang Gung University, Taiwan chanhl@mail.cgu.edu.twcgu Tree node (13) degree of a tree (3) height ht of a tree (4) degree of a node leaf (terminal)

More information

CSCI2100B Data Structures Hashing

CSCI2100B Data Structures Hashing CSCI2100B Data Structures Hashing Irwin King king@cse.cuhk.edu.hk http://www.cse.cuhk.edu.hk/~king Department of Computer Science & Engineering The Chinese University of Hong Kong Introduction Hashing

More information

Advanced Implementation of Tables

Advanced Implementation of Tables Chapter 13 Advanced Implementation of Tables 2011 Pearson Addison-Wesley. All rights reserved 13 A-1 Balanced Search Trees The efficiency of the binary search tree implementation of the ADT table is related

More information

1. Stack overflow & underflow 2. Implementation: partially filled array & linked list 3. Applications: reverse string, backtracking

1. Stack overflow & underflow 2. Implementation: partially filled array & linked list 3. Applications: reverse string, backtracking Review for Test 2 (Chapter 6-10) Chapter 6: Template functions & classes 1) What is the primary purpose of template functions? A. To allow a single function to be used with varying types of arguments B.

More information

Introduction to Systems Programming - COMP 1002, 1402

Introduction to Systems Programming - COMP 1002, 1402 LINKED LISTS Introduction to Systems Programming - COMP 1002, 1402 Outline Linked list Adding and removing data to a link list Linked list search Common Data Structures in C and C++ 3 Linked lists One-way

More information