Data Structure Exam Answer Key
Data Structure Exam Answer Key
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
() In a complete binary tree if the number of nodes is 1000000. What will be the height
of complete binary tree.
) Which data structure is used to perform recursion and why?
SECTIONB
(b) What is Stack? Write aCprogram for linked list implementation of stack.
(c) Write an algorithm for Quick sort. Use Quick sort algorithm to sort the following
elements: 2, 8, 7, 1, 3, 5, 6, 4
(d) Write the Dijkstra algorithm for shortest path in a graph and also find the shortest path
from S' to all remaining vertices of graph in the following graph:
v(e) The order of nodes of a binary tree in inorder and postorder traversal are as follows:
In order : B, I, D, A, C, G, E, H, F.
Post order: I, D, B, G, C, H, F, E, A.
() Draw the corresponding binary tree.
(ii) Write the pre order traversal of the same tree.
cost
What is spanning tree? Write down the Prim'salgorithm to obtain minimum
tree
spanning tree. Use Prim's algorithm to find the minimum cost spanning
in the following graph:
6
2
(b) Write and explain the Floyd Warshall algorithm to find the all pair shortest path. Use the
Floyd Warshall algorithm to find shortest path among all the
L 0 1
233: 2
(a) Discuss left skewed and right skewed binary tree. Construct an AVL tree by
inserting the following elements in the order of their occurrence:
60, 2, 14, 22, 13, 111, 92, 86.
What is B-Tree? Write the various properties of B- Tree. Show the results of
inserting the keys F, S, 0, K,C, L, H, T, V, W, M, R, N, P, A, Bin order into a
empty B-Tree of order 5.
[Link]
(SEM IV) THEORY EXAMINA TION 2022-23
TECHNICAL COMMUNICATION
Time: 3 Hours
Total Marks: 100
Note: Attempt all Sections. If require any missing data; then
choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
(a) Recall skimming and scanning in reading
comprehension.
(b) List out the advantages of horizontal flow of communication.
(c) Associate clarity and concise with the effectiveness of technical
communication.
(d) Differentiate between routine and Special Report.
(e) Determine the factors responsible for retention of audience interest in any
presentation.
() Examine the difference between classroom presentation and individual
conferencing.
1 0 3 . 8 5 . 1 4 1 . 1 7 0
SECTIONC
3. Attempt any one part of the following: 10x1=10
(a) "The single most significant characteristic of the human race. is the ability to
communicate." Describe the importance and features of technical communication.
(a) Suppose you are going toestablish a Research &Development Cell in your organization.
Yourequire 30 computers to establish a Lab for research there. Now write and illustrate a
proposal to the Manager by inventing necessary detail yourself. Invent the necessary
details.
(b) Release a report on the increasing number of IITs and the compromises made in the
quality of education due tp this initiative. Quote some examples with special reference to
its impact on students.
5. Attempt any one part of the following: 10x1=10
6. 10x1=10
Attempt any one part of the following:
(a Determine Speech and Professional forsonality Atributes with suitable examples. Discuss
its' importance at workplace.
b) Investigate the importance øfEbfathy, Competence, and positive attitude,fof good
leader. |
1 3 : 2 5 : 4 1
2 8 - 0 7 - 2 0 2 3
B. TECH
(SEM IV) THEORY EXAMINATION 2022-23
COMPUTER SYSTEM SECURITY
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.
SECTIONA
1, Attempt all questions in brief. 2 x 10 = 20
SETÍONB
2. Attempt any three of the following:
a) Define control hijacking with' an example. Explain buffer overflow in control
hijacking. UNIX.
(b) Compare access control in Windows with the access control in
(c) Define cross site request forgery and explain defenses against it,
(d) Explain IP security. 1 3 : 2 4 :
SECTION C
Attempt any one part of the following: 10x1=10
3.
1 0 3 . 8 5 . 1 4 1 . 1 7
P 5 6
O P 2 3 E P 2
1 3 : 2 4 : 1 3
0 1 - 0 8 - 2 0 2 3
[Link]
QP23EP2 056 |01-08-2023 [Link]|
Printed Pages:02 Sub Code: KCS-302
Paper Id: 233647
Roll No.2 o22ooyo
B. TECH.
(SEM II)THEORY EXAMINATION 2022-23
COMPUTER ORGANIZATION AND ARCHITECTURE
Time: 3 Hours
Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose
suitably.
SECTION A
1. Attemptall questions in brief. 2 x 10 = 20
SECTIONC
3.
Attempt any one part of the following:
10x1=10
(a) Explain about stack
register stack? organization used in processors. What do you understand by
(b) What is an effective address? How it
is calculated in different types of addressing
modes? Explain.
(a) Describe the derivation procedure of look ahead carry adder by an example with
the help of block diagram.
(b) Show the systematic multiplication process of (-15) x (-16) using Booth's
Algorithm.
10x1=10
6. Attempt any one part of the following:
(a) Discuss the Memory Hierarchy in computer system with regard to Speed, Size
and Cost. 7 . 2 4 2
(b) Write a short notes on magnetic disk, magnetic tape and optical disk.
With a neat schematic diagram, explain about DMA controller and its mode of 1 4 .
data transfer.
(b) Discuss the design of a typical input or output interface.
1 3 : 2
|
7 : 5 6
0 1 - 0 4 - 2 0 2 3
B. TECH.
(SEM-II) THEORY EXAMINATION 2022-23
LOGIC
DISCRETE STRUCTURES & THEORY OF
Total Marks: 100
Time: 3 Hours
choose suitably.
Note: Attempt all Sections. If require any missing data; then
SECTION A
2 x 10 = 20
1. Attempt all questionsin brief.
ceiling
(a) Identify whether x+y]= [x] + [yl, Vx,y ER, where Tx] is a
function
form the following Hasse's
(b) Find the Maximal elements and minimal elements
diagram
20
DP5208 1 4 . 9 9 . 3 7 . 2 4
25
5 2
growth of functions. \
(c) Define what is Big-O notatión with respect of
(d) Find the composite mapping gof if
g: R>R is given by g(x)= sinx
f: R>R is given by f(x) ’e andfollowing
1 3 : 1 6 : 0 1
graph
(e) Draw an adjacency matrix for the
SECTION B
[Link]
CP23DP2_508 | 29-03-2023 [Link] !
Atte
2.
Attempt any three of the following: 10x3=30
(a) Tdentify whether the each of the following relations defined on the set X=
{1,2,3,4} are reflexive, symmetric, transitive and/or antisymmetric?
() Ri ={ (1,1), (1,2), (2,1) }
(i) R-{(1,1), (1,2), (1,4), (2,1), (2,2), (3,3), (4,1),(4,4) }
(ii) Ry= { (2,1), (3,1), (3,2), (4,1), (4,2), (4,3) }
(b) Let afunction is defined as f: R-(3}’ R-{1}, f(x) = (x-1)/(x-3),
then show that f is a bijective function and also compute the inverse of f.
Where R is a set of real numbers.
(c) ) Express Converse, Inverse and Contrapositive of the following statement
"If x+5=8 then x=3)
(i) Show that the statements PoQ and (PA Q) VOPA1Q) are equivalent
(d) Express the following
() Euler graph and Hamiltonian graph
(ii) Chromatic number of agraph
(iii) Walk and path
(iv) Bipartite graph
(e) Solve the following recurrence relation by using generating function.
a, + 5an-1 + 6an-2= 42. 4" , where a0 = 1and aj = -2
. 2 4 2
3
SECTIONC
Attempt any one part of the following: 10x1=10
(a) Let G=(1,-1, i, i} with the operation of ordinary multiplication on G
4.93.
be an
algebraic structure, where i=-1
(1) Determine whether Gis abelian.
(ii) Determine the order of each element in G.
(iii) Determine whether G is a cyclic group, ifG is a cyclic group, then
determine the generator/generators of the group G
(iv) Determine a subgroup of the group G.
(b) Let (G,*) and G', *) be any two groups and let e and e be their respective
identities. Iff is a homomorphism of Ginto G', then pYove that
() f(e) = e -2023
(a) Prove that the set of residues F={0,1,2,3,4} modulo 5 is a field w.r.t. addition and
multiplication of residue classes modulo 5. i.e. (F, ts, Xs) is a field.
(b) Define Boolean algebra. Show that a'.[(b'+c)'+ b.c] + (a+b')'.c] = a'.b using
rules of Boolean Algebra. Where a' is the complement of an element a.
D P520 8
937.242
System call interposition is significant in computer security as it allows the monitoring and control of system calls made by applications to the operating system kernel. This can be exploited by an attacker to redirect or alter system calls for malicious purposes like unauthorized data access. However, it can be leveraged defensively as a means to audit, modify, or deny certain system calls to enforce security policies and monitor app behavior. Defending against malicious interposition involves using secure and verified detection layers to automatically identify and block unauthorized interpositions.
Intonation plays a crucial role in speech by conveying emotions and intentions, affecting how a message is perceived. It provides cues about the speaker's attitude and can emphasize important information, making communication clearer. In professional settings, effective intonation aids in maintaining audience engagement and makes complex information more accessible. Variability in pitch can highlight key points and soften negative messages, supporting persuasive and empathetic communication. Appropriate use of intonation can enhance clarity and effectiveness in delivering presentations, negotiations, and interpersonal exchanges.
Intrusion Detection Systems (IDS) and Intrusion Prevention Systems (IPS) both monitor network traffic for potentially harmful activity. IDS alerts administrators to suspicious activities, facilitating reactive measures, whereas IPS actively blocks detected threats in real-time, providing a proactive security shield. IDS is often deployed for monitoring and alerting to learn attack patterns, while IPS aims to prevent malicious actions outright. They can be used in tandem for enhanced network security, with IDS providing in-depth analysis and IPS offering immediate threat mitigation.
The Floyd-Warshall algorithm is a dynamic programming technique used to find shortest paths between all pairs of nodes in a weighted graph. It systematically compares all possible paths through each vertex and selects the shortest one by updating a distance matrix iteratively. Starting with the direct path weights as initial distances, the algorithm updates distances by considering all possible intermediate nodes. It ensures that the matrix holds the shortest path length between any two nodes once all nodes have been considered. This approach efficiently finds shortest paths in O(n^3) time complexity where n is the number of vertices.
An AVL tree is a self-balancing binary search tree where the height difference between left and right subtrees for any node is at most one. This balance is maintained by tree rotations. To construct an AVL tree with the elements 7, 2, 1, 4, 5, 9, 3, 6, insert them sequentially while performing rotations as needed. After inserting 3, the tree becomes unbalanced with the node sequence 2-1-3, requiring a right rotation. Similarly, inserting 6 requires balancing the subtree rooted at 4, performed by a left-right rotation. The process continues until a balanced AVL tree is achieved.
The division method for computing a hash function involves using the remainder of the division of a key by a prime number to generate an index. The formula is 'h(k) = k mod m', where k is the key and m is a prime number chosen such that it is not too close to a power of two. Collision resolution strategies include open addressing, where probe sequences are used to find the next open slot (e.g., linear probing), and chaining, where each table entry is a pointer to a linked list of entries that hash to the same location.
Symmetric encryption uses the same key for both encryption and decryption, making it faster but requiring secure key distribution. Asymmetric encryption uses a pair of public and private keys, where the public key encrypts data and the private key decrypts it, providing secure communication without key exchange. Symmetric encryption is commonly used for bulk data encryption due to its efficiency, while asymmetric encryption is applied in key exchange protocols and digital signatures, where security in key management is critical. The security of asymmetric systems relies on computational hardness, unlike symmetric systems which rely on secure key management.
Horizontal communication occurs between individuals, departments, or units at the same hierarchical level and is crucial for coordination and problem-solving. It fosters collaboration, reduces conflict, and ensures team alignment. Vertical communication flows up and down the hierarchy, facilitating operational efficiency by clarifying duties and resolving issues across different levels. Each type enhances organizational cohesion; the horizontal flow encourages knowledge sharing, while the vertical flow ensures organizational oversight and adherence to strategic goals.
An effective seminar presentation structure typically consists of an engaging introduction, clear body sections, and a concise conclusion. The introduction should capture attention, introduce the topic, and outline the presentation's objectives. The body should systematically cover each point, using logical sequencing and storytelling to maintain interest. Visual aids and interactive elements can enhance engagement. The conclusion should summarize key points and offer actionable insights or takeaway messages. Interspersing interactive Q&A sessions can boost information retention and address audience queries for greater involvement.
The steps to convert an infix expression to a postfix expression using the Shunting Yard algorithm involve using a stack and output queue. 1) Read the infix expression from left to right. 2) If the token is an operand, add it to the output queue. 3) If the token is a left parenthesis, push it on the stack. 4) If the token is a right parenthesis, pop the stack to the output queue until a left parenthesis is at the top of the stack. 5) If the token is an operator, pop the stack to the output queue until the top of the stack has an operator of lower precedence. Push the current operator onto the stack. In the given expression 'A + (B*C-(D/ E ^F) *G) *H', the algorithm step yields the postfix expression 'A B C * D E F ^ / G * - H * +'.