PES Institute of Technology-BSC QUESTION BANK

Size: px
Start display at page:

Download "PES Institute of Technology-BSC QUESTION BANK"

Transcription

1 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 of a data type.write an ADT for a natural number 2. What is time complexity? Determine the time complexity of an iterative and recursive functions that adds n elements of the array using tabular method 3. Define three asymptotic notations and give the asymptotic representation of function 3n+2 in all the three notations and prove the same from first principle method 4. Define Big Oh notation. Show that 3n+2 = O(n) is correct Explain performance analysis and performance measurement. Write recursive function to implement Binary search 7. Write an recursive function to sum a list of numbers and also show the total step 7 counts for the function. What is recursion? What are various types of recursion? 4 9. What is recursion? Explain types of recursion. Write a C program to search an element in a given array using recursive binary search.. What do you understand by dynamic memory allocation? Explain any three functions that support dynamic allocation? 11. What is an algorithm? Briefly explain the criteria that an algorithm must satisfy. 12. Define a pointer. Write a C function to swap two numbers using pointers What is a pointer and why is it used? 14. Define Pointer. With example explain pointer declaration and accessing data through pointers 15. What are the various memory allocation techniques? Explain how memory can 5 be dynamically allocated using malloc()? 1. Explain the functions supported by C to caary out dynamic memory allocation Differentiate between static memory allocation and dynamic memory allocation. Explain malloc() and realloc(). 1. What are preprocessor directives? Explain any two operations that can be done using preprocessor directives 19. Bring out the differences between structures and unions. 5 UNIT II ARRAYS AND STRUCTURES 20. What is a structure? What are the different ways of declaring a structure? Explain with an example 21. Differentiate between Structure and Union with example 5

2 22. Incorporate a structure to contain details of a human being (name, age, salary 4 and date of birth) with date of birth containing month, day and year. 23. Write a C program with an appropriate structure definition and variable 12 declaration to store information about an employee, using nested structures. Consider the following fields like: ENAME, EMPID, DOJ(Date, Month, Year), Salary(Basic, DA, HRA) What are structures? Explain how the structures are useful by giving various 2+4 examples. 25. What is the difference between int *a and int a[5] and int *[5]? 2. What is sparse matrix? Give ADT sparse matrix and show with a suitable example sparse matrix representation storing as triples. 27. Write a C program to read a sparse matrix of integer values and search this matrix for an element specified by the user. 2. What is a polynomial? What is the degree of the polynomial? Write a function to add two polynomials? 29. How would you represent two sparse polynomials using array of structure and also write a function to add that polynomials and store the result in the same array. 30. What is the degree of the polynomial? Consider the two polynomials A(x) = x and B(x)= x 3 + 3x Show diagrammatically how these two polynomials can be represented in a array. 31. Write ADT for Polynomial. What are different ways of representing a polynomial? Write a program to read, display and add two polynomials 32. What is a sparse matrix? Write a program to search an element in a given sparse matrix. UNIT III STACKS AND QUEUES 33. Define stack. What are the different operations that can be performed on stack? Write a C program to implement all stack operations 34. Explain System stack in detail Write a note on multiple stacks 5 3. Explain how the stack is used in parameter passing Write short notes on dynamic stack representation 5 3. Show the stack after each operation of the following sequence that starts with the empty stack: push(a), push(b), pop, push(c), push(d), pop 39. Define Stack as a data structure and discuss its applications 40. List applications of stacks. Using stack write an algorithm to determine if a given string is palindrome and print suitable message as output. 41. Obtain prefix and postfix expression a. (A+B)*(C+D)$(A+B) b. A+B*C-D/E*H c. (A+B^C^D)*(E+F/D) 42. List the various ways of representing the arithmetic expressions by giving suitable examples 4

3 43. Show the detailed concept of the stack to evaluate the following positive expression 32-5*+1^7+ * 44. Write the prefix and postfix form of the following infix expressions ((A + B) * C -(D-E)) $(F+G) b) (A+B)*(C+D-E)*F 45. Implement stack using static and dynamic memory allocation. Discuss the relative merits of these two implementations 4. Write a program to check whether a given expression is a valid postfix expression or not. If valid evaluate a given postfix expression otherwise display a suitable message. 47. Write an algorithm for converting infix expression to post-fix expression. Trace the algorithm indicating content of stack for expression (a-b)/(c*d)+e 4. What are STACK? Explain operation performed on STACK. Discuss how the stack structure can be used for Tower of Hanoi problem 49. Convert the following infix expression into a postfix expression using stack i) a * (b+c) *d ii) ((a+b) * d + e)/((f+a*d) +c) Show that, how stack operations takes place for the conversion of infix to postfix 7 expression. ((A-(B+C)) *D) $(E+F) 51. Write an algorithm to implement a stack of size N using an array. The elements in the stack are to be integers. The operations to be supported are PUSH, POP and DISPLAY. Take into account the exceptions of Stack overflow and underflow 52. Define queue. What are the different operations that can be performed on queue? Write a C program to implement all queue operations 53. Distinguish between Ordinary queues and Circular queues Write a program to implement a linear queue using arrays. Take into account the exceptions like Queue Full and Queue Empty. 55. Write a C function i) to insert an element at the rear end of a queue ii) to delete an element from the front end of the queue 5. A circular queue has a size of 5 and has 3 elements, 40 and 20, where F=2 and R=4. After inserting 50 and 0, what is value of F and R. Trying to insert 30 at this stage what will happen? Delete 2 elements from the queue and insert 0. Show the sequences of steps with necessary diagrams with the value of F and R UNIT III LINKED LISTS 57. What is a SLL? Write a program to implement stack as a singly linked list 5. What are the advantages and disadvantages of linked lists over arrays? What are different types of linked list? Write a C function to count number of 7 elements present in single linked list. 0. Write a recursive search routine to search for a node in a SLL

4 1. Write an algorithm to concatenate two lists (assume both are existing) 2. Write a C function to a. To count number of nodes using singly linked list b. To concatenate two singly linked list, and then to sort the resultant list c. To reverse direction of singly linked list(as shown below) 3. Write a program to represent a polynomial of single variable using linked list and perform the following functions a. Evaluation of polynomial b. Display the polynomial 4. Define and implement doubly link list 5. Write advantages of doubly linked list over singly linked list. Write C function that will insert a given integer value into an ordered doubly linked list.. What is a single linked list? Explain with an example how a single linked list can 7 be used for sorting a set of N numbers. 7. Write a program to find for a particular node (either the position or info of the 7 node can be given) in a DLL or circular DLL. What are the advantages and disadvantages of doubly linked list? Also give its applications 9. Write a C function to insert and delete a node from the front end in case of 4 doubly linked List. 70. Implement a circular SLL with the header node containing the total no of nodes in the list. The node itself consists of student details like reg no, name, marks etc. 71. What are the advantages of circularly linked list over a linear list? Write a C routine that concatenates two circular lists. 72. Write C functions to perform the following operations: a. Create a circular singly linked list b. Display Circular singly linked list 73. Write a function to insert a node at front and rear end in a circular linked list. Write down sequence of steps to be followed UNIT III STACKS AND QUEUES 74. Define stack. What are the different operations that can be performed on stack? Write a C program to implement all stack operations

5 75. Explain System stack in detail Write a note on multiple stacks Explain how the stack is used in parameter passing 4 7. Write short notes on dynamic stack representation Show the stack after each operation of the following sequence that starts with the empty stack: push(a), push(b), pop, push(c), push(d), pop 0. Define Stack as a data structure and discuss its applications 1. List applications of stacks. Using stack write an algorithm to determine if a given string is palindrome and print suitable message as output. 2. Obtain prefix and postfix expression a. (A+B)*(C+D)$(A+B) b. A+B*C-D/E*H c. (A+B^C^D)*(E+F/D) 3. List the various ways of representing the arithmetic expressions by giving suitable examples 4. Show the detailed concept of the stack to evaluate the following positive expression 32-5*+1^7+ * 5. Write the prefix and postfix form of the following infix expressions ((A + B) * C -(D-E)) $(F+G) b) (A+B)*(C+D-E)*F. Implement stack using static and dynamic memory allocation. Discuss the relative merits of these two implementations 7. Write a program to check whether a given expression is a valid postfix expression or not. If valid evaluate a given postfix expression otherwise display a suitable message.. Write an algorithm for converting infix expression to post-fix expression. Trace the algorithm indicating content of stack for expression (a-b)/(c*d)+e 9. What are STACK? Explain operation performed on STACK. Discuss how the stack structure can be used for Tower of Hanoi problem 90. Convert the following infix expression into a postfix expression using stack i) a * (b+c) *d ii) ((a+b) * d + e)/((f+a*d) +c) Show that, how stack operations takes place for the conversion of infix to postfix 7 expression. ((A-(B+C)) *D) $(E+F) 92. Write an algorithm to implement a stack of size N using an array. The elements in the stack are to be integers. The operations to be supported are PUSH, POP and DISPLAY. Take into account the exceptions of Stack overflow and underflow 93. Define queue. What are the different operations that can be performed on queue? Write a C program to implement all queue operations 94. Distinguish between Ordinary queues and Circular queues Write a program to implement a linear queue using arrays. Take into account the

6 exceptions like Queue Full and Queue Empty. 9. Write a C function i) to insert an element at the rear end of a queue ii) to delete an element from the front end of the queue 97. A circular queue has a size of 5 and has 3 elements, 40 and 20, where F=2 and R=4. After inserting 50 and 0, what is value of F and R. Trying to insert 30 at this stage what will happen? Delete 2 elements from the queue and insert 0. Show the sequences of steps with necessary diagrams with the value of F and R UNIT V & VI TREES I, TREES II and GRAPHS 9. What are the different ways to represent binary trees? Explain in detail. 99. What are the differences between strictly binary tree and complete binary tree 4 0. What is a TREE? Define the following a. Ancestor b. Descendants of node with respect to the TREE 1. Write C functions for following tree traversals 9 i) Inorder ii) Preorder iii) Post order 2. Write and explain with a function, level order tree traversal 3. What is a heap and what are the different types of heap 4. Give examples to show the father, son, descendent and ascendant nodes of a binary tree 5. What are the two conditions under which a binary tree becomes an almost 4 complete binary tree?. Given the following traversals In order: E I C F J B G D K H L A Preorder: A B C E I F J D G H K L Construct a Binary Tree 7.. Explain the different methods of representation of binary trees in "C". 5. Explain threaded binary trees in detail 9. Define the following a. Strict binary tree b. Almost complete binary tree c. Ordered tree d. Right in threaded binary tree 1. Write a C recursive program to find out the height of a binary tree Construct a binary tree for the expression A + (B-C)*(E+F)/G and draw the diagram showing each step Explain one-way and two-way threading of binary trees Implement the recursive tree traversal of in, pre and post order traversals 114. Write an algorithms for deleting node in a binary search tree for all the three cases 115. Write an expression tree for the expression A/B*C*D+E. Give the C function for

7 inorder, preorder, post order traversals and apply the traversal methods to the expression tree and give the result of traversals 11. Write an algorithm for the iterative tree traversal 117. Write an algorithm to traverse the tree using father field 11. Construct a binary tree for the expression: ((7+(-3) * ) ^ 5+4) Define the following terms with appropriate sketches a) Tree b) Directed tree c) Ordered tree d) Binary tree e) Spanning tree 120. Write recursive C routines to traverse a binary tree in different ways. Assume the dynamic node representation of a binary tree 121. Define a tree recursively. Define the following terms with example. Siblings i. Descendants ii. Complete Binary Tree iii. Strictly Binary Tree (Full Binary Tree) 122. What is heap? Explain the different types of heap? Explain the following with an example: i) Forest ii) Graph iii) Winner tree 124. What is a binary search tree? Draw the binary search tree for the following input:14,5,,2,1,20,1,-1, Define ADT of Binary search tree. Write the iterative search function and recursive search function of BST 12. Explain with an example how to convert given forest into binary trees UNIT VII - PRIORITY QUEUES 127. Explain min and max heap with example. 12. Implement Fibonacci heap What is binomial heap? Explain the steps involved in the deletion of min element from a binomial heap Define a max heap. Write a C function to insert an item into max heap Write short notes on: i) Priority queues ii) Leftist trees iii) Fibonacci heaps 132. Briefly explain the following with an example: i) HBLT ii) WBLT 133. What is Fibonacci heap? Give suitable example and give the steps for deletion of node and decrease key of specified node in F-heap Explain Single ended and Double ended Priority Queue Define F-Heap. Explain the operations: Delete and Decrease key 13. Define Pairing Heap. Explain the following operations: getmin, insert, deletemin, meld,delete, decreasekey.

8 UNIT VIII - EFFICIENT BINARY SEARCH TREES 137. What is an AVL tree? Write the algorithm to insert an item in to AVL tree. 13. Explain the different types of rotations of an AVL tree Write short notes on: i) Red-Black tree. ii) Splay trees Describe the following with an example: i) Height-balanced trees. ii) Optimal BST 141. Explain the Red-Black tree. State its properties 142. Explain i) Bottom-Up Splay Trees ii) Top-Down Splay Trees 143. Let h be the height of a red-black tree, let n be the number of internal nodes in the tree and r be the rank of the root then, prove that i) h 2r ii) n 2 r -1. 4

9

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

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

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

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

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

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

DATA STRUCTURES USING C

DATA STRUCTURES USING C 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

More information

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Lab Manual. Advanced Data Structures (Pr): IT-411

Lab Manual. Advanced Data Structures (Pr): IT-411 Lab Manual Advanced Data Structures (Pr): IT-411 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical / program Lab Teacher

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

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

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

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

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

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

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

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

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

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

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

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. 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

Fundamentals of Data Structures Trees Example test questions for the course

Fundamentals of Data Structures Trees Example test questions for the course 2008 November Tree Questions Page 1 of 6 Fundamentals of Data Structures Trees Example test questions for the course These questions or similar questions have been used in tests in previous years. The

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

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

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

Introduction to the Design and Analysis of Algorithms

Introduction to the Design and Analysis of Algorithms Introduction to the Design and Analysis of Algorithms Joaquim Madeira Version 0.1 September 2015 U. Aveiro, September 2015 1 Overview Algorithms and Problem Solving Problem Types Algorithm Design Techniques

More information

Binary Heap Algorithms

Binary Heap Algorithms CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell

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

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

Acharya Nagarjuna University :: B.Sc. - 1 st Year - 2 nd Semester PROGRAMMING IN C UNIT I: Introduction to Algorithms and Programming Languages:

Acharya Nagarjuna University :: B.Sc. - 1 st Year - 2 nd Semester PROGRAMMING IN C UNIT I: Introduction to Algorithms and Programming Languages: B.Sc. - 1 st Year - 2 nd Semester PROGRAMMING IN C UNIT I: Introduction to Algorithms and Programming Languages: Algorithm Key features of Algorithms Some more Algorithms Flow Charts Pseudo code Programming

More information

SET 1B Stacks and Queues

SET 1B Stacks and Queues SET 1B Stacks and Queues 1. Compute the postfix equivalent of the following infix arithmetic expression where a+b*c+d*e f; where represents exponentiation. Assume normal operator precedence. 2. Suppose

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

Example: The following figure illustrates a stack, which can accommodate maximum of 10 elements: (Simple representation of a stack)

Example: The following figure illustrates a stack, which can accommodate maximum of 10 elements: (Simple representation of a stack) M5.1: Introduction: A stack is a non-primitive linear data structure. A stack, also called a Last-In-First- Out (LIFO) system, is a linear list in which insertion and deletion can take place only at one

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

PESIT Bangalore South Campus

PESIT Bangalore South Campus PESIT Bangalore South Campus Hosur road, km before Electronic City, Bengaluru -00 Department of Information Science and Engineering Scheme For Internal Assessment Test 3 Subject & Code: Data Structures

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

Abstract Data Types (ADTs) List ADT Data structures A data structure is a mathematical or logical way of organizing data in the memory that consider not only the items stored but also the relationship

More information

Assignment for Even Semester of PGDCA/M.Sc. Computer Science

Assignment for Even Semester of PGDCA/M.Sc. Computer Science Assignment for Even Semester of PGDCA/M.Sc. Computer Science (Through Distance Education) For session 2015-2016 Directorate of Distance Education Guru Jambeshwar University of Science & Technology, Hissar

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

Leftist heap: is a binary tree with the normal heap ordering property, but the tree is not balanced. In fact it attempts to be very unbalanced!

Leftist heap: is a binary tree with the normal heap ordering property, but the tree is not balanced. In fact it attempts to be very unbalanced! Leftist heap: is a binary tree with the normal heap ordering property, but the tree is not balanced. In fact it attempts to be very unbalanced! Definition: the null path length npl(x) of node x is the

More information

True False (1 points each) (Circle the correct answer)

True False (1 points each) (Circle the correct answer) CS 2420 Exam 2 Fill in the blank (1 point each blank): 1. probing is simple to implement, but typically results in primary, which causes performance to degrade rapidly. 2. probing still causes secondary

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

CS 2321 Data Structures and Algorithms. Trees. Dr. Mahdi Khemakhem

CS 2321 Data Structures and Algorithms. Trees. Dr. Mahdi Khemakhem CS 2321 Data Structures and Algorithms Trees Dr. Mahdi Khemakhem Outlines 1. Definitions and Terminologies 2. Binary Trees 3. Binary Search Trees 4. AVL-Trees CS 2321: D.S.A (-Trees-) 2 1. Defintions and

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

CS6301-Programming and Data structure II. II Year III Semester

CS6301-Programming and Data structure II. II Year III Semester GOJAN SCHOOL OF BUSINESS AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS6301-Programming and Data structure II II Year III Semester UNIT-I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS

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

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

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

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

CS2 Final Study Guide

CS2 Final Study Guide CS2 Final Study Guide - Know how to write an assignment operator, copy constructor and destructor for a simple class that has dynamically allocated memory. Trees 1. Define the following terms o binary

More information

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010 Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010 Problem 1. In each of the following question, please specify if the statement

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

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

Chapter 6 Priority Queues

Chapter 6 Priority Queues Chapter 6 Priority Queues Introduction Want to delete from queue according to priority. o Max priority queue delete the greatest. o Min priority queue delete the least. Insert normally, but delete based

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

Priority Queues (Heaps)

Priority Queues (Heaps) Priority Queues (Heaps) CptS 223 Advanced Data Structures Larry Holder School of Electrical Engineering and Computer Science Washington State University 1 Motivation Queues are a standard mechanism for

More information

SET 1B Stacks and Queues

SET 1B Stacks and Queues SET 1B Stacks and Queues 1. Compute the postfix equivalent of the following infix arithmetic expression where a+b*c+d*e f; where represents exponentiation. Assume normal operator precedence. Infix expression

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

Recursive Algorithms. Recursive procedure. Recurrence Equation. Data Structures

Recursive Algorithms. Recursive procedure. Recurrence Equation. Data Structures Recursive Algorithms Recursive procedure In this technique, we define a procedure that is allowed to make calls to itself as a subroutine Those calls are meant to solve sub-problems of smaller size Recursive

More information

Data Structure with C

Data Structure with C Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which

More information

Introduction: Practical daily life: In computer world:

Introduction: Practical daily life: In computer world: Need of stack In the linear array, one can insert and delete elements at any place in the list-at the beginning, at the end or in the middle. There are certain situations in computer science when one wants

More information

DATA STRUCTURES LECTURE NOTES INFO1105

DATA STRUCTURES LECTURE NOTES INFO1105 DATA STRUCTURES LECTURE NOTES INFO1105 Work Street Work City, Work State Work ZIP, T Work Phone, F Work Fax Phone, M Mobile Phone, E Work Email, Work URL 2015 Julian O. TABLE OF CONTENTS WEEK 1 Data Structures

More information

KALASALINGAM UNIVERSITY

KALASALINGAM UNIVERSITY KALASALINGAM UNIVERSITY (Kalasalingam Academy of Research and Education) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LAB MANUAL DATA STRUCTURES LABORATORY (CSE 295) 1 INTRODUCTION This manual is organized

More information

Data Structures and Algorithms in C++

Data Structures and Algorithms in C++ Data Structures and Algorithms in C++ Second Edition Michael T. Goodrich Department of Computer Science University of California, Irvine Roberto Tamassia Department of Computer Science Brown University

More information

Chapter 6 Priority Queues

Chapter 6 Priority Queues Chapter 6 Priority Queues Introduction Want to delete from queue according to priority. o Max priority queue delete the greatest. o Min priority queue delete the least. Insert normally, but delete based

More information

MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS) DEPARTMENT OF CSE SUBJECT: DATA STRUCTURES THROUGH C

MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS) DEPARTMENT OF CSE SUBJECT: DATA STRUCTURES THROUGH C MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS) DEPARTMENT OF CSE SUBJECT: DATA STRUCTURES THROUGH C Year: I B.Tech(ECE&EEE)-II semester(mr15) MID-II EXAM MODULE: III 1. Which of the following is not a type

More information

Algorithms and Data Structures

Algorithms and Data Structures Lesson 2: stacks and queues Luciano Bononi http://www.cs.unibo.it/~bononi/ (slide credits: these slides are a revised version of slides created by Dr. Gabriele D Angelo) International

More information

B-Trees. CMSC 420: Lecture 9

B-Trees. CMSC 420: Lecture 9 B-Trees CMSC 420: Lecture 9 Another way to achieve balance Height of a perfect binary tree of n nodes is O(log n). Idea: Force the tree to be perfect. - Problem: can t have an arbitrary # of nodes. - Perfect

More information

The DSW Algorithm. Data Structures and Algorithms in Java 1

The DSW Algorithm. Data Structures and Algorithms in Java 1 The DSW Algorithm The building block for tree transformations in this algorithm is the rotation There are two types of rotation, left and right, which are symmetrical to one another rotateright (Gr, Par,

More information

Priority Queues. Binary heaper Leftist heaper Binomial heaps Fibonacci heaps. Priority queues are important in, among other things, operating systems

Priority Queues. Binary heaper Leftist heaper Binomial heaps Fibonacci heaps. Priority queues are important in, among other things, operating systems Priority Queues Binary heaper Leftist heaper Binomial heaps Fibonacci heaps Priority queues are important in, among other things, operating systems (process control i multitasking systems), search algorithms

More information

Contents. 1. RAM Model Lists Preface... v. Acknowledgements... vi

Contents. 1. RAM Model Lists Preface... v. Acknowledgements... vi Contents Preface... v Acknowledgements... vi 1. RAM Model... 1 Introduction...1 Pseudo-Code...4 Example: n! Pseudo-Code Versus Machine Code...5 Motivation for Asymptotic Time Complexity...6 Analyzing Algorithms

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

W4231: Analysis of Algorithms

W4231: Analysis of Algorithms W4231: Analysis of Algorithms 10/7/1999 Amortized Analysis of Data Structures Main Idea of Amortized Analysis Suppose you have a data structure such that every time you do a sequence of n operations starting

More information

Lab Manual. Algorithms Design (Pr) COT-311

Lab Manual. Algorithms Design (Pr) COT-311 Lab Manual Algorithms Design (Pr) COT-311 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical / program Lab Teacher forms groups

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

Lab Manual. Data Structures (Pr): COT-213 Data Structures (P): IT-215

Lab Manual. Data Structures (Pr): COT-213 Data Structures (P): IT-215 Lab Manual Data Structures (Pr): COT-213 Data Structures (P): IT-215 !" #$%&'() * +, -. 951/6201617535973417*37311 235678976: ;7A

More information

OXFORD ENGINEERING COLLEGE (NAAC ACCREDITED WITH B GRADE) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS

OXFORD ENGINEERING COLLEGE (NAAC ACCREDITED WITH B GRADE) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS OXFORD ENGINEERING COLLEGE (NAAC ACCREDITED WITH B GRADE) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS YEAR/SEM: II/IV SUB.CODE: CS6301 STAFF NAME: S.RAJESWARI SUB.NAME: Programming and

More information

CSE 373 Sample Midterm #1 (closed book, closed notes, calculators o.k.)

CSE 373 Sample Midterm #1 (closed book, closed notes, calculators o.k.) Name: KEY Email address: CSE 373 Sample Midterm #1 (closed book, closed notes, calculators o.k.) Instructions Read the directions for each question carefully before answering. We will give partial credit

More information

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92. Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure

More information