SE Computer Engineering
SE ONLINE EXAM MCQ!
SE Computer Enginnering Syllabus
Microprocessor
DSA
Computer Graphics
---------------------------
Group A
------------------------------
MCQ QUESTIONS
Advanced Data Structures
SE Computer Enginnering Syllabus
- Count number of positive & negative numbers from the array
- ASM program to Overlapped and Non-Overlapped block transfer with and without String instruction
- Convert 4-digit Hex number into its equivalent BCD number and 5-digit BCD number into its equivalent HEX number.(a) HEX to BCD
- Convert 4-digit Hex number into its equivalent BCD number and 5-digit BCD number into its equivalent HEX number. b) BCD to HEX
- Multiplication of two 8-bit hexadecimal numbers. Use successive addition and add and shift method. ( 64-bit registers is expected)
- Find the factorial of a given integer number on a command line by using recursion. Explicit stack manipulation is expected in the code.
- Find :
- a) Number of Blank spaces
- b) Number of lines
- c) Occurrence of a particular character. Accept the data from the text file. The text file has to be accessed during Program_1 execution and write FAR PROCEDURES in Program_2 for the rest of the processing. Use of PUBLIC and EXTERN directives is mandatory.
- Menus driven Assembly Language Program (ALP) to implement OS (DOS) commands TYPE, COPY and DELETE using file operations. User is supposed to provide command line arguments in all cases.
- Program to sort the list of integers in ascending/descending order. using bubble sort
- Bubble sort 1 digit ASM Program
- Write X86/64 ALP to switch from real mode to protected mode and display the values of GDTR, LDTR, IDTR, TR and MSW Registers.
- Write 80387 ALP to obtain:
- i) Mean
- ii) Variance
- iii) Standard Deviation
- Also plot the histogram for the data set. The data elements are available in a text file.
- Permutation Generator in C++
- Set Operations in C++
- Matrix Operations Program in CPP
- Data Structures Pinnacle Club Program using Singly Linked List in C++
- Program to Calculate 1's, 2's complement and addition of binary numbers using DLL
- Set Operations using Liked List
- C++ program using stack to check whether given expression is well parenthesized or not.
- C++ program for expression conversion as infix to postfix
- C+ + program for simulating job Priority Queue
- C++ program to simulate deque with functions to add and delete elements from either end of the deque
- C++ Program to Demonstrate Various Searching Algorithms
- C++ program to simulate the system using circular queue using array.
- C++ Program to demonstrate Shell sort, insertion sort and Quick Sort
- DSA ALL
- ADS LAB Page:
- Expression : a-b*c-d/e+f construct Inorder sequence and traverse it using postorder, preorder,inorder traversal.
- Threaded Binary Tree :Convert given binary tree into inordered and preordered threaded binary tree
- Dictionary : stores keywords & its meanings. Use Binary Search Tree For Its implementation
- There are flight paths between cities. If there is a flight between city A and city B then there is an edge between the cities. The cost of the edge can be the time that flight takes to reach city B from A, or the amount of fuel used for the journey. Represent this as a graph. The node can be represented by airport name or name of the city. Use adjacency list representation of the graph or use adjacency matrix representation of the graph.
- You have a business with several offices; you want to lease phone lines to connect them upwith each other; and the phone company charges different amounts of money to connectdifferent pairs of cities. You want a set of lines that connects all your offices with a minimumtotal cost. Solve the problem by suggesting appropriate data structures.
- Microprocessor Unit Implement all the functions of a dictionary (ADT) using hashing. Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable, Keys must be unique Standard Operations: Insert(key, value), Find(key), Delete(key)Test 2
- The symbol table is generated by compiler. From this perspective, the symbol table is a set of name-attribute pairs. In a symbol table for a compiler, the name is an identifier, and the attributes might include an initial value and a list of lines that use the identifier. Perform the following operations on symbol table:
- (1) Determine if a particular name is in the table
- (2) Retrieve the attributes of that name
- (3) Modify the attributes of that name
- (4) Insert a new name and its attributes
- (5) Delete name and its attribute
- A Dictionary stores keywords & its meanings. Provide facility for adding new keywords, deleting keywords, updating values of any entry. Provide facility to display whole data sorted in ascending/ Descending order. Also find how many maximum comparisons may require for finding any keyword. Use Height balance tree and find the complexity for finding a keyword
- create ADT that implements the SET concept.
- a. Add (newElement)
- b. Remove (element)
- c. Contains (element)
- d. Size ()
- e. Intersection of two sets,
- f. Union of two sets, g. Difference between two sets, h. Subset
- Department maintains a student information. The file contains roll number, name, division and address. Allow user to add, delete information of student. Display information of particular employee. If record of student does not exist an appropriate message is displayed. If it is, then the system displays the student details. Use sequential file to main the data.
- Download ALL ADS Programs
No comments: