![]() (iii) Delete the node from the data has copied. (ii) Assign the next pointer of the newly copied node of the next pointer of the node from the content has been copied. (i) Copy the content of the next mode into the mode that has to be deleted. (c) Answer the following from the diagram of a Binary Tree given below: (b) Distinguish between worst-case and best-case complexity of an algorithm. Write an algorithm OR a Method for deleting a node from a linked list. (a) A linked list is formed from the objects of the class, class Node (b) Stack works on LIFO (Lost In First Out) principle. Also, define the main() function to create an object and call methods accordingly to enable the task. Specify the class Frequency giving details of the constructor(), void accepts(String), void checkandfreq(), void checkanfreq() and void display(). Void display(): to display the number of “and” and “an” with appropriate messages. Void checkanfreq(): to count the frequency of “an” Void checkandfreq(): to count the frequency of “and” Void accept(String n): to assign n to text, where the value of the parameter n should be in lower case. Design a class Frequency using the description given below: Ĭountand: to store the frequency of the word “and”Ĭountan: to store the frequency of the word “an”įrequency(): constructor to initialize the instance variables Input a sentence from the user and count the number of times, the words “an” and “and” are present in the sentence. Flowcharts and Algorithms are not required.This can be achieved by using mnemonic names and comments in the program.Each program should be has written in such a way that it clearly depicts the logic of the problem.Whereas a decoder is used in converting binary to denary. Whereas a decoder is a circuit tan converts binary numbers to denary numbersĪ multiplexer is used as a common bus system. (b) A Multiplexer is a circuit that selects one of many input channels and connects it to the output channel. (a) A full adder is a logic circuit that can add three bits at a time producing two outputs one of which is the Sum bit and the other is Carry bit. (c) Convert the following cardinal expression into its canonical form and reduce it using Boolean laws: (b) State how a Decoder is different from a Multiplexer. Also, derive SOP expression for the Full Adder and draw its logic circuit. (a) What is Full Adder? Draw the truth table for a Full adder. (c) What is a Decoder? Draw the truth table and logic circuit diagram for a 2 to 4 Decoder. ![]() (a) Show with the help of a logic diagram how a NAND gate is equivalent to an OR gate. Draw the logic gate diagram of the reduced expression using NAND gate only. Reduce the above expression by using four variable Karnaugh’s Map. (d) Using truth table, verify whether the following is true or false: (c) Name the logic gate for the following circuit diagram and write its truth table. Īlso, find the complement of the reduced expression. Verify any one of them using the truth table. While answering questions in this Part, indicate briefly your working and reasoning, wherever required. ISC Computer Science Previous Year Question Paper 2011 Solved for Class 12
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |