infix to postfix c pgm. CLICK HERE
Wednesday, 28 November 2018
Tuesday, 27 November 2018
LAB EXPERIMENTS FOR FINALS 3rd and 5th SEM
CONDUCTION OF FOLLOWING EXPERIMENTS.
VIVA WILL BE ASKED ON ANY TOPIC INCLUDING DEFINITIONS, OPERATIONS, ASYMPTOTIC ANALYSIS.
1. STACKS - C PROGRAM ON BASIC OPERATIONS OF STACK, C PROGRAM ON INFIX TO POSTFIX CONVERSION.
2. QUEUES - C PROGRAM ON LINEAR QUEUE, C PROGRAM ON CIRCULAR QUEUE.
3. LINKED LIST - C PROGRAM ON SINGLY LINKED LIST, C PROGRAM ON DOUBLY LINKED LIST.
4. TREES - C PROGRAM ON CREATION OF BINARY SEARCH TREE (BST) AND BST TRAVERSALS,
C PROGRAM ON CREATION OF BST AND FINDING MIN, MAX VALUES IN BST, HEIGHT OF BST.
5. SORTING - C PROGRAM ON MERGE SORT, C PROGRAM ON QUICK SORT, C PROGRAM ON HEAP SORT.
VIVA WILL BE ASKED ON ANY TOPIC INCLUDING DEFINITIONS, OPERATIONS, ASYMPTOTIC ANALYSIS.
1. STACKS - C PROGRAM ON BASIC OPERATIONS OF STACK, C PROGRAM ON INFIX TO POSTFIX CONVERSION.
2. QUEUES - C PROGRAM ON LINEAR QUEUE, C PROGRAM ON CIRCULAR QUEUE.
3. LINKED LIST - C PROGRAM ON SINGLY LINKED LIST, C PROGRAM ON DOUBLY LINKED LIST.
4. TREES - C PROGRAM ON CREATION OF BINARY SEARCH TREE (BST) AND BST TRAVERSALS,
C PROGRAM ON CREATION OF BST AND FINDING MIN, MAX VALUES IN BST, HEIGHT OF BST.
5. SORTING - C PROGRAM ON MERGE SORT, C PROGRAM ON QUICK SORT, C PROGRAM ON HEAP SORT.
Tuesday, 6 November 2018
STRUCTURED ENQUIRY FOR 3RD AND 5TH SEM
STRUCTURED ENQUIRY
MARKS BASED ON FOLLOWING:
1. DEMONSTRATION / EXECUTION OF PROGRAM(S) TO RESPECTIVE STAFF.
2. REPORT OF 10-20 PAGES PER TEAM, WITH FOLLOWING CONTENTS:
- FRONT PAGE
- CERTIFICATE
- CHAPTERS - 1. INTRODUCTION, 2. PROBLEM STATEMENT, 3. ANALYSIS, 4. DESIGN, 5. IMPLEMENTATION, 6. RESULT AND OUTCOMES.
FONT - TIMES NEW ROMAN.
FONT SIZE: CHAPTER NAME - 18, HEADING - 16, SUB HEADING - 14, CONTENT - 12.
LINE SPACING - 1.5
1. Design a Program to store the details of a function call as a frame of data. Data in a frame should include function name, return type, arguments passed to a function. Maintain the starting address of every frame. Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
2. Consider a mouse trapped in a maze, trying to find the exit:
This mouse can only move right, left, down, or up—one step at a time. It applies the following procedure:
-> Try moving right, left, down, and up If a route beginning with any one of these fails,
-> Try a new route that starts in an untried direction.
The maze is implemented as a 2D array of char’s. 1 = wall, 0 = open, m = mouse’s initial position, e = exit (could be anywhere), .(dot) = visited location. We assume the boundaries of the array are walls.
Find out appropriate data structure to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
3. Design an input restricted double ended queue for which only the operations removeleft, removeright, and insertleft are valid. And an output restricted double ended queue for which only removeleft, insertleft and insertright are valid.
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
4. Design a C program to simulate a simple multiuser computer system as follows: Each user has unique ID and wishes to perform a number of transactions on the computer. Only one transaction may be processed by the computer at any given moment. Each input line represents a single user and contains user's ID followed by a starting time and a series of integers representing the duration of each of his or her transactions. The input is sorted by increasing starting time, and all the times and durations are in seconds. Assume a user does not request time for a transaction until the previous transaction is complete and computer accepts transactions based on First Come First Served basis. The program should simulate system and print a message containing user ID and time whenever a transaction begins and ends. At the end of simulation it should print the average waiting time for a transaction. ( Waiting time is amount of time between time that the transaction was requested and time it was started).
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
5. Design a program to implement a polynomial equation having 3 variables (x, y and z). Each node should represent a term and should contain the powers of x, y and z as well as coefficient of that term. Program should have following functions:
a. Add two such polynomials.
b. Multiply two such polynomials.
c. Take partial derivative of such polynomial with respect to any of its variables.
d. Evaluate such polynomial for given values of x, y and z.
e. Divide one such polynomial by another, creating a quotient polynomial.
f. Print the representation of such a polynomial.
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
6. Design a C program to perform following operations on a binary tree.
a. Accept a pointer to a node and return TRUE if that node is root of valid tree and FALSE otherwise.
b. Accept a pointer to a node of a tree, and return level of that node in the tree.
c. Accept pointer to a tree and return a pointer to a new tree that is mirror image of the first tree ( i.e. all left sub trees are now right subtrees and vice versa).
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
TEAMS
3A 3B
MARKS BASED ON FOLLOWING:
1. DEMONSTRATION / EXECUTION OF PROGRAM(S) TO RESPECTIVE STAFF.
2. REPORT OF 10-20 PAGES PER TEAM, WITH FOLLOWING CONTENTS:
- FRONT PAGE
- CERTIFICATE
- CHAPTERS - 1. INTRODUCTION, 2. PROBLEM STATEMENT, 3. ANALYSIS, 4. DESIGN, 5. IMPLEMENTATION, 6. RESULT AND OUTCOMES.
FONT - TIMES NEW ROMAN.
FONT SIZE: CHAPTER NAME - 18, HEADING - 16, SUB HEADING - 14, CONTENT - 12.
LINE SPACING - 1.5
1. Design a Program to store the details of a function call as a frame of data. Data in a frame should include function name, return type, arguments passed to a function. Maintain the starting address of every frame. Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
2. Consider a mouse trapped in a maze, trying to find the exit:
This mouse can only move right, left, down, or up—one step at a time. It applies the following procedure:
-> Try moving right, left, down, and up If a route beginning with any one of these fails,
-> Try a new route that starts in an untried direction.
The maze is implemented as a 2D array of char’s. 1 = wall, 0 = open, m = mouse’s initial position, e = exit (could be anywhere), .(dot) = visited location. We assume the boundaries of the array are walls.
Find out appropriate data structure to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
3. Design an input restricted double ended queue for which only the operations removeleft, removeright, and insertleft are valid. And an output restricted double ended queue for which only removeleft, insertleft and insertright are valid.
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap).
4. Design a C program to simulate a simple multiuser computer system as follows: Each user has unique ID and wishes to perform a number of transactions on the computer. Only one transaction may be processed by the computer at any given moment. Each input line represents a single user and contains user's ID followed by a starting time and a series of integers representing the duration of each of his or her transactions. The input is sorted by increasing starting time, and all the times and durations are in seconds. Assume a user does not request time for a transaction until the previous transaction is complete and computer accepts transactions based on First Come First Served basis. The program should simulate system and print a message containing user ID and time whenever a transaction begins and ends. At the end of simulation it should print the average waiting time for a transaction. ( Waiting time is amount of time between time that the transaction was requested and time it was started).
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
5. Design a program to implement a polynomial equation having 3 variables (x, y and z). Each node should represent a term and should contain the powers of x, y and z as well as coefficient of that term. Program should have following functions:
a. Add two such polynomials.
b. Multiply two such polynomials.
c. Take partial derivative of such polynomial with respect to any of its variables.
d. Evaluate such polynomial for given values of x, y and z.
e. Divide one such polynomial by another, creating a quotient polynomial.
f. Print the representation of such a polynomial.
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
6. Design a C program to perform following operations on a binary tree.
a. Accept a pointer to a node and return TRUE if that node is root of valid tree and FALSE otherwise.
b. Accept a pointer to a node of a tree, and return level of that node in the tree.
c. Accept pointer to a tree and return a pointer to a new tree that is mirror image of the first tree ( i.e. all left sub trees are now right subtrees and vice versa).
Find out appropriate data structures to be used to solve the problem. If appropriate data structure found, implement the program, if not, justify your answer why the following data structure cannot be used to implement. (Analyze using Stack, Queue, Linked List (singly/doubly), Tree, Heap, sorting algorithms). Justify your solution.
TEAMS
3A 3B
| NO | ROLL NOS. | ROLL NOS. |
| 1 | 1 to 7 | 73 to 79 |
| 2 | 8 to 13 | 80 to 86 |
| 3 | 14 to 19 | 87 to 94 |
| 4 | 20 to 26 | 95 to 102 |
| 5 | 27 to 33 | 103 to 110 |
| 6 | 34 to 39 | 111 to 119 |
| 1 | 40 to 47 | 121 TO 127 |
| 2 | 48 to 56 | 128 TO 134 |
| 3 | 57 to 62 | 135 TO 141 |
| 4 | 63 to 68 | 142 TO 154 |
| 5 | 25, 43, 51, 69 to 72 | 155 TO 160 |
| ||||||||||||||||||||||||||||||||||||||||||||
Thursday, 25 October 2018
UPDATED DS LAB SCHEDULE FOR MINOR - 2 AND SYLLABUS
DS LAB MINOR - 2 WILL BE SCHEDULED ALONG WITH REGULAR MINOR - 2 EXAMS FOR BOTH 3RD AND 5TH SEM (EXCEPT DIPLOMA STUDENTS ).
DURATION - 1HR 15MINS.
EXAM PATTERN
Any 2 FULL Questions to be attempted out of 3. Max 40marks.
1. STACKS - INFIX TO POSTFIX CONVERSION.
2. QUEUES - LINEAR QUEUE, CIRCULAR QUEUE.
3. LINKED LIST - SINGLY LINKED LIST, DOUBLY LINKED LIST, CIRCULAR SINGLY LINKED LIST
4. TREES - DEFINITION OF TREE, TYPES OF TREES, CONSTRUCTION AND TRAVERSAL OF BINARY TREE & BINARY SEARCH TREE.
DURATION - 1HR 15MINS.
EXAM PATTERN
Any 2 FULL Questions to be attempted out of 3. Max 40marks.
1. STACKS - INFIX TO POSTFIX CONVERSION.
2. QUEUES - LINEAR QUEUE, CIRCULAR QUEUE.
3. LINKED LIST - SINGLY LINKED LIST, DOUBLY LINKED LIST, CIRCULAR SINGLY LINKED LIST
4. TREES - DEFINITION OF TREE, TYPES OF TREES, CONSTRUCTION AND TRAVERSAL OF BINARY TREE & BINARY SEARCH TREE.
Tuesday, 16 October 2018
SEMINAR TOPICS
DS LAB - SEMINAR
TOPICS - for 3rd and 5th Sem.
Every topic should have
1. Theory /
Concept
2. Algorithm
3. Asymptotic
analysis - best case, average and worst case.
4. Examples ( one
or more ).
5. Tracing of
example.
6. Asymptotic
Analysis of example.
1. List out and Discuss the Asymptotic Notations - O (big oh), Ω( omega )
and Θ
( theta). Also relate these notations with best
case, average case and worst case
scenarios.
2. Write an modular program (using functions) on MERGE SORT. Using Asymptotic
Notations perform best case, average case and worst case analysis.
3.
Write and Design an modular (using functions) program on QUICK SORT.
Using Asymptotic Notations perform best case, average case and worst case analysis.
4.
Write an modular program (using functions) on HEAP SORT. Using
Asymptotic Notations perform best case, average case and worst case analysis.
5.
Write an modular program (using functions) on SHELL SORT. Using
Asymptotic Notations perform best case, average case and worst case analysis.
6.
Write an modular program (using functions) on RADIX SORT. Using
Asymptotic Notations perform best case, average case and worst case analysis.
7. Write an modular program (using functions) on Direct address
Tables. Discuss its performance - best case,
average case and worst case analysis.
8. Write an modular program (using functions) on Hash Tables. Discuss
its performance - best case, average case and worst case analysis.
9. Write an modular program (using functions) on Linear Search. Discuss
its performance analysis for best case, average case and worst case.
10. Write an modular program (using functions) on Binary Search.
Discuss its performance analysis for best case, average case and worst case.
TEAMS
| TEAMS FOR SEMINAR | ||
| 3A | 3B | |
| SEMINAR TOPIC NO | ROLL NOS. | ROLL NOS. |
| 1 | 1 to 7 | 73 to 79 |
| 2 | 8 to 13 | 80 to 86 |
| 3 | 14 to 19 | 87 to 94 |
| 4 | 20 to 26 | 95 to 102 |
| 5 | 27 to 33 | 103 to 110 |
| 6 | 34 to 39 | 111 to 119 |
| 7 | 40 to 47 | 121 TO 127 |
| 8 | 48 to 56 | 128 TO 134 |
| 9 | 57 to 62 | 135 TO 141 |
| 10 | 63 to 68 | 142 TO 154 |
| 7 | 25, 43, 51, 69 to 72 | 155 TO 160 |
| 8 | ------- | 161, 894, 1391 TO 1393 |
| ||||||||||||||||||||||||||||||||||||||||||||
Saturday, 13 October 2018
RESOURCE ON C PROGRAMMING FOR 7TH SEM
TO ACCESS PPT - CLICK HERE TO VIEW PPT
TO ACCESS PDF BOOK -
LET US C BY YK - CLICK HERE
DATA STRUCTURES NOTES
FIRST SESSION. INTRODUCTION TO DATA STRUCTURES. CLICK HERE
SECOND SESSION. STACKS, QUEUES AND RECURSION. CLICK HERE
THIRD SESSION. LINKED LIST. CLICK HERE
FOURTH SESSION. BINARY TREES. CLICK HERE
BINARY SEARCH TREES. CLICK HERE
FIFTH SESSION. GRAPHS. CLICK HERE
TO ACCESS PDF BOOK -
LET US C BY YK - CLICK HERE
DATA STRUCTURES NOTES
FIRST SESSION. INTRODUCTION TO DATA STRUCTURES. CLICK HERE
SECOND SESSION. STACKS, QUEUES AND RECURSION. CLICK HERE
THIRD SESSION. LINKED LIST. CLICK HERE
FOURTH SESSION. BINARY TREES. CLICK HERE
BINARY SEARCH TREES. CLICK HERE
FIFTH SESSION. GRAPHS. CLICK HERE
Wednesday, 10 October 2018
MINOR 1 QUESTIONS.
FOR 3 A DIVISION
CLICK HERE TO VIEW QUESTIONS.
FOR 3 B DIVISION.
CLICK HERE TO VIEW THE QUESTIONS
FOR 5 A DIVISION
CLICK HERE TO VIEW QUESTIONS
FOR 5 B DIVISION
CLICK HERE TO VIEW THE QUESTIONS
INTERESTED STUDENTS OF RESPECTIVE DIVISION CAN SUBMIT THE SOLUTION FOR ABOVE MINOR QUESTIONS.
LAST DATE: 20 OCTOBER 2018.
CLICK HERE TO VIEW QUESTIONS.
FOR 3 B DIVISION.
CLICK HERE TO VIEW THE QUESTIONS
FOR 5 A DIVISION
CLICK HERE TO VIEW QUESTIONS
FOR 5 B DIVISION
CLICK HERE TO VIEW THE QUESTIONS
INTERESTED STUDENTS OF RESPECTIVE DIVISION CAN SUBMIT THE SOLUTION FOR ABOVE MINOR QUESTIONS.
LAST DATE: 20 OCTOBER 2018.
Subscribe to:
Posts (Atom)