Monthly Archives: February 2020
Linked List 2011
A linked list is formed from the objects of the class class Node { int info; Node link; } Write an algorithm OR a Method for deleting a node from a lined list. The method declaration is given below: void … Continue reading
Posted in Linked list
Leave a comment
Linked List 2012
A linked list is formed from the objects of the class class node { int p; String n; node next; } Write an algorithm/method to search fro a name and display the contents of that node. The method declaration is … Continue reading
Posted in Linked list
Leave a comment
Linked list 2013
Write an Algorithm OR a Method to count the number of nodes in the linked list The ,ethod declaration is given below: int count (Node prt-start) Algorithm to count the number of nodes in a linked list Steps Start Set … Continue reading
Posted in Linked list
Leave a comment
Linked List 2014
A linked list is formed from the objects of the class class Node { int number; Node nextNode; } Write an Algoritm OR a Method to add a node at the end of an existing liked list The method declaration … Continue reading
Posted in Linked list
Leave a comment
Infix to postfix 2014
Convert the following infix expression into its postfix form (A/B+C) * (D/(E-F)) =(A/B+C) (D/(E-F))* =(AB/+C) (D/(EF-))* =(AB/C+) (DEF-/)* =AB/C+DEF-/*
Posted in infix
Leave a comment
Infix to postfix 2013
convert the following infix notation to its postfix formE * (F / (G – H) * I) + J = E *(F / GH – *I) + J= E * FGH – / * + J= EFGH – / I … Continue reading
Posted in infix
Leave a comment
Infix to postfix 2012
Convert the following infux notation to its postfix form A (B + C) + (D + E) * F) / G = A + (BC++DE + *F) / G =A +(BC+ +DE + F*) /G = A + BC + … Continue reading
Posted in infix
Leave a comment
Infix to postfix 2011
Convert the following infix expression to its postfix form a + b * c – d / e input action stack status output c push c a print c a + push c+ a b print c+ ab * push … Continue reading
Posted in infix
Leave a comment
Array address calculation 2014
An array AR[-4…6, -2 … 12] stores elements in Row Major wise, with the address AR[2][3] as 4142. If each element requires 2 bytes of storage. Find the Base address Given i =2, j=3, W= 2 bytes B=? AR[-4 …6, … Continue reading
Posted in address
Leave a comment
Array address calculation 2013
A square matrix M[][] of size 10 is stored in the memory with each element requiring 4 bytes of storage. If the base address is M[0][0] is 1840, determine the address at M[4][8] when the matrix is stored in Row … Continue reading
Posted in address
Leave a comment