7 views

Uploaded by Mani Kandan K

digital lab model ques

- Placementpapers 2013 IBM
- Binary Search Trees
- Chapter 8 - Heaps
- Cost Element Cost Planning
- An Interface for Assisting the Design and Production of Pop-up Card En
- ABAP Internal Table Secondary Key Performance Comparison _ ABAP Help Blog
- Aircraft Landing
- all mcq
- Procedural Skeletons
- topic15_Trees.pdf
- MCA 3rd Sem. Ass.2018-19
- apicus[1]
- A Novel Approach for Keyword extraction in learning objects using text mining
- Tree Data Structure
- Priority Queues With Heap Immplementation
- DatStr 12 AVLTrees
- 2620005 Programming Skills
- iit kgp Practice-13 Stacks and Queues
- Red Black Trees
- AVL

You are on page 1of 4

.TECH DEGREE EXAMINATION, OCT/NOV 2012 IT 2205 - DATA STRUCTURES AND ALGORITHMS LAB B.TECH INFORMATION TECHNOLOGY III SEMESTER Regulations - 2008 Time: 3 Hours 1 Maximum Marks: 100 100

Write a function in C to create a list using singly linked list. The list should contain the following numbers 30, 50, 20, 10, 45, 65, 05. Write functions to insert an item at given position, to delete an item at given position, to find an item in the list and to display the items in the list.

Write a function in C to create a list using doubly linked list. The list should contain the following language Software namely C, C++, C#, Java, PASCAL, BASIC, COBOL. Write functions to insert an S/W name at given position, to delete a S/W name at given position, to find a S/W name in the list and to display the S/W name in the list in reverse order

100

Write a function in C to create two sorted list L1 and L2 using singly linked list. The List should contain integer numbers only. Write a function using only the basic list operations to generate list L3 which should contain the union of two list L1 and L2

100

Write a function in C to create two sorted lists L1 and L2 using singly linked list. The List should contain integer numbers only. Write a function using only the basic list operations to generate list L3 which should contain the intersection of two lists L1 and L2

100

Write a function in C to represent polynomial as linked list. Each node of the list should contain the degree and coefficient of the polynomial. Write a function to add two polynomials. Execute your program for the following inputs a) Polynomial 1: Polynomial 2: b) Polynomial 1 : 5 x 6 + 7 x 4 + 10 x 1 + 20 3x4+8x3+4x1 10 x 4 + 3 x 3 + 8 x 2

100

Polynomial 2:

8 x 10 + 6 x 8 + 5 x 4 + 2 x 3 + 9 x 2 + 10

Write functions in C to implement the stack with its basic operations either using linked list or using an array. Using the basic operations of the stack, push the following characters into the stack and print them in the reverse order. T,E,C,H,N,O,L,O,G,Y Input;

100

Write functions in C to implement the stack with its basic operations either using linked list or using an array. Using the basic operations of the stack, convert the following infix notation to postfix notation. Input : A * ( B + C) / D * E ^ F G + H

100

Write functions in C to implement the circular queue with its basic operations using an array of size 6. Using the basic operations of the queue, Enqueue the following subject code and Dequeue them in the same order Input : 2201, 2202, 2203, 2204, 2205, 2206, 2207, 2208, 2209, 2210

100

Write functions in C to implement the circular queue with its basic operations using an array. Using the basic operations of the queue, simulate the producer and consumer problem.

100

10 Write functions in C to construct an expression tree using Stack. Write a function to produce the preorder traversal of the expression tree. Input: A B C * + D E * F + g * 11 Write functions in C to construct an expression tree using Stack. Write a function to produce the postorder traversal of the expression tree . Input: A B C * + D E * F - g * + 12 Write functions in C to construct an expression tree using Stack. Write a function to produce the inorder traversal of the expression tree . Input: A B C * - D E * F + g * + 13 Write a function in C to implement Binary search tree. Write functions to insert an integer, to find an integer and to find the largest integer in the binary search tree. Input : 60, 30, 70, 35, 65, 67, 37 Insert 29, find 70 & 31

100

100

100

100

14 Write a function in C to implement Binary search tree. Write functions to insert an integer, to delete an integer and to find the smallest integer in a binary search tree. Input: 60, 30, 70, 35, 65, 67, 37 Insert 80, delete 60 & 35

100

15 Write a function in C to implement priority queue using min heap. The property of min heap is value at the parent node should be less than or equal to the values of its children node. Using the operations of the min heap, print following integers in ascending order Input: 75, 65, 89, 12, 34, 3, 56, 10, 25, 80 16 Write a function in C to implement priority queue using max heap. The property of max heap is value at the parent node should be greater than or equal to the values of its children node. Using the operations of the max heap, print following integers in descending order Input: 75, 65, 89, 12, 34, 3, 56, 10, 25, 80 17 Write a program in C to implement hashing using linear probing method. Let the hash table size be 10. Hash the following integers and display the contents of the hash table Input: 45, 23, 26, 75, 34, 93, and 67. 18 Write a program in C to implement hashing using quadratic probing method. Let the hash table size be 10. Hash the following integers and display the contents of the hash table Input: 45, 23, 26, 75, 34, 93, and 67. 19 Write a program in C to implement Dijkstras algorithm using priority queue to find the shortest path from the source vertex to all the remaining vertices in the given graph. Graph: Source vertex : V1

100

100

100

100

100

100

- Placementpapers 2013 IBMUploaded byAravind Chidambaram
- Binary Search TreesUploaded bySowmyaMukhamiSrinivasan
- Chapter 8 - HeapsUploaded byNguyễn Thanh Linh
- Cost Element Cost PlanningUploaded byBijaya Mahananda
- An Interface for Assisting the Design and Production of Pop-up Card EnUploaded byjoin
- ABAP Internal Table Secondary Key Performance Comparison _ ABAP Help BlogUploaded byraky0369
- Aircraft LandingUploaded byseenumurar
- all mcqUploaded byTHANGAMARI
- Procedural SkeletonsUploaded bykukuduxu
- topic15_Trees.pdfUploaded bySanchit Garg
- MCA 3rd Sem. Ass.2018-19Uploaded byKumar Info
- apicus[1]Uploaded byRishabh Jain
- A Novel Approach for Keyword extraction in learning objects using text miningUploaded byInternational Journal for Scientific Research and Development - IJSRD
- Tree Data StructureUploaded bynalluri_08
- Priority Queues With Heap ImmplementationUploaded byMoizzah Asif
- DatStr 12 AVLTreesUploaded byshk8
- 2620005 Programming SkillsUploaded byyrsqzlkg
- iit kgp Practice-13 Stacks and QueuesUploaded byAbhinaba Saha
- Red Black TreesUploaded byAndersonOliveira
- AVLUploaded byPoonam Bhardwaj
- Depth First Search AlgUploaded bymdhuq1
- TechnicalUploaded byravi_03dc13
- SS_Chap2_S.pdfUploaded bySahana
- 14604426231047479589Uploaded byKarthikeyan Ramajayam
- Lecture 11Uploaded byRam Ganesh
- GI-report No.11Uploaded byVăn Thuấn Ngô
- 04135371Uploaded byMohana Sundaram Ma Ni
- MC0080_ans1Uploaded bySiva Pragadeesh
- Alcomft Tr 01 34Uploaded bychuyenvien94
- CFG-pumpingUploaded bySonaiya Mahesh

- Basic Installation OdroidC2 V1.1Uploaded byMani Kandan K
- Amc 6821Uploaded byMani Kandan K
- if-505.pdfUploaded bymirkofedor
- Amc 6821Uploaded byMani Kandan K
- Nucleo-F207ZGUploaded byMani Kandan K
- Quectel M66-OpenCPU User Guide V1.0Uploaded byMani Kandan K
- Develop Usb Device Access Once Using Libusb - Use Any Where Nagendra Simhadri - V4.0Uploaded byMani Kandan K
- Odroid c2 User ManualUploaded byMani Kandan K
- DSP Lecture01 IntroUploaded byAnyun Sharma
- Catalog YMI130 en 050 1Uploaded byMani Kandan K
- lan-1561-aenUploaded byDerrick Kojo Senyo
- cse41.pdfUploaded bymickyalemu
- Fault Detection Technique by using OTDR.pdfUploaded byMani Kandan K
- Optical Fiber Communications - KeiserUploaded byapi-19826463
- otdr_engUploaded byరాజా రావు చామర్తి
- mp and mc 2015Uploaded byMani Kandan K
- 23451Uploaded byMani Kandan K
- HelpUploaded byMani Kandan K
- RTL Design Using VHDLUploaded byJoshua Kumaresan
- 20091224510102-141-0-14Uploaded byMani Kandan K
- 94210321-MOSFETUploaded byNavaneethaan Nathamoorthy
- Lab Plan LICUploaded byMani Kandan K
- CSE3213_04_AnalogDigitalSignals_F2010Uploaded byVamsi Reddy
- 01. ESTUploaded byRaja Ram
- Trig Cheat SheetUploaded byHMaSN

- How to Slipstream All Intel SATA Drivers With XPUploaded byBirendra Kumar Singh
- HPE2-T30-40Uploaded byGbenga Mally
- Read meUploaded byAri AutoEletrica Siqueira
- dfdUploaded byfarin_sidiki
- Linux Report NehaUploaded bysonabeta07
- DB2_PrasenjitUploaded byPrasenjit Chatterjee
- Installation of MQUploaded bynandoooo86
- ChaosMonkey_Guide for EngineersUploaded byAndrewSteblevsky
- ReportUploaded bySangam Gupta
- Project Report AircelUploaded byasifkingkhan
- John Mecke Resume - 2010Uploaded byJohn C. Mecke
- Data management of Public Bus services in Johor Bahru, MalaysiaUploaded byvasu727303
- First Order Linear Homogeneous Fuzzy Ordinary Differential Equation Based on Lagrange Multiplier MethodUploaded bysankar_mondal02
- Apwidget Android AudioUploaded byadulphusjuhnos
- Neuron Files Download PageUploaded byscripded
- Enregistrement - IMPORTANT Mixing-VocalsUploaded byrobertlangdon99
- 1756-RN628E-EN-EUploaded bySanz Flrntin Skott
- description: tags: Sec1Pgs16-75Uploaded byanon-449531
- IJETTCS-2014-04-24-121Uploaded byAnonymous vQrJlEN
- PredictiveUploaded byAjayy Prakash
- SIP Balancer User GuideUploaded byNicTanase
- Clusturing ArtificialUploaded bynagendraMBA
- SDKUploaded byOmar Mufti
- Conversion Plan ReportUploaded bybvital
- AssemblersUploaded byAqil Siddiqui
- Handover(RAN16.0_Draft B).pdfUploaded bykofi_amoako_amoantwi
- Best_Practices_for_IT_Strategic_Planning_en.pdfUploaded byAnonymous iMq2HDvVq
- cryptoUploaded bynanjilba
- Pre Assess Report 2692505Uploaded byAnuj Tiwari
- Software Quality Assurance Analyst in Austin TX Resume Rendle TaylorUploaded byRendleTaylor2