R. C. TECHNICAL INSTITUTE, SOLA

R. C. TECHNICAL INSTITUTE, SOLA Information Technology Department SEMESTER 3 Assignments list for all subjects Subject Name: DIGITAL MEMORY SYSTEMS Subject Code: 3331601 ASSIGNMENT-1- Digital Memory Systems Basics 1. List out all the flip-flop and any one of them. 2. Give the full form of following. RTL, DTL, ECL,TTL,I2L,PMOS,NMOS, CMOS 3. List out all the basic gates explain any two in detail. 4. Define following terms. a. Fan in b. Threshold voltage c. Noise immunity d. Fan out e. Propagation delay f. Operating Temperature 5. Compare between combinational circuit and sequential circuit. 6. Advantages and Disadvantages of mos and cmos. ASSIGNMENT-2- Sequential Circuit Design 1. Explain Master Slave in detail. 2. What is trigger flip-flop? Explain its type. 3. Def. Following terms:- a. State table b. State diagram 4. Explain racing condition in J-K flip-flop. ASSIGNMENT-3- Complex Sequential Circuit Design 1. Define Register. Explain its type in detail. 2. Explain ripple counter in detail. 3. Wright short note on following: a. Decade counter b. Ring counter 4. List out application of shift register. 5. List out application of counter register. Page 1

ASSIGNMENT-4- Memory Architecture 1. Explain classification of memory. 2. Write short note on ROM with block diagram. 3. Explain case memory detail. 4. Difference between static ram and dynamic ram. 5. Explain types of rom. ASSIGNMENT-5 Processor Architecture 1. Explain 8086 Architecture in detail. 2. Explain 8086 pin diagram in detail. 3. Write a short note on 8086 register. 4. What is flag? And explain 8086 flag in detail. Page 2

Subject Name: Computer Graphics Subject Code: 3331602 ASSIGNMENT -1- Introduction to Computer Graphics 1. Define different application areas of CG with one example. 2. Differentiate Raster Scan & Random Scan with proper example. 3. Describe CRT with its terminology. 4. What is the difference between emissive display & Non emissive display? 5. Describe in short any four Input Devices. ASSIGNMENT -2- Output Primitives 1. Describe Bresenham s Line Drawing Algorithm with necessary application. 2. Describe Mid Point Circle Algorithm with necessary application. 3. Describe the Following Algorithm with necessary figures: a. Boundary Fill b. Flood Fill 4. Differentiate Convex and Concave Polygons 5. Explain with necessary figures:: Methods Of Character Generation. ASSIGNMENT - 3-2 Dimensional Geometry and Viewing 1. Explain in detail : 2 D Transformation 2. General Pivot point Rotation and General Fixed Pint Scaling in 2-D. 3. Describe in Short: Reflection, Zooming, Panning and Jaggies. 4. Line Clipping algorithm:: a. Cohen Sutherland Line Clipping Algorithm b. Liang Barsky Line Clipping Algorithm 5. Polygon Clipping algorithm:: a. Sutherland Hodgeman Polygon Clipping Algorithm b. Weiler Polygon Clipping Algorithm 6. Text Clipping ASSIGNMENT - 4-3 Dimensional Geometry and Viewing 1. Explain in detail : 3 D Transformation 2. Reflection and Shear in 3 D. 3. Types Of Presentation a. Parallel Projection b. Perspective Projection ASSIGNMENT - 5- Application of Computer graphics in Image Processing 1. Difference between Digital Image and Real Image 2. Application of Image Processing in Computer Graphics. 3. Munsell s Color Classification System 4. XYZ Color Classification System. Page 3

Subject Name: Operating Systems Subject Code: 3351701 ASSIGNMENT-1- Operating System Concepts 1. Define OS. 2. List types of OS. 3. What is OS? What is the need of OS? ASSIGNMENT-2- Processor & Process Management 1. Define process and scheduler. 2. Differentiation process and program. 3. List out condition for dead lock to occur. 4. Describe processes. ASSIGNMENT-3- Memory Management 1. Define logical addressing. 2. Show memory hierarchy in memory management. ASSIGNMENT-4- File Management 1. Differentiate absolute file path and release file path. 2. List out file attributes. 3. Define file in file management. 4. List out file attributes in file management. ASSIGNMENT-5- Linux Basics 1. List out directory command of Linux O.S. 2. Explain grep command. 3. Explain chmod command. 4. Define kernel, shell. Page 4

Subject Name: Data Structures Subject Code: 3330704 ASSIGNMENT-1- Basic concepts of Data Structures 1. What is Data Structure? Explain types of Data Structure. 2. Explain primitive and non-primitive Data Structure. 3. Define Algorithm. Explain key features of Algorithm. 4. Define: Time Complexity, Space Complexity. 5. Differentiate: List v/s Array. 6. Explain Linear and Binary Search with Example. 7. Define: Best Case, Average Case and Worst Case Time Complexity. 8. Write an algorithm to insert an element in array. ASSIGNMENT-2- String 1. Define String. List out various string operation. 2. Explain putchar() and puts() function with example. 3. Write algorithm to find length of given string without using library function. 4. Write C Program to compare two strings without using library function. 5. Write a C Program to copy one string to another string without use of library function strcpy. ASSIGNMENT-3- Stack & Queues 1. Define Stack. Write an algorithm for PUSH and POP operation. 2. Define Queue. Write algorithm to delete an element from queue. 3. Differentiate: Simple Queue v/s Circular Queue. 4. Explain application of Stack. 5. List out limitations of Queue. 6. Convert: a * (c + d) + (j + k) * n + m * p into postfix expression. 7. Convert: a + b * (c / d) e into postfix expression. 8. Explain the conversion from prefix to postfix expression with example. Page 5

ASSIGNMENT-4- Linked List 1. Define pointer and write advantages of pointer. 2. Write application of linked list. 3. Write short note on doubly linked list. 4. Write short note on circular linked list. 5. Write an algorithm to insert new node at the starting of singly linked list. 6. Write an algorithm to count the number of nodes in singly linked list. 7. Write an algorithm to search given node in singly linked list. 8. Write an algorithm to delete node from beginning in singly linked list. 9. Write an algorithm to insert node at the end of singly linked list. 10. Write an algorithm to insert node at beginning of doubly linked list. ASSIGNMENT-5- Sorting & Hashing 1. Define Collision. Explain Collision Resolution Techniques. 2. Write an algorithm for Bubble Sort. 3. Write an algorithm for Selection Sort. 4. Define Hashing. Explain any two Hashing Techniques. 5. Give Trace of Radix Sort algorithm using following data. a. 23, 74, 11, 65, 57, 36, 99, 70, 81, 139, 61 6. Write short note on DMA. 7. Write an algorithm for Insertion Sort. 8. Write a C Program for Merge Sort. 9. Write an algorithm for Quick Sort. 10. State two advantages of Radix sort and Insertion sort. ASSIGNMENT-6- Trees 1. Define : Forest, In-degree, BST, Leaf node, Complete Binary Tree, Directed Edge, Isolated Node 2. Define Tree. Explain application of Tree. 3. Explain conversion of general tree into binary tree with suitable example. 4. Explain tree traversal method with suitable example. 5. Create BST for the following data. a. 4, 3, 8, 2, 1, 6, 9, 5, 7 6. Write an algorithm for in-order tree traversal method. 7. Write an algorithm for post-order tree traversal method. 8. What is Binary Tree? Explain searching a node in binary tree. Page 6