PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore
|
|
- Timothy Cain
- 7 years ago
- Views:
Transcription
1 PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore Department of MCA COURSE INFORMATION SHEET 1. GENERAL INFORMATION: Data Structures Using C (16MCA11) Academic Year: 2016 Semester: I Title Code Duration (hrs) Lectures 4 Hrs/Week 16MCA11 Total 52 Hrs Data Structures Using C 2. COURSE PRE-REQUISITE: 3. COURSE OBJECTIVE: Student should know the basics of C concepts and pointers This course provides the students with a comprehensive introduction to how the abstractions can be made concrete by using a programming language as it contains the control structures necessary to make programs readable and allows basic data structures such as stacks, linked lists and trees to be implemented in a variety of ways. 4. COURSE OUTCOMES: A student who successfully completes the course will be able to: Understand basics of C programming language Acquire knowledge of o Various types of data structures, operations and algorithms o Sorting and searching operations Analyze the performance of - Stack, Queue, Lists, Trees, Hashing, Searching and Sorting techniques Implement all the applications of Data structures in a high-level language Design and apply appropriate data structures for solving computing problems.
2 5. FACULTY DETAILS: Faculty Name: Ms.Sujatha K Department : MCA Room Number: 515 Phone Number: Mail-id : sujathak@pes.edu Contact Hours : College Hours 6. VENUE AND HOURS/WEEK: All lectures will normally be held in 603, 6 th Floor. Lecture Hours/week: 4Hrs All the laboratory sessions will be held in Room 500 & 506, 5 th Floor. Laboratory Hours/week: 2Hrs 7. MODULE MAP: Class Theme Topics to be covered 1 Introduction to C 2 Introduction to C 3 Input and Output Statements 4 Module 1 Control Statements: if, else-if, Switch Control Structures: while, for, do-while, break 5 And continue 6 Overview of C Functions: Categories of functions 7 Call-by-value and call-by-reference 8 Arrays: Single dimension and two dimensional 9 Multi-dimensional arrays, passing arrays to Functions 10 Passing strings to functions 11 Pointer Expression, pointer as function arguments 12 Functions returning pointers, pointers to functions 13 Module 2 Structures: declaring and using structure types Classification of data structures: Primitive and 14 Pointers, Non-primitive, Linear and nonlinear data structures, structure operations 15 classification of ADT: Array as ADT operations (Insert and data structures Delete) 16 and String ADT: Array as ADT operations (Search and Sort) 17 String Definition, Representation 18 String as ADT: Insert,Delete 19 String as ADT: Concatenate, Comparing, Substring 20 Examples on Structures and Functions 21 Module 3 Primitive and Non-Primitive, Linear and NonLinear data structure operations 22 Classification of Stack: Definition, Representation, Stack as Data Structures ADT, Operations of Stack % of portions covered Chapter Cumulative Wise
3 23 Applications: Polish and reverse polish expr, Infix to postfix conversion 24 Evaluation of Postfix expression 25 Infix to prefix, Postfix to Infix conversion 26 Recursion: Factorial, GCD, Fibonacci, Tower of 27 Hanoi Queue definition, representation, ADT, Operations 28 Circular queue 29 Priority Queue 30 Double ended queue:applications of queues Application of Linked Lists: Stacks, Queues 39 Application of Linked Lists: Double-ended queues, Priority Queues 40 Sparse Matrix and Polynomials using Lists, Trees and BST 41 Trees: Definition, Terminologies 42 Array and Linked Representation of binary trees 43 Traversal Methods Inorder, Preorder and Postorder 44 Unit 5 Binary Search Trees Creation, Insertion, Deletion 45 Binary Search Trees Traversal and Searching Trees, Sorting and Searching, Hashing 46 Sorting: Bubble sort, Insertion Sort 47 Sorting: Selection sort, quick sort 48 Linear Search and Binary Search Module 4 Linked List Linked List: Limitations of array implementation, Static and dynamic memory allocation Memory management functions: definition, representation, operations: getnode() and freenode() operations Singly Linked List: Linked list as a data Structure, Inserting and removing nodes from a list, Linked implementations of stacks Example of list operations such as insert and delete an element before a key element, header nodes Circular Linked List: Inserting, deleting and searching elements in a list Doubly Linked List: Inserting and Deleting nodes, Queue as doubly linked list Doubly Linked List: Insert into position, delete an specified element Hashing: Hash table organizations, hashing functions Static and Dynamic hashing, Collision- Resolution techniques, Programming examples
4 8. RECOMMENDED BOOKS/JOURNALS/WEBSITES Text Books: 1) Programming in ANSI C, Balaguruswamy, McGraw Hill Education 2) Data Structures Using C and C++ by Yedidyah Langsam and Moshe J. Augenstein and Aaron M Tenanbanum, 2nd Edition, Pearson Education Asia, ) Introduction to Data Structure and Algorithms with C++ by Glenn W. Rowe Reference Books: 1) Principles of Data Structures using C & C++ by Vinu V. Das, New Age International, ) Data Structures Using C, Balaguruswamy:, McGraw Hill Education 9 THEORY ASSESSMENT WRITTEN EXAMINATION Paper Structure No. Of Questions 10 Questions No. of questions to be answered 5 IA Marks 20 Paper Duration 3 Hrs Total Marks 80 Pass Marks QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE Usage of structures, unions - a conventional tool for handling a group of logically related items. Unions - sharing of memory. Pointers - the real power of C. 1. What are structures? 2 2. Explain how the structures are useful by giving various examples Bring out the differences between structures and unions What is a pointer and why is it used? 4 5. With an example explain how bit fields can be defined in C What are enumerated data types? Explain with an example 4 7. List the various kinds of pre-processor statements What is the difference between macros and inline functions? 4
5 9. Explain the differences between malloc() and calloc() functions used for memory allocation What is type casting? Give an example What are register variables? Where are they used? 4* 12. Why Macro is Need? Explain the conditional Macros with example. 5* 13. With the help of suitable example explain command line arguments 5* 14. Write a short note on Enumeration. 6* 15. Explain the storage classes What are macros? List few macros used in C What is union? How is it different from structure? With suitable example show how union is declared and used in C? 6* 18. What is a Macro definition? Write a C program to print the cube of a given number using a Macro definition. 6* 19. What do you understand by dynamic memory allocation? Explain any three functions that support dynamic allocation? 6* 20. What are bit wise operators? Give example for each operator Write a program to copy contents of a file to other using command line arguments Write a program to merge the contents of a file to other using command line arguments What is the difference between macros and inline functions? What are command line arguments? Write a C program to copy contents of a file to another file. 8* 25. What are the command line arguments? Write a C program to accept the file name and text through command line arguments? Create a file with text and print the text on the screen 8* 26. Show the output of the following assuming a = 4, b = 3, c = 10 a) d = a & b b) d = a/b c) d = a^b d) d = ~c e) d = a >> 2 f) d = a << 2 9* 27. What are files? Create a file called sem.txt to store semester performances of all branches. Also display the semester and the branch, which has performed the best Create a file for storing employee database. To this file include operations to add new employees, delete employees and search for a particular employee Explain the various access modes used for files in C Write a C program to copy the contents of one file into another 10* 31. Explain the bit wise operators with examples used in C. 10* 32. What are Macros? Explain with an example. 10*
6 33. Explain call by value and call by reference. Give two examples. Define formal and actual parameters. 10* 34. What are pre-processor directives? Explain any two operations that can be done using preprocessor directives. 10* 35. Create a structure pointed by a pointer variable and allocate memory using malloc() and calloc() separately. Execute the code and note your observations STACK OBJECTIVE: The most important concept in data structures. To study the prominent role in the area programming is stack. To expertise into a concrete and valuable tool in problem solving. 36 Define stack. Explain the implementation of various stack operations using structures Define stack. Explain the implementation of various stack operations using singly linked list Define stack. Explain implementation of various stack operations using doubly linked list Explain how the stack is used in parameter passing. 4* 40 Write the prefix and postfix form of the following infix expressions a) ((A + B) * C - (D-E)) $(F+G) b) (A+B)*(C+D-E)*F 4 41 Write a C function to convert a valid arithmetic infix expression into its equivalent postfix expression. Stack implementation is to be assumed 4* 43 Show the detailed concept of the stack to evaluate the following positive expression 632-5*+1^7+ * 4 44 Write short notes on dynamic stack representation. 5* 45 Show the detailed contents of the stack and trace of the algorithm to evaluate the given postfix expression 123+*321-+* 5* 46 What is a stack? How it can be represented in "C" using arrays? 6* 47 What is a stack? Give examples to show the operations of stack Define Stack as a data structure and discuss its applications 6* 49 Obtain prefix and postfix expression (A+B)*(C+D)$(A+B) A+B*C-D/E*H
7 (A+B^C^D)*(E+F/D) 6* 50 What is stack? List the applications of stack. Write a C function to insert an element on the top of stack. 6* 51 Implement the stack using arrays List the various ways of representing the arithmetic expressions by giving suitable examples 8 53 Show the detailed contents of the stack for given postfix expression to evaluate / + * 2 $ * 54. List applications of stack. Using stack write an algorithm to determine if a given string is palindrome and print suitable message as output. 10* 55. Implement stack using static and dynamic memory allocation. Discuss the relative merits of these two implementations. 10* 56. 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 a program to check whether a given expression is a valid prefix expression or not. If valid evaluate a given prefix expression otherwise display a suitable message Write an algorithm to convert a given infix expression into postfix expression Write an algorithm to convert a given infix expression into prefix expression 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. 10* 61 Show that, how stack operations takes place for the conversion of infix to postfix expression. ((A-(B+C)) *D) $(E+F) 10* 62 Convert the following infix expression into a postfix expression (((A/(B*C))+(D*E))-(A*C)) A$B*C-D+E/F/(G+H) 63 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. 64 What is STACK? Explain operation performed on STACK. Discuss how the stack structure can be used for Tower of Hanoi problem. RECURSION OBJECTIVE: Recursion the most powerful and one of the best programming tools of data structures. Advantages and disadvantages of the same.
8 Applications. 65 What is recursion? 2 66 What is a recursive definition? Indicate its properties? 4* 67 What is recursion? Give the properties of a recursive definition of an algorithm. What are its advantages? 5* 68 What is a recursion? Compare the recursive programs with iterative programs. 6* 69 Write a note on Efficiency of Recursion. 6* 70 Write a "C" recursive program to solve the tower of Hanoi problem. Give the trace for 3 disks. 8* 71 What is recursion? Explain with an example 8* 72 Bring out the differences between recursion and iteration Write a program to find GCD of 2 nos. using iterative and recursive techniques 8 74 Write a program to find the following using recursion: i) Factorial of a given number ii) Fibonacci series up to a given number 8 75 Write a program to solve the towers of Hanoi problem 8 76 Define recursion. Write a recursive program to find the GCD of two numbers. 8* 77 Write recursive c routines i) For computing the binomial coefficient of k term of an n degree polynomial ii) That accepts a non negative decimal integer as a parameter and writes out Its binary representation. 8+8* 78 What is recursion? Discuss an example which can be represented both recursively and iteratively. 8* 79 Write recursive function for: i) Fibonacci series for nth number ii) Printing number in reverse order (6+6)* 80 Write a recursive C function to find the n Fibonacci number. Explain with an example 10* QUEUES AND LISTS OBJECTIVE: a. QUEUES: To make a considerable exhaustive study of yet another data structure QUEUE. To study various forms of implementation techniques of the Queues and their different types.
9 To study the applications. b. LISTS: To study exhaustive about lists viz. singly linked list, doubly linked list, circular list, circular doubled linked list, their implementation techniques and applications. QUEUES 81 Distinguish between Ordinary queues and Circular queues. 4* 82 What are the advantages and disadvantages of linked lists over arrays? 4* 83 Define Priority queues and explain. 4* 84 Write a routine to insert an element in a ordinary queue. 8* 85 Write a note on a Priority queues. 8* 86 Write a program to implement a linear queue using arrays Write a program to implement a circular queue using arrays Write a program to implement a double-ended queue using arrays A circular queue has a size of 5 and has 3 elements 10,40 and 20,where F=2 and R=4. After inserting 50 and 60,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 100. Show the sequences of steps with necessary diagrams with the value of F and R. 8* 90 Write a C Program to perform the following operations on a queue Insert Delete Display 8* 91 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 10* 92 What is circular queue? Write C program to implement circular queue using arrays with operations of INSERT (), DELETE () and DISPLAY (). 10* LISTS 93 Understanding list operations like concatenation, searching for a node etc Understanding the array implementation of list 8 95 What is a SLL? Write a program to implement stack as a singly linked list Write a program to create an on ordered link list. 8
10 97 Write an algorithm to find whether a given list is ordered or not Write a recursive search routine to search for a node in a SLL Write a program to find for a particular node (either the position or info of the node can be given) in a SLL Write an algorithm to concatenate two lists (assume both are existing) What do you understand by a linked list? Write a C function SEARCH (F, X) that accepts a printer P to a list of integers and an integer X, and returns a pointer to a node containing X, if it exists, and the NULL pointer otherwise. 8* 102 What is a single linked list? Explain with an example how a single linked list can be used for sorting a set of N numbers. 8* 103 What are different types of linked list? Write a C function to count number or elements present in single linked list. 10* 104 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. 10* 105 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) Start Start 12* 106 Explain merging of two lists which have been represented as i) Array ii) Linked list 12* 107 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 12* DOUBLY LINKED LIST 108 Knowing the doubly linked list definition and its implementation Write a program to find for a particular node (either the position or info of the node can be given) in a DLL circular What are the advantages and disadvantages of doubly linked list? Also give its applications.
11 6* 111 Write a C function to insert and delete a node from the front end in case of doubly linked list. 8* CIRCULAR LIST 112 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. 6 A B C D D C B A 113 What are the advantages of circularly linked list over a linear list? Write a c routine that concatenates two circular lists. 6* 114 Write C functions to perform the following operations: a. Create a circular single linked list b. Display Circular single linked list 8* TREES OBJECTIVE: To study exhaustively regarding a tree, types of trees and focus only on BST (Binary search tree). To study the implementation of BST. About applications. 115 What is binary tree? What are the differences between strictly binary tree and complete binary tree What are the two conditions under which a binary tree becomes an almost complete binary tree? Discuss the applications of trees 4* 119 Explain with suitable example the following traversals of a tree i) Preorder and ii) In order 4* 120 Give examples to show the father, son, and descendent and ascendant nodes of a 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 6*
12 122 What is a TREE? Define the following a. Ancestor b. Descendants of node with respect to the TREE 6* 123 Explain various type of tree traversal with simple example. 6* 124 Write C functions for following tree traversals i) Inorder ii) Preorder iii) Post order 6* 125 What is binary search tree? Create a BST Explain the different methods of representation of binary trees in "C". 8* 127 Write recursive C routines to traverse a binary tree in different ways. Assume the dynamic node representation of a binary tree 8* 128 Define the following a. Strict binary tree b. Almost complete binary tree c. Ordered tree d. Right in threaded binary tree 8* 129 Construct a binary tree for the expression A + ( B-C)*(E+F)/G and draw the diagram showing each step. 8* 130 Explain one-way and two-way threading of binary trees 8* 131 Implement the sequential representation of a binary search tree Write an algorithm to traverse the tree using father field List the various tree traversal techniques giving examples Implement the recursive tree traversal of in, pre and post order traversals Write an algorithm for the iterative tree traversal What is a threaded binary tree? Implement the in order threaded binary tree Define the following terms with appropriate sketches a) Tree b) Directed tree c) Ordered tree d) Binary tree e) Spanning tree Explain the different methods of binary tree representation 10* 140 Write an output after traversing of a given tree by i) in order ii) Preorder traversing methods 10*
13 141 Write an algorithms for deleting node in a binary search tree for all the three cases 142 Write a "C" program to I) Create; and ii) traverse a binary tree in three orders.
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 informationPES 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 informationDATA 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 information1) 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 informationKrishna 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 informationGUJARAT 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 informationData 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 informationUnit 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 informationBCS2B02: 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 informationData 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 informationKITES TECHNOLOGY COURSE MODULE (C, C++, DS)
KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL
More informationData 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 information1. 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 information5. 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 informationDEPARTMENT 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 informationModule 2 Stacks and Queues: Abstract Data Types
Module 2 Stacks and Queues: Abstract Data Types A stack is one of the most important and useful non-primitive linear data structure in computer science. It is an ordered collection of items into which
More informationPART-A Questions. 2. How does an enumerated statement differ from a typedef statement?
1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members
More informationSyllabus for Computer Science. Proposed scheme for B.Sc Programme under Choice Based Credit System
Syllabus for Computer Science Proposed scheme for B.Sc Programme under Choice Based Credit System SEMESTER - I Code Course Title Course Type HPW Credits BS106 SEMESTER -I I BS 206 SEMESTER -III BS 301
More informationBangalore University B.Sc Computer Science Syllabus ( Semester System)
Bangalore University B.Sc Computer Science Syllabus ( Semester System) First Semester CSIT1: Computer Fundamentals and C Programming CSIP1: C Programming Lab Second Semester CSIIT1: Data Structures and
More informationData 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 informationAnalysis of a Search Algorithm
CSE 326 Lecture 4: Lists and Stacks 1. Agfgd 2. Dgsdsfd 3. Hdffdsf 4. Sdfgsfdg 5. Tefsdgass We will review: Analysis: Searching a sorted array (from last time) List ADT: Insert, Delete, Find, First, Kth,
More information2) What is the structure of an organization? Explain how IT support at different organizational levels.
(PGDIT 01) Paper - I : BASICS OF INFORMATION TECHNOLOGY 1) What is an information technology? Why you need to know about IT. 2) What is the structure of an organization? Explain how IT support at different
More informationQuestions 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 informationAbstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types
EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that
More informationObjected oriented Programming: C++ Unit 1 1. Introduction 1.1. Introduction to Object Oriented Programming. 1.2. C++ fundamentals.
Gujarat University Choice Based Credit System (CBCS) Syllabus for B. Sc. Semester III (Computer Science) COM 201: DATA STRUCTURE USING C++ (Theory) Hours: 4 /week Credits: 4 Objected oriented Programming:
More informationALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical
More informationLab 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 informationAtmiya 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 informationAP 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 informationUniversity of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015)
University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015) S. Y. B. Sc. (Computer Science) No Paper Title: Semester I Title:
More informationB.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011
NEW Detailed Syllabus of B.Sc.(Computer Science) and B.Sc.(IT) Effective From July 2011 SEMESTER SYSTEM Scheme & Syllabus for B.Sc. (CS) Pass and Hons. Course Effective from July 2011 and onwards CLASS
More informationJava 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 informationData Structures Using C++ 2E. Chapter 5 Linked Lists
Data Structures Using C++ 2E Chapter 5 Linked Lists Doubly Linked Lists Traversed in either direction Typical operations Initialize the list Destroy the list Determine if list empty Search list for a given
More informationOrdered Lists and Binary Trees
Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:
More informationMAX = 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 informationI PUC - Computer Science. Practical s Syllabus. Contents
I PUC - Computer Science Practical s Syllabus Contents Topics 1 Overview Of a Computer 1.1 Introduction 1.2 Functional Components of a computer (Working of each unit) 1.3 Evolution Of Computers 1.4 Generations
More informationExercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013
Exercises Software Development I 11 Recursion, Binary (Search) Trees Towers of Hanoi // Tree Traversal January 16, 2013 Software Development I Winter term 2012/2013 Institute for Pervasive Computing Johannes
More informationGovt. Holkar Science College, Indore Department of Computer Science B.Sc. Computer Science
Govt. Holkar Science College, Indore Department of Computer Science B.Sc. Computer Science Session- 2014-2017 (Effective from July 2014 session for 2014-16 batch onwards) Marks Distributions B.Sc. I Semester
More informationBinary 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 informationThe following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).
CHAPTER 5 The Tree Data Model There are many situations in which information has a hierarchical or nested structure like that found in family trees or organization charts. The abstraction that models hierarchical
More informationBinary Search Trees CMPSC 122
Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than
More informationSample Questions Csci 1112 A. Bellaachia
Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k
More informationData Structures and Algorithms
Data Structures and Algorithms CS245-2016S-06 Binary Search Trees David Galles Department of Computer Science University of San Francisco 06-0: Ordered List ADT Operations: Insert an element in the list
More informationTREE BASIC TERMINOLOGIES
TREE 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 father and his children and
More informationCOMPUTER SCIENCE. Paper 1 (THEORY)
COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------
More informationLecture 12 Doubly Linked Lists (with Recursion)
Lecture 12 Doubly Linked Lists (with Recursion) In this lecture Introduction to Doubly linked lists What is recursion? Designing a node of a DLL Recursion and Linked Lists o Finding a node in a LL (recursively)
More informationCSE 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 informationIntroduction to Data Structures
Introduction to Data Structures Albert Gural October 28, 2011 1 Introduction When trying to convert from an algorithm to the actual code, one important aspect to consider is how to store and manipulate
More information1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)
Chapter 7 Data Structures for Computer Graphics (This chapter was written for programmers - option in lecture course) Any computer model of an Object must comprise three different types of entities: 1.
More informationAlgorithms 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 informationHome 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 informationChapter 3: Restricted Structures Page 1
Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both
More informationML for the Working Programmer
ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming
More informationLecture 1: Data Storage & Index
Lecture 1: Data Storage & Index R&G Chapter 8-11 Concurrency control Query Execution and Optimization Relational Operators File & Access Methods Buffer Management Disk Space Management Recovery Manager
More informationData Structures UNIT III. Model Question Answer
Data Structures UNIT III Model Question Answer Q.1. Define Stack? What are the different primitive operations on Stack? Ans: Stack: A stack is a linear structure in which items may be added or removed
More informationQuiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s
Quiz 4 Solutions Q1: What value does function mystery return when called with a value of 4? int mystery ( int number ) { if ( number
More informationThe Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!
The Tower of Hanoi Recursion Solution recursion recursion recursion Recursive Thinking: ignore everything but the bottom disk. 1 2 Recursive Function Time Complexity Hanoi (n, src, dest, temp): If (n >
More informationCHAPTER 4 ESSENTIAL DATA STRUCTRURES
CHAPTER 4 ESSENTIAL DATA STRUCTURES 72 CHAPTER 4 ESSENTIAL DATA STRUCTRURES In every algorithm, there is a need to store data. Ranging from storing a single value in a single variable, to more complex
More informationIntroduction to Programming System Design. CSCI 455x (4 Units)
Introduction to Programming System Design CSCI 455x (4 Units) Description This course covers programming in Java and C++. Topics include review of basic programming concepts such as control structures,
More informationA single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc
Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc
More informationBinary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R
Binary Search Trees A Generic Tree Nodes in a binary search tree ( B-S-T) are of the form P parent Key A Satellite data L R B C D E F G H I J The B-S-T has a root node which is the only node whose parent
More informationG. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session 2006-2007 DEPARTMENT CSE Semester IV SUBJECT DSPD
G. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session 2006-2007 DEPARTMENT CSE Semester IV SUBJECT DSPD LIST OF EXPERIMENTS 1.Make a database. The record tag,tstudent consists of these fields: Name[20],RollNo.[5],Address[40],Phone[12],UT-1[2,from1
More informationCommon Data Structures
Data Structures 1 Common Data Structures Arrays (single and multiple dimensional) Linked Lists Stacks Queues Trees Graphs You should already be familiar with arrays, so they will not be discussed. Trees
More informationStack & Queue. Darshan Institute of Engineering & Technology. Explain Array in detail. Row major matrix No of Columns = m = u2 b2 + 1
Stack & Queue Explain Array in detail One Dimensional Array Simplest data structure that makes use of computed address to locate its elements is the onedimensional array or vector; number of memory locations
More informationTo My Parents -Laxmi and Modaiah. To My Family Members. To My Friends. To IIT Bombay. To All Hard Workers
To My Parents -Laxmi and Modaiah To My Family Members To My Friends To IIT Bombay To All Hard Workers Copyright 2010 by CareerMonk.com All rights reserved. Designed by Narasimha Karumanchi Printed in
More informationScheme & Syllabus. B.Sc. (IT) I st to VI th Semester. w.e.f. July 2011 (2011-2014 Batch onwards) Devi Ahilya Vishwavidyalaya, Indore(M.P.
Scheme & Syllabus of B.Sc. (IT) I st to VI th Semester w.e.f. July 2011 (2011-2014 Batch onwards) Devi Ahilya Vishwavidyalaya, Indore(M.P.),452001 Proposed Syllabus & Scheme for B. Sc. (IT) SEMESTER SYSTEM
More informationUnordered Linked Lists
Unordered Linked Lists Derive class unorderedlinkedlist from the abstract class linkedlisttype Implement the operations search, insertfirst, insertlast, deletenode See code on page 292 Defines an unordered
More informationStacks. Linear data structures
Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations
More informationData Structures and Data Manipulation
Data Structures and Data Manipulation What the Specification Says: Explain how static data structures may be used to implement dynamic data structures; Describe algorithms for the insertion, retrieval
More informationBinary Search Trees (BST)
Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search
More informationCourse: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1
Definition Course: Programming II - Abstract Data Types The ADT Stack The ADT Stack is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit insertions
More informationGlossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
More informationChapter 13. Disk Storage, Basic File Structures, and Hashing
Chapter 13 Disk Storage, Basic File Structures, and Hashing Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and Extendible Hashing
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK A REVIEW ON THE USAGE OF OLD AND NEW DATA STRUCTURE ARRAYS, LINKED LIST, STACK,
More informationBinary Trees and Huffman Encoding Binary Search Trees
Binary Trees and Huffman Encoding Binary Search Trees Computer Science E119 Harvard Extension School Fall 2012 David G. Sullivan, Ph.D. Motivation: Maintaining a Sorted Collection of Data A data dictionary
More informationLecture 11 Doubly Linked Lists & Array of Linked Lists. Doubly Linked Lists
Lecture 11 Doubly Linked Lists & Array of Linked Lists In this lecture Doubly linked lists Array of Linked Lists Creating an Array of Linked Lists Representing a Sparse Matrix Defining a Node for a Sparse
More informationConverting a Number from Decimal to Binary
Converting a Number from Decimal to Binary Convert nonnegative integer in decimal format (base 10) into equivalent binary number (base 2) Rightmost bit of x Remainder of x after division by two Recursive
More informationChapter 13 Disk Storage, Basic File Structures, and Hashing.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright 2004 Pearson Education, Inc. Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files
More informationAP Computer Science Java Mr. Clausen Program 9A, 9B
AP Computer Science Java Mr. Clausen Program 9A, 9B PROGRAM 9A I m_sort_of_searching (20 points now, 60 points when all parts are finished) The purpose of this project is to set up a program that will
More informationAlgorithms and Data Structures Written Exam Proposed SOLUTION
Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are
More informationChapter 5 Instructor's Manual
The Essentials of Computer Organization and Architecture Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003 Chapter 5 Instructor's Manual Chapter Objectives Chapter 5, A Closer Look at Instruction
More informationData Structures Fibonacci Heaps, Amortized Analysis
Chapter 4 Data Structures Fibonacci Heaps, Amortized Analysis Algorithm Theory WS 2012/13 Fabian Kuhn Fibonacci Heaps Lacy merge variant of binomial heaps: Do not merge trees as long as possible Structure:
More informationC++ Programming Language
C++ Programming Language Lecturer: Yuri Nefedov 7th and 8th semesters Lectures: 34 hours (7th semester); 32 hours (8th semester). Seminars: 34 hours (7th semester); 32 hours (8th semester). Course abstract
More informationAn Introduction to Programming and Computer Science
An Introduction to Programming and Computer Science Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts Copyright 1998 by
More informationRecord Storage and Primary File Organization
Record Storage and Primary File Organization 1 C H A P T E R 4 Contents Introduction Secondary Storage Devices Buffering of Blocks Placing File Records on Disk Operations on Files Files of Unordered Records
More informationA binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:
Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1
Slide 13-1 Chapter 13 Disk Storage, Basic File Structures, and Hashing Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and Extendible
More informationPseudo code Tutorial and Exercises Teacher s Version
Pseudo code Tutorial and Exercises Teacher s Version Pseudo-code is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy
More informationLINKED DATA STRUCTURES
LINKED DATA STRUCTURES 1 Linked Lists A linked list is a structure in which objects refer to the same kind of object, and where: the objects, called nodes, are linked in a linear sequence. we keep a reference
More informationCOMPUTER SCIENCE (5651) Test at a Glance
COMPUTER SCIENCE (5651) Test at a Glance Test Name Computer Science Test Code 5651 Time Number of Questions Test Delivery 3 hours 100 selected-response questions Computer delivered Content Categories Approximate
More informationEE2204 DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE)
EE2204 DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE) UNIT I LINEAR STRUCTURES Abstract Data Types (ADT) List ADT array-based implementation linked list implementation cursor-based linked lists
More informationClass XII (Theory) C++
Class XII (Theory) C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name Marks 1. OBJECT ORIENTED PROGRAMMING IN C++ 30 2. DATA STRUCTURE 14 3. DATABASE MANAGEMENT SYSTEM AND SQL 8 4. BOOLEAN ALGEBRA
More informationECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139
ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 Instructions: No aides. Turn off all electronic media and store them under your desk. If
More informationExam study sheet for CS2711. List of topics
Exam study sheet for CS2711 Here is the list of topics you need to know for the final exam. For each data structure listed below, make sure you can do the following: 1. Give an example of this data structure
More informationUIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming
UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything
More informationLearning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees
Learning Outcomes COMP202 Complexity of Algorithms Binary Search Trees and Other Search Trees [See relevant sections in chapters 2 and 3 in Goodrich and Tamassia.] At the conclusion of this set of lecture
More informationBachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries
First Semester Development 1A On completion of this subject students will be able to apply basic programming and problem solving skills in a 3 rd generation object-oriented programming language (such as
More informationADTs,, Arrays, Linked Lists
1 ADTs,, Arrays, Linked Lists Outline and Required Reading: ADTs ( 2.1.2) Arrays ( 1.5) Linked Lists ( 4.3.1, 4.3.2) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic Abstract Data Type (ADT) 2 abstract
More informationGCE Computing. COMP3 Problem Solving, Programming, Operating Systems, Databases and Networking Report on the Examination.
GCE Computing COMP3 Problem Solving, Programming, Operating Systems, Databases and Networking Report on the Examination 2510 Summer 2014 Version: 1.0 Further copies of this Report are available from aqa.org.uk
More information