THIS BLOG IS MEANT FOR PROVIDING CONTENT, CONCEPTS RELATED TO ELECTRONICS AND COMMUNICATION. READER CAN EXPRESS THEIR VIEWS AND DOUBTS ON SUBJECTS. MY AREA OF INTEREST IS SWITCHING THEORY AND LOGIC DESIGN, VHLD PROGRAMMING, VERILOG PROGRAMMING... I WILL UPDATE THE REMAINING SOON... THANK YOU ALL
Thursday, February 15, 2024
DICD PREVIOUS QUESTION PAPER
Dr. Ch. Jayaprakash is an accomplished Associate Professor in the Department of Electronics and Communication Engineering at Sir C.R. Reddy College of Engineering, Eluru, with over 17 years of teaching experience. He earned his Ph.D. in MEMS from KLU and specializes in VLSI, Analog and Digital IC Design, MEMS, and Signal Processing. His academic journey includes a strong focus on both front-end and back-end VLSI design tools such as MentorGraphics, Tanner, and Vivado. Dr. Jayaprakash has published numerous research papers in reputed international journals, with key contributions in the detection of VOC’S using MEMS technology. He has also filed patents related to MEMS cantilever arrays and RF MEMS switches. In addition to his research, he has been actively involved in mentoring M.Tech students and contributing to institutional development through roles such as In-charge for VLSI Lab and Internal Examination.His passion for innovation and education is evident in his continuous contributions to the field.
Subscribe to:
Post Comments (Atom)
COMPARISON TREE
Difference between Full and Complete Binary Tree A binary tree is a type of data structure where each node can only have two offspring...
-
Binary Search Trees (BST): A binary search tree, also known as an ordered binary tree. In a binary search tree, all the nodes in the left ...
-
Tree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges...
-
AVL TREE The first type of self-balancing binary search tree to be invented is the AVL tree. The name AVL tree is coined after its inve...
No comments:
Post a Comment